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