]> git.proxmox.com Git - qemu.git/blame - cutils.c
Fix typo
[qemu.git] / cutils.c
CommitLineData
18607dcb
FB
1/*
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"
18607dcb 26
707c0dbc
RP
27/*
28 * fill first 'len' characters of 'buff' with pruned
29 * contents of 'str' delimited by the character 'c'.
30 * Escape character '\' is pruned off.
31 * Return pointer to the delimiting character.
32 */
33const char *fill_token(char *buf, const int len, const char *str, const char c)
34{
35 const char *p=str;
36 char *q=buf;
37
38 while (p < str+len-1) {
39 if (*p == c)
40 break;
41 if (*p == '\\') {
42 p++;
43 if (*p == '\0')
44 break;
45 }
46 *q++ = *p++;
47 }
48 *q='\0';
49 return p;
50}
51
52
18607dcb
FB
53void pstrcpy(char *buf, int buf_size, const char *str)
54{
55 int c;
56 char *q = buf;
57
58 if (buf_size <= 0)
59 return;
60
61 for(;;) {
62 c = *str++;
63 if (c == 0 || q >= buf + buf_size - 1)
64 break;
65 *q++ = c;
66 }
67 *q = '\0';
68}
69
70/* strcat and truncate. */
71char *pstrcat(char *buf, int buf_size, const char *s)
72{
73 int len;
74 len = strlen(buf);
5fafdf24 75 if (len < buf_size)
18607dcb
FB
76 pstrcpy(buf + len, buf_size - len, s);
77 return buf;
78}
79
80int strstart(const char *str, const char *val, const char **ptr)
81{
82 const char *p, *q;
83 p = str;
84 q = val;
85 while (*q != '\0') {
86 if (*p != *q)
87 return 0;
88 p++;
89 q++;
90 }
91 if (ptr)
92 *ptr = p;
93 return 1;
94}
95
96int stristart(const char *str, const char *val, const char **ptr)
97{
98 const char *p, *q;
99 p = str;
100 q = val;
101 while (*q != '\0') {
cd390083 102 if (qemu_toupper(*p) != qemu_toupper(*q))
18607dcb
FB
103 return 0;
104 p++;
105 q++;
106 }
107 if (ptr)
108 *ptr = p;
109 return 1;
110}
3c6b2088
FB
111
112time_t mktimegm(struct tm *tm)
113{
114 time_t t;
115 int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday;
116 if (m < 3) {
117 m += 12;
118 y--;
119 }
120 t = 86400 * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 +
121 y / 400 - 719469);
122 t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec;
123 return t;
124}
b39ade83 125
ad46db9a 126int qemu_fls(int i)
b39ade83 127{
8d371d4b 128 return 32 - clz32(i);
b39ade83 129}
44e3ee8a
AL
130
131/* io vectors */
132
133void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint)
134{
135 qiov->iov = qemu_malloc(alloc_hint * sizeof(struct iovec));
136 qiov->niov = 0;
137 qiov->nalloc = alloc_hint;
249aa745 138 qiov->size = 0;
44e3ee8a
AL
139}
140
522584a5
AL
141void qemu_iovec_init_external(QEMUIOVector *qiov, struct iovec *iov, int niov)
142{
143 int i;
144
145 qiov->iov = iov;
146 qiov->niov = niov;
147 qiov->nalloc = -1;
148 qiov->size = 0;
149 for (i = 0; i < niov; i++)
150 qiov->size += iov[i].iov_len;
151}
152
44e3ee8a
AL
153void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len)
154{
522584a5
AL
155 assert(qiov->nalloc != -1);
156
44e3ee8a
AL
157 if (qiov->niov == qiov->nalloc) {
158 qiov->nalloc = 2 * qiov->nalloc + 1;
159 qiov->iov = qemu_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec));
160 }
161 qiov->iov[qiov->niov].iov_base = base;
162 qiov->iov[qiov->niov].iov_len = len;
249aa745 163 qiov->size += len;
44e3ee8a
AL
164 ++qiov->niov;
165}
166
167void qemu_iovec_destroy(QEMUIOVector *qiov)
168{
522584a5
AL
169 assert(qiov->nalloc != -1);
170
44e3ee8a
AL
171 qemu_free(qiov->iov);
172}
173
be959463
AL
174void qemu_iovec_reset(QEMUIOVector *qiov)
175{
522584a5
AL
176 assert(qiov->nalloc != -1);
177
be959463
AL
178 qiov->niov = 0;
179 qiov->size = 0;
180}
181
44e3ee8a
AL
182void qemu_iovec_to_buffer(QEMUIOVector *qiov, void *buf)
183{
184 uint8_t *p = (uint8_t *)buf;
185 int i;
186
187 for (i = 0; i < qiov->niov; ++i) {
188 memcpy(p, qiov->iov[i].iov_base, qiov->iov[i].iov_len);
189 p += qiov->iov[i].iov_len;
190 }
191}
192
249aa745 193void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count)
44e3ee8a
AL
194{
195 const uint8_t *p = (const uint8_t *)buf;
249aa745 196 size_t copy;
44e3ee8a
AL
197 int i;
198
249aa745
AL
199 for (i = 0; i < qiov->niov && count; ++i) {
200 copy = count;
201 if (copy > qiov->iov[i].iov_len)
202 copy = qiov->iov[i].iov_len;
203 memcpy(qiov->iov[i].iov_base, p, copy);
204 p += copy;
205 count -= copy;
44e3ee8a
AL
206 }
207}