2005-11-17 09:05:55 +00:00
|
|
|
/**
|
|
|
|
* @file types.c
|
|
|
|
*
|
2005-12-06 13:07:06 +00:00
|
|
|
* @brief Generic types.
|
2005-11-17 09:05:55 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
2006-07-07 08:49:06 +00:00
|
|
|
* Copyright (C) 2005-2006 Martin Willi
|
|
|
|
* Copyright (C) 2005 Jan Hutter
|
2005-11-17 09:05:55 +00:00
|
|
|
* Hochschule fuer Technik Rapperswil
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify it
|
|
|
|
* under the terms of the GNU General Public License as published by the
|
|
|
|
* Free Software Foundation; either version 2 of the License, or (at your
|
|
|
|
* option) any later version. See <http://www.fsf.org/copyleft/gpl.txt>.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful, but
|
|
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
|
|
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
|
* for more details.
|
|
|
|
*/
|
2006-04-10 08:07:38 +00:00
|
|
|
|
|
|
|
#include <string.h>
|
2006-05-29 07:02:12 +00:00
|
|
|
#include <time.h>
|
2006-07-05 10:09:42 +00:00
|
|
|
#include <stdio.h>
|
2006-07-27 12:18:40 +00:00
|
|
|
#include <stdarg.h>
|
2006-07-28 09:45:18 +00:00
|
|
|
#include <pthread.h>
|
2006-09-27 14:15:49 +00:00
|
|
|
#include <printf.h>
|
2006-04-10 08:07:38 +00:00
|
|
|
|
2005-11-17 09:05:55 +00:00
|
|
|
#include "types.h"
|
|
|
|
|
|
|
|
|
2005-12-06 13:07:06 +00:00
|
|
|
/**
|
|
|
|
* String mappings for type status_t.
|
|
|
|
*/
|
2005-11-17 09:05:55 +00:00
|
|
|
mapping_t status_m[] = {
|
|
|
|
{SUCCESS, "SUCCESS"},
|
|
|
|
{FAILED, "FAILED"},
|
|
|
|
{OUT_OF_RES, "OUT_OF_RES"},
|
|
|
|
{ALREADY_DONE, "ALREADY_DONE"},
|
|
|
|
{NOT_SUPPORTED, "NOT_SUPPORTED"},
|
|
|
|
{INVALID_ARG, "INVALID_ARG"},
|
|
|
|
{NOT_FOUND, "NOT_FOUND"},
|
|
|
|
{PARSE_ERROR, "PARSE_ERROR"},
|
|
|
|
{VERIFY_ERROR, "VERIFY_ERROR"},
|
|
|
|
{INVALID_STATE, "INVALID_STATE"},
|
2006-05-23 08:01:49 +00:00
|
|
|
{DESTROY_ME, "DESTROY_ME"},
|
2005-11-17 09:05:55 +00:00
|
|
|
{MAPPING_END, NULL}
|
|
|
|
};
|
|
|
|
|
2005-12-06 13:07:06 +00:00
|
|
|
/**
|
|
|
|
* Empty chunk.
|
|
|
|
*/
|
2006-06-16 05:53:47 +00:00
|
|
|
chunk_t CHUNK_INITIALIZER = { NULL, 0 };
|
2006-04-10 08:07:38 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Described in header.
|
|
|
|
*/
|
|
|
|
chunk_t chunk_clone(chunk_t chunk)
|
|
|
|
{
|
|
|
|
chunk_t clone = CHUNK_INITIALIZER;
|
|
|
|
|
|
|
|
if (chunk.ptr && chunk.len > 0)
|
|
|
|
{
|
|
|
|
clone.ptr = malloc(chunk.len);
|
|
|
|
clone.len = chunk.len;
|
|
|
|
memcpy(clone.ptr, chunk.ptr, chunk.len);
|
|
|
|
}
|
|
|
|
|
|
|
|
return clone;
|
|
|
|
}
|
|
|
|
|
2006-07-27 12:18:40 +00:00
|
|
|
/**
|
|
|
|
* Decribed in header.
|
|
|
|
*/
|
|
|
|
chunk_t chunk_cat(const char* mode, ...)
|
|
|
|
{
|
|
|
|
chunk_t construct;
|
|
|
|
va_list chunks;
|
|
|
|
u_char *pos;
|
|
|
|
int i;
|
|
|
|
int count = strlen(mode);
|
|
|
|
|
|
|
|
/* sum up lengths of individual chunks */
|
|
|
|
va_start(chunks, mode);
|
|
|
|
construct.len = 0;
|
|
|
|
for (i = 0; i < count; i++)
|
|
|
|
{
|
|
|
|
chunk_t ch = va_arg(chunks, chunk_t);
|
|
|
|
construct.len += ch.len;
|
|
|
|
}
|
|
|
|
va_end(chunks);
|
|
|
|
|
|
|
|
/* allocate needed memory for construct */
|
|
|
|
construct.ptr = malloc(construct.len);
|
|
|
|
pos = construct.ptr;
|
|
|
|
|
|
|
|
/* copy or move the chunks */
|
|
|
|
va_start(chunks, mode);
|
|
|
|
for (i = 0; i < count; i++)
|
|
|
|
{
|
|
|
|
chunk_t ch = va_arg(chunks, chunk_t);
|
|
|
|
switch (*mode++)
|
|
|
|
{
|
|
|
|
case 'm':
|
|
|
|
memcpy(pos, ch.ptr, ch.len);
|
|
|
|
pos += ch.len;
|
|
|
|
free(ch.ptr);
|
|
|
|
break;
|
|
|
|
case 'c':
|
|
|
|
default:
|
|
|
|
memcpy(pos, ch.ptr, ch.len);
|
|
|
|
pos += ch.len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
va_end(chunks);
|
|
|
|
|
|
|
|
return construct;
|
|
|
|
}
|
|
|
|
|
2006-04-10 08:07:38 +00:00
|
|
|
/**
|
|
|
|
* Described in header.
|
|
|
|
*/
|
|
|
|
void chunk_free(chunk_t *chunk)
|
|
|
|
{
|
|
|
|
free(chunk->ptr);
|
|
|
|
chunk->ptr = NULL;
|
|
|
|
chunk->len = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Described in header.
|
|
|
|
*/
|
|
|
|
chunk_t chunk_alloc(size_t bytes)
|
|
|
|
{
|
|
|
|
chunk_t new_chunk;
|
|
|
|
new_chunk.ptr = malloc(bytes);
|
|
|
|
new_chunk.len = bytes;
|
|
|
|
return new_chunk;
|
|
|
|
}
|
|
|
|
|
2006-04-19 11:40:48 +00:00
|
|
|
/**
|
|
|
|
* Described in header.
|
|
|
|
*/
|
|
|
|
bool chunk_equals(chunk_t a, chunk_t b)
|
|
|
|
{
|
2006-06-16 05:53:47 +00:00
|
|
|
return a.ptr != NULL && b.ptr != NULL &&
|
|
|
|
a.len == b.len && memeq(a.ptr, b.ptr, a.len);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Described in header.
|
|
|
|
*/
|
|
|
|
bool chunk_equals_or_null(chunk_t a, chunk_t b)
|
|
|
|
{
|
|
|
|
if (a.ptr == NULL || b.ptr == NULL)
|
|
|
|
return TRUE;
|
|
|
|
return a.len == b.len && memeq(a.ptr, b.ptr, a.len);
|
2006-04-19 11:40:48 +00:00
|
|
|
}
|
2006-04-10 08:07:38 +00:00
|
|
|
|
2006-05-19 06:44:08 +00:00
|
|
|
/**
|
|
|
|
* Described in header.
|
|
|
|
*/
|
|
|
|
void chunk_to_hex(char *buf, size_t buflen, chunk_t chunk)
|
|
|
|
{
|
|
|
|
bool first = TRUE;
|
|
|
|
|
|
|
|
buflen--; /* reserve space for null termination */
|
|
|
|
|
2006-05-23 08:15:08 +00:00
|
|
|
while (chunk.len > 0 && buflen > 2)
|
2006-05-19 06:44:08 +00:00
|
|
|
{
|
|
|
|
static char hexdig[] = "0123456789abcdef";
|
|
|
|
|
|
|
|
if (first)
|
|
|
|
{
|
|
|
|
first = FALSE;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
*buf++ = ':'; buflen--;
|
|
|
|
}
|
|
|
|
*buf++ = hexdig[(*chunk.ptr >> 4) & 0x0f];
|
|
|
|
*buf++ = hexdig[ *chunk.ptr++ & 0x0f];
|
|
|
|
buflen -= 2; chunk.len--;
|
|
|
|
}
|
|
|
|
*buf = '\0';
|
|
|
|
}
|
|
|
|
|
2006-09-27 14:15:49 +00:00
|
|
|
/**
|
|
|
|
* Number of bytes per line to dump raw data
|
|
|
|
*/
|
|
|
|
#define BYTES_PER_LINE 16
|
|
|
|
|
|
|
|
/**
|
|
|
|
* output handler in printf() for byte ranges
|
|
|
|
*/
|
|
|
|
static int print_bytes(FILE *stream, const struct printf_info *info,
|
|
|
|
const void *const *args)
|
|
|
|
{
|
|
|
|
char *bytes = *((void**)(args[0]));
|
|
|
|
int len = *((size_t*)(args[1]));
|
|
|
|
|
|
|
|
char buffer[BYTES_PER_LINE * 3];
|
|
|
|
char ascii_buffer[BYTES_PER_LINE + 1];
|
|
|
|
char *buffer_pos = buffer;
|
|
|
|
char *bytes_pos = bytes;
|
|
|
|
char *bytes_roof = bytes + len;
|
|
|
|
int line_start = 0;
|
|
|
|
int i = 0;
|
|
|
|
int total_written = 0;
|
|
|
|
|
|
|
|
total_written = fprintf(stream, "=> %d bytes @ %p", len, bytes);
|
|
|
|
if (total_written < 0)
|
|
|
|
{
|
|
|
|
return total_written;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (bytes_pos < bytes_roof)
|
|
|
|
{
|
|
|
|
static char hexdig[] = "0123456789ABCDEF";
|
|
|
|
|
|
|
|
*buffer_pos++ = hexdig[(*bytes_pos >> 4) & 0xF];
|
|
|
|
*buffer_pos++ = hexdig[ *bytes_pos & 0xF];
|
|
|
|
|
|
|
|
ascii_buffer[i++] =
|
|
|
|
(*bytes_pos > 31 && *bytes_pos < 127) ? *bytes_pos : '.';
|
|
|
|
|
|
|
|
if (++bytes_pos == bytes_roof || i == BYTES_PER_LINE)
|
|
|
|
{
|
|
|
|
int padding = 3 * (BYTES_PER_LINE - i);
|
|
|
|
int written;
|
|
|
|
|
|
|
|
while (padding--)
|
|
|
|
{
|
|
|
|
*buffer_pos++ = ' ';
|
|
|
|
}
|
|
|
|
*buffer_pos++ = '\0';
|
|
|
|
ascii_buffer[i] = '\0';
|
|
|
|
|
|
|
|
written = fprintf(stream, "\n%4d: %s %s",
|
|
|
|
line_start, buffer, ascii_buffer);
|
|
|
|
if (written < 0)
|
|
|
|
{
|
|
|
|
return written;
|
|
|
|
}
|
|
|
|
total_written += written;
|
|
|
|
|
|
|
|
buffer_pos = buffer;
|
|
|
|
line_start += BYTES_PER_LINE;
|
|
|
|
i = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
*buffer_pos++ = ' ';
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return total_written;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* output handler in printf() for chunks
|
|
|
|
*/
|
|
|
|
static int print_chunk(FILE *stream, const struct printf_info *info,
|
|
|
|
const void *const *args)
|
|
|
|
{
|
|
|
|
chunk_t *chunk = *((chunk_t**)(args[0]));
|
|
|
|
|
|
|
|
const void *new_args[] = {&chunk->ptr, &chunk->len};
|
|
|
|
return print_bytes(stream, info, new_args);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* arginfo handler in printf() for chunks
|
|
|
|
*/
|
|
|
|
static int print_chunk_arginfo(const struct printf_info *info, size_t n, int *argtypes)
|
|
|
|
{
|
|
|
|
if (n > 0)
|
|
|
|
{
|
|
|
|
argtypes[0] = PA_POINTER;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* arginfo handler in printf() for byte ranges
|
|
|
|
*/
|
|
|
|
static int print_bytes_arginfo(const struct printf_info *info, size_t n, int *argtypes)
|
|
|
|
{
|
|
|
|
if (n > 1)
|
|
|
|
{
|
|
|
|
argtypes[0] = PA_POINTER;
|
|
|
|
argtypes[1] = PA_INT;
|
|
|
|
}
|
|
|
|
return 2;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* register printf() handlers for chunk and byte ranges
|
|
|
|
*/
|
|
|
|
static void __attribute__ ((constructor))print_register()
|
|
|
|
{
|
|
|
|
register_printf_function(CHUNK_PRINTF_SPEC, print_chunk, print_chunk_arginfo);
|
|
|
|
register_printf_function(BYTES_PRINTF_SPEC, print_bytes, print_bytes_arginfo);
|
|
|
|
}
|
|
|
|
|
2006-04-10 08:07:38 +00:00
|
|
|
/**
|
|
|
|
* Described in header.
|
|
|
|
*/
|
|
|
|
void *clalloc(void * pointer, size_t size)
|
|
|
|
{
|
|
|
|
void *data;
|
|
|
|
data = malloc(size);
|
|
|
|
|
|
|
|
memcpy(data, pointer,size);
|
|
|
|
|
|
|
|
return (data);
|
|
|
|
}
|
2006-05-29 07:02:12 +00:00
|
|
|
|
2006-07-28 09:45:18 +00:00
|
|
|
/**
|
|
|
|
* We use a single mutex for all refcount variables. This
|
|
|
|
* is not optimal for performance, but the critical section
|
|
|
|
* is not that long...
|
|
|
|
* TODO: Consider to include a mutex in each refcount_t variable.
|
|
|
|
*/
|
|
|
|
static pthread_mutex_t ref_mutex = PTHREAD_MUTEX_INITIALIZER;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Described in header.
|
|
|
|
*
|
|
|
|
* TODO: May be implemented with atomic CPU instructions
|
|
|
|
* instead of a mutex.
|
|
|
|
*/
|
|
|
|
void ref_get(refcount_t *ref)
|
|
|
|
{
|
|
|
|
pthread_mutex_lock(&ref_mutex);
|
|
|
|
(*ref)++;
|
|
|
|
pthread_mutex_unlock(&ref_mutex);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Described in header.
|
|
|
|
*
|
|
|
|
* TODO: May be implemented with atomic CPU instructions
|
|
|
|
* instead of a mutex.
|
|
|
|
*/
|
|
|
|
bool ref_put(refcount_t *ref)
|
|
|
|
{
|
|
|
|
bool more_refs;
|
|
|
|
|
|
|
|
pthread_mutex_lock(&ref_mutex);
|
|
|
|
more_refs = --(*ref);
|
|
|
|
pthread_mutex_unlock(&ref_mutex);
|
|
|
|
return !more_refs;
|
|
|
|
}
|
|
|
|
|
2006-05-29 07:02:12 +00:00
|
|
|
/*
|
|
|
|
* Names of the months used by timetoa()
|
|
|
|
*/
|
|
|
|
static const char* months[] = {
|
|
|
|
"Jan", "Feb", "Mar", "Apr", "May", "Jun",
|
|
|
|
"Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Described in header file
|
|
|
|
*/
|
|
|
|
void timetoa(char *buf, size_t buflen, const time_t *time, bool utc)
|
|
|
|
{
|
|
|
|
if (*time == UNDEFINED_TIME)
|
|
|
|
snprintf(buf, buflen, "--- -- --:--:--%s----", (utc)?" UTC ":" ");
|
|
|
|
else
|
|
|
|
{
|
|
|
|
struct tm *t = (utc)? gmtime(time) : localtime(time);
|
|
|
|
|
|
|
|
snprintf(buf, buflen, "%s %02d %02d:%02d:%02d%s%04d",
|
|
|
|
months[t->tm_mon], t->tm_mday, t->tm_hour, t->tm_min, t->tm_sec,
|
|
|
|
(utc)?" UTC ":" ", t->tm_year + 1900);
|
|
|
|
}
|
|
|
|
}
|