cutils.c 12.0 KB
Newer Older
B
bellard 已提交
1 2
/*
 * Simple C functions to supplement the C library
3
 *
B
bellard 已提交
4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23
 * Copyright (c) 2006 Fabrice Bellard
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */
P
pbrook 已提交
24
#include "qemu-common.h"
A
aliguori 已提交
25
#include "host-utils.h"
26
#include <math.h>
B
bellard 已提交
27

28 29
#include "qemu_socket.h"

B
bellard 已提交
30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51
void pstrcpy(char *buf, int buf_size, const char *str)
{
    int c;
    char *q = buf;

    if (buf_size <= 0)
        return;

    for(;;) {
        c = *str++;
        if (c == 0 || q >= buf + buf_size - 1)
            break;
        *q++ = c;
    }
    *q = '\0';
}

/* strcat and truncate. */
char *pstrcat(char *buf, int buf_size, const char *s)
{
    int len;
    len = strlen(buf);
52
    if (len < buf_size)
B
bellard 已提交
53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78
        pstrcpy(buf + len, buf_size - len, s);
    return buf;
}

int strstart(const char *str, const char *val, const char **ptr)
{
    const char *p, *q;
    p = str;
    q = val;
    while (*q != '\0') {
        if (*p != *q)
            return 0;
        p++;
        q++;
    }
    if (ptr)
        *ptr = p;
    return 1;
}

int stristart(const char *str, const char *val, const char **ptr)
{
    const char *p, *q;
    p = str;
    q = val;
    while (*q != '\0') {
79
        if (qemu_toupper(*p) != qemu_toupper(*q))
B
bellard 已提交
80 81 82 83 84 85 86 87
            return 0;
        p++;
        q++;
    }
    if (ptr)
        *ptr = p;
    return 1;
}
B
bellard 已提交
88

B
Blue Swirl 已提交
89 90 91 92 93 94 95 96 97 98 99 100 101
/* XXX: use host strnlen if available ? */
int qemu_strnlen(const char *s, int max_len)
{
    int i;

    for(i = 0; i < max_len; i++) {
        if (s[i] == '\0') {
            break;
        }
    }
    return i;
}

B
bellard 已提交
102 103 104 105 106 107 108 109 110 111 112 113 114
time_t mktimegm(struct tm *tm)
{
    time_t t;
    int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday;
    if (m < 3) {
        m += 12;
        y--;
    }
    t = 86400 * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 + 
                 y / 400 - 719469);
    t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec;
    return t;
}
A
aliguori 已提交
115

B
blueswir1 已提交
116
int qemu_fls(int i)
A
aliguori 已提交
117
{
A
aliguori 已提交
118
    return 32 - clz32(i);
A
aliguori 已提交
119
}
A
aliguori 已提交
120

121 122 123 124 125 126 127 128 129
/*
 * Make sure data goes on disk, but if possible do not bother to
 * write out the inode just for timestamp updates.
 *
 * Unfortunately even in 2009 many operating systems do not support
 * fdatasync and have to fall back to fsync.
 */
int qemu_fdatasync(int fd)
{
B
Blue Swirl 已提交
130
#ifdef CONFIG_FDATASYNC
131 132 133 134 135 136
    return fdatasync(fd);
#else
    return fsync(fd);
#endif
}

A
aliguori 已提交
137 138 139 140
/* io vectors */

void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint)
{
141
    qiov->iov = g_malloc(alloc_hint * sizeof(struct iovec));
A
aliguori 已提交
142 143
    qiov->niov = 0;
    qiov->nalloc = alloc_hint;
144
    qiov->size = 0;
A
aliguori 已提交
145 146
}

147 148 149 150 151 152 153 154 155 156 157 158
void qemu_iovec_init_external(QEMUIOVector *qiov, struct iovec *iov, int niov)
{
    int i;

    qiov->iov = iov;
    qiov->niov = niov;
    qiov->nalloc = -1;
    qiov->size = 0;
    for (i = 0; i < niov; i++)
        qiov->size += iov[i].iov_len;
}

A
aliguori 已提交
159 160
void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len)
{
161 162
    assert(qiov->nalloc != -1);

A
aliguori 已提交
163 164
    if (qiov->niov == qiov->nalloc) {
        qiov->nalloc = 2 * qiov->nalloc + 1;
165
        qiov->iov = g_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec));
A
aliguori 已提交
166 167 168
    }
    qiov->iov[qiov->niov].iov_base = base;
    qiov->iov[qiov->niov].iov_len = len;
169
    qiov->size += len;
A
aliguori 已提交
170 171 172
    ++qiov->niov;
}

K
Kevin Wolf 已提交
173
/*
174 175 176 177 178
 * Copies iovecs from src to the end of dst. It starts copying after skipping
 * the given number of bytes in src and copies until src is completely copied
 * or the total size of the copied iovec reaches size.The size of the last
 * copied iovec is changed in order to fit the specified total size if it isn't
 * a perfect fit already.
K
Kevin Wolf 已提交
179
 */
180 181
void qemu_iovec_copy(QEMUIOVector *dst, QEMUIOVector *src, uint64_t skip,
    size_t size)
K
Kevin Wolf 已提交
182 183 184
{
    int i;
    size_t done;
185 186
    void *iov_base;
    uint64_t iov_len;
K
Kevin Wolf 已提交
187 188 189 190 191

    assert(dst->nalloc != -1);

    done = 0;
    for (i = 0; (i < src->niov) && (done != size); i++) {
192 193 194 195 196 197 198 199 200 201 202 203 204
        if (skip >= src->iov[i].iov_len) {
            /* Skip the whole iov */
            skip -= src->iov[i].iov_len;
            continue;
        } else {
            /* Skip only part (or nothing) of the iov */
            iov_base = (uint8_t*) src->iov[i].iov_base + skip;
            iov_len = src->iov[i].iov_len - skip;
            skip = 0;
        }

        if (done + iov_len > size) {
            qemu_iovec_add(dst, iov_base, size - done);
K
Kevin Wolf 已提交
205 206
            break;
        } else {
207
            qemu_iovec_add(dst, iov_base, iov_len);
K
Kevin Wolf 已提交
208
        }
209
        done += iov_len;
K
Kevin Wolf 已提交
210 211 212
    }
}

213 214 215 216 217
void qemu_iovec_concat(QEMUIOVector *dst, QEMUIOVector *src, size_t size)
{
    qemu_iovec_copy(dst, src, 0, size);
}

A
aliguori 已提交
218 219
void qemu_iovec_destroy(QEMUIOVector *qiov)
{
220 221
    assert(qiov->nalloc != -1);

222
    qemu_iovec_reset(qiov);
223
    g_free(qiov->iov);
224 225
    qiov->nalloc = 0;
    qiov->iov = NULL;
A
aliguori 已提交
226 227
}

A
aliguori 已提交
228 229
void qemu_iovec_reset(QEMUIOVector *qiov)
{
230 231
    assert(qiov->nalloc != -1);

A
aliguori 已提交
232 233 234 235
    qiov->niov = 0;
    qiov->size = 0;
}

A
aliguori 已提交
236 237 238 239 240 241 242 243 244 245 246
void qemu_iovec_to_buffer(QEMUIOVector *qiov, void *buf)
{
    uint8_t *p = (uint8_t *)buf;
    int i;

    for (i = 0; i < qiov->niov; ++i) {
        memcpy(p, qiov->iov[i].iov_base, qiov->iov[i].iov_len);
        p += qiov->iov[i].iov_len;
    }
}

247
void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count)
A
aliguori 已提交
248 249
{
    const uint8_t *p = (const uint8_t *)buf;
250
    size_t copy;
A
aliguori 已提交
251 252
    int i;

253 254 255 256 257 258 259
    for (i = 0; i < qiov->niov && count; ++i) {
        copy = count;
        if (copy > qiov->iov[i].iov_len)
            copy = qiov->iov[i].iov_len;
        memcpy(qiov->iov[i].iov_base, p, copy);
        p     += copy;
        count -= copy;
A
aliguori 已提交
260 261
    }
}
P
Paolo Bonzini 已提交
262

263 264 265 266 267 268 269 270 271 272 273 274
void qemu_iovec_memset(QEMUIOVector *qiov, int c, size_t count)
{
    size_t n;
    int i;

    for (i = 0; i < qiov->niov && count; ++i) {
        n = MIN(count, qiov->iov[i].iov_len);
        memset(qiov->iov[i].iov_base, c, n);
        count -= n;
    }
}

275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305
void qemu_iovec_memset_skip(QEMUIOVector *qiov, int c, size_t count,
                            size_t skip)
{
    int i;
    size_t done;
    void *iov_base;
    uint64_t iov_len;

    done = 0;
    for (i = 0; (i < qiov->niov) && (done != count); i++) {
        if (skip >= qiov->iov[i].iov_len) {
            /* Skip the whole iov */
            skip -= qiov->iov[i].iov_len;
            continue;
        } else {
            /* Skip only part (or nothing) of the iov */
            iov_base = (uint8_t*) qiov->iov[i].iov_base + skip;
            iov_len = qiov->iov[i].iov_len - skip;
            skip = 0;
        }

        if (done + iov_len > count) {
            memset(iov_base, c, count - done);
            break;
        } else {
            memset(iov_base, c, iov_len);
        }
        done += iov_len;
    }
}

P
Paolo Bonzini 已提交
306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322
#ifndef _WIN32
/* Sets a specific flag */
int fcntl_setfl(int fd, int flag)
{
    int flags;

    flags = fcntl(fd, F_GETFL);
    if (flags == -1)
        return -errno;

    if (fcntl(fd, F_SETFL, flags | flag) == -1)
        return -errno;

    return 0;
}
#endif

323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339
static int64_t suffix_mul(char suffix, int64_t unit)
{
    switch (qemu_toupper(suffix)) {
    case STRTOSZ_DEFSUFFIX_B:
        return 1;
    case STRTOSZ_DEFSUFFIX_KB:
        return unit;
    case STRTOSZ_DEFSUFFIX_MB:
        return unit * unit;
    case STRTOSZ_DEFSUFFIX_GB:
        return unit * unit * unit;
    case STRTOSZ_DEFSUFFIX_TB:
        return unit * unit * unit * unit;
    }
    return -1;
}

340 341
/*
 * Convert string to bytes, allowing either B/b for bytes, K/k for KB,
342
 * M/m for MB, G/g for GB or T/t for TB. End pointer will be returned
343
 * in *end, if not NULL. Return -1 on error.
344
 */
345 346
int64_t strtosz_suffix_unit(const char *nptr, char **end,
                            const char default_suffix, int64_t unit)
347
{
348
    int64_t retval = -1;
349
    char *endptr;
350
    unsigned char c;
351 352 353 354 355 356 357 358
    int mul_required = 0;
    double val, mul, integral, fraction;

    errno = 0;
    val = strtod(nptr, &endptr);
    if (isnan(val) || endptr == nptr || errno != 0) {
        goto fail;
    }
359 360
    fraction = modf(val, &integral);
    if (fraction != 0) {
361 362 363
        mul_required = 1;
    }
    c = *endptr;
364 365 366 367 368 369
    mul = suffix_mul(c, unit);
    if (mul >= 0) {
        endptr++;
    } else {
        mul = suffix_mul(default_suffix, unit);
        assert(mul >= 0);
370
    }
371
    if (mul == 1 && mul_required) {
372 373
        goto fail;
    }
374
    if ((val * mul >= INT64_MAX) || val < 0) {
375 376 377 378 379 380 381 382 383 384 385
        goto fail;
    }
    retval = val * mul;

fail:
    if (end) {
        *end = endptr;
    }

    return retval;
}
J
Jes Sorensen 已提交
386

387 388
int64_t strtosz_suffix(const char *nptr, char **end, const char default_suffix)
{
389
    return strtosz_suffix_unit(nptr, end, default_suffix, 1024);
390 391
}

392
int64_t strtosz(const char *nptr, char **end)
J
Jes Sorensen 已提交
393 394 395
{
    return strtosz_suffix(nptr, end, STRTOSZ_DEFSUFFIX_MB);
}
396 397 398 399 400 401 402 403 404 405 406 407

int qemu_parse_fd(const char *param)
{
    int fd;
    char *endptr = NULL;

    fd = strtol(param, &endptr, 10);
    if (*endptr || (fd == 0 && param == endptr)) {
        return -1;
    }
    return fd;
}
408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516

/*
 * Send/recv data with iovec buffers
 *
 * This function send/recv data from/to the iovec buffer directly.
 * The first `offset' bytes in the iovec buffer are skipped and next
 * `len' bytes are used.
 *
 * For example,
 *
 *   do_sendv_recvv(sockfd, iov, len, offset, 1);
 *
 * is equal to
 *
 *   char *buf = malloc(size);
 *   iov_to_buf(iov, iovcnt, buf, offset, size);
 *   send(sockfd, buf, size, 0);
 *   free(buf);
 */
static int do_sendv_recvv(int sockfd, struct iovec *iov, int len, int offset,
                          int do_sendv)
{
    int ret, diff, iovlen;
    struct iovec *last_iov;

    /* last_iov is inclusive, so count from one.  */
    iovlen = 1;
    last_iov = iov;
    len += offset;

    while (last_iov->iov_len < len) {
        len -= last_iov->iov_len;

        last_iov++;
        iovlen++;
    }

    diff = last_iov->iov_len - len;
    last_iov->iov_len -= diff;

    while (iov->iov_len <= offset) {
        offset -= iov->iov_len;

        iov++;
        iovlen--;
    }

    iov->iov_base = (char *) iov->iov_base + offset;
    iov->iov_len -= offset;

    {
#if defined CONFIG_IOVEC && defined CONFIG_POSIX
        struct msghdr msg;
        memset(&msg, 0, sizeof(msg));
        msg.msg_iov = iov;
        msg.msg_iovlen = iovlen;

        do {
            if (do_sendv) {
                ret = sendmsg(sockfd, &msg, 0);
            } else {
                ret = recvmsg(sockfd, &msg, 0);
            }
        } while (ret == -1 && errno == EINTR);
#else
        struct iovec *p = iov;
        ret = 0;
        while (iovlen > 0) {
            int rc;
            if (do_sendv) {
                rc = send(sockfd, p->iov_base, p->iov_len, 0);
            } else {
                rc = qemu_recv(sockfd, p->iov_base, p->iov_len, 0);
            }
            if (rc == -1) {
                if (errno == EINTR) {
                    continue;
                }
                if (ret == 0) {
                    ret = -1;
                }
                break;
            }
            if (rc == 0) {
                break;
            }
            ret += rc;
            iovlen--, p++;
        }
#endif
    }

    /* Undo the changes above */
    iov->iov_base = (char *) iov->iov_base - offset;
    iov->iov_len += offset;
    last_iov->iov_len += diff;
    return ret;
}

int qemu_recvv(int sockfd, struct iovec *iov, int len, int iov_offset)
{
    return do_sendv_recvv(sockfd, iov, len, iov_offset, 0);
}

int qemu_sendv(int sockfd, struct iovec *iov, int len, int iov_offset)
{
    return do_sendv_recvv(sockfd, iov, len, iov_offset, 1);
}