2
* Simple C functions to supplement the C library
4
* Copyright (c) 2006 Fabrice Bellard
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:
13
* The above copyright notice and this permission notice shall be included in
14
* all copies or substantial portions of the Software.
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
24
#include "qemu-common.h"
25
#include "qemu/host-utils.h"
28
#include "qemu/sockets.h"
31
void strpadcpy(char *buf, int buf_size, const char *str, char pad)
33
int len = qemu_strnlen(str, buf_size);
34
memcpy(buf, str, len);
35
memset(buf + len, pad, buf_size - len);
38
void pstrcpy(char *buf, int buf_size, const char *str)
48
if (c == 0 || q >= buf + buf_size - 1)
55
/* strcat and truncate. */
56
char *pstrcat(char *buf, int buf_size, const char *s)
61
pstrcpy(buf + len, buf_size - len, s);
65
int strstart(const char *str, const char *val, const char **ptr)
81
int stristart(const char *str, const char *val, const char **ptr)
87
if (qemu_toupper(*p) != qemu_toupper(*q))
97
/* XXX: use host strnlen if available ? */
98
int qemu_strnlen(const char *s, int max_len)
102
for(i = 0; i < max_len; i++) {
110
char *qemu_strsep(char **input, const char *delim)
112
char *result = *input;
113
if (result != NULL) {
116
for (p = result; *p != '\0'; p++) {
117
if (strchr(delim, *p)) {
131
time_t mktimegm(struct tm *tm)
134
int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday;
139
t = 86400ULL * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 +
141
t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec;
147
return 32 - clz32(i);
151
* Make sure data goes on disk, but if possible do not bother to
152
* write out the inode just for timestamp updates.
154
* Unfortunately even in 2009 many operating systems do not support
155
* fdatasync and have to fall back to fsync.
157
int qemu_fdatasync(int fd)
159
#ifdef CONFIG_FDATASYNC
160
return fdatasync(fd);
167
* Searches for an area with non-zero content in a buffer
169
* Attention! The len must be a multiple of
170
* BUFFER_FIND_NONZERO_OFFSET_UNROLL_FACTOR * sizeof(VECTYPE)
171
* and addr must be a multiple of sizeof(VECTYPE) due to
172
* restriction of optimizations in this function.
174
* can_use_buffer_find_nonzero_offset() can be used to check
175
* these requirements.
177
* The return value is the offset of the non-zero area rounded
178
* down to a multiple of sizeof(VECTYPE) for the first
179
* BUFFER_FIND_NONZERO_OFFSET_UNROLL_FACTOR chunks and down to
180
* BUFFER_FIND_NONZERO_OFFSET_UNROLL_FACTOR * sizeof(VECTYPE)
183
* If the buffer is all zero the return value is equal to len.
186
size_t buffer_find_nonzero_offset(const void *buf, size_t len)
188
const VECTYPE *p = buf;
189
const VECTYPE zero = (VECTYPE){0};
192
assert(can_use_buffer_find_nonzero_offset(buf, len));
198
for (i = 0; i < BUFFER_FIND_NONZERO_OFFSET_UNROLL_FACTOR; i++) {
199
if (!ALL_EQ(p[i], zero)) {
200
return i * sizeof(VECTYPE);
204
for (i = BUFFER_FIND_NONZERO_OFFSET_UNROLL_FACTOR;
205
i < len / sizeof(VECTYPE);
206
i += BUFFER_FIND_NONZERO_OFFSET_UNROLL_FACTOR) {
207
VECTYPE tmp0 = p[i + 0] | p[i + 1];
208
VECTYPE tmp1 = p[i + 2] | p[i + 3];
209
VECTYPE tmp2 = p[i + 4] | p[i + 5];
210
VECTYPE tmp3 = p[i + 6] | p[i + 7];
211
VECTYPE tmp01 = tmp0 | tmp1;
212
VECTYPE tmp23 = tmp2 | tmp3;
213
if (!ALL_EQ(tmp01 | tmp23, zero)) {
218
return i * sizeof(VECTYPE);
222
* Checks if a buffer is all zeroes
224
* Attention! The len must be a multiple of 4 * sizeof(long) due to
225
* restriction of optimizations in this function.
227
bool buffer_is_zero(const void *buf, size_t len)
230
* Use long as the biggest available internal data type that fits into the
231
* CPU register and unroll the loop to smooth out the effect of memory
237
const long * const data = buf;
239
/* use vector optimized zero check if possible */
240
if (can_use_buffer_find_nonzero_offset(buf, len)) {
241
return buffer_find_nonzero_offset(buf, len) == len;
244
assert(len % (4 * sizeof(long)) == 0);
247
for (i = 0; i < len; i += 4) {
253
if (d0 || d1 || d2 || d3) {
262
/* Sets a specific flag */
263
int fcntl_setfl(int fd, int flag)
267
flags = fcntl(fd, F_GETFL);
271
if (fcntl(fd, F_SETFL, flags | flag) == -1)
278
static int64_t suffix_mul(char suffix, int64_t unit)
280
switch (qemu_toupper(suffix)) {
281
case STRTOSZ_DEFSUFFIX_B:
283
case STRTOSZ_DEFSUFFIX_KB:
285
case STRTOSZ_DEFSUFFIX_MB:
287
case STRTOSZ_DEFSUFFIX_GB:
288
return unit * unit * unit;
289
case STRTOSZ_DEFSUFFIX_TB:
290
return unit * unit * unit * unit;
291
case STRTOSZ_DEFSUFFIX_PB:
292
return unit * unit * unit * unit * unit;
293
case STRTOSZ_DEFSUFFIX_EB:
294
return unit * unit * unit * unit * unit * unit;
300
* Convert string to bytes, allowing either B/b for bytes, K/k for KB,
301
* M/m for MB, G/g for GB or T/t for TB. End pointer will be returned
302
* in *end, if not NULL. Return -ERANGE on overflow, Return -EINVAL on
305
int64_t strtosz_suffix_unit(const char *nptr, char **end,
306
const char default_suffix, int64_t unit)
308
int64_t retval = -EINVAL;
311
int mul_required = 0;
312
double val, mul, integral, fraction;
315
val = strtod(nptr, &endptr);
316
if (isnan(val) || endptr == nptr || errno != 0) {
319
fraction = modf(val, &integral);
324
mul = suffix_mul(c, unit);
328
mul = suffix_mul(default_suffix, unit);
331
if (mul == 1 && mul_required) {
334
if ((val * mul >= INT64_MAX) || val < 0) {
348
int64_t strtosz_suffix(const char *nptr, char **end, const char default_suffix)
350
return strtosz_suffix_unit(nptr, end, default_suffix, 1024);
353
int64_t strtosz(const char *nptr, char **end)
355
return strtosz_suffix(nptr, end, STRTOSZ_DEFSUFFIX_MB);
361
* @s: String to parse
362
* @value: Destination for parsed integer value
363
* @endptr: Destination for pointer to first character not consumed
364
* @base: integer base, between 2 and 36 inclusive, or 0
366
* Parse unsigned integer
368
* Parsed syntax is like strtoull()'s: arbitrary whitespace, a single optional
369
* '+' or '-', an optional "0x" if @base is 0 or 16, one or more digits.
371
* If @s is null, or @base is invalid, or @s doesn't start with an
372
* integer in the syntax above, set *@value to 0, *@endptr to @s, and
375
* Set *@endptr to point right beyond the parsed integer (even if the integer
376
* overflows or is negative, all digits will be parsed and *@endptr will
377
* point right beyond them).
379
* If the integer is negative, set *@value to 0, and return -ERANGE.
381
* If the integer overflows unsigned long long, set *@value to
382
* ULLONG_MAX, and return -ERANGE.
384
* Else, set *@value to the parsed integer, and return 0.
386
int parse_uint(const char *s, unsigned long long *value, char **endptr,
390
char *endp = (char *)s;
391
unsigned long long val = 0;
399
val = strtoull(s, &endp, base);
410
/* make sure we reject negative numbers: */
411
while (isspace((unsigned char)*s)) {
429
* @s: String to parse
430
* @value: Destination for parsed integer value
431
* @base: integer base, between 2 and 36 inclusive, or 0
433
* Parse unsigned integer from entire string
435
* Have the same behavior of parse_uint(), but with an additional check
436
* for additional data after the parsed number. If extra characters are present
437
* after the parsed number, the function will return -EINVAL, and *@v will
440
int parse_uint_full(const char *s, unsigned long long *value, int base)
445
r = parse_uint(s, value, &endp, base);
457
int qemu_parse_fd(const char *param)
462
fd = strtol(param, &endptr, 10);
463
if (*endptr || (fd == 0 && param == endptr)) {
469
/* round down to the nearest power of 2*/
470
int64_t pow2floor(int64_t value)
472
if (!is_power_of_2(value)) {
473
value = 0x8000000000000000ULL >> clz64(value);
479
* Implementation of ULEB128 (http://en.wikipedia.org/wiki/LEB128)
480
* Input is limited to 14-bit numbers
482
int uleb128_encode_small(uint8_t *out, uint32_t n)
484
g_assert(n <= 0x3fff);
489
*out++ = (n & 0x7f) | 0x80;
495
int uleb128_decode_small(const uint8_t *in, uint32_t *n)
502
/* we exceed 14 bit number */
512
* helper to parse debug environment variables
514
int parse_debug_env(const char *name, int max, int initial)
516
char *debug_env = getenv(name);
523
debug = strtol(debug_env, &inv, 10);
524
if (inv == debug_env) {
527
if (debug < 0 || debug > max) {
528
fprintf(stderr, "warning: %s not in [0, %d]", name, max);