Statistics
| Branch: | Revision:

root / cutils.c @ 636aa200

History | View | Annotate | Download (4.5 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 44e3ee8a aliguori
/* io vectors */
119 44e3ee8a aliguori
120 44e3ee8a aliguori
void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint)
121 44e3ee8a aliguori
{
122 44e3ee8a aliguori
    qiov->iov = qemu_malloc(alloc_hint * sizeof(struct iovec));
123 44e3ee8a aliguori
    qiov->niov = 0;
124 44e3ee8a aliguori
    qiov->nalloc = alloc_hint;
125 249aa745 aliguori
    qiov->size = 0;
126 44e3ee8a aliguori
}
127 44e3ee8a aliguori
128 522584a5 aliguori
void qemu_iovec_init_external(QEMUIOVector *qiov, struct iovec *iov, int niov)
129 522584a5 aliguori
{
130 522584a5 aliguori
    int i;
131 522584a5 aliguori
132 522584a5 aliguori
    qiov->iov = iov;
133 522584a5 aliguori
    qiov->niov = niov;
134 522584a5 aliguori
    qiov->nalloc = -1;
135 522584a5 aliguori
    qiov->size = 0;
136 522584a5 aliguori
    for (i = 0; i < niov; i++)
137 522584a5 aliguori
        qiov->size += iov[i].iov_len;
138 522584a5 aliguori
}
139 522584a5 aliguori
140 44e3ee8a aliguori
void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len)
141 44e3ee8a aliguori
{
142 522584a5 aliguori
    assert(qiov->nalloc != -1);
143 522584a5 aliguori
144 44e3ee8a aliguori
    if (qiov->niov == qiov->nalloc) {
145 44e3ee8a aliguori
        qiov->nalloc = 2 * qiov->nalloc + 1;
146 44e3ee8a aliguori
        qiov->iov = qemu_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec));
147 44e3ee8a aliguori
    }
148 44e3ee8a aliguori
    qiov->iov[qiov->niov].iov_base = base;
149 44e3ee8a aliguori
    qiov->iov[qiov->niov].iov_len = len;
150 249aa745 aliguori
    qiov->size += len;
151 44e3ee8a aliguori
    ++qiov->niov;
152 44e3ee8a aliguori
}
153 44e3ee8a aliguori
154 44e3ee8a aliguori
void qemu_iovec_destroy(QEMUIOVector *qiov)
155 44e3ee8a aliguori
{
156 522584a5 aliguori
    assert(qiov->nalloc != -1);
157 522584a5 aliguori
158 44e3ee8a aliguori
    qemu_free(qiov->iov);
159 44e3ee8a aliguori
}
160 44e3ee8a aliguori
161 be959463 aliguori
void qemu_iovec_reset(QEMUIOVector *qiov)
162 be959463 aliguori
{
163 522584a5 aliguori
    assert(qiov->nalloc != -1);
164 522584a5 aliguori
165 be959463 aliguori
    qiov->niov = 0;
166 be959463 aliguori
    qiov->size = 0;
167 be959463 aliguori
}
168 be959463 aliguori
169 44e3ee8a aliguori
void qemu_iovec_to_buffer(QEMUIOVector *qiov, void *buf)
170 44e3ee8a aliguori
{
171 44e3ee8a aliguori
    uint8_t *p = (uint8_t *)buf;
172 44e3ee8a aliguori
    int i;
173 44e3ee8a aliguori
174 44e3ee8a aliguori
    for (i = 0; i < qiov->niov; ++i) {
175 44e3ee8a aliguori
        memcpy(p, qiov->iov[i].iov_base, qiov->iov[i].iov_len);
176 44e3ee8a aliguori
        p += qiov->iov[i].iov_len;
177 44e3ee8a aliguori
    }
178 44e3ee8a aliguori
}
179 44e3ee8a aliguori
180 249aa745 aliguori
void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count)
181 44e3ee8a aliguori
{
182 44e3ee8a aliguori
    const uint8_t *p = (const uint8_t *)buf;
183 249aa745 aliguori
    size_t copy;
184 44e3ee8a aliguori
    int i;
185 44e3ee8a aliguori
186 249aa745 aliguori
    for (i = 0; i < qiov->niov && count; ++i) {
187 249aa745 aliguori
        copy = count;
188 249aa745 aliguori
        if (copy > qiov->iov[i].iov_len)
189 249aa745 aliguori
            copy = qiov->iov[i].iov_len;
190 249aa745 aliguori
        memcpy(qiov->iov[i].iov_base, p, copy);
191 249aa745 aliguori
        p     += copy;
192 249aa745 aliguori
        count -= copy;
193 44e3ee8a aliguori
    }
194 44e3ee8a aliguori
}