root / cutils.c @ 522584a5
History | View | Annotate | Download (4.3 kB)
1 |
/*
|
---|---|
2 |
* Simple C functions to supplement the C library
|
3 |
*
|
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 |
*/
|
24 |
#include "qemu-common.h" |
25 |
#include "host-utils.h" |
26 |
#include <assert.h> |
27 |
|
28 |
void 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. */
|
46 |
char *pstrcat(char *buf, int buf_size, const char *s) |
47 |
{ |
48 |
int len;
|
49 |
len = strlen(buf); |
50 |
if (len < buf_size)
|
51 |
pstrcpy(buf + len, buf_size - len, s); |
52 |
return buf;
|
53 |
} |
54 |
|
55 |
int 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 |
|
71 |
int 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') { |
77 |
if (qemu_toupper(*p) != qemu_toupper(*q))
|
78 |
return 0; |
79 |
p++; |
80 |
q++; |
81 |
} |
82 |
if (ptr)
|
83 |
*ptr = p; |
84 |
return 1; |
85 |
} |
86 |
|
87 |
time_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 |
} |
100 |
|
101 |
int qemu_fls(int i) |
102 |
{ |
103 |
return 32 - clz32(i); |
104 |
} |
105 |
|
106 |
/* io vectors */
|
107 |
|
108 |
void 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; |
113 |
qiov->size = 0;
|
114 |
} |
115 |
|
116 |
void 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 |
|
128 |
void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len) |
129 |
{ |
130 |
assert(qiov->nalloc != -1);
|
131 |
|
132 |
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; |
138 |
qiov->size += len; |
139 |
++qiov->niov; |
140 |
} |
141 |
|
142 |
void qemu_iovec_destroy(QEMUIOVector *qiov)
|
143 |
{ |
144 |
assert(qiov->nalloc != -1);
|
145 |
|
146 |
qemu_free(qiov->iov); |
147 |
} |
148 |
|
149 |
void qemu_iovec_reset(QEMUIOVector *qiov)
|
150 |
{ |
151 |
assert(qiov->nalloc != -1);
|
152 |
|
153 |
qiov->niov = 0;
|
154 |
qiov->size = 0;
|
155 |
} |
156 |
|
157 |
void 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 |
|
168 |
void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count) |
169 |
{ |
170 |
const uint8_t *p = (const uint8_t *)buf; |
171 |
size_t copy; |
172 |
int i;
|
173 |
|
174 |
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; |
181 |
} |
182 |
} |