cutils.c 11.5 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
#include "qemu_socket.h"
29
#include "iov.h"
30

B
bellard 已提交
31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52
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);
53
    if (len < buf_size)
B
bellard 已提交
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 79
        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') {
80
        if (qemu_toupper(*p) != qemu_toupper(*q))
B
bellard 已提交
81 82 83 84 85 86 87 88
            return 0;
        p++;
        q++;
    }
    if (ptr)
        *ptr = p;
    return 1;
}
B
bellard 已提交
89

B
Blue Swirl 已提交
90 91 92 93 94 95 96 97 98 99 100 101 102
/* 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 已提交
103 104 105 106 107 108 109 110 111 112 113 114 115
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 已提交
116

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

122 123 124 125 126 127 128 129 130
/*
 * 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 已提交
131
#ifdef CONFIG_FDATASYNC
132 133 134 135 136 137
    return fdatasync(fd);
#else
    return fsync(fd);
#endif
}

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

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

148 149 150 151 152 153 154 155 156 157 158 159
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 已提交
160 161
void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len)
{
162 163
    assert(qiov->nalloc != -1);

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

K
Kevin Wolf 已提交
174
/*
175 176 177 178 179 180 181 182
 * Concatenates (partial) iovecs from src to the end of dst.
 * It starts copying after skipping `soffset' bytes at the
 * beginning of src and adds individual vectors from src to
 * dst copies up to `sbytes' bytes total, or up to the end
 * of src if it comes first.  This way, it is okay to specify
 * very large value for `sbytes' to indicate "up to the end
 * of src".
 * Only vector pointers are processed, not the actual data buffers.
K
Kevin Wolf 已提交
183
 */
184 185
void qemu_iovec_concat(QEMUIOVector *dst,
                       QEMUIOVector *src, size_t soffset, size_t sbytes)
K
Kevin Wolf 已提交
186 187 188
{
    int i;
    size_t done;
189
    struct iovec *siov = src->iov;
K
Kevin Wolf 已提交
190
    assert(dst->nalloc != -1);
191 192 193 194 195 196 197
    assert(src->size >= soffset);
    for (i = 0, done = 0; done < sbytes && i < src->niov; i++) {
        if (soffset < siov[i].iov_len) {
            size_t len = MIN(siov[i].iov_len - soffset, sbytes - done);
            qemu_iovec_add(dst, siov[i].iov_base + soffset, len);
            done += len;
            soffset = 0;
198
        } else {
199
            soffset -= siov[i].iov_len;
200
        }
K
Kevin Wolf 已提交
201
    }
202
    /* return done; */
203 204
}

A
aliguori 已提交
205 206
void qemu_iovec_destroy(QEMUIOVector *qiov)
{
207 208
    assert(qiov->nalloc != -1);

209
    qemu_iovec_reset(qiov);
210
    g_free(qiov->iov);
211 212
    qiov->nalloc = 0;
    qiov->iov = NULL;
A
aliguori 已提交
213 214
}

A
aliguori 已提交
215 216
void qemu_iovec_reset(QEMUIOVector *qiov)
{
217 218
    assert(qiov->nalloc != -1);

A
aliguori 已提交
219 220 221 222
    qiov->niov = 0;
    qiov->size = 0;
}

A
aliguori 已提交
223 224 225 226 227 228 229 230 231 232 233
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;
    }
}

234 235
size_t qemu_iovec_from_buf(QEMUIOVector *qiov, size_t offset,
                           const void *buf, size_t bytes)
A
aliguori 已提交
236
{
237
    return iov_from_buf(qiov->iov, qiov->niov, offset, buf, bytes);
A
aliguori 已提交
238
}
P
Paolo Bonzini 已提交
239

240 241
size_t qemu_iovec_memset(QEMUIOVector *qiov, size_t offset,
                         int fillc, size_t bytes)
242
{
243
    return iov_memset(qiov->iov, qiov->niov, offset, fillc, bytes);
244 245
}

246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280
/*
 * Checks if a buffer is all zeroes
 *
 * Attention! The len must be a multiple of 4 * sizeof(long) due to
 * restriction of optimizations in this function.
 */
bool buffer_is_zero(const void *buf, size_t len)
{
    /*
     * Use long as the biggest available internal data type that fits into the
     * CPU register and unroll the loop to smooth out the effect of memory
     * latency.
     */

    size_t i;
    long d0, d1, d2, d3;
    const long * const data = buf;

    assert(len % (4 * sizeof(long)) == 0);
    len /= sizeof(long);

    for (i = 0; i < len; i += 4) {
        d0 = data[i + 0];
        d1 = data[i + 1];
        d2 = data[i + 2];
        d3 = data[i + 3];

        if (d0 || d1 || d2 || d3) {
            return false;
        }
    }

    return true;
}

P
Paolo Bonzini 已提交
281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297
#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

298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314
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;
}

315 316
/*
 * Convert string to bytes, allowing either B/b for bytes, K/k for KB,
317
 * M/m for MB, G/g for GB or T/t for TB. End pointer will be returned
318
 * in *end, if not NULL. Return -1 on error.
319
 */
320 321
int64_t strtosz_suffix_unit(const char *nptr, char **end,
                            const char default_suffix, int64_t unit)
322
{
323
    int64_t retval = -1;
324
    char *endptr;
325
    unsigned char c;
326 327 328 329 330 331 332 333
    int mul_required = 0;
    double val, mul, integral, fraction;

    errno = 0;
    val = strtod(nptr, &endptr);
    if (isnan(val) || endptr == nptr || errno != 0) {
        goto fail;
    }
334 335
    fraction = modf(val, &integral);
    if (fraction != 0) {
336 337 338
        mul_required = 1;
    }
    c = *endptr;
339 340 341 342 343 344
    mul = suffix_mul(c, unit);
    if (mul >= 0) {
        endptr++;
    } else {
        mul = suffix_mul(default_suffix, unit);
        assert(mul >= 0);
345
    }
346
    if (mul == 1 && mul_required) {
347 348
        goto fail;
    }
349
    if ((val * mul >= INT64_MAX) || val < 0) {
350 351 352 353 354 355 356 357 358 359 360
        goto fail;
    }
    retval = val * mul;

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

    return retval;
}
J
Jes Sorensen 已提交
361

362 363
int64_t strtosz_suffix(const char *nptr, char **end, const char default_suffix)
{
364
    return strtosz_suffix_unit(nptr, end, default_suffix, 1024);
365 366
}

367
int64_t strtosz(const char *nptr, char **end)
J
Jes Sorensen 已提交
368 369 370
{
    return strtosz_suffix(nptr, end, STRTOSZ_DEFSUFFIX_MB);
}
371 372 373 374 375 376 377 378 379 380 381 382

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;
}
383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 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

/*
 * 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);
}