]>
Commit | Line | Data |
---|---|---|
18607dcb FB |
1 | /* |
2 | * Simple C functions to supplement the C library | |
5fafdf24 | 3 | * |
18607dcb FB |
4 | * 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 | */ | |
aafd7584 | 24 | #include "qemu/osdep.h" |
faf07963 | 25 | #include "qemu-common.h" |
1de7afc9 | 26 | #include "qemu/host-utils.h" |
9f9b17a4 | 27 | #include <math.h> |
18607dcb | 28 | |
1de7afc9 PB |
29 | #include "qemu/sockets.h" |
30 | #include "qemu/iov.h" | |
4297c8ee | 31 | #include "net/net.h" |
f348b6d1 | 32 | #include "qemu/cutils.h" |
8c5135f9 | 33 | |
2a025ae4 DF |
34 | void strpadcpy(char *buf, int buf_size, const char *str, char pad) |
35 | { | |
36 | int len = qemu_strnlen(str, buf_size); | |
37 | memcpy(buf, str, len); | |
38 | memset(buf + len, pad, buf_size - len); | |
39 | } | |
40 | ||
18607dcb FB |
41 | void pstrcpy(char *buf, int buf_size, const char *str) |
42 | { | |
43 | int c; | |
44 | char *q = buf; | |
45 | ||
46 | if (buf_size <= 0) | |
47 | return; | |
48 | ||
49 | for(;;) { | |
50 | c = *str++; | |
51 | if (c == 0 || q >= buf + buf_size - 1) | |
52 | break; | |
53 | *q++ = c; | |
54 | } | |
55 | *q = '\0'; | |
56 | } | |
57 | ||
58 | /* strcat and truncate. */ | |
59 | char *pstrcat(char *buf, int buf_size, const char *s) | |
60 | { | |
61 | int len; | |
62 | len = strlen(buf); | |
5fafdf24 | 63 | if (len < buf_size) |
18607dcb FB |
64 | pstrcpy(buf + len, buf_size - len, s); |
65 | return buf; | |
66 | } | |
67 | ||
68 | int strstart(const char *str, const char *val, const char **ptr) | |
69 | { | |
70 | const char *p, *q; | |
71 | p = str; | |
72 | q = val; | |
73 | while (*q != '\0') { | |
74 | if (*p != *q) | |
75 | return 0; | |
76 | p++; | |
77 | q++; | |
78 | } | |
79 | if (ptr) | |
80 | *ptr = p; | |
81 | return 1; | |
82 | } | |
83 | ||
84 | int stristart(const char *str, const char *val, const char **ptr) | |
85 | { | |
86 | const char *p, *q; | |
87 | p = str; | |
88 | q = val; | |
89 | while (*q != '\0') { | |
cd390083 | 90 | if (qemu_toupper(*p) != qemu_toupper(*q)) |
18607dcb FB |
91 | return 0; |
92 | p++; | |
93 | q++; | |
94 | } | |
95 | if (ptr) | |
96 | *ptr = p; | |
97 | return 1; | |
98 | } | |
3c6b2088 | 99 | |
d43277c5 BS |
100 | /* XXX: use host strnlen if available ? */ |
101 | int qemu_strnlen(const char *s, int max_len) | |
102 | { | |
103 | int i; | |
104 | ||
105 | for(i = 0; i < max_len; i++) { | |
106 | if (s[i] == '\0') { | |
107 | break; | |
108 | } | |
109 | } | |
110 | return i; | |
111 | } | |
112 | ||
a38ed811 KW |
113 | char *qemu_strsep(char **input, const char *delim) |
114 | { | |
115 | char *result = *input; | |
116 | if (result != NULL) { | |
117 | char *p; | |
118 | ||
119 | for (p = result; *p != '\0'; p++) { | |
120 | if (strchr(delim, *p)) { | |
121 | break; | |
122 | } | |
123 | } | |
124 | if (*p == '\0') { | |
125 | *input = NULL; | |
126 | } else { | |
127 | *p = '\0'; | |
128 | *input = p + 1; | |
129 | } | |
130 | } | |
131 | return result; | |
132 | } | |
133 | ||
3c6b2088 FB |
134 | time_t mktimegm(struct tm *tm) |
135 | { | |
136 | time_t t; | |
137 | int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday; | |
138 | if (m < 3) { | |
139 | m += 12; | |
140 | y--; | |
141 | } | |
b6db4aca | 142 | t = 86400ULL * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 + |
3c6b2088 FB |
143 | y / 400 - 719469); |
144 | t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec; | |
145 | return t; | |
146 | } | |
b39ade83 | 147 | |
6f1953c4 CH |
148 | /* |
149 | * Make sure data goes on disk, but if possible do not bother to | |
150 | * write out the inode just for timestamp updates. | |
151 | * | |
152 | * Unfortunately even in 2009 many operating systems do not support | |
153 | * fdatasync and have to fall back to fsync. | |
154 | */ | |
155 | int qemu_fdatasync(int fd) | |
156 | { | |
5f6b9e8f | 157 | #ifdef CONFIG_FDATASYNC |
6f1953c4 CH |
158 | return fdatasync(fd); |
159 | #else | |
160 | return fsync(fd); | |
161 | #endif | |
162 | } | |
163 | ||
db1a4972 PB |
164 | #ifndef _WIN32 |
165 | /* Sets a specific flag */ | |
166 | int fcntl_setfl(int fd, int flag) | |
167 | { | |
168 | int flags; | |
169 | ||
170 | flags = fcntl(fd, F_GETFL); | |
171 | if (flags == -1) | |
172 | return -errno; | |
173 | ||
174 | if (fcntl(fd, F_SETFL, flags | flag) == -1) | |
175 | return -errno; | |
176 | ||
177 | return 0; | |
178 | } | |
179 | #endif | |
180 | ||
eba90e4e MA |
181 | static int64_t suffix_mul(char suffix, int64_t unit) |
182 | { | |
183 | switch (qemu_toupper(suffix)) { | |
4677bb40 | 184 | case QEMU_STRTOSZ_DEFSUFFIX_B: |
eba90e4e | 185 | return 1; |
4677bb40 | 186 | case QEMU_STRTOSZ_DEFSUFFIX_KB: |
eba90e4e | 187 | return unit; |
4677bb40 | 188 | case QEMU_STRTOSZ_DEFSUFFIX_MB: |
eba90e4e | 189 | return unit * unit; |
4677bb40 | 190 | case QEMU_STRTOSZ_DEFSUFFIX_GB: |
eba90e4e | 191 | return unit * unit * unit; |
4677bb40 | 192 | case QEMU_STRTOSZ_DEFSUFFIX_TB: |
eba90e4e | 193 | return unit * unit * unit * unit; |
4677bb40 | 194 | case QEMU_STRTOSZ_DEFSUFFIX_PB: |
5e00984a | 195 | return unit * unit * unit * unit * unit; |
4677bb40 | 196 | case QEMU_STRTOSZ_DEFSUFFIX_EB: |
5e00984a | 197 | return unit * unit * unit * unit * unit * unit; |
eba90e4e MA |
198 | } |
199 | return -1; | |
200 | } | |
201 | ||
9f9b17a4 JS |
202 | /* |
203 | * Convert string to bytes, allowing either B/b for bytes, K/k for KB, | |
8dddfb55 | 204 | * M/m for MB, G/g for GB or T/t for TB. End pointer will be returned |
37edbf7e LG |
205 | * in *end, if not NULL. Return -ERANGE on overflow, Return -EINVAL on |
206 | * other error. | |
9f9b17a4 | 207 | */ |
4677bb40 | 208 | int64_t qemu_strtosz_suffix_unit(const char *nptr, char **end, |
a732e1ba | 209 | const char default_suffix, int64_t unit) |
9f9b17a4 | 210 | { |
37edbf7e | 211 | int64_t retval = -EINVAL; |
f3bd362a | 212 | char *endptr; |
eba90e4e | 213 | unsigned char c; |
9f9b17a4 JS |
214 | int mul_required = 0; |
215 | double val, mul, integral, fraction; | |
216 | ||
217 | errno = 0; | |
218 | val = strtod(nptr, &endptr); | |
219 | if (isnan(val) || endptr == nptr || errno != 0) { | |
220 | goto fail; | |
221 | } | |
7eb05349 JS |
222 | fraction = modf(val, &integral); |
223 | if (fraction != 0) { | |
9f9b17a4 JS |
224 | mul_required = 1; |
225 | } | |
9f9b17a4 | 226 | c = *endptr; |
eba90e4e MA |
227 | mul = suffix_mul(c, unit); |
228 | if (mul >= 0) { | |
229 | endptr++; | |
230 | } else { | |
231 | mul = suffix_mul(default_suffix, unit); | |
232 | assert(mul >= 0); | |
9f9b17a4 | 233 | } |
eba90e4e | 234 | if (mul == 1 && mul_required) { |
9f9b17a4 JS |
235 | goto fail; |
236 | } | |
70b4f4bb | 237 | if ((val * mul >= INT64_MAX) || val < 0) { |
37edbf7e | 238 | retval = -ERANGE; |
9f9b17a4 JS |
239 | goto fail; |
240 | } | |
241 | retval = val * mul; | |
242 | ||
243 | fail: | |
244 | if (end) { | |
245 | *end = endptr; | |
246 | } | |
247 | ||
248 | return retval; | |
249 | } | |
d8427002 | 250 | |
4677bb40 MAL |
251 | int64_t qemu_strtosz_suffix(const char *nptr, char **end, |
252 | const char default_suffix) | |
a732e1ba | 253 | { |
4677bb40 | 254 | return qemu_strtosz_suffix_unit(nptr, end, default_suffix, 1024); |
a732e1ba JR |
255 | } |
256 | ||
4677bb40 | 257 | int64_t qemu_strtosz(const char *nptr, char **end) |
d8427002 | 258 | { |
4677bb40 | 259 | return qemu_strtosz_suffix(nptr, end, QEMU_STRTOSZ_DEFSUFFIX_MB); |
d8427002 | 260 | } |
443916d1 | 261 | |
764e0fa4 | 262 | /** |
717adf96 | 263 | * Helper function for error checking after strtol() and the like |
764e0fa4 | 264 | */ |
717adf96 MA |
265 | static int check_strtox_error(const char *nptr, char *ep, |
266 | const char **endptr, int libc_errno) | |
764e0fa4 | 267 | { |
4baef267 MA |
268 | if (endptr) { |
269 | *endptr = ep; | |
270 | } | |
271 | ||
272 | /* Turn "no conversion" into an error */ | |
717adf96 | 273 | if (libc_errno == 0 && ep == nptr) { |
4baef267 | 274 | return -EINVAL; |
47d4be12 | 275 | } |
4baef267 MA |
276 | |
277 | /* Fail when we're expected to consume the string, but didn't */ | |
717adf96 | 278 | if (!endptr && *ep) { |
764e0fa4 CT |
279 | return -EINVAL; |
280 | } | |
4baef267 | 281 | |
717adf96 | 282 | return -libc_errno; |
764e0fa4 CT |
283 | } |
284 | ||
285 | /** | |
4295f879 | 286 | * Convert string @nptr to a long integer, and store it in @result. |
764e0fa4 | 287 | * |
4295f879 MA |
288 | * This is a wrapper around strtol() that is harder to misuse. |
289 | * Semantics of @nptr, @endptr, @base match strtol() with differences | |
290 | * noted below. | |
764e0fa4 | 291 | * |
4295f879 | 292 | * @nptr may be null, and no conversion is performed then. |
764e0fa4 | 293 | * |
4295f879 MA |
294 | * If no conversion is performed, store @nptr in *@endptr and return |
295 | * -EINVAL. | |
764e0fa4 | 296 | * |
4295f879 MA |
297 | * If @endptr is null, and the string isn't fully converted, return |
298 | * -EINVAL. This is the case when the pointer that would be stored in | |
299 | * a non-null @endptr points to a character other than '\0'. | |
300 | * | |
301 | * If the conversion overflows @result, store LONG_MAX in @result, | |
302 | * and return -ERANGE. | |
303 | * | |
304 | * If the conversion underflows @result, store LONG_MIN in @result, | |
305 | * and return -ERANGE. | |
306 | * | |
307 | * Else store the converted value in @result, and return zero. | |
764e0fa4 CT |
308 | */ |
309 | int qemu_strtol(const char *nptr, const char **endptr, int base, | |
310 | long *result) | |
311 | { | |
717adf96 | 312 | char *ep; |
4baef267 | 313 | |
764e0fa4 CT |
314 | if (!nptr) { |
315 | if (endptr) { | |
316 | *endptr = nptr; | |
317 | } | |
4baef267 | 318 | return -EINVAL; |
764e0fa4 | 319 | } |
4baef267 MA |
320 | |
321 | errno = 0; | |
322 | *result = strtol(nptr, &ep, base); | |
323 | return check_strtox_error(nptr, ep, endptr, errno); | |
764e0fa4 | 324 | } |
c817c015 CT |
325 | |
326 | /** | |
4295f879 MA |
327 | * Convert string @nptr to an unsigned long, and store it in @result. |
328 | * | |
329 | * This is a wrapper around strtoul() that is harder to misuse. | |
330 | * Semantics of @nptr, @endptr, @base match strtoul() with differences | |
331 | * noted below. | |
332 | * | |
333 | * @nptr may be null, and no conversion is performed then. | |
334 | * | |
335 | * If no conversion is performed, store @nptr in *@endptr and return | |
336 | * -EINVAL. | |
337 | * | |
338 | * If @endptr is null, and the string isn't fully converted, return | |
339 | * -EINVAL. This is the case when the pointer that would be stored in | |
340 | * a non-null @endptr points to a character other than '\0'. | |
c817c015 | 341 | * |
4295f879 MA |
342 | * If the conversion overflows @result, store ULONG_MAX in @result, |
343 | * and return -ERANGE. | |
c817c015 | 344 | * |
4295f879 | 345 | * Else store the converted value in @result, and return zero. |
c817c015 | 346 | * |
4295f879 MA |
347 | * Note that a number with a leading minus sign gets converted without |
348 | * the minus sign, checked for overflow (see above), then negated (in | |
349 | * @result's type). This is exactly how strtoul() works. | |
c817c015 CT |
350 | */ |
351 | int qemu_strtoul(const char *nptr, const char **endptr, int base, | |
352 | unsigned long *result) | |
353 | { | |
717adf96 | 354 | char *ep; |
4baef267 | 355 | |
c817c015 CT |
356 | if (!nptr) { |
357 | if (endptr) { | |
358 | *endptr = nptr; | |
359 | } | |
4baef267 MA |
360 | return -EINVAL; |
361 | } | |
362 | ||
363 | errno = 0; | |
364 | *result = strtoul(nptr, &ep, base); | |
365 | /* Windows returns 1 for negative out-of-range values. */ | |
366 | if (errno == ERANGE) { | |
367 | *result = -1; | |
c817c015 | 368 | } |
4baef267 | 369 | return check_strtox_error(nptr, ep, endptr, errno); |
c817c015 CT |
370 | } |
371 | ||
8ac4df40 | 372 | /** |
4295f879 | 373 | * Convert string @nptr to an int64_t. |
8ac4df40 | 374 | * |
4295f879 MA |
375 | * Works like qemu_strtol(), except it stores INT64_MAX on overflow, |
376 | * and INT_MIN on underflow. | |
8ac4df40 | 377 | */ |
b30d1886 | 378 | int qemu_strtoi64(const char *nptr, const char **endptr, int base, |
8ac4df40 CT |
379 | int64_t *result) |
380 | { | |
717adf96 | 381 | char *ep; |
4baef267 | 382 | |
8ac4df40 CT |
383 | if (!nptr) { |
384 | if (endptr) { | |
385 | *endptr = nptr; | |
386 | } | |
4baef267 | 387 | return -EINVAL; |
8ac4df40 | 388 | } |
4baef267 MA |
389 | |
390 | errno = 0; | |
391 | /* FIXME This assumes int64_t is long long */ | |
392 | *result = strtoll(nptr, &ep, base); | |
393 | return check_strtox_error(nptr, ep, endptr, errno); | |
8ac4df40 CT |
394 | } |
395 | ||
3904e6bf | 396 | /** |
4295f879 | 397 | * Convert string @nptr to an uint64_t. |
3904e6bf | 398 | * |
4295f879 | 399 | * Works like qemu_strtoul(), except it stores UINT64_MAX on overflow. |
3904e6bf | 400 | */ |
b30d1886 | 401 | int qemu_strtou64(const char *nptr, const char **endptr, int base, |
3904e6bf CT |
402 | uint64_t *result) |
403 | { | |
717adf96 | 404 | char *ep; |
4baef267 | 405 | |
3904e6bf CT |
406 | if (!nptr) { |
407 | if (endptr) { | |
408 | *endptr = nptr; | |
409 | } | |
4baef267 MA |
410 | return -EINVAL; |
411 | } | |
412 | ||
413 | errno = 0; | |
414 | /* FIXME This assumes uint64_t is unsigned long long */ | |
415 | *result = strtoull(nptr, &ep, base); | |
416 | /* Windows returns 1 for negative out-of-range values. */ | |
417 | if (errno == ERANGE) { | |
418 | *result = -1; | |
3904e6bf | 419 | } |
4baef267 | 420 | return check_strtox_error(nptr, ep, endptr, errno); |
3904e6bf CT |
421 | } |
422 | ||
e3f9fe2d EH |
423 | /** |
424 | * parse_uint: | |
425 | * | |
426 | * @s: String to parse | |
427 | * @value: Destination for parsed integer value | |
428 | * @endptr: Destination for pointer to first character not consumed | |
429 | * @base: integer base, between 2 and 36 inclusive, or 0 | |
430 | * | |
431 | * Parse unsigned integer | |
432 | * | |
433 | * Parsed syntax is like strtoull()'s: arbitrary whitespace, a single optional | |
434 | * '+' or '-', an optional "0x" if @base is 0 or 16, one or more digits. | |
435 | * | |
436 | * If @s is null, or @base is invalid, or @s doesn't start with an | |
437 | * integer in the syntax above, set *@value to 0, *@endptr to @s, and | |
438 | * return -EINVAL. | |
439 | * | |
440 | * Set *@endptr to point right beyond the parsed integer (even if the integer | |
441 | * overflows or is negative, all digits will be parsed and *@endptr will | |
442 | * point right beyond them). | |
443 | * | |
444 | * If the integer is negative, set *@value to 0, and return -ERANGE. | |
445 | * | |
446 | * If the integer overflows unsigned long long, set *@value to | |
447 | * ULLONG_MAX, and return -ERANGE. | |
448 | * | |
449 | * Else, set *@value to the parsed integer, and return 0. | |
450 | */ | |
451 | int parse_uint(const char *s, unsigned long long *value, char **endptr, | |
452 | int base) | |
453 | { | |
454 | int r = 0; | |
455 | char *endp = (char *)s; | |
456 | unsigned long long val = 0; | |
457 | ||
458 | if (!s) { | |
459 | r = -EINVAL; | |
460 | goto out; | |
461 | } | |
462 | ||
463 | errno = 0; | |
464 | val = strtoull(s, &endp, base); | |
465 | if (errno) { | |
466 | r = -errno; | |
467 | goto out; | |
468 | } | |
469 | ||
470 | if (endp == s) { | |
471 | r = -EINVAL; | |
472 | goto out; | |
473 | } | |
474 | ||
475 | /* make sure we reject negative numbers: */ | |
476 | while (isspace((unsigned char)*s)) { | |
477 | s++; | |
478 | } | |
479 | if (*s == '-') { | |
480 | val = 0; | |
481 | r = -ERANGE; | |
482 | goto out; | |
483 | } | |
484 | ||
485 | out: | |
486 | *value = val; | |
487 | *endptr = endp; | |
488 | return r; | |
489 | } | |
490 | ||
491 | /** | |
492 | * parse_uint_full: | |
493 | * | |
494 | * @s: String to parse | |
495 | * @value: Destination for parsed integer value | |
496 | * @base: integer base, between 2 and 36 inclusive, or 0 | |
497 | * | |
498 | * Parse unsigned integer from entire string | |
499 | * | |
500 | * Have the same behavior of parse_uint(), but with an additional check | |
501 | * for additional data after the parsed number. If extra characters are present | |
502 | * after the parsed number, the function will return -EINVAL, and *@v will | |
503 | * be set to 0. | |
504 | */ | |
505 | int parse_uint_full(const char *s, unsigned long long *value, int base) | |
506 | { | |
507 | char *endp; | |
508 | int r; | |
509 | ||
510 | r = parse_uint(s, value, &endp, base); | |
511 | if (r < 0) { | |
512 | return r; | |
513 | } | |
514 | if (*endp) { | |
515 | *value = 0; | |
516 | return -EINVAL; | |
517 | } | |
518 | ||
519 | return 0; | |
520 | } | |
521 | ||
443916d1 SB |
522 | int qemu_parse_fd(const char *param) |
523 | { | |
e9c5c1f4 LE |
524 | long fd; |
525 | char *endptr; | |
443916d1 | 526 | |
e9c5c1f4 | 527 | errno = 0; |
443916d1 | 528 | fd = strtol(param, &endptr, 10); |
e9c5c1f4 LE |
529 | if (param == endptr /* no conversion performed */ || |
530 | errno != 0 /* not representable as long; possibly others */ || | |
531 | *endptr != '\0' /* final string not empty */ || | |
532 | fd < 0 /* invalid as file descriptor */ || | |
533 | fd > INT_MAX /* not representable as int */) { | |
443916d1 SB |
534 | return -1; |
535 | } | |
536 | return fd; | |
537 | } | |
9fb26641 | 538 | |
e6546bb9 OW |
539 | /* |
540 | * Implementation of ULEB128 (http://en.wikipedia.org/wiki/LEB128) | |
541 | * Input is limited to 14-bit numbers | |
542 | */ | |
543 | int uleb128_encode_small(uint8_t *out, uint32_t n) | |
544 | { | |
545 | g_assert(n <= 0x3fff); | |
546 | if (n < 0x80) { | |
547 | *out++ = n; | |
548 | return 1; | |
549 | } else { | |
550 | *out++ = (n & 0x7f) | 0x80; | |
551 | *out++ = n >> 7; | |
552 | return 2; | |
553 | } | |
554 | } | |
555 | ||
556 | int uleb128_decode_small(const uint8_t *in, uint32_t *n) | |
557 | { | |
558 | if (!(*in & 0x80)) { | |
559 | *n = *in++; | |
560 | return 1; | |
561 | } else { | |
562 | *n = *in++ & 0x7f; | |
563 | /* we exceed 14 bit number */ | |
564 | if (*in & 0x80) { | |
565 | return -1; | |
566 | } | |
567 | *n |= *in++ << 7; | |
568 | return 2; | |
569 | } | |
570 | } | |
b16352ac AL |
571 | |
572 | /* | |
573 | * helper to parse debug environment variables | |
574 | */ | |
575 | int parse_debug_env(const char *name, int max, int initial) | |
576 | { | |
577 | char *debug_env = getenv(name); | |
578 | char *inv = NULL; | |
cc5d0e04 | 579 | long debug; |
b16352ac AL |
580 | |
581 | if (!debug_env) { | |
582 | return initial; | |
583 | } | |
cc5d0e04 | 584 | errno = 0; |
b16352ac AL |
585 | debug = strtol(debug_env, &inv, 10); |
586 | if (inv == debug_env) { | |
587 | return initial; | |
588 | } | |
cc5d0e04 | 589 | if (debug < 0 || debug > max || errno != 0) { |
b16352ac AL |
590 | fprintf(stderr, "warning: %s not in [0, %d]", name, max); |
591 | return initial; | |
592 | } | |
593 | return debug; | |
594 | } | |
4297c8ee AK |
595 | |
596 | /* | |
597 | * Helper to print ethernet mac address | |
598 | */ | |
599 | const char *qemu_ether_ntoa(const MACAddr *mac) | |
600 | { | |
601 | static char ret[18]; | |
602 | ||
603 | snprintf(ret, sizeof(ret), "%02x:%02x:%02x:%02x:%02x:%02x", | |
604 | mac->a[0], mac->a[1], mac->a[2], mac->a[3], mac->a[4], mac->a[5]); | |
605 | ||
606 | return ret; | |
607 | } |