blob: bd9a01950a7a298b1b223f774d82f7bd5b97da88 [file] [log] [blame]
bellard18607dc2007-01-07 22:04:40 +00001/*
2 * Simple C functions to supplement the C library
ths5fafdf22007-09-16 21:08:06 +00003 *
bellard18607dc2007-01-07 22:04:40 +00004 * 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 */
pbrookfaf07962007-11-11 02:51:17 +000024#include "qemu-common.h"
aliguori8d371d42008-12-04 20:08:06 +000025#include "host-utils.h"
bellard18607dc2007-01-07 22:04:40 +000026
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);
ths5fafdf22007-09-16 21:08:06 +000049 if (len < buf_size)
bellard18607dc2007-01-07 22:04:40 +000050 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') {
blueswir1cd390082008-11-16 13:53:32 +000076 if (qemu_toupper(*p) != qemu_toupper(*q))
bellard18607dc2007-01-07 22:04:40 +000077 return 0;
78 p++;
79 q++;
80 }
81 if (ptr)
82 *ptr = p;
83 return 1;
84}
bellard3c6b2082007-11-10 19:36:39 +000085
Blue Swirld43277c2009-07-01 18:24:44 +000086/* 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
bellard3c6b2082007-11-10 19:36:39 +000099time_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}
aliguorib39ade82008-12-04 19:19:45 +0000112
blueswir1ad46db92008-12-11 19:37:54 +0000113int qemu_fls(int i)
aliguorib39ade82008-12-04 19:19:45 +0000114{
aliguori8d371d42008-12-04 20:08:06 +0000115 return 32 - clz32(i);
aliguorib39ade82008-12-04 19:19:45 +0000116}
aliguori44e3ee82009-01-22 16:59:20 +0000117
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;
aliguori249aa742009-01-26 17:17:52 +0000125 qiov->size = 0;
aliguori44e3ee82009-01-22 16:59:20 +0000126}
127
aliguori522584a2009-03-28 17:46:10 +0000128void 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
aliguori44e3ee82009-01-22 16:59:20 +0000140void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len)
141{
aliguori522584a2009-03-28 17:46:10 +0000142 assert(qiov->nalloc != -1);
143
aliguori44e3ee82009-01-22 16:59:20 +0000144 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;
aliguori249aa742009-01-26 17:17:52 +0000150 qiov->size += len;
aliguori44e3ee82009-01-22 16:59:20 +0000151 ++qiov->niov;
152}
153
154void qemu_iovec_destroy(QEMUIOVector *qiov)
155{
aliguori522584a2009-03-28 17:46:10 +0000156 assert(qiov->nalloc != -1);
157
aliguori44e3ee82009-01-22 16:59:20 +0000158 qemu_free(qiov->iov);
159}
160
aliguoribe959462009-02-05 21:23:54 +0000161void qemu_iovec_reset(QEMUIOVector *qiov)
162{
aliguori522584a2009-03-28 17:46:10 +0000163 assert(qiov->nalloc != -1);
164
aliguoribe959462009-02-05 21:23:54 +0000165 qiov->niov = 0;
166 qiov->size = 0;
167}
168
aliguori44e3ee82009-01-22 16:59:20 +0000169void 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
aliguori249aa742009-01-26 17:17:52 +0000180void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count)
aliguori44e3ee82009-01-22 16:59:20 +0000181{
182 const uint8_t *p = (const uint8_t *)buf;
aliguori249aa742009-01-26 17:17:52 +0000183 size_t copy;
aliguori44e3ee82009-01-22 16:59:20 +0000184 int i;
185
aliguori249aa742009-01-26 17:17:52 +0000186 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;
aliguori44e3ee82009-01-22 16:59:20 +0000193 }
194}