blob: a1652ab0bc39bafcf0e9e9f71d90af65d237d426 [file] [log] [blame]
bellard18607dc2007-01-07 22:04:40 +00001/*
2 * Simple C functions to supplement the C library
ths5fafdf22007-09-16 21:08:06 +00003 *
bellard18607dc2007-01-07 22:04:40 +00004 * 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 */
pbrookfaf07962007-11-11 02:51:17 +000024#include "qemu-common.h"
aliguori8d371d42008-12-04 20:08:06 +000025#include "host-utils.h"
aliguori522584a2009-03-28 17:46:10 +000026#include <assert.h>
bellard18607dc2007-01-07 22:04:40 +000027
28void pstrcpy(char *buf, int buf_size, const char *str)
29{
30 int c;
31 char *q = buf;
32
33 if (buf_size <= 0)
34 return;
35
36 for(;;) {
37 c = *str++;
38 if (c == 0 || q >= buf + buf_size - 1)
39 break;
40 *q++ = c;
41 }
42 *q = '\0';
43}
44
45/* strcat and truncate. */
46char *pstrcat(char *buf, int buf_size, const char *s)
47{
48 int len;
49 len = strlen(buf);
ths5fafdf22007-09-16 21:08:06 +000050 if (len < buf_size)
bellard18607dc2007-01-07 22:04:40 +000051 pstrcpy(buf + len, buf_size - len, s);
52 return buf;
53}
54
55int strstart(const char *str, const char *val, const char **ptr)
56{
57 const char *p, *q;
58 p = str;
59 q = val;
60 while (*q != '\0') {
61 if (*p != *q)
62 return 0;
63 p++;
64 q++;
65 }
66 if (ptr)
67 *ptr = p;
68 return 1;
69}
70
71int stristart(const char *str, const char *val, const char **ptr)
72{
73 const char *p, *q;
74 p = str;
75 q = val;
76 while (*q != '\0') {
blueswir1cd390082008-11-16 13:53:32 +000077 if (qemu_toupper(*p) != qemu_toupper(*q))
bellard18607dc2007-01-07 22:04:40 +000078 return 0;
79 p++;
80 q++;
81 }
82 if (ptr)
83 *ptr = p;
84 return 1;
85}
bellard3c6b2082007-11-10 19:36:39 +000086
87time_t mktimegm(struct tm *tm)
88{
89 time_t t;
90 int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday;
91 if (m < 3) {
92 m += 12;
93 y--;
94 }
95 t = 86400 * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 +
96 y / 400 - 719469);
97 t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec;
98 return t;
99}
aliguorib39ade82008-12-04 19:19:45 +0000100
blueswir1ad46db92008-12-11 19:37:54 +0000101int qemu_fls(int i)
aliguorib39ade82008-12-04 19:19:45 +0000102{
aliguori8d371d42008-12-04 20:08:06 +0000103 return 32 - clz32(i);
aliguorib39ade82008-12-04 19:19:45 +0000104}
aliguori44e3ee82009-01-22 16:59:20 +0000105
106/* io vectors */
107
108void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint)
109{
110 qiov->iov = qemu_malloc(alloc_hint * sizeof(struct iovec));
111 qiov->niov = 0;
112 qiov->nalloc = alloc_hint;
aliguori249aa742009-01-26 17:17:52 +0000113 qiov->size = 0;
aliguori44e3ee82009-01-22 16:59:20 +0000114}
115
aliguori522584a2009-03-28 17:46:10 +0000116void qemu_iovec_init_external(QEMUIOVector *qiov, struct iovec *iov, int niov)
117{
118 int i;
119
120 qiov->iov = iov;
121 qiov->niov = niov;
122 qiov->nalloc = -1;
123 qiov->size = 0;
124 for (i = 0; i < niov; i++)
125 qiov->size += iov[i].iov_len;
126}
127
aliguori44e3ee82009-01-22 16:59:20 +0000128void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len)
129{
aliguori522584a2009-03-28 17:46:10 +0000130 assert(qiov->nalloc != -1);
131
aliguori44e3ee82009-01-22 16:59:20 +0000132 if (qiov->niov == qiov->nalloc) {
133 qiov->nalloc = 2 * qiov->nalloc + 1;
134 qiov->iov = qemu_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec));
135 }
136 qiov->iov[qiov->niov].iov_base = base;
137 qiov->iov[qiov->niov].iov_len = len;
aliguori249aa742009-01-26 17:17:52 +0000138 qiov->size += len;
aliguori44e3ee82009-01-22 16:59:20 +0000139 ++qiov->niov;
140}
141
142void qemu_iovec_destroy(QEMUIOVector *qiov)
143{
aliguori522584a2009-03-28 17:46:10 +0000144 assert(qiov->nalloc != -1);
145
aliguori44e3ee82009-01-22 16:59:20 +0000146 qemu_free(qiov->iov);
147}
148
aliguoribe959462009-02-05 21:23:54 +0000149void qemu_iovec_reset(QEMUIOVector *qiov)
150{
aliguori522584a2009-03-28 17:46:10 +0000151 assert(qiov->nalloc != -1);
152
aliguoribe959462009-02-05 21:23:54 +0000153 qiov->niov = 0;
154 qiov->size = 0;
155}
156
aliguori44e3ee82009-01-22 16:59:20 +0000157void qemu_iovec_to_buffer(QEMUIOVector *qiov, void *buf)
158{
159 uint8_t *p = (uint8_t *)buf;
160 int i;
161
162 for (i = 0; i < qiov->niov; ++i) {
163 memcpy(p, qiov->iov[i].iov_base, qiov->iov[i].iov_len);
164 p += qiov->iov[i].iov_len;
165 }
166}
167
aliguori249aa742009-01-26 17:17:52 +0000168void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count)
aliguori44e3ee82009-01-22 16:59:20 +0000169{
170 const uint8_t *p = (const uint8_t *)buf;
aliguori249aa742009-01-26 17:17:52 +0000171 size_t copy;
aliguori44e3ee82009-01-22 16:59:20 +0000172 int i;
173
aliguori249aa742009-01-26 17:17:52 +0000174 for (i = 0; i < qiov->niov && count; ++i) {
175 copy = count;
176 if (copy > qiov->iov[i].iov_len)
177 copy = qiov->iov[i].iov_len;
178 memcpy(qiov->iov[i].iov_base, p, copy);
179 p += copy;
180 count -= copy;
aliguori44e3ee82009-01-22 16:59:20 +0000181 }
182}