root / cutils.c @ d8bcbabf
History | View | Annotate | Download (5.6 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 | 18607dcb | bellard | |
27 | 18607dcb | bellard | void pstrcpy(char *buf, int buf_size, const char *str) |
28 | 18607dcb | bellard | { |
29 | 18607dcb | bellard | int c;
|
30 | 18607dcb | bellard | char *q = buf;
|
31 | 18607dcb | bellard | |
32 | 18607dcb | bellard | if (buf_size <= 0) |
33 | 18607dcb | bellard | return;
|
34 | 18607dcb | bellard | |
35 | 18607dcb | bellard | for(;;) {
|
36 | 18607dcb | bellard | c = *str++; |
37 | 18607dcb | bellard | if (c == 0 || q >= buf + buf_size - 1) |
38 | 18607dcb | bellard | break;
|
39 | 18607dcb | bellard | *q++ = c; |
40 | 18607dcb | bellard | } |
41 | 18607dcb | bellard | *q = '\0';
|
42 | 18607dcb | bellard | } |
43 | 18607dcb | bellard | |
44 | 18607dcb | bellard | /* strcat and truncate. */
|
45 | 18607dcb | bellard | char *pstrcat(char *buf, int buf_size, const char *s) |
46 | 18607dcb | bellard | { |
47 | 18607dcb | bellard | int len;
|
48 | 18607dcb | bellard | len = strlen(buf); |
49 | 5fafdf24 | ths | if (len < buf_size)
|
50 | 18607dcb | bellard | pstrcpy(buf + len, buf_size - len, s); |
51 | 18607dcb | bellard | return buf;
|
52 | 18607dcb | bellard | } |
53 | 18607dcb | bellard | |
54 | 18607dcb | bellard | int strstart(const char *str, const char *val, const char **ptr) |
55 | 18607dcb | bellard | { |
56 | 18607dcb | bellard | const char *p, *q; |
57 | 18607dcb | bellard | p = str; |
58 | 18607dcb | bellard | q = val; |
59 | 18607dcb | bellard | while (*q != '\0') { |
60 | 18607dcb | bellard | if (*p != *q)
|
61 | 18607dcb | bellard | return 0; |
62 | 18607dcb | bellard | p++; |
63 | 18607dcb | bellard | q++; |
64 | 18607dcb | bellard | } |
65 | 18607dcb | bellard | if (ptr)
|
66 | 18607dcb | bellard | *ptr = p; |
67 | 18607dcb | bellard | return 1; |
68 | 18607dcb | bellard | } |
69 | 18607dcb | bellard | |
70 | 18607dcb | bellard | int stristart(const char *str, const char *val, const char **ptr) |
71 | 18607dcb | bellard | { |
72 | 18607dcb | bellard | const char *p, *q; |
73 | 18607dcb | bellard | p = str; |
74 | 18607dcb | bellard | q = val; |
75 | 18607dcb | bellard | while (*q != '\0') { |
76 | cd390083 | blueswir1 | if (qemu_toupper(*p) != qemu_toupper(*q))
|
77 | 18607dcb | bellard | return 0; |
78 | 18607dcb | bellard | p++; |
79 | 18607dcb | bellard | q++; |
80 | 18607dcb | bellard | } |
81 | 18607dcb | bellard | if (ptr)
|
82 | 18607dcb | bellard | *ptr = p; |
83 | 18607dcb | bellard | return 1; |
84 | 18607dcb | bellard | } |
85 | 3c6b2088 | bellard | |
86 | d43277c5 | Blue Swirl | /* XXX: use host strnlen if available ? */
|
87 | d43277c5 | Blue Swirl | int qemu_strnlen(const char *s, int max_len) |
88 | d43277c5 | Blue Swirl | { |
89 | d43277c5 | Blue Swirl | int i;
|
90 | d43277c5 | Blue Swirl | |
91 | d43277c5 | Blue Swirl | for(i = 0; i < max_len; i++) { |
92 | d43277c5 | Blue Swirl | if (s[i] == '\0') { |
93 | d43277c5 | Blue Swirl | break;
|
94 | d43277c5 | Blue Swirl | } |
95 | d43277c5 | Blue Swirl | } |
96 | d43277c5 | Blue Swirl | return i;
|
97 | d43277c5 | Blue Swirl | } |
98 | d43277c5 | Blue Swirl | |
99 | 3c6b2088 | bellard | time_t mktimegm(struct tm *tm)
|
100 | 3c6b2088 | bellard | { |
101 | 3c6b2088 | bellard | time_t t; |
102 | 3c6b2088 | bellard | int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday; |
103 | 3c6b2088 | bellard | if (m < 3) { |
104 | 3c6b2088 | bellard | m += 12;
|
105 | 3c6b2088 | bellard | y--; |
106 | 3c6b2088 | bellard | } |
107 | 3c6b2088 | bellard | t = 86400 * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 + |
108 | 3c6b2088 | bellard | y / 400 - 719469); |
109 | 3c6b2088 | bellard | t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec; |
110 | 3c6b2088 | bellard | return t;
|
111 | 3c6b2088 | bellard | } |
112 | b39ade83 | aliguori | |
113 | ad46db9a | blueswir1 | int qemu_fls(int i) |
114 | b39ade83 | aliguori | { |
115 | 8d371d4b | aliguori | return 32 - clz32(i); |
116 | b39ade83 | aliguori | } |
117 | 44e3ee8a | aliguori | |
118 | 6f1953c4 | Christoph Hellwig | /*
|
119 | 6f1953c4 | Christoph Hellwig | * Make sure data goes on disk, but if possible do not bother to
|
120 | 6f1953c4 | Christoph Hellwig | * write out the inode just for timestamp updates.
|
121 | 6f1953c4 | Christoph Hellwig | *
|
122 | 6f1953c4 | Christoph Hellwig | * Unfortunately even in 2009 many operating systems do not support
|
123 | 6f1953c4 | Christoph Hellwig | * fdatasync and have to fall back to fsync.
|
124 | 6f1953c4 | Christoph Hellwig | */
|
125 | 6f1953c4 | Christoph Hellwig | int qemu_fdatasync(int fd) |
126 | 6f1953c4 | Christoph Hellwig | { |
127 | 5f6b9e8f | Blue Swirl | #ifdef CONFIG_FDATASYNC
|
128 | 6f1953c4 | Christoph Hellwig | return fdatasync(fd);
|
129 | 6f1953c4 | Christoph Hellwig | #else
|
130 | 6f1953c4 | Christoph Hellwig | return fsync(fd);
|
131 | 6f1953c4 | Christoph Hellwig | #endif
|
132 | 6f1953c4 | Christoph Hellwig | } |
133 | 6f1953c4 | Christoph Hellwig | |
134 | 44e3ee8a | aliguori | /* io vectors */
|
135 | 44e3ee8a | aliguori | |
136 | 44e3ee8a | aliguori | void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint) |
137 | 44e3ee8a | aliguori | { |
138 | 44e3ee8a | aliguori | qiov->iov = qemu_malloc(alloc_hint * sizeof(struct iovec)); |
139 | 44e3ee8a | aliguori | qiov->niov = 0;
|
140 | 44e3ee8a | aliguori | qiov->nalloc = alloc_hint; |
141 | 249aa745 | aliguori | qiov->size = 0;
|
142 | 44e3ee8a | aliguori | } |
143 | 44e3ee8a | aliguori | |
144 | 522584a5 | aliguori | void qemu_iovec_init_external(QEMUIOVector *qiov, struct iovec *iov, int niov) |
145 | 522584a5 | aliguori | { |
146 | 522584a5 | aliguori | int i;
|
147 | 522584a5 | aliguori | |
148 | 522584a5 | aliguori | qiov->iov = iov; |
149 | 522584a5 | aliguori | qiov->niov = niov; |
150 | 522584a5 | aliguori | qiov->nalloc = -1;
|
151 | 522584a5 | aliguori | qiov->size = 0;
|
152 | 522584a5 | aliguori | for (i = 0; i < niov; i++) |
153 | 522584a5 | aliguori | qiov->size += iov[i].iov_len; |
154 | 522584a5 | aliguori | } |
155 | 522584a5 | aliguori | |
156 | 44e3ee8a | aliguori | void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len) |
157 | 44e3ee8a | aliguori | { |
158 | 522584a5 | aliguori | assert(qiov->nalloc != -1);
|
159 | 522584a5 | aliguori | |
160 | 44e3ee8a | aliguori | if (qiov->niov == qiov->nalloc) {
|
161 | 44e3ee8a | aliguori | qiov->nalloc = 2 * qiov->nalloc + 1; |
162 | 44e3ee8a | aliguori | qiov->iov = qemu_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec)); |
163 | 44e3ee8a | aliguori | } |
164 | 44e3ee8a | aliguori | qiov->iov[qiov->niov].iov_base = base; |
165 | 44e3ee8a | aliguori | qiov->iov[qiov->niov].iov_len = len; |
166 | 249aa745 | aliguori | qiov->size += len; |
167 | 44e3ee8a | aliguori | ++qiov->niov; |
168 | 44e3ee8a | aliguori | } |
169 | 44e3ee8a | aliguori | |
170 | 40b4f539 | Kevin Wolf | /*
|
171 | 40b4f539 | Kevin Wolf | * Copies iovecs from src to the end dst until src is completely copied or the
|
172 | 40b4f539 | Kevin Wolf | * total size of the copied iovec reaches size. The size of the last copied
|
173 | 40b4f539 | Kevin Wolf | * iovec is changed in order to fit the specified total size if it isn't a
|
174 | 40b4f539 | Kevin Wolf | * perfect fit already.
|
175 | 40b4f539 | Kevin Wolf | */
|
176 | 40b4f539 | Kevin Wolf | void qemu_iovec_concat(QEMUIOVector *dst, QEMUIOVector *src, size_t size)
|
177 | 40b4f539 | Kevin Wolf | { |
178 | 40b4f539 | Kevin Wolf | int i;
|
179 | 40b4f539 | Kevin Wolf | size_t done; |
180 | 40b4f539 | Kevin Wolf | |
181 | 40b4f539 | Kevin Wolf | assert(dst->nalloc != -1);
|
182 | 40b4f539 | Kevin Wolf | |
183 | 40b4f539 | Kevin Wolf | done = 0;
|
184 | 40b4f539 | Kevin Wolf | for (i = 0; (i < src->niov) && (done != size); i++) { |
185 | 40b4f539 | Kevin Wolf | if (done + src->iov[i].iov_len > size) {
|
186 | 40b4f539 | Kevin Wolf | qemu_iovec_add(dst, src->iov[i].iov_base, size - done); |
187 | 40b4f539 | Kevin Wolf | break;
|
188 | 40b4f539 | Kevin Wolf | } else {
|
189 | 40b4f539 | Kevin Wolf | qemu_iovec_add(dst, src->iov[i].iov_base, src->iov[i].iov_len); |
190 | 40b4f539 | Kevin Wolf | } |
191 | 40b4f539 | Kevin Wolf | done += src->iov[i].iov_len; |
192 | 40b4f539 | Kevin Wolf | } |
193 | 40b4f539 | Kevin Wolf | } |
194 | 40b4f539 | Kevin Wolf | |
195 | 44e3ee8a | aliguori | void qemu_iovec_destroy(QEMUIOVector *qiov)
|
196 | 44e3ee8a | aliguori | { |
197 | 522584a5 | aliguori | assert(qiov->nalloc != -1);
|
198 | 522584a5 | aliguori | |
199 | 44e3ee8a | aliguori | qemu_free(qiov->iov); |
200 | 44e3ee8a | aliguori | } |
201 | 44e3ee8a | aliguori | |
202 | be959463 | aliguori | void qemu_iovec_reset(QEMUIOVector *qiov)
|
203 | be959463 | aliguori | { |
204 | 522584a5 | aliguori | assert(qiov->nalloc != -1);
|
205 | 522584a5 | aliguori | |
206 | be959463 | aliguori | qiov->niov = 0;
|
207 | be959463 | aliguori | qiov->size = 0;
|
208 | be959463 | aliguori | } |
209 | be959463 | aliguori | |
210 | 44e3ee8a | aliguori | void qemu_iovec_to_buffer(QEMUIOVector *qiov, void *buf) |
211 | 44e3ee8a | aliguori | { |
212 | 44e3ee8a | aliguori | uint8_t *p = (uint8_t *)buf; |
213 | 44e3ee8a | aliguori | int i;
|
214 | 44e3ee8a | aliguori | |
215 | 44e3ee8a | aliguori | for (i = 0; i < qiov->niov; ++i) { |
216 | 44e3ee8a | aliguori | memcpy(p, qiov->iov[i].iov_base, qiov->iov[i].iov_len); |
217 | 44e3ee8a | aliguori | p += qiov->iov[i].iov_len; |
218 | 44e3ee8a | aliguori | } |
219 | 44e3ee8a | aliguori | } |
220 | 44e3ee8a | aliguori | |
221 | 249aa745 | aliguori | void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count) |
222 | 44e3ee8a | aliguori | { |
223 | 44e3ee8a | aliguori | const uint8_t *p = (const uint8_t *)buf; |
224 | 249aa745 | aliguori | size_t copy; |
225 | 44e3ee8a | aliguori | int i;
|
226 | 44e3ee8a | aliguori | |
227 | 249aa745 | aliguori | for (i = 0; i < qiov->niov && count; ++i) { |
228 | 249aa745 | aliguori | copy = count; |
229 | 249aa745 | aliguori | if (copy > qiov->iov[i].iov_len)
|
230 | 249aa745 | aliguori | copy = qiov->iov[i].iov_len; |
231 | 249aa745 | aliguori | memcpy(qiov->iov[i].iov_base, p, copy); |
232 | 249aa745 | aliguori | p += copy; |
233 | 249aa745 | aliguori | count -= copy; |
234 | 44e3ee8a | aliguori | } |
235 | 44e3ee8a | aliguori | } |