root / cutils.c @ f3e3aa8c
History | View | Annotate | Download (4.3 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 | 522584a5 | aliguori | #include <assert.h> |
27 | 18607dcb | bellard | |
28 | 18607dcb | bellard | void pstrcpy(char *buf, int buf_size, const char *str) |
29 | 18607dcb | bellard | { |
30 | 18607dcb | bellard | int c;
|
31 | 18607dcb | bellard | char *q = buf;
|
32 | 18607dcb | bellard | |
33 | 18607dcb | bellard | if (buf_size <= 0) |
34 | 18607dcb | bellard | return;
|
35 | 18607dcb | bellard | |
36 | 18607dcb | bellard | for(;;) {
|
37 | 18607dcb | bellard | c = *str++; |
38 | 18607dcb | bellard | if (c == 0 || q >= buf + buf_size - 1) |
39 | 18607dcb | bellard | break;
|
40 | 18607dcb | bellard | *q++ = c; |
41 | 18607dcb | bellard | } |
42 | 18607dcb | bellard | *q = '\0';
|
43 | 18607dcb | bellard | } |
44 | 18607dcb | bellard | |
45 | 18607dcb | bellard | /* strcat and truncate. */
|
46 | 18607dcb | bellard | char *pstrcat(char *buf, int buf_size, const char *s) |
47 | 18607dcb | bellard | { |
48 | 18607dcb | bellard | int len;
|
49 | 18607dcb | bellard | len = strlen(buf); |
50 | 5fafdf24 | ths | if (len < buf_size)
|
51 | 18607dcb | bellard | pstrcpy(buf + len, buf_size - len, s); |
52 | 18607dcb | bellard | return buf;
|
53 | 18607dcb | bellard | } |
54 | 18607dcb | bellard | |
55 | 18607dcb | bellard | int strstart(const char *str, const char *val, const char **ptr) |
56 | 18607dcb | bellard | { |
57 | 18607dcb | bellard | const char *p, *q; |
58 | 18607dcb | bellard | p = str; |
59 | 18607dcb | bellard | q = val; |
60 | 18607dcb | bellard | while (*q != '\0') { |
61 | 18607dcb | bellard | if (*p != *q)
|
62 | 18607dcb | bellard | return 0; |
63 | 18607dcb | bellard | p++; |
64 | 18607dcb | bellard | q++; |
65 | 18607dcb | bellard | } |
66 | 18607dcb | bellard | if (ptr)
|
67 | 18607dcb | bellard | *ptr = p; |
68 | 18607dcb | bellard | return 1; |
69 | 18607dcb | bellard | } |
70 | 18607dcb | bellard | |
71 | 18607dcb | bellard | int stristart(const char *str, const char *val, const char **ptr) |
72 | 18607dcb | bellard | { |
73 | 18607dcb | bellard | const char *p, *q; |
74 | 18607dcb | bellard | p = str; |
75 | 18607dcb | bellard | q = val; |
76 | 18607dcb | bellard | while (*q != '\0') { |
77 | cd390083 | blueswir1 | if (qemu_toupper(*p) != qemu_toupper(*q))
|
78 | 18607dcb | bellard | return 0; |
79 | 18607dcb | bellard | p++; |
80 | 18607dcb | bellard | q++; |
81 | 18607dcb | bellard | } |
82 | 18607dcb | bellard | if (ptr)
|
83 | 18607dcb | bellard | *ptr = p; |
84 | 18607dcb | bellard | return 1; |
85 | 18607dcb | bellard | } |
86 | 3c6b2088 | bellard | |
87 | 3c6b2088 | bellard | time_t mktimegm(struct tm *tm)
|
88 | 3c6b2088 | bellard | { |
89 | 3c6b2088 | bellard | time_t t; |
90 | 3c6b2088 | bellard | int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday; |
91 | 3c6b2088 | bellard | if (m < 3) { |
92 | 3c6b2088 | bellard | m += 12;
|
93 | 3c6b2088 | bellard | y--; |
94 | 3c6b2088 | bellard | } |
95 | 3c6b2088 | bellard | t = 86400 * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 + |
96 | 3c6b2088 | bellard | y / 400 - 719469); |
97 | 3c6b2088 | bellard | t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec; |
98 | 3c6b2088 | bellard | return t;
|
99 | 3c6b2088 | bellard | } |
100 | b39ade83 | aliguori | |
101 | ad46db9a | blueswir1 | int qemu_fls(int i) |
102 | b39ade83 | aliguori | { |
103 | 8d371d4b | aliguori | return 32 - clz32(i); |
104 | b39ade83 | aliguori | } |
105 | 44e3ee8a | aliguori | |
106 | 44e3ee8a | aliguori | /* io vectors */
|
107 | 44e3ee8a | aliguori | |
108 | 44e3ee8a | aliguori | void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint) |
109 | 44e3ee8a | aliguori | { |
110 | 44e3ee8a | aliguori | qiov->iov = qemu_malloc(alloc_hint * sizeof(struct iovec)); |
111 | 44e3ee8a | aliguori | qiov->niov = 0;
|
112 | 44e3ee8a | aliguori | qiov->nalloc = alloc_hint; |
113 | 249aa745 | aliguori | qiov->size = 0;
|
114 | 44e3ee8a | aliguori | } |
115 | 44e3ee8a | aliguori | |
116 | 522584a5 | aliguori | void qemu_iovec_init_external(QEMUIOVector *qiov, struct iovec *iov, int niov) |
117 | 522584a5 | aliguori | { |
118 | 522584a5 | aliguori | int i;
|
119 | 522584a5 | aliguori | |
120 | 522584a5 | aliguori | qiov->iov = iov; |
121 | 522584a5 | aliguori | qiov->niov = niov; |
122 | 522584a5 | aliguori | qiov->nalloc = -1;
|
123 | 522584a5 | aliguori | qiov->size = 0;
|
124 | 522584a5 | aliguori | for (i = 0; i < niov; i++) |
125 | 522584a5 | aliguori | qiov->size += iov[i].iov_len; |
126 | 522584a5 | aliguori | } |
127 | 522584a5 | aliguori | |
128 | 44e3ee8a | aliguori | void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len) |
129 | 44e3ee8a | aliguori | { |
130 | 522584a5 | aliguori | assert(qiov->nalloc != -1);
|
131 | 522584a5 | aliguori | |
132 | 44e3ee8a | aliguori | if (qiov->niov == qiov->nalloc) {
|
133 | 44e3ee8a | aliguori | qiov->nalloc = 2 * qiov->nalloc + 1; |
134 | 44e3ee8a | aliguori | qiov->iov = qemu_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec)); |
135 | 44e3ee8a | aliguori | } |
136 | 44e3ee8a | aliguori | qiov->iov[qiov->niov].iov_base = base; |
137 | 44e3ee8a | aliguori | qiov->iov[qiov->niov].iov_len = len; |
138 | 249aa745 | aliguori | qiov->size += len; |
139 | 44e3ee8a | aliguori | ++qiov->niov; |
140 | 44e3ee8a | aliguori | } |
141 | 44e3ee8a | aliguori | |
142 | 44e3ee8a | aliguori | void qemu_iovec_destroy(QEMUIOVector *qiov)
|
143 | 44e3ee8a | aliguori | { |
144 | 522584a5 | aliguori | assert(qiov->nalloc != -1);
|
145 | 522584a5 | aliguori | |
146 | 44e3ee8a | aliguori | qemu_free(qiov->iov); |
147 | 44e3ee8a | aliguori | } |
148 | 44e3ee8a | aliguori | |
149 | be959463 | aliguori | void qemu_iovec_reset(QEMUIOVector *qiov)
|
150 | be959463 | aliguori | { |
151 | 522584a5 | aliguori | assert(qiov->nalloc != -1);
|
152 | 522584a5 | aliguori | |
153 | be959463 | aliguori | qiov->niov = 0;
|
154 | be959463 | aliguori | qiov->size = 0;
|
155 | be959463 | aliguori | } |
156 | be959463 | aliguori | |
157 | 44e3ee8a | aliguori | void qemu_iovec_to_buffer(QEMUIOVector *qiov, void *buf) |
158 | 44e3ee8a | aliguori | { |
159 | 44e3ee8a | aliguori | uint8_t *p = (uint8_t *)buf; |
160 | 44e3ee8a | aliguori | int i;
|
161 | 44e3ee8a | aliguori | |
162 | 44e3ee8a | aliguori | for (i = 0; i < qiov->niov; ++i) { |
163 | 44e3ee8a | aliguori | memcpy(p, qiov->iov[i].iov_base, qiov->iov[i].iov_len); |
164 | 44e3ee8a | aliguori | p += qiov->iov[i].iov_len; |
165 | 44e3ee8a | aliguori | } |
166 | 44e3ee8a | aliguori | } |
167 | 44e3ee8a | aliguori | |
168 | 249aa745 | aliguori | void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count) |
169 | 44e3ee8a | aliguori | { |
170 | 44e3ee8a | aliguori | const uint8_t *p = (const uint8_t *)buf; |
171 | 249aa745 | aliguori | size_t copy; |
172 | 44e3ee8a | aliguori | int i;
|
173 | 44e3ee8a | aliguori | |
174 | 249aa745 | aliguori | for (i = 0; i < qiov->niov && count; ++i) { |
175 | 249aa745 | aliguori | copy = count; |
176 | 249aa745 | aliguori | if (copy > qiov->iov[i].iov_len)
|
177 | 249aa745 | aliguori | copy = qiov->iov[i].iov_len; |
178 | 249aa745 | aliguori | memcpy(qiov->iov[i].iov_base, p, copy); |
179 | 249aa745 | aliguori | p += copy; |
180 | 249aa745 | aliguori | count -= copy; |
181 | 44e3ee8a | aliguori | } |
182 | 44e3ee8a | aliguori | } |