blob: 369a01687575945dfddadf27a34e7b1d767f37f1 [file] [log] [blame]
bellard18607dc2007-01-07 22:04:40 +00001/*
2 * Simple C functions to supplement the C library
ths5fafdf22007-09-16 21:08:06 +00003 *
bellard18607dc2007-01-07 22:04:40 +00004 * Copyright (c) 2006 Fabrice Bellard
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
22 * THE SOFTWARE.
23 */
pbrookfaf07962007-11-11 02:51:17 +000024#include "qemu-common.h"
aliguori8d371d42008-12-04 20:08:06 +000025#include "host-utils.h"
Jes Sorensen9f9b17a2010-10-21 17:15:46 +020026#include <math.h>
bellard18607dc2007-01-07 22:04:40 +000027
28void pstrcpy(char *buf, int buf_size, const char *str)
29{
30 int c;
31 char *q = buf;
32
33 if (buf_size <= 0)
34 return;
35
36 for(;;) {
37 c = *str++;
38 if (c == 0 || q >= buf + buf_size - 1)
39 break;
40 *q++ = c;
41 }
42 *q = '\0';
43}
44
45/* strcat and truncate. */
46char *pstrcat(char *buf, int buf_size, const char *s)
47{
48 int len;
49 len = strlen(buf);
ths5fafdf22007-09-16 21:08:06 +000050 if (len < buf_size)
bellard18607dc2007-01-07 22:04:40 +000051 pstrcpy(buf + len, buf_size - len, s);
52 return buf;
53}
54
55int strstart(const char *str, const char *val, const char **ptr)
56{
57 const char *p, *q;
58 p = str;
59 q = val;
60 while (*q != '\0') {
61 if (*p != *q)
62 return 0;
63 p++;
64 q++;
65 }
66 if (ptr)
67 *ptr = p;
68 return 1;
69}
70
71int stristart(const char *str, const char *val, const char **ptr)
72{
73 const char *p, *q;
74 p = str;
75 q = val;
76 while (*q != '\0') {
blueswir1cd390082008-11-16 13:53:32 +000077 if (qemu_toupper(*p) != qemu_toupper(*q))
bellard18607dc2007-01-07 22:04:40 +000078 return 0;
79 p++;
80 q++;
81 }
82 if (ptr)
83 *ptr = p;
84 return 1;
85}
bellard3c6b2082007-11-10 19:36:39 +000086
Blue Swirld43277c2009-07-01 18:24:44 +000087/* XXX: use host strnlen if available ? */
88int qemu_strnlen(const char *s, int max_len)
89{
90 int i;
91
92 for(i = 0; i < max_len; i++) {
93 if (s[i] == '\0') {
94 break;
95 }
96 }
97 return i;
98}
99
bellard3c6b2082007-11-10 19:36:39 +0000100time_t mktimegm(struct tm *tm)
101{
102 time_t t;
103 int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday;
104 if (m < 3) {
105 m += 12;
106 y--;
107 }
108 t = 86400 * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 +
109 y / 400 - 719469);
110 t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec;
111 return t;
112}
aliguorib39ade82008-12-04 19:19:45 +0000113
blueswir1ad46db92008-12-11 19:37:54 +0000114int qemu_fls(int i)
aliguorib39ade82008-12-04 19:19:45 +0000115{
aliguori8d371d42008-12-04 20:08:06 +0000116 return 32 - clz32(i);
aliguorib39ade82008-12-04 19:19:45 +0000117}
aliguori44e3ee82009-01-22 16:59:20 +0000118
Christoph Hellwig6f1953c2009-09-04 19:01:32 +0200119/*
120 * Make sure data goes on disk, but if possible do not bother to
121 * write out the inode just for timestamp updates.
122 *
123 * Unfortunately even in 2009 many operating systems do not support
124 * fdatasync and have to fall back to fsync.
125 */
126int qemu_fdatasync(int fd)
127{
Blue Swirl5f6b9e82009-09-20 06:56:26 +0000128#ifdef CONFIG_FDATASYNC
Christoph Hellwig6f1953c2009-09-04 19:01:32 +0200129 return fdatasync(fd);
130#else
131 return fsync(fd);
132#endif
133}
134
aliguori44e3ee82009-01-22 16:59:20 +0000135/* io vectors */
136
137void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint)
138{
139 qiov->iov = qemu_malloc(alloc_hint * sizeof(struct iovec));
140 qiov->niov = 0;
141 qiov->nalloc = alloc_hint;
aliguori249aa742009-01-26 17:17:52 +0000142 qiov->size = 0;
aliguori44e3ee82009-01-22 16:59:20 +0000143}
144
aliguori522584a2009-03-28 17:46:10 +0000145void qemu_iovec_init_external(QEMUIOVector *qiov, struct iovec *iov, int niov)
146{
147 int i;
148
149 qiov->iov = iov;
150 qiov->niov = niov;
151 qiov->nalloc = -1;
152 qiov->size = 0;
153 for (i = 0; i < niov; i++)
154 qiov->size += iov[i].iov_len;
155}
156
aliguori44e3ee82009-01-22 16:59:20 +0000157void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len)
158{
aliguori522584a2009-03-28 17:46:10 +0000159 assert(qiov->nalloc != -1);
160
aliguori44e3ee82009-01-22 16:59:20 +0000161 if (qiov->niov == qiov->nalloc) {
162 qiov->nalloc = 2 * qiov->nalloc + 1;
163 qiov->iov = qemu_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec));
164 }
165 qiov->iov[qiov->niov].iov_base = base;
166 qiov->iov[qiov->niov].iov_len = len;
aliguori249aa742009-01-26 17:17:52 +0000167 qiov->size += len;
aliguori44e3ee82009-01-22 16:59:20 +0000168 ++qiov->niov;
169}
170
Kevin Wolf40b4f532009-09-09 17:53:37 +0200171/*
Kevin Wolfb8a83a42010-09-13 18:06:11 +0200172 * Copies iovecs from src to the end of dst. It starts copying after skipping
173 * the given number of bytes in src and copies until src is completely copied
174 * or the total size of the copied iovec reaches size.The size of the last
175 * copied iovec is changed in order to fit the specified total size if it isn't
176 * a perfect fit already.
Kevin Wolf40b4f532009-09-09 17:53:37 +0200177 */
Kevin Wolfb8a83a42010-09-13 18:06:11 +0200178void qemu_iovec_copy(QEMUIOVector *dst, QEMUIOVector *src, uint64_t skip,
179 size_t size)
Kevin Wolf40b4f532009-09-09 17:53:37 +0200180{
181 int i;
182 size_t done;
Kevin Wolfb8a83a42010-09-13 18:06:11 +0200183 void *iov_base;
184 uint64_t iov_len;
Kevin Wolf40b4f532009-09-09 17:53:37 +0200185
186 assert(dst->nalloc != -1);
187
188 done = 0;
189 for (i = 0; (i < src->niov) && (done != size); i++) {
Kevin Wolfb8a83a42010-09-13 18:06:11 +0200190 if (skip >= src->iov[i].iov_len) {
191 /* Skip the whole iov */
192 skip -= src->iov[i].iov_len;
193 continue;
194 } else {
195 /* Skip only part (or nothing) of the iov */
196 iov_base = (uint8_t*) src->iov[i].iov_base + skip;
197 iov_len = src->iov[i].iov_len - skip;
198 skip = 0;
199 }
200
201 if (done + iov_len > size) {
202 qemu_iovec_add(dst, iov_base, size - done);
Kevin Wolf40b4f532009-09-09 17:53:37 +0200203 break;
204 } else {
Kevin Wolfb8a83a42010-09-13 18:06:11 +0200205 qemu_iovec_add(dst, iov_base, iov_len);
Kevin Wolf40b4f532009-09-09 17:53:37 +0200206 }
Kevin Wolfb8a83a42010-09-13 18:06:11 +0200207 done += iov_len;
Kevin Wolf40b4f532009-09-09 17:53:37 +0200208 }
209}
210
Kevin Wolfb8a83a42010-09-13 18:06:11 +0200211void qemu_iovec_concat(QEMUIOVector *dst, QEMUIOVector *src, size_t size)
212{
213 qemu_iovec_copy(dst, src, 0, size);
214}
215
aliguori44e3ee82009-01-22 16:59:20 +0000216void qemu_iovec_destroy(QEMUIOVector *qiov)
217{
aliguori522584a2009-03-28 17:46:10 +0000218 assert(qiov->nalloc != -1);
219
aliguori44e3ee82009-01-22 16:59:20 +0000220 qemu_free(qiov->iov);
221}
222
aliguoribe959462009-02-05 21:23:54 +0000223void qemu_iovec_reset(QEMUIOVector *qiov)
224{
aliguori522584a2009-03-28 17:46:10 +0000225 assert(qiov->nalloc != -1);
226
aliguoribe959462009-02-05 21:23:54 +0000227 qiov->niov = 0;
228 qiov->size = 0;
229}
230
aliguori44e3ee82009-01-22 16:59:20 +0000231void qemu_iovec_to_buffer(QEMUIOVector *qiov, void *buf)
232{
233 uint8_t *p = (uint8_t *)buf;
234 int i;
235
236 for (i = 0; i < qiov->niov; ++i) {
237 memcpy(p, qiov->iov[i].iov_base, qiov->iov[i].iov_len);
238 p += qiov->iov[i].iov_len;
239 }
240}
241
aliguori249aa742009-01-26 17:17:52 +0000242void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count)
aliguori44e3ee82009-01-22 16:59:20 +0000243{
244 const uint8_t *p = (const uint8_t *)buf;
aliguori249aa742009-01-26 17:17:52 +0000245 size_t copy;
aliguori44e3ee82009-01-22 16:59:20 +0000246 int i;
247
aliguori249aa742009-01-26 17:17:52 +0000248 for (i = 0; i < qiov->niov && count; ++i) {
249 copy = count;
250 if (copy > qiov->iov[i].iov_len)
251 copy = qiov->iov[i].iov_len;
252 memcpy(qiov->iov[i].iov_base, p, copy);
253 p += copy;
254 count -= copy;
aliguori44e3ee82009-01-22 16:59:20 +0000255 }
256}
Paolo Bonzinidb1a4972010-03-10 11:38:55 +0100257
Kevin Wolfb8a83a42010-09-13 18:06:11 +0200258void qemu_iovec_memset(QEMUIOVector *qiov, int c, size_t count)
259{
260 size_t n;
261 int i;
262
263 for (i = 0; i < qiov->niov && count; ++i) {
264 n = MIN(count, qiov->iov[i].iov_len);
265 memset(qiov->iov[i].iov_base, c, n);
266 count -= n;
267 }
268}
269
Paolo Bonzinidb1a4972010-03-10 11:38:55 +0100270#ifndef _WIN32
271/* Sets a specific flag */
272int fcntl_setfl(int fd, int flag)
273{
274 int flags;
275
276 flags = fcntl(fd, F_GETFL);
277 if (flags == -1)
278 return -errno;
279
280 if (fcntl(fd, F_SETFL, flags | flag) == -1)
281 return -errno;
282
283 return 0;
284}
285#endif
286
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200287/*
288 * Convert string to bytes, allowing either B/b for bytes, K/k for KB,
289 * M/m for MB, G/g for GB or T/t for TB. Default without any postfix
290 * is MB. End pointer will be returned in *end, if not NULL. A valid
291 * value must be terminated by whitespace, ',' or '\0'. Return -1 on
292 * error.
293 */
Jes Sorensen70b4f4b2011-01-05 11:41:02 +0100294int64_t strtosz_suffix(const char *nptr, char **end, const char default_suffix)
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200295{
Jes Sorensen70b4f4b2011-01-05 11:41:02 +0100296 int64_t retval = -1;
Jes Sorensenf3bd3622011-01-24 16:33:28 +0100297 char *endptr;
298 unsigned char c, d;
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200299 int mul_required = 0;
300 double val, mul, integral, fraction;
301
302 errno = 0;
303 val = strtod(nptr, &endptr);
304 if (isnan(val) || endptr == nptr || errno != 0) {
305 goto fail;
306 }
Jes Sorensen7eb05342011-01-24 16:33:30 +0100307 fraction = modf(val, &integral);
308 if (fraction != 0) {
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200309 mul_required = 1;
310 }
311 /*
312 * Any whitespace character is fine for terminating the number,
313 * in addition we accept ',' to handle strings where the size is
314 * part of a multi token argument.
315 */
316 c = *endptr;
Jes Sorensend8427002010-12-09 14:17:24 +0100317 d = c;
Jes Sorensenf3bd3622011-01-24 16:33:28 +0100318 if (qemu_isspace(c) || c == '\0' || c == ',') {
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200319 c = 0;
Jes Sorensend8427002010-12-09 14:17:24 +0100320 if (default_suffix) {
321 d = default_suffix;
322 } else {
323 d = c;
324 }
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200325 }
Jes Sorensena2afc2c2011-01-24 16:33:29 +0100326 switch (qemu_toupper(d)) {
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200327 case 'B':
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200328 mul = 1;
329 if (mul_required) {
330 goto fail;
331 }
332 break;
333 case 'K':
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200334 mul = 1 << 10;
335 break;
336 case 0:
337 if (mul_required) {
338 goto fail;
339 }
340 case 'M':
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200341 mul = 1ULL << 20;
342 break;
343 case 'G':
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200344 mul = 1ULL << 30;
345 break;
346 case 'T':
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200347 mul = 1ULL << 40;
348 break;
349 default:
350 goto fail;
351 }
352 /*
353 * If not terminated by whitespace, ',', or \0, increment endptr
354 * to point to next character, then check that we are terminated
355 * by an appropriate separating character, ie. whitespace, ',', or
356 * \0. If not, we are seeing trailing garbage, thus fail.
357 */
358 if (c != 0) {
359 endptr++;
Jes Sorensenf3bd3622011-01-24 16:33:28 +0100360 if (!qemu_isspace(*endptr) && *endptr != ',' && *endptr != 0) {
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200361 goto fail;
362 }
363 }
Jes Sorensen70b4f4b2011-01-05 11:41:02 +0100364 if ((val * mul >= INT64_MAX) || val < 0) {
Jes Sorensen9f9b17a2010-10-21 17:15:46 +0200365 goto fail;
366 }
367 retval = val * mul;
368
369fail:
370 if (end) {
371 *end = endptr;
372 }
373
374 return retval;
375}
Jes Sorensend8427002010-12-09 14:17:24 +0100376
Jes Sorensen70b4f4b2011-01-05 11:41:02 +0100377int64_t strtosz(const char *nptr, char **end)
Jes Sorensend8427002010-12-09 14:17:24 +0100378{
379 return strtosz_suffix(nptr, end, STRTOSZ_DEFSUFFIX_MB);
380}