2007-01-07 23:04:40 +01:00
|
|
|
/*
|
|
|
|
* Simple C functions to supplement the C library
|
2007-09-16 23:08:06 +02:00
|
|
|
*
|
2007-01-07 23:04:40 +01:00
|
|
|
* Copyright (c) 2006 Fabrice Bellard
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*/
|
2007-11-11 03:51:17 +01:00
|
|
|
#include "qemu-common.h"
|
2008-12-04 21:08:06 +01:00
|
|
|
#include "host-utils.h"
|
2007-01-07 23:04:40 +01:00
|
|
|
|
2009-06-27 02:41:50 +02:00
|
|
|
/*
|
|
|
|
* fill first 'len' characters of 'buff' with pruned
|
|
|
|
* contents of 'str' delimited by the character 'c'.
|
|
|
|
* Escape character '\' is pruned off.
|
|
|
|
* Return pointer to the delimiting character.
|
|
|
|
*/
|
|
|
|
const char *fill_token(char *buf, const int len, const char *str, const char c)
|
|
|
|
{
|
|
|
|
const char *p=str;
|
|
|
|
char *q=buf;
|
|
|
|
|
|
|
|
while (p < str+len-1) {
|
|
|
|
if (*p == c)
|
|
|
|
break;
|
|
|
|
if (*p == '\\') {
|
|
|
|
p++;
|
|
|
|
if (*p == '\0')
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
*q++ = *p++;
|
|
|
|
}
|
|
|
|
*q='\0';
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2007-01-07 23:04:40 +01:00
|
|
|
void pstrcpy(char *buf, int buf_size, const char *str)
|
|
|
|
{
|
|
|
|
int c;
|
|
|
|
char *q = buf;
|
|
|
|
|
|
|
|
if (buf_size <= 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
for(;;) {
|
|
|
|
c = *str++;
|
|
|
|
if (c == 0 || q >= buf + buf_size - 1)
|
|
|
|
break;
|
|
|
|
*q++ = c;
|
|
|
|
}
|
|
|
|
*q = '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
/* strcat and truncate. */
|
|
|
|
char *pstrcat(char *buf, int buf_size, const char *s)
|
|
|
|
{
|
|
|
|
int len;
|
|
|
|
len = strlen(buf);
|
2007-09-16 23:08:06 +02:00
|
|
|
if (len < buf_size)
|
2007-01-07 23:04:40 +01:00
|
|
|
pstrcpy(buf + len, buf_size - len, s);
|
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
int strstart(const char *str, const char *val, const char **ptr)
|
|
|
|
{
|
|
|
|
const char *p, *q;
|
|
|
|
p = str;
|
|
|
|
q = val;
|
|
|
|
while (*q != '\0') {
|
|
|
|
if (*p != *q)
|
|
|
|
return 0;
|
|
|
|
p++;
|
|
|
|
q++;
|
|
|
|
}
|
|
|
|
if (ptr)
|
|
|
|
*ptr = p;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int stristart(const char *str, const char *val, const char **ptr)
|
|
|
|
{
|
|
|
|
const char *p, *q;
|
|
|
|
p = str;
|
|
|
|
q = val;
|
|
|
|
while (*q != '\0') {
|
2008-11-16 14:53:32 +01:00
|
|
|
if (qemu_toupper(*p) != qemu_toupper(*q))
|
2007-01-07 23:04:40 +01:00
|
|
|
return 0;
|
|
|
|
p++;
|
|
|
|
q++;
|
|
|
|
}
|
|
|
|
if (ptr)
|
|
|
|
*ptr = p;
|
|
|
|
return 1;
|
|
|
|
}
|
2007-11-10 20:36:39 +01:00
|
|
|
|
|
|
|
time_t mktimegm(struct tm *tm)
|
|
|
|
{
|
|
|
|
time_t t;
|
|
|
|
int y = tm->tm_year + 1900, m = tm->tm_mon + 1, d = tm->tm_mday;
|
|
|
|
if (m < 3) {
|
|
|
|
m += 12;
|
|
|
|
y--;
|
|
|
|
}
|
|
|
|
t = 86400 * (d + (153 * m - 457) / 5 + 365 * y + y / 4 - y / 100 +
|
|
|
|
y / 400 - 719469);
|
|
|
|
t += 3600 * tm->tm_hour + 60 * tm->tm_min + tm->tm_sec;
|
|
|
|
return t;
|
|
|
|
}
|
2008-12-04 20:19:45 +01:00
|
|
|
|
2008-12-11 20:37:54 +01:00
|
|
|
int qemu_fls(int i)
|
2008-12-04 20:19:45 +01:00
|
|
|
{
|
2008-12-04 21:08:06 +01:00
|
|
|
return 32 - clz32(i);
|
2008-12-04 20:19:45 +01:00
|
|
|
}
|
2009-01-22 17:59:20 +01:00
|
|
|
|
|
|
|
/* io vectors */
|
|
|
|
|
|
|
|
void qemu_iovec_init(QEMUIOVector *qiov, int alloc_hint)
|
|
|
|
{
|
|
|
|
qiov->iov = qemu_malloc(alloc_hint * sizeof(struct iovec));
|
|
|
|
qiov->niov = 0;
|
|
|
|
qiov->nalloc = alloc_hint;
|
2009-01-26 18:17:52 +01:00
|
|
|
qiov->size = 0;
|
2009-01-22 17:59:20 +01:00
|
|
|
}
|
|
|
|
|
2009-03-28 18:46:10 +01:00
|
|
|
void qemu_iovec_init_external(QEMUIOVector *qiov, struct iovec *iov, int niov)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
qiov->iov = iov;
|
|
|
|
qiov->niov = niov;
|
|
|
|
qiov->nalloc = -1;
|
|
|
|
qiov->size = 0;
|
|
|
|
for (i = 0; i < niov; i++)
|
|
|
|
qiov->size += iov[i].iov_len;
|
|
|
|
}
|
|
|
|
|
2009-01-22 17:59:20 +01:00
|
|
|
void qemu_iovec_add(QEMUIOVector *qiov, void *base, size_t len)
|
|
|
|
{
|
2009-03-28 18:46:10 +01:00
|
|
|
assert(qiov->nalloc != -1);
|
|
|
|
|
2009-01-22 17:59:20 +01:00
|
|
|
if (qiov->niov == qiov->nalloc) {
|
|
|
|
qiov->nalloc = 2 * qiov->nalloc + 1;
|
|
|
|
qiov->iov = qemu_realloc(qiov->iov, qiov->nalloc * sizeof(struct iovec));
|
|
|
|
}
|
|
|
|
qiov->iov[qiov->niov].iov_base = base;
|
|
|
|
qiov->iov[qiov->niov].iov_len = len;
|
2009-01-26 18:17:52 +01:00
|
|
|
qiov->size += len;
|
2009-01-22 17:59:20 +01:00
|
|
|
++qiov->niov;
|
|
|
|
}
|
|
|
|
|
|
|
|
void qemu_iovec_destroy(QEMUIOVector *qiov)
|
|
|
|
{
|
2009-03-28 18:46:10 +01:00
|
|
|
assert(qiov->nalloc != -1);
|
|
|
|
|
2009-01-22 17:59:20 +01:00
|
|
|
qemu_free(qiov->iov);
|
|
|
|
}
|
|
|
|
|
2009-02-05 22:23:54 +01:00
|
|
|
void qemu_iovec_reset(QEMUIOVector *qiov)
|
|
|
|
{
|
2009-03-28 18:46:10 +01:00
|
|
|
assert(qiov->nalloc != -1);
|
|
|
|
|
2009-02-05 22:23:54 +01:00
|
|
|
qiov->niov = 0;
|
|
|
|
qiov->size = 0;
|
|
|
|
}
|
|
|
|
|
2009-01-22 17:59:20 +01:00
|
|
|
void qemu_iovec_to_buffer(QEMUIOVector *qiov, void *buf)
|
|
|
|
{
|
|
|
|
uint8_t *p = (uint8_t *)buf;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
for (i = 0; i < qiov->niov; ++i) {
|
|
|
|
memcpy(p, qiov->iov[i].iov_base, qiov->iov[i].iov_len);
|
|
|
|
p += qiov->iov[i].iov_len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-01-26 18:17:52 +01:00
|
|
|
void qemu_iovec_from_buffer(QEMUIOVector *qiov, const void *buf, size_t count)
|
2009-01-22 17:59:20 +01:00
|
|
|
{
|
|
|
|
const uint8_t *p = (const uint8_t *)buf;
|
2009-01-26 18:17:52 +01:00
|
|
|
size_t copy;
|
2009-01-22 17:59:20 +01:00
|
|
|
int i;
|
|
|
|
|
2009-01-26 18:17:52 +01:00
|
|
|
for (i = 0; i < qiov->niov && count; ++i) {
|
|
|
|
copy = count;
|
|
|
|
if (copy > qiov->iov[i].iov_len)
|
|
|
|
copy = qiov->iov[i].iov_len;
|
|
|
|
memcpy(qiov->iov[i].iov_base, p, copy);
|
|
|
|
p += copy;
|
|
|
|
count -= copy;
|
2009-01-22 17:59:20 +01:00
|
|
|
}
|
|
|
|
}
|