[qemu.git] / cutils.c

/*
 * Simple C functions to supplement the C library
 *
 * 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.
 */
#include "qemu-common.h"
#include "host-utils.h"
#include <math.h>

#include "qemu_socket.h"

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);
    if (len < buf_size)
        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') {
        if (qemu_toupper(*p) != qemu_toupper(*q))
            return 0;
        p++;
        q++;
    }
    if (ptr)
        *ptr = p;
    return 1;
}

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

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;
}

int qemu_fls(int i)
{
    return 32 - clz32(i);
}

/*
 * 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)
{
#ifdef CONFIG_FDATASYNC
    return fdatasync(fd);
#else
    return fsync(fd);
#endif
}

/* io vectors */

void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint)
{
    qiov->iov = g_malloc(alloc_hint * sizeof(struct iovec));
    qiov->niov = 0;
    qiov->nalloc = alloc_hint;
    qiov->size = 0;
}

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;
}

void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len)
{
    assert(qiov->nalloc != -1);

    if (qiov->niov == qiov->nalloc) {
        qiov->nalloc = 2 * qiov->nalloc + 1;
        qiov->iov = g_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec));
    }
    qiov->iov[qiov->niov].iov_base = base;
    qiov->iov[qiov->niov].iov_len = len;
    qiov->size += len;
    ++qiov->niov;
}

/*
 * 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.
 */
void qemu_iovec_copy(QEMUIOVector *dst, QEMUIOVector *src, uint64_t skip,
    size_t size)
{
    int i;
    size_t done;
    void *iov_base;
    uint64_t iov_len;

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

    done = 0;
    for (i = 0; (i < src->niov) && (done != size); i++) {
        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);
            break;
        } else {
            qemu_iovec_add(dst, iov_base, iov_len);
        }
        done += iov_len;
    }
}

void qemu_iovec_concat(QEMUIOVector *dst, QEMUIOVector *src, size_t size)
{
    qemu_iovec_copy(dst, src, 0, size);
}

void qemu_iovec_destroy(QEMUIOVector *qiov)
{
    assert(qiov->nalloc != -1);

    qemu_iovec_reset(qiov);
    g_free(qiov->iov);
    qiov->nalloc = 0;
    qiov->iov = NULL;
}

void qemu_iovec_reset(QEMUIOVector *qiov)
{
    assert(qiov->nalloc != -1);

    qiov->niov = 0;
    qiov->size = 0;
}

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;
    }
}

void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count)
{
    const uint8_t *p = (const uint8_t *)buf;
    size_t copy;
    int i;

    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;
    }
}

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;
    }
}

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;
    }
}

#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

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;
}

/*
 * Convert string to bytes, allowing either B/b for bytes, K/k for KB,
 * M/m for MB, G/g for GB or T/t for TB. End pointer will be returned
 * in *end, if not NULL. Return -1 on error.
 */
int64_t strtosz_suffix_unit(const char *nptr, char **end,
                            const char default_suffix, int64_t unit)
{
    int64_t retval = -1;
    char *endptr;
    unsigned char c;
    int mul_required = 0;
    double val, mul, integral, fraction;

    errno = 0;
    val = strtod(nptr, &endptr);
    if (isnan(val) || endptr == nptr || errno != 0) {
        goto fail;
    }
    fraction = modf(val, &integral);
    if (fraction != 0) {
        mul_required = 1;
    }
    c = *endptr;
    mul = suffix_mul(c, unit);
    if (mul >= 0) {
        endptr++;
    } else {
        mul = suffix_mul(default_suffix, unit);
        assert(mul >= 0);
    }
    if (mul == 1 && mul_required) {
        goto fail;
    }
    if ((val * mul >= INT64_MAX) || val < 0) {
        goto fail;
    }
    retval = val * mul;

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

    return retval;
}

int64_t strtosz_suffix(const char *nptr, char **end, const char default_suffix)
{
    return strtosz_suffix_unit(nptr, end, default_suffix, 1024);
}

int64_t strtosz(const char *nptr, char **end)
{
    return strtosz_suffix(nptr, end, STRTOSZ_DEFSUFFIX_MB);
}

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;
}

/*
 * 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);
}
Commit	Line	Data
18607dcb FB	1	/*
18607dcb FB	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	*/
faf07963	24	#include "qemu-common.h"
8d371d4b	25	#include "host-utils.h"
9f9b17a4	26	#include <math.h>
18607dcb	27
8c5135f9 PB	28	#include "qemu_socket.h"
8c5135f9 PB	29
18607dcb FB	30	void pstrcpy(char buf, int buf_size, const char str)
	31	{
	32	int c;
	33	char *q = buf;
	34
	35	if (buf_size <= 0)
	36	return;
	37
	38	for(;;) {
	39	c = *str++;
	40	if (c == 0 \|\| q >= buf + buf_size - 1)
	41	break;
	42	*q++ = c;
	43	}
	44	*q = '\0';
	45	}
	46
	47	/* strcat and truncate. */
	48	char pstrcat(char buf, int buf_size, const char *s)
	49	{
	50	int len;
	51	len = strlen(buf);
5fafdf24	52	if (len < buf_size)
18607dcb FB	53	pstrcpy(buf + len, buf_size - len, s);
	54	return buf;
	55	}
	56
	57	int strstart(const char str, const char val, const char **ptr)
	58	{
	59	const char p, q;
	60	p = str;
	61	q = val;
	62	while (*q != '\0') {
	63	if (p != q)
	64	return 0;
	65	p++;
	66	q++;
	67	}
	68	if (ptr)
	69	*ptr = p;
	70	return 1;
	71	}
	72
	73	int stristart(const char str, const char val, const char **ptr)
	74	{
	75	const char p, q;
	76	p = str;
	77	q = val;
	78	while (*q != '\0') {
cd390083	79	if (qemu_toupper(p) != qemu_toupper(q))
18607dcb FB	80	return 0;
	81	p++;
	82	q++;
	83	}
	84	if (ptr)
	85	*ptr = p;
	86	return 1;
	87	}
3c6b2088	88
d43277c5 BS	89	/* XXX: use host strnlen if available ? */
	90	int qemu_strnlen(const char *s, int max_len)
	91	{
	92	int i;
	93
	94	for(i = 0; i < max_len; i++) {
	95	if (s[i] == '\0') {
	96	break;
	97	}
	98	}
	99	return i;
	100	}
	101
3c6b2088 FB	102	time_t mktimegm(struct tm *tm)
	103	{
	104	time_t t;
	105	int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday;
	106	if (m < 3) {
	107	m += 12;
	108	y--;
	109	}
	110	t = 86400 * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 +
	111	y / 400 - 719469);
	112	t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec;
	113	return t;
	114	}
b39ade83	115
ad46db9a	116	int qemu_fls(int i)
b39ade83	117	{
8d371d4b	118	return 32 - clz32(i);
b39ade83	119	}
44e3ee8a	120
6f1953c4 CH	121	/*
	122	* Make sure data goes on disk, but if possible do not bother to
	123	* write out the inode just for timestamp updates.
	124	*
	125	* Unfortunately even in 2009 many operating systems do not support
	126	* fdatasync and have to fall back to fsync.
	127	*/
	128	int qemu_fdatasync(int fd)
	129	{
5f6b9e8f	130	#ifdef CONFIG_FDATASYNC
6f1953c4 CH	131	return fdatasync(fd);
	132	#else
	133	return fsync(fd);
	134	#endif
	135	}
	136
44e3ee8a AL	137	/* io vectors */
	138
	139	void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint)
	140	{
7267c094	141	qiov->iov = g_malloc(alloc_hint * sizeof(struct iovec));
44e3ee8a AL	142	qiov->niov = 0;
44e3ee8a AL	143	qiov->nalloc = alloc_hint;
249aa745	144	qiov->size = 0;
44e3ee8a AL	145	}
44e3ee8a AL	146
522584a5 AL	147	void qemu_iovec_init_external(QEMUIOVector qiov, struct iovec iov, int niov)
	148	{
	149	int i;
	150
	151	qiov->iov = iov;
	152	qiov->niov = niov;
	153	qiov->nalloc = -1;
	154	qiov->size = 0;
	155	for (i = 0; i < niov; i++)
	156	qiov->size += iov[i].iov_len;
	157	}
	158
44e3ee8a AL	159	void qemu_iovec_add(QEMUIOVector qiov, void base, size_t len)
44e3ee8a AL	160	{
522584a5 AL	161	assert(qiov->nalloc != -1);
522584a5 AL	162
44e3ee8a AL	163	if (qiov->niov == qiov->nalloc) {
44e3ee8a AL	164	qiov->nalloc = 2 * qiov->nalloc + 1;
7267c094	165	qiov->iov = g_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec));
44e3ee8a AL	166	}
	167	qiov->iov[qiov->niov].iov_base = base;
	168	qiov->iov[qiov->niov].iov_len = len;
249aa745	169	qiov->size += len;
44e3ee8a AL	170	++qiov->niov;
	171	}
	172
40b4f539	173	/*
b8a83a4f KW	174	* Copies iovecs from src to the end of dst. It starts copying after skipping
	175	* the given number of bytes in src and copies until src is completely copied
	176	* or the total size of the copied iovec reaches size.The size of the last
	177	* copied iovec is changed in order to fit the specified total size if it isn't
	178	* a perfect fit already.
40b4f539	179	*/
b8a83a4f KW	180	void qemu_iovec_copy(QEMUIOVector dst, QEMUIOVector src, uint64_t skip,
b8a83a4f KW	181	size_t size)
40b4f539 KW	182	{
	183	int i;
	184	size_t done;
b8a83a4f KW	185	void *iov_base;
b8a83a4f KW	186	uint64_t iov_len;
40b4f539 KW	187
	188	assert(dst->nalloc != -1);
	189
	190	done = 0;
	191	for (i = 0; (i < src->niov) && (done != size); i++) {
b8a83a4f KW	192	if (skip >= src->iov[i].iov_len) {
	193	/* Skip the whole iov */
	194	skip -= src->iov[i].iov_len;
	195	continue;
	196	} else {
	197	/* Skip only part (or nothing) of the iov */
	198	iov_base = (uint8_t*) src->iov[i].iov_base + skip;
	199	iov_len = src->iov[i].iov_len - skip;
	200	skip = 0;
	201	}
	202
	203	if (done + iov_len > size) {
	204	qemu_iovec_add(dst, iov_base, size - done);
40b4f539 KW	205	break;
40b4f539 KW	206	} else {
b8a83a4f	207	qemu_iovec_add(dst, iov_base, iov_len);
40b4f539	208	}
b8a83a4f	209	done += iov_len;
40b4f539 KW	210	}
	211	}
	212
b8a83a4f KW	213	void qemu_iovec_concat(QEMUIOVector dst, QEMUIOVector src, size_t size)
	214	{
	215	qemu_iovec_copy(dst, src, 0, size);
	216	}
	217
44e3ee8a AL	218	void qemu_iovec_destroy(QEMUIOVector *qiov)
44e3ee8a AL	219	{
522584a5 AL	220	assert(qiov->nalloc != -1);
522584a5 AL	221
bd83b362	222	qemu_iovec_reset(qiov);
7267c094	223	g_free(qiov->iov);
bd83b362 PB	224	qiov->nalloc = 0;
bd83b362 PB	225	qiov->iov = NULL;
44e3ee8a AL	226	}
44e3ee8a AL	227
be959463 AL	228	void qemu_iovec_reset(QEMUIOVector *qiov)
be959463 AL	229	{
522584a5 AL	230	assert(qiov->nalloc != -1);
522584a5 AL	231
be959463 AL	232	qiov->niov = 0;
	233	qiov->size = 0;
	234	}
	235
44e3ee8a AL	236	void qemu_iovec_to_buffer(QEMUIOVector qiov, void buf)
	237	{
	238	uint8_t p = (uint8_t )buf;
	239	int i;
	240
	241	for (i = 0; i < qiov->niov; ++i) {
	242	memcpy(p, qiov->iov[i].iov_base, qiov->iov[i].iov_len);
	243	p += qiov->iov[i].iov_len;
	244	}
	245	}
	246
249aa745	247	void qemu_iovec_from_buffer(QEMUIOVector qiov, const void buf, size_t count)
44e3ee8a AL	248	{
44e3ee8a AL	249	const uint8_t p = (const uint8_t )buf;
249aa745	250	size_t copy;
44e3ee8a AL	251	int i;
44e3ee8a AL	252
249aa745 AL	253	for (i = 0; i < qiov->niov && count; ++i) {
	254	copy = count;
	255	if (copy > qiov->iov[i].iov_len)
	256	copy = qiov->iov[i].iov_len;
	257	memcpy(qiov->iov[i].iov_base, p, copy);
	258	p += copy;
	259	count -= copy;
44e3ee8a AL	260	}
44e3ee8a AL	261	}
db1a4972	262
b8a83a4f KW	263	void qemu_iovec_memset(QEMUIOVector *qiov, int c, size_t count)
	264	{
	265	size_t n;
	266	int i;
	267
	268	for (i = 0; i < qiov->niov && count; ++i) {
	269	n = MIN(count, qiov->iov[i].iov_len);
	270	memset(qiov->iov[i].iov_base, c, n);
	271	count -= n;
	272	}
	273	}
	274
e0d9c6f9 CT	275	void qemu_iovec_memset_skip(QEMUIOVector *qiov, int c, size_t count,
	276	size_t skip)
	277	{
	278	int i;
	279	size_t done;
	280	void *iov_base;
	281	uint64_t iov_len;
	282
	283	done = 0;
	284	for (i = 0; (i < qiov->niov) && (done != count); i++) {
	285	if (skip >= qiov->iov[i].iov_len) {
	286	/* Skip the whole iov */
	287	skip -= qiov->iov[i].iov_len;
	288	continue;
	289	} else {
	290	/* Skip only part (or nothing) of the iov */
	291	iov_base = (uint8_t*) qiov->iov[i].iov_base + skip;
	292	iov_len = qiov->iov[i].iov_len - skip;
	293	skip = 0;
	294	}
	295
	296	if (done + iov_len > count) {
	297	memset(iov_base, c, count - done);
	298	break;
	299	} else {
	300	memset(iov_base, c, iov_len);
	301	}
	302	done += iov_len;
	303	}
	304	}
	305
db1a4972 PB	306	#ifndef _WIN32
	307	/* Sets a specific flag */
	308	int fcntl_setfl(int fd, int flag)
	309	{
	310	int flags;
	311
	312	flags = fcntl(fd, F_GETFL);
	313	if (flags == -1)
	314	return -errno;
	315
	316	if (fcntl(fd, F_SETFL, flags \| flag) == -1)
	317	return -errno;
	318
	319	return 0;
	320	}
	321	#endif
	322
eba90e4e MA	323	static int64_t suffix_mul(char suffix, int64_t unit)
	324	{
	325	switch (qemu_toupper(suffix)) {
	326	case STRTOSZ_DEFSUFFIX_B:
	327	return 1;
	328	case STRTOSZ_DEFSUFFIX_KB:
	329	return unit;
	330	case STRTOSZ_DEFSUFFIX_MB:
	331	return unit * unit;
	332	case STRTOSZ_DEFSUFFIX_GB:
	333	return unit * unit * unit;
	334	case STRTOSZ_DEFSUFFIX_TB:
	335	return unit * unit * unit * unit;
	336	}
	337	return -1;
	338	}
	339
9f9b17a4 JS	340	/*
9f9b17a4 JS	341	* Convert string to bytes, allowing either B/b for bytes, K/k for KB,
8dddfb55	342	* M/m for MB, G/g for GB or T/t for TB. End pointer will be returned
eba90e4e	343	* in *end, if not NULL. Return -1 on error.
9f9b17a4	344	*/
a732e1ba JR	345	int64_t strtosz_suffix_unit(const char nptr, char *end,
a732e1ba JR	346	const char default_suffix, int64_t unit)
9f9b17a4	347	{
70b4f4bb	348	int64_t retval = -1;
f3bd362a	349	char *endptr;
eba90e4e	350	unsigned char c;
9f9b17a4 JS	351	int mul_required = 0;
	352	double val, mul, integral, fraction;
	353
	354	errno = 0;
	355	val = strtod(nptr, &endptr);
	356	if (isnan(val) \|\| endptr == nptr \|\| errno != 0) {
	357	goto fail;
	358	}
7eb05349 JS	359	fraction = modf(val, &integral);
7eb05349 JS	360	if (fraction != 0) {
9f9b17a4 JS	361	mul_required = 1;
9f9b17a4 JS	362	}
9f9b17a4	363	c = *endptr;
eba90e4e MA	364	mul = suffix_mul(c, unit);
	365	if (mul >= 0) {
	366	endptr++;
	367	} else {
	368	mul = suffix_mul(default_suffix, unit);
	369	assert(mul >= 0);
9f9b17a4	370	}
eba90e4e	371	if (mul == 1 && mul_required) {
9f9b17a4 JS	372	goto fail;
9f9b17a4 JS	373	}
70b4f4bb	374	if ((val * mul >= INT64_MAX) \|\| val < 0) {
9f9b17a4 JS	375	goto fail;
	376	}
	377	retval = val * mul;
	378
	379	fail:
	380	if (end) {
	381	*end = endptr;
	382	}
	383
	384	return retval;
	385	}
d8427002	386
a732e1ba JR	387	int64_t strtosz_suffix(const char nptr, char *end, const char default_suffix)
a732e1ba JR	388	{
fdc9c41a	389	return strtosz_suffix_unit(nptr, end, default_suffix, 1024);
a732e1ba JR	390	}
a732e1ba JR	391
70b4f4bb	392	int64_t strtosz(const char nptr, char *end)
d8427002 JS	393	{
	394	return strtosz_suffix(nptr, end, STRTOSZ_DEFSUFFIX_MB);
	395	}
443916d1 SB	396
	397	int qemu_parse_fd(const char *param)
	398	{
	399	int fd;
	400	char *endptr = NULL;
	401
	402	fd = strtol(param, &endptr, 10);
	403	if (*endptr \|\| (fd == 0 && param == endptr)) {
	404	return -1;
	405	}
	406	return fd;
	407	}
8c5135f9 PB	408
	409	/*
	410	* Send/recv data with iovec buffers
	411	*
	412	* This function send/recv data from/to the iovec buffer directly.
	413	* The first `offset' bytes in the iovec buffer are skipped and next
	414	* `len' bytes are used.
	415	*
	416	* For example,
	417	*
	418	* do_sendv_recvv(sockfd, iov, len, offset, 1);
	419	*
	420	* is equal to
	421	*
	422	* char *buf = malloc(size);
	423	* iov_to_buf(iov, iovcnt, buf, offset, size);
	424	* send(sockfd, buf, size, 0);
	425	* free(buf);
	426	*/
	427	static int do_sendv_recvv(int sockfd, struct iovec *iov, int len, int offset,
	428	int do_sendv)
	429	{
	430	int ret, diff, iovlen;
	431	struct iovec *last_iov;
	432
	433	/* last_iov is inclusive, so count from one. */
	434	iovlen = 1;
	435	last_iov = iov;
	436	len += offset;
	437
	438	while (last_iov->iov_len < len) {
	439	len -= last_iov->iov_len;
	440
	441	last_iov++;
	442	iovlen++;
	443	}
	444
	445	diff = last_iov->iov_len - len;
	446	last_iov->iov_len -= diff;
	447
	448	while (iov->iov_len <= offset) {
	449	offset -= iov->iov_len;
	450
	451	iov++;
	452	iovlen--;
	453	}
	454
	455	iov->iov_base = (char *) iov->iov_base + offset;
	456	iov->iov_len -= offset;
	457
	458	{
	459	#if defined CONFIG_IOVEC && defined CONFIG_POSIX
	460	struct msghdr msg;
	461	memset(&msg, 0, sizeof(msg));
	462	msg.msg_iov = iov;
	463	msg.msg_iovlen = iovlen;
	464
	465	do {
	466	if (do_sendv) {
	467	ret = sendmsg(sockfd, &msg, 0);
	468	} else {
	469	ret = recvmsg(sockfd, &msg, 0);
	470	}
	471	} while (ret == -1 && errno == EINTR);
472	#else
473	struct iovec *p = iov;
474	ret = 0;
475	while (iovlen > 0) {
476	int rc;
477	if (do_sendv) {
478	rc = send(sockfd, p->iov_base, p->iov_len, 0);
479	} else {
480	rc = qemu_recv(sockfd, p->iov_base, p->iov_len, 0);
481	}
482	if (rc == -1) {
483	if (errno == EINTR) {
484	continue;
485	}
486	if (ret == 0) {
487	ret = -1;
488	}
489	break;
490	}
491	if (rc == 0) {
492	break;
493	}
494	ret += rc;
495	iovlen--, p++;
496	}
497	#endif
498	}
499
500	/* Undo the changes above */
501	iov->iov_base = (char *) iov->iov_base - offset;
502	iov->iov_len += offset;
503	last_iov->iov_len += diff;
504	return ret;
505	}
506
507	int qemu_recvv(int sockfd, struct iovec *iov, int len, int iov_offset)
508	{
509	return do_sendv_recvv(sockfd, iov, len, iov_offset, 0);
510	}
511
512	int qemu_sendv(int sockfd, struct iovec *iov, int len, int iov_offset)
513	{
514	return do_sendv_recvv(sockfd, iov, len, iov_offset, 1);
515	}
516