root / cutils.c @ c08ba66f
History | View | Annotate | Download (10 kB)
1 | 18607dcb | bellard | /*
|
---|---|---|---|
2 | 18607dcb | bellard | * Simple C functions to supplement the C library
|
3 | 5fafdf24 | ths | *
|
4 | 18607dcb | bellard | * Copyright (c) 2006 Fabrice Bellard
|
5 | 18607dcb | bellard | *
|
6 | 18607dcb | bellard | * Permission is hereby granted, free of charge, to any person obtaining a copy
|
7 | 18607dcb | bellard | * of this software and associated documentation files (the "Software"), to deal
|
8 | 18607dcb | bellard | * in the Software without restriction, including without limitation the rights
|
9 | 18607dcb | bellard | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
10 | 18607dcb | bellard | * copies of the Software, and to permit persons to whom the Software is
|
11 | 18607dcb | bellard | * furnished to do so, subject to the following conditions:
|
12 | 18607dcb | bellard | *
|
13 | 18607dcb | bellard | * The above copyright notice and this permission notice shall be included in
|
14 | 18607dcb | bellard | * all copies or substantial portions of the Software.
|
15 | 18607dcb | bellard | *
|
16 | 18607dcb | bellard | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
17 | 18607dcb | bellard | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
18 | 18607dcb | bellard | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
19 | 18607dcb | bellard | * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
20 | 18607dcb | bellard | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
21 | 18607dcb | bellard | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
22 | 18607dcb | bellard | * THE SOFTWARE.
|
23 | 18607dcb | bellard | */
|
24 | faf07963 | pbrook | #include "qemu-common.h" |
25 | 8d371d4b | aliguori | #include "host-utils.h" |
26 | 9f9b17a4 | Jes Sorensen | #include <math.h> |
27 | 18607dcb | bellard | |
28 | 8c5135f9 | Paolo Bonzini | #include "qemu_socket.h" |
29 | 3d9b4925 | Michael Tokarev | #include "iov.h" |
30 | 8c5135f9 | Paolo Bonzini | |
31 | 2a025ae4 | Dmitry Fleytman | void strpadcpy(char *buf, int buf_size, const char *str, char pad) |
32 | 2a025ae4 | Dmitry Fleytman | { |
33 | 2a025ae4 | Dmitry Fleytman | int len = qemu_strnlen(str, buf_size);
|
34 | 2a025ae4 | Dmitry Fleytman | memcpy(buf, str, len); |
35 | 2a025ae4 | Dmitry Fleytman | memset(buf + len, pad, buf_size - len); |
36 | 2a025ae4 | Dmitry Fleytman | } |
37 | 2a025ae4 | Dmitry Fleytman | |
38 | 18607dcb | bellard | void pstrcpy(char *buf, int buf_size, const char *str) |
39 | 18607dcb | bellard | { |
40 | 18607dcb | bellard | int c;
|
41 | 18607dcb | bellard | char *q = buf;
|
42 | 18607dcb | bellard | |
43 | 18607dcb | bellard | if (buf_size <= 0) |
44 | 18607dcb | bellard | return;
|
45 | 18607dcb | bellard | |
46 | 18607dcb | bellard | for(;;) {
|
47 | 18607dcb | bellard | c = *str++; |
48 | 18607dcb | bellard | if (c == 0 || q >= buf + buf_size - 1) |
49 | 18607dcb | bellard | break;
|
50 | 18607dcb | bellard | *q++ = c; |
51 | 18607dcb | bellard | } |
52 | 18607dcb | bellard | *q = '\0';
|
53 | 18607dcb | bellard | } |
54 | 18607dcb | bellard | |
55 | 18607dcb | bellard | /* strcat and truncate. */
|
56 | 18607dcb | bellard | char *pstrcat(char *buf, int buf_size, const char *s) |
57 | 18607dcb | bellard | { |
58 | 18607dcb | bellard | int len;
|
59 | 18607dcb | bellard | len = strlen(buf); |
60 | 5fafdf24 | ths | if (len < buf_size)
|
61 | 18607dcb | bellard | pstrcpy(buf + len, buf_size - len, s); |
62 | 18607dcb | bellard | return buf;
|
63 | 18607dcb | bellard | } |
64 | 18607dcb | bellard | |
65 | 18607dcb | bellard | int strstart(const char *str, const char *val, const char **ptr) |
66 | 18607dcb | bellard | { |
67 | 18607dcb | bellard | const char *p, *q; |
68 | 18607dcb | bellard | p = str; |
69 | 18607dcb | bellard | q = val; |
70 | 18607dcb | bellard | while (*q != '\0') { |
71 | 18607dcb | bellard | if (*p != *q)
|
72 | 18607dcb | bellard | return 0; |
73 | 18607dcb | bellard | p++; |
74 | 18607dcb | bellard | q++; |
75 | 18607dcb | bellard | } |
76 | 18607dcb | bellard | if (ptr)
|
77 | 18607dcb | bellard | *ptr = p; |
78 | 18607dcb | bellard | return 1; |
79 | 18607dcb | bellard | } |
80 | 18607dcb | bellard | |
81 | 18607dcb | bellard | int stristart(const char *str, const char *val, const char **ptr) |
82 | 18607dcb | bellard | { |
83 | 18607dcb | bellard | const char *p, *q; |
84 | 18607dcb | bellard | p = str; |
85 | 18607dcb | bellard | q = val; |
86 | 18607dcb | bellard | while (*q != '\0') { |
87 | cd390083 | blueswir1 | if (qemu_toupper(*p) != qemu_toupper(*q))
|
88 | 18607dcb | bellard | return 0; |
89 | 18607dcb | bellard | p++; |
90 | 18607dcb | bellard | q++; |
91 | 18607dcb | bellard | } |
92 | 18607dcb | bellard | if (ptr)
|
93 | 18607dcb | bellard | *ptr = p; |
94 | 18607dcb | bellard | return 1; |
95 | 18607dcb | bellard | } |
96 | 3c6b2088 | bellard | |
97 | d43277c5 | Blue Swirl | /* XXX: use host strnlen if available ? */
|
98 | d43277c5 | Blue Swirl | int qemu_strnlen(const char *s, int max_len) |
99 | d43277c5 | Blue Swirl | { |
100 | d43277c5 | Blue Swirl | int i;
|
101 | d43277c5 | Blue Swirl | |
102 | d43277c5 | Blue Swirl | for(i = 0; i < max_len; i++) { |
103 | d43277c5 | Blue Swirl | if (s[i] == '\0') { |
104 | d43277c5 | Blue Swirl | break;
|
105 | d43277c5 | Blue Swirl | } |
106 | d43277c5 | Blue Swirl | } |
107 | d43277c5 | Blue Swirl | return i;
|
108 | d43277c5 | Blue Swirl | } |
109 | d43277c5 | Blue Swirl | |
110 | 3c6b2088 | bellard | time_t mktimegm(struct tm *tm)
|
111 | 3c6b2088 | bellard | { |
112 | 3c6b2088 | bellard | time_t t; |
113 | 3c6b2088 | bellard | int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday; |
114 | 3c6b2088 | bellard | if (m < 3) { |
115 | 3c6b2088 | bellard | m += 12;
|
116 | 3c6b2088 | bellard | y--; |
117 | 3c6b2088 | bellard | } |
118 | 3c6b2088 | bellard | t = 86400 * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 + |
119 | 3c6b2088 | bellard | y / 400 - 719469); |
120 | 3c6b2088 | bellard | t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec; |
121 | 3c6b2088 | bellard | return t;
|
122 | 3c6b2088 | bellard | } |
123 | b39ade83 | aliguori | |
124 | ad46db9a | blueswir1 | int qemu_fls(int i) |
125 | b39ade83 | aliguori | { |
126 | 8d371d4b | aliguori | return 32 - clz32(i); |
127 | b39ade83 | aliguori | } |
128 | 44e3ee8a | aliguori | |
129 | 6f1953c4 | Christoph Hellwig | /*
|
130 | 6f1953c4 | Christoph Hellwig | * Make sure data goes on disk, but if possible do not bother to
|
131 | 6f1953c4 | Christoph Hellwig | * write out the inode just for timestamp updates.
|
132 | 6f1953c4 | Christoph Hellwig | *
|
133 | 6f1953c4 | Christoph Hellwig | * Unfortunately even in 2009 many operating systems do not support
|
134 | 6f1953c4 | Christoph Hellwig | * fdatasync and have to fall back to fsync.
|
135 | 6f1953c4 | Christoph Hellwig | */
|
136 | 6f1953c4 | Christoph Hellwig | int qemu_fdatasync(int fd) |
137 | 6f1953c4 | Christoph Hellwig | { |
138 | 5f6b9e8f | Blue Swirl | #ifdef CONFIG_FDATASYNC
|
139 | 6f1953c4 | Christoph Hellwig | return fdatasync(fd);
|
140 | 6f1953c4 | Christoph Hellwig | #else
|
141 | 6f1953c4 | Christoph Hellwig | return fsync(fd);
|
142 | 6f1953c4 | Christoph Hellwig | #endif
|
143 | 6f1953c4 | Christoph Hellwig | } |
144 | 6f1953c4 | Christoph Hellwig | |
145 | 44e3ee8a | aliguori | /* io vectors */
|
146 | 44e3ee8a | aliguori | |
147 | 44e3ee8a | aliguori | void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint) |
148 | 44e3ee8a | aliguori | { |
149 | 7267c094 | Anthony Liguori | qiov->iov = g_malloc(alloc_hint * sizeof(struct iovec)); |
150 | 44e3ee8a | aliguori | qiov->niov = 0;
|
151 | 44e3ee8a | aliguori | qiov->nalloc = alloc_hint; |
152 | 249aa745 | aliguori | qiov->size = 0;
|
153 | 44e3ee8a | aliguori | } |
154 | 44e3ee8a | aliguori | |
155 | 522584a5 | aliguori | void qemu_iovec_init_external(QEMUIOVector *qiov, struct iovec *iov, int niov) |
156 | 522584a5 | aliguori | { |
157 | 522584a5 | aliguori | int i;
|
158 | 522584a5 | aliguori | |
159 | 522584a5 | aliguori | qiov->iov = iov; |
160 | 522584a5 | aliguori | qiov->niov = niov; |
161 | 522584a5 | aliguori | qiov->nalloc = -1;
|
162 | 522584a5 | aliguori | qiov->size = 0;
|
163 | 522584a5 | aliguori | for (i = 0; i < niov; i++) |
164 | 522584a5 | aliguori | qiov->size += iov[i].iov_len; |
165 | 522584a5 | aliguori | } |
166 | 522584a5 | aliguori | |
167 | 44e3ee8a | aliguori | void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len) |
168 | 44e3ee8a | aliguori | { |
169 | 522584a5 | aliguori | assert(qiov->nalloc != -1);
|
170 | 522584a5 | aliguori | |
171 | 44e3ee8a | aliguori | if (qiov->niov == qiov->nalloc) {
|
172 | 44e3ee8a | aliguori | qiov->nalloc = 2 * qiov->nalloc + 1; |
173 | 7267c094 | Anthony Liguori | qiov->iov = g_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec)); |
174 | 44e3ee8a | aliguori | } |
175 | 44e3ee8a | aliguori | qiov->iov[qiov->niov].iov_base = base; |
176 | 44e3ee8a | aliguori | qiov->iov[qiov->niov].iov_len = len; |
177 | 249aa745 | aliguori | qiov->size += len; |
178 | 44e3ee8a | aliguori | ++qiov->niov; |
179 | 44e3ee8a | aliguori | } |
180 | 44e3ee8a | aliguori | |
181 | 40b4f539 | Kevin Wolf | /*
|
182 | 1b093c48 | Michael Tokarev | * Concatenates (partial) iovecs from src to the end of dst.
|
183 | 1b093c48 | Michael Tokarev | * It starts copying after skipping `soffset' bytes at the
|
184 | 1b093c48 | Michael Tokarev | * beginning of src and adds individual vectors from src to
|
185 | 1b093c48 | Michael Tokarev | * dst copies up to `sbytes' bytes total, or up to the end
|
186 | 1b093c48 | Michael Tokarev | * of src if it comes first. This way, it is okay to specify
|
187 | 1b093c48 | Michael Tokarev | * very large value for `sbytes' to indicate "up to the end
|
188 | 1b093c48 | Michael Tokarev | * of src".
|
189 | 1b093c48 | Michael Tokarev | * Only vector pointers are processed, not the actual data buffers.
|
190 | 40b4f539 | Kevin Wolf | */
|
191 | 1b093c48 | Michael Tokarev | void qemu_iovec_concat(QEMUIOVector *dst,
|
192 | 1b093c48 | Michael Tokarev | QEMUIOVector *src, size_t soffset, size_t sbytes) |
193 | 40b4f539 | Kevin Wolf | { |
194 | 40b4f539 | Kevin Wolf | int i;
|
195 | 40b4f539 | Kevin Wolf | size_t done; |
196 | 1b093c48 | Michael Tokarev | struct iovec *siov = src->iov;
|
197 | 40b4f539 | Kevin Wolf | assert(dst->nalloc != -1);
|
198 | 1b093c48 | Michael Tokarev | assert(src->size >= soffset); |
199 | 1b093c48 | Michael Tokarev | for (i = 0, done = 0; done < sbytes && i < src->niov; i++) { |
200 | 1b093c48 | Michael Tokarev | if (soffset < siov[i].iov_len) {
|
201 | 1b093c48 | Michael Tokarev | size_t len = MIN(siov[i].iov_len - soffset, sbytes - done); |
202 | 1b093c48 | Michael Tokarev | qemu_iovec_add(dst, siov[i].iov_base + soffset, len); |
203 | 1b093c48 | Michael Tokarev | done += len; |
204 | 1b093c48 | Michael Tokarev | soffset = 0;
|
205 | b8a83a4f | Kevin Wolf | } else {
|
206 | 1b093c48 | Michael Tokarev | soffset -= siov[i].iov_len; |
207 | b8a83a4f | Kevin Wolf | } |
208 | 40b4f539 | Kevin Wolf | } |
209 | 1b093c48 | Michael Tokarev | /* return done; */
|
210 | b8a83a4f | Kevin Wolf | } |
211 | b8a83a4f | Kevin Wolf | |
212 | 44e3ee8a | aliguori | void qemu_iovec_destroy(QEMUIOVector *qiov)
|
213 | 44e3ee8a | aliguori | { |
214 | 522584a5 | aliguori | assert(qiov->nalloc != -1);
|
215 | 522584a5 | aliguori | |
216 | bd83b362 | Paolo Bonzini | qemu_iovec_reset(qiov); |
217 | 7267c094 | Anthony Liguori | g_free(qiov->iov); |
218 | bd83b362 | Paolo Bonzini | qiov->nalloc = 0;
|
219 | bd83b362 | Paolo Bonzini | qiov->iov = NULL;
|
220 | 44e3ee8a | aliguori | } |
221 | 44e3ee8a | aliguori | |
222 | be959463 | aliguori | void qemu_iovec_reset(QEMUIOVector *qiov)
|
223 | be959463 | aliguori | { |
224 | 522584a5 | aliguori | assert(qiov->nalloc != -1);
|
225 | 522584a5 | aliguori | |
226 | be959463 | aliguori | qiov->niov = 0;
|
227 | be959463 | aliguori | qiov->size = 0;
|
228 | be959463 | aliguori | } |
229 | be959463 | aliguori | |
230 | d5e6b161 | Michael Tokarev | size_t qemu_iovec_to_buf(QEMUIOVector *qiov, size_t offset, |
231 | d5e6b161 | Michael Tokarev | void *buf, size_t bytes)
|
232 | 44e3ee8a | aliguori | { |
233 | d5e6b161 | Michael Tokarev | return iov_to_buf(qiov->iov, qiov->niov, offset, buf, bytes);
|
234 | 44e3ee8a | aliguori | } |
235 | 44e3ee8a | aliguori | |
236 | 03396148 | Michael Tokarev | size_t qemu_iovec_from_buf(QEMUIOVector *qiov, size_t offset, |
237 | 03396148 | Michael Tokarev | const void *buf, size_t bytes) |
238 | 44e3ee8a | aliguori | { |
239 | 03396148 | Michael Tokarev | return iov_from_buf(qiov->iov, qiov->niov, offset, buf, bytes);
|
240 | 44e3ee8a | aliguori | } |
241 | db1a4972 | Paolo Bonzini | |
242 | 3d9b4925 | Michael Tokarev | size_t qemu_iovec_memset(QEMUIOVector *qiov, size_t offset, |
243 | 3d9b4925 | Michael Tokarev | int fillc, size_t bytes)
|
244 | b8a83a4f | Kevin Wolf | { |
245 | 3d9b4925 | Michael Tokarev | return iov_memset(qiov->iov, qiov->niov, offset, fillc, bytes);
|
246 | e0d9c6f9 | Chunqiang Tang | } |
247 | e0d9c6f9 | Chunqiang Tang | |
248 | 1a6d39fd | Stefan Hajnoczi | /*
|
249 | 1a6d39fd | Stefan Hajnoczi | * Checks if a buffer is all zeroes
|
250 | 1a6d39fd | Stefan Hajnoczi | *
|
251 | 1a6d39fd | Stefan Hajnoczi | * Attention! The len must be a multiple of 4 * sizeof(long) due to
|
252 | 1a6d39fd | Stefan Hajnoczi | * restriction of optimizations in this function.
|
253 | 1a6d39fd | Stefan Hajnoczi | */
|
254 | 1a6d39fd | Stefan Hajnoczi | bool buffer_is_zero(const void *buf, size_t len) |
255 | 1a6d39fd | Stefan Hajnoczi | { |
256 | 1a6d39fd | Stefan Hajnoczi | /*
|
257 | 1a6d39fd | Stefan Hajnoczi | * Use long as the biggest available internal data type that fits into the
|
258 | 1a6d39fd | Stefan Hajnoczi | * CPU register and unroll the loop to smooth out the effect of memory
|
259 | 1a6d39fd | Stefan Hajnoczi | * latency.
|
260 | 1a6d39fd | Stefan Hajnoczi | */
|
261 | 1a6d39fd | Stefan Hajnoczi | |
262 | 1a6d39fd | Stefan Hajnoczi | size_t i; |
263 | 1a6d39fd | Stefan Hajnoczi | long d0, d1, d2, d3;
|
264 | 1a6d39fd | Stefan Hajnoczi | const long * const data = buf; |
265 | 1a6d39fd | Stefan Hajnoczi | |
266 | 1a6d39fd | Stefan Hajnoczi | assert(len % (4 * sizeof(long)) == 0); |
267 | 1a6d39fd | Stefan Hajnoczi | len /= sizeof(long); |
268 | 1a6d39fd | Stefan Hajnoczi | |
269 | 1a6d39fd | Stefan Hajnoczi | for (i = 0; i < len; i += 4) { |
270 | 1a6d39fd | Stefan Hajnoczi | d0 = data[i + 0];
|
271 | 1a6d39fd | Stefan Hajnoczi | d1 = data[i + 1];
|
272 | 1a6d39fd | Stefan Hajnoczi | d2 = data[i + 2];
|
273 | 1a6d39fd | Stefan Hajnoczi | d3 = data[i + 3];
|
274 | 1a6d39fd | Stefan Hajnoczi | |
275 | 1a6d39fd | Stefan Hajnoczi | if (d0 || d1 || d2 || d3) {
|
276 | 1a6d39fd | Stefan Hajnoczi | return false; |
277 | 1a6d39fd | Stefan Hajnoczi | } |
278 | 1a6d39fd | Stefan Hajnoczi | } |
279 | 1a6d39fd | Stefan Hajnoczi | |
280 | 1a6d39fd | Stefan Hajnoczi | return true; |
281 | 1a6d39fd | Stefan Hajnoczi | } |
282 | 1a6d39fd | Stefan Hajnoczi | |
283 | db1a4972 | Paolo Bonzini | #ifndef _WIN32
|
284 | db1a4972 | Paolo Bonzini | /* Sets a specific flag */
|
285 | db1a4972 | Paolo Bonzini | int fcntl_setfl(int fd, int flag) |
286 | db1a4972 | Paolo Bonzini | { |
287 | db1a4972 | Paolo Bonzini | int flags;
|
288 | db1a4972 | Paolo Bonzini | |
289 | db1a4972 | Paolo Bonzini | flags = fcntl(fd, F_GETFL); |
290 | db1a4972 | Paolo Bonzini | if (flags == -1) |
291 | db1a4972 | Paolo Bonzini | return -errno;
|
292 | db1a4972 | Paolo Bonzini | |
293 | db1a4972 | Paolo Bonzini | if (fcntl(fd, F_SETFL, flags | flag) == -1) |
294 | db1a4972 | Paolo Bonzini | return -errno;
|
295 | db1a4972 | Paolo Bonzini | |
296 | db1a4972 | Paolo Bonzini | return 0; |
297 | db1a4972 | Paolo Bonzini | } |
298 | db1a4972 | Paolo Bonzini | #endif
|
299 | db1a4972 | Paolo Bonzini | |
300 | eba90e4e | Markus Armbruster | static int64_t suffix_mul(char suffix, int64_t unit) |
301 | eba90e4e | Markus Armbruster | { |
302 | eba90e4e | Markus Armbruster | switch (qemu_toupper(suffix)) {
|
303 | eba90e4e | Markus Armbruster | case STRTOSZ_DEFSUFFIX_B:
|
304 | eba90e4e | Markus Armbruster | return 1; |
305 | eba90e4e | Markus Armbruster | case STRTOSZ_DEFSUFFIX_KB:
|
306 | eba90e4e | Markus Armbruster | return unit;
|
307 | eba90e4e | Markus Armbruster | case STRTOSZ_DEFSUFFIX_MB:
|
308 | eba90e4e | Markus Armbruster | return unit * unit;
|
309 | eba90e4e | Markus Armbruster | case STRTOSZ_DEFSUFFIX_GB:
|
310 | eba90e4e | Markus Armbruster | return unit * unit * unit;
|
311 | eba90e4e | Markus Armbruster | case STRTOSZ_DEFSUFFIX_TB:
|
312 | eba90e4e | Markus Armbruster | return unit * unit * unit * unit;
|
313 | eba90e4e | Markus Armbruster | } |
314 | eba90e4e | Markus Armbruster | return -1; |
315 | eba90e4e | Markus Armbruster | } |
316 | eba90e4e | Markus Armbruster | |
317 | 9f9b17a4 | Jes Sorensen | /*
|
318 | 9f9b17a4 | Jes Sorensen | * Convert string to bytes, allowing either B/b for bytes, K/k for KB,
|
319 | 8dddfb55 | Markus Armbruster | * M/m for MB, G/g for GB or T/t for TB. End pointer will be returned
|
320 | eba90e4e | Markus Armbruster | * in *end, if not NULL. Return -1 on error.
|
321 | 9f9b17a4 | Jes Sorensen | */
|
322 | a732e1ba | Joerg Roedel | int64_t strtosz_suffix_unit(const char *nptr, char **end, |
323 | a732e1ba | Joerg Roedel | const char default_suffix, int64_t unit) |
324 | 9f9b17a4 | Jes Sorensen | { |
325 | 70b4f4bb | Jes Sorensen | int64_t retval = -1;
|
326 | f3bd362a | Jes Sorensen | char *endptr;
|
327 | eba90e4e | Markus Armbruster | unsigned char c; |
328 | 9f9b17a4 | Jes Sorensen | int mul_required = 0; |
329 | 9f9b17a4 | Jes Sorensen | double val, mul, integral, fraction;
|
330 | 9f9b17a4 | Jes Sorensen | |
331 | 9f9b17a4 | Jes Sorensen | errno = 0;
|
332 | 9f9b17a4 | Jes Sorensen | val = strtod(nptr, &endptr); |
333 | 9f9b17a4 | Jes Sorensen | if (isnan(val) || endptr == nptr || errno != 0) { |
334 | 9f9b17a4 | Jes Sorensen | goto fail;
|
335 | 9f9b17a4 | Jes Sorensen | } |
336 | 7eb05349 | Jes Sorensen | fraction = modf(val, &integral); |
337 | 7eb05349 | Jes Sorensen | if (fraction != 0) { |
338 | 9f9b17a4 | Jes Sorensen | mul_required = 1;
|
339 | 9f9b17a4 | Jes Sorensen | } |
340 | 9f9b17a4 | Jes Sorensen | c = *endptr; |
341 | eba90e4e | Markus Armbruster | mul = suffix_mul(c, unit); |
342 | eba90e4e | Markus Armbruster | if (mul >= 0) { |
343 | eba90e4e | Markus Armbruster | endptr++; |
344 | eba90e4e | Markus Armbruster | } else {
|
345 | eba90e4e | Markus Armbruster | mul = suffix_mul(default_suffix, unit); |
346 | eba90e4e | Markus Armbruster | assert(mul >= 0);
|
347 | 9f9b17a4 | Jes Sorensen | } |
348 | eba90e4e | Markus Armbruster | if (mul == 1 && mul_required) { |
349 | 9f9b17a4 | Jes Sorensen | goto fail;
|
350 | 9f9b17a4 | Jes Sorensen | } |
351 | 70b4f4bb | Jes Sorensen | if ((val * mul >= INT64_MAX) || val < 0) { |
352 | 9f9b17a4 | Jes Sorensen | goto fail;
|
353 | 9f9b17a4 | Jes Sorensen | } |
354 | 9f9b17a4 | Jes Sorensen | retval = val * mul; |
355 | 9f9b17a4 | Jes Sorensen | |
356 | 9f9b17a4 | Jes Sorensen | fail:
|
357 | 9f9b17a4 | Jes Sorensen | if (end) {
|
358 | 9f9b17a4 | Jes Sorensen | *end = endptr; |
359 | 9f9b17a4 | Jes Sorensen | } |
360 | 9f9b17a4 | Jes Sorensen | |
361 | 9f9b17a4 | Jes Sorensen | return retval;
|
362 | 9f9b17a4 | Jes Sorensen | } |
363 | d8427002 | Jes Sorensen | |
364 | a732e1ba | Joerg Roedel | int64_t strtosz_suffix(const char *nptr, char **end, const char default_suffix) |
365 | a732e1ba | Joerg Roedel | { |
366 | fdc9c41a | Jan Kiszka | return strtosz_suffix_unit(nptr, end, default_suffix, 1024); |
367 | a732e1ba | Joerg Roedel | } |
368 | a732e1ba | Joerg Roedel | |
369 | 70b4f4bb | Jes Sorensen | int64_t strtosz(const char *nptr, char **end) |
370 | d8427002 | Jes Sorensen | { |
371 | d8427002 | Jes Sorensen | return strtosz_suffix(nptr, end, STRTOSZ_DEFSUFFIX_MB);
|
372 | d8427002 | Jes Sorensen | } |
373 | 443916d1 | Stefan Berger | |
374 | 443916d1 | Stefan Berger | int qemu_parse_fd(const char *param) |
375 | 443916d1 | Stefan Berger | { |
376 | 443916d1 | Stefan Berger | int fd;
|
377 | 443916d1 | Stefan Berger | char *endptr = NULL; |
378 | 443916d1 | Stefan Berger | |
379 | 443916d1 | Stefan Berger | fd = strtol(param, &endptr, 10);
|
380 | 443916d1 | Stefan Berger | if (*endptr || (fd == 0 && param == endptr)) { |
381 | 443916d1 | Stefan Berger | return -1; |
382 | 443916d1 | Stefan Berger | } |
383 | 443916d1 | Stefan Berger | return fd;
|
384 | 443916d1 | Stefan Berger | } |
385 | 9fb26641 | Orit Wasserman | |
386 | adb696f3 | Corey Bryant | int qemu_parse_fdset(const char *param) |
387 | adb696f3 | Corey Bryant | { |
388 | adb696f3 | Corey Bryant | return qemu_parse_fd(param);
|
389 | adb696f3 | Corey Bryant | } |
390 | adb696f3 | Corey Bryant | |
391 | 9fb26641 | Orit Wasserman | /* round down to the nearest power of 2*/
|
392 | 9fb26641 | Orit Wasserman | int64_t pow2floor(int64_t value) |
393 | 9fb26641 | Orit Wasserman | { |
394 | 9fb26641 | Orit Wasserman | if (!is_power_of_2(value)) {
|
395 | 9fb26641 | Orit Wasserman | value = 0x8000000000000000ULL >> clz64(value);
|
396 | 9fb26641 | Orit Wasserman | } |
397 | 9fb26641 | Orit Wasserman | return value;
|
398 | 9fb26641 | Orit Wasserman | } |
399 | e6546bb9 | Orit Wasserman | |
400 | e6546bb9 | Orit Wasserman | /*
|
401 | e6546bb9 | Orit Wasserman | * Implementation of ULEB128 (http://en.wikipedia.org/wiki/LEB128)
|
402 | e6546bb9 | Orit Wasserman | * Input is limited to 14-bit numbers
|
403 | e6546bb9 | Orit Wasserman | */
|
404 | e6546bb9 | Orit Wasserman | int uleb128_encode_small(uint8_t *out, uint32_t n)
|
405 | e6546bb9 | Orit Wasserman | { |
406 | e6546bb9 | Orit Wasserman | g_assert(n <= 0x3fff);
|
407 | e6546bb9 | Orit Wasserman | if (n < 0x80) { |
408 | e6546bb9 | Orit Wasserman | *out++ = n; |
409 | e6546bb9 | Orit Wasserman | return 1; |
410 | e6546bb9 | Orit Wasserman | } else {
|
411 | e6546bb9 | Orit Wasserman | *out++ = (n & 0x7f) | 0x80; |
412 | e6546bb9 | Orit Wasserman | *out++ = n >> 7;
|
413 | e6546bb9 | Orit Wasserman | return 2; |
414 | e6546bb9 | Orit Wasserman | } |
415 | e6546bb9 | Orit Wasserman | } |
416 | e6546bb9 | Orit Wasserman | |
417 | e6546bb9 | Orit Wasserman | int uleb128_decode_small(const uint8_t *in, uint32_t *n) |
418 | e6546bb9 | Orit Wasserman | { |
419 | e6546bb9 | Orit Wasserman | if (!(*in & 0x80)) { |
420 | e6546bb9 | Orit Wasserman | *n = *in++; |
421 | e6546bb9 | Orit Wasserman | return 1; |
422 | e6546bb9 | Orit Wasserman | } else {
|
423 | e6546bb9 | Orit Wasserman | *n = *in++ & 0x7f;
|
424 | e6546bb9 | Orit Wasserman | /* we exceed 14 bit number */
|
425 | e6546bb9 | Orit Wasserman | if (*in & 0x80) { |
426 | e6546bb9 | Orit Wasserman | return -1; |
427 | e6546bb9 | Orit Wasserman | } |
428 | e6546bb9 | Orit Wasserman | *n |= *in++ << 7;
|
429 | e6546bb9 | Orit Wasserman | return 2; |
430 | e6546bb9 | Orit Wasserman | } |
431 | e6546bb9 | Orit Wasserman | } |