lighttpd
/
lighttpd1.4
2
0
Fork 0
Code Issues Releases Wiki Activity
lighttpd 1.4.x https://www.lighttpd.net/
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
2302 Commits
8 Branches
78 Tags
45 MiB
 
 
 
 
 
 
Tree: ac143ead29
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'ac143ead29'
${ noResults }
lighttpd1.4/src/buffer.c

1076 lines
28 KiB
Raw Blame History

#include "first.h"
#include "buffer.h"
#include <stdlib.h>
#include <string.h>
static const char hex_chars[] = "0123456789abcdef";
/**
* init the buffer
*
*/
buffer* buffer_init(void) {
buffer *b;
b = malloc(sizeof(*b));
force_assert(b);
b->ptr = NULL;
b->size = 0;
b->used = 0;
return b;
}
buffer *buffer_init_buffer(const buffer *src) {
buffer *b = buffer_init();
buffer_copy_buffer(b, src);
return b;
}
buffer *buffer_init_string(const char *str) {
buffer *b = buffer_init();
buffer_copy_string(b, str);
return b;
}
void buffer_free(buffer *b) {
if (NULL == b) return;
free(b->ptr);
free(b);
}
void buffer_reset(buffer *b) {
if (NULL == b) return;
/* limit don't reuse buffer larger than ... bytes */
if (b->size > BUFFER_MAX_REUSE_SIZE) {
free(b->ptr);
b->ptr = NULL;
b->size = 0;
} else if (b->size > 0) {
b->ptr[0] = '\0';
}
b->used = 0;
}
void buffer_move(buffer *b, buffer *src) {
buffer tmp;
if (NULL == b) {
buffer_reset(src);
return;
}
buffer_reset(b);
if (NULL == src) return;
tmp = *src; *src = *b; *b = tmp;
}
#define BUFFER_PIECE_SIZE 64
static size_t buffer_align_size(size_t size) {
size_t align = BUFFER_PIECE_SIZE - (size % BUFFER_PIECE_SIZE);
/* overflow on unsinged size_t is defined to wrap around */
if (size + align < size) return size;
return size + align;
}
/* make sure buffer is at least "size" big. discard old data */
static void buffer_alloc(buffer *b, size_t size) {
force_assert(NULL != b);
if (0 == size) size = 1;
if (size <= b->size) return;
if (NULL != b->ptr) free(b->ptr);
b->used = 0;
b->size = buffer_align_size(size);
b->ptr = malloc(b->size);
force_assert(NULL != b->ptr);
}
/* make sure buffer is at least "size" big. keep old data */
static void buffer_realloc(buffer *b, size_t size) {
force_assert(NULL != b);
if (0 == size) size = 1;
if (size <= b->size) return;
b->size = buffer_align_size(size);
b->ptr = realloc(b->ptr, b->size);
force_assert(NULL != b->ptr);
}
char* buffer_string_prepare_copy(buffer *b, size_t size) {
force_assert(NULL != b);
force_assert(size + 1 > size);
buffer_alloc(b, size + 1);
b->used = 1;
b->ptr[0] = '\0';
return b->ptr;
}
char* buffer_string_prepare_append(buffer *b, size_t size) {
force_assert(NULL != b);
if (buffer_string_is_empty(b)) {
return buffer_string_prepare_copy(b, size);
} else {
size_t req_size = b->used + size;
/* not empty, b->used already includes a terminating 0 */
force_assert(req_size >= b->used);
/* check for overflow: unsigned overflow is defined to wrap around */
force_assert(req_size >= b->used);
buffer_realloc(b, req_size);
return b->ptr + b->used - 1;
}
}
void buffer_string_set_length(buffer *b, size_t len) {
force_assert(NULL != b);
force_assert(len + 1 > len);
buffer_realloc(b, len + 1);
b->used = len + 1;
b->ptr[len] = '\0';
}
void buffer_commit(buffer *b, size_t size)
{
force_assert(NULL != b);
force_assert(b->size > 0);
if (0 == b->used) b->used = 1;
if (size > 0) {
/* check for overflow: unsigned overflow is defined to wrap around */
force_assert(b->used + size > b->used);
force_assert(b->used + size <= b->size);
b->used += size;
}
b->ptr[b->used - 1] = '\0';
}
void buffer_copy_string(buffer *b, const char *s) {
buffer_copy_string_len(b, s, NULL != s ? strlen(s) : 0);
}
void buffer_copy_string_len(buffer *b, const char *s, size_t s_len) {
force_assert(NULL != b);
force_assert(NULL != s || s_len == 0);
buffer_string_prepare_copy(b, s_len);
if (0 != s_len) memcpy(b->ptr, s, s_len);
buffer_commit(b, s_len);
}
void buffer_copy_buffer(buffer *b, const buffer *src) {
if (NULL == src || 0 == src->used) {
buffer_string_prepare_copy(b, 0);
b->used = 0; /* keep special empty state for now */
} else {
buffer_copy_string_len(b, src->ptr, buffer_string_length(src));
}
}
void buffer_append_string(buffer *b, const char *s) {
buffer_append_string_len(b, s, NULL != s ? strlen(s) : 0);
}
/**
* append a string to the end of the buffer
*
* the resulting buffer is terminated with a '\0'
* s is treated as a un-terminated string (a \0 is handled a normal character)
*
* @param b a buffer
* @param s the string
* @param s_len size of the string (without the terminating \0)
*/
void buffer_append_string_len(buffer *b, const char *s, size_t s_len) {
char *target_buf;
force_assert(NULL != b);
force_assert(NULL != s || s_len == 0);
target_buf = buffer_string_prepare_append(b, s_len);
if (0 == s_len) return; /* nothing to append */
memcpy(target_buf, s, s_len);
buffer_commit(b, s_len);
}
void buffer_append_string_buffer(buffer *b, const buffer *src) {
if (NULL == src) {
buffer_append_string_len(b, NULL, 0);
} else {
buffer_append_string_len(b, src->ptr, buffer_string_length(src));
}
}
void buffer_append_uint_hex(buffer *b, uintmax_t value) {
char *buf;
int shift = 0;
{
uintmax_t copy = value;
do {
copy >>= 8;
shift += 2; /* counting nibbles (4 bits) */
} while (0 != copy);
}
buf = buffer_string_prepare_append(b, shift);
buffer_commit(b, shift); /* will fill below */
shift <<= 2; /* count bits now */
while (shift > 0) {
shift -= 4;
*(buf++) = hex_chars[(value >> shift) & 0x0F];
}
}
static char* utostr(char * const buf_end, uintmax_t val) {
char *cur = buf_end;
do {
int mod = val % 10;
val /= 10;
/* prepend digit mod */
*(--cur) = (char) ('0' + mod);
} while (0 != val);
return cur;
}
static char* itostr(char * const buf_end, intmax_t val) {
/* absolute value not defined for INTMAX_MIN, but can take absolute
* value of any negative number via twos complement cast to unsigned.
* negative sign is prepended after (now unsigned) value is converted
* to string */
uintmax_t uval = val >= 0 ? (uintmax_t)val : ((uintmax_t)~val) + 1;
char *cur = utostr(buf_end, uval);
if (val < 0) *(--cur) = '-';
return cur;
}
void buffer_append_int(buffer *b, intmax_t val) {
char buf[LI_ITOSTRING_LENGTH];
char* const buf_end = buf + sizeof(buf);
char *str;
force_assert(NULL != b);
str = itostr(buf_end, val);
force_assert(buf_end > str && str >= buf);
buffer_append_string_len(b, str, buf_end - str);
}
void buffer_copy_int(buffer *b, intmax_t val) {
force_assert(NULL != b);
b->used = 0;
buffer_append_int(b, val);
}
void buffer_append_strftime(buffer *b, const char *format, const struct tm *tm) {
size_t r;
char* buf;
force_assert(NULL != b);
force_assert(NULL != tm);
if (NULL == format || '\0' == format[0]) {
/* empty format */
buffer_string_prepare_append(b, 0);
return;
}
buf = buffer_string_prepare_append(b, 255);
r = strftime(buf, buffer_string_space(b), format, tm);
/* 0 (in some apis buffer_string_space(b)) signals the string may have
* been too small; but the format could also just have lead to an empty
* string
*/
if (0 == r || r >= buffer_string_space(b)) {
/* give it a second try with a larger string */
buf = buffer_string_prepare_append(b, 4095);
r = strftime(buf, buffer_string_space(b), format, tm);
}
if (r >= buffer_string_space(b)) r = 0;
buffer_commit(b, r);
}
void li_itostrn(char *buf, size_t buf_len, intmax_t val) {
char p_buf[LI_ITOSTRING_LENGTH];
char* const p_buf_end = p_buf + sizeof(p_buf);
char* str = p_buf_end - 1;
*str = '\0';
str = itostr(str, val);
force_assert(p_buf_end > str && str >= p_buf);
force_assert(buf_len >= (size_t) (p_buf_end - str));
memcpy(buf, str, p_buf_end - str);
}
void li_utostrn(char *buf, size_t buf_len, uintmax_t val) {
char p_buf[LI_ITOSTRING_LENGTH];
char* const p_buf_end = p_buf + sizeof(p_buf);
char* str = p_buf_end - 1;
*str = '\0';
str = utostr(str, val);
force_assert(p_buf_end > str && str >= p_buf);
force_assert(buf_len >= (size_t) (p_buf_end - str));
memcpy(buf, str, p_buf_end - str);
}
char int2hex(char c) {
return hex_chars[(c & 0x0F)];
}
/* converts hex char (0-9, A-Z, a-z) to decimal.
* returns 0xFF on invalid input.
*/
char hex2int(unsigned char hex) {
unsigned char value = hex - '0';
if (value > 9) {
hex |= 0x20; /* to lower case */
value = hex - 'a' + 10;
if (value < 10) value = 0xff;
}
if (value > 15) value = 0xff;
return value;
}
/**
* check if two buffer contain the same data
*
* HISTORY: this function was pretty much optimized, but didn't handled
* alignment properly.
*/
int buffer_is_equal(const buffer *a, const buffer *b) {
force_assert(NULL != a && NULL != b);
if (a->used != b->used) return 0;
if (a->used == 0) return 1;
return (0 == memcmp(a->ptr, b->ptr, a->used));
}
int buffer_is_equal_string(const buffer *a, const char *s, size_t b_len) {
force_assert(NULL != a && NULL != s);
force_assert(b_len + 1 > b_len);
if (a->used != b_len + 1) return 0;
if (0 != memcmp(a->ptr, s, b_len)) return 0;
if ('\0' != a->ptr[a->used-1]) return 0;
return 1;
}
/* buffer_is_equal_caseless_string(b, CONST_STR_LEN("value")) */
int buffer_is_equal_caseless_string(const buffer *a, const char *s, size_t b_len) {
force_assert(NULL != a);
if (a->used != b_len + 1) return 0;
force_assert('\0' == a->ptr[a->used - 1]);
return (0 == strcasecmp(a->ptr, s));
}
int buffer_caseless_compare(const char *a, size_t a_len, const char *b, size_t b_len) {
size_t const len = (a_len < b_len) ? a_len : b_len;
size_t i;
for (i = 0; i < len; ++i) {
unsigned char ca = a[i], cb = b[i];
if (ca == cb) continue;
/* always lowercase for transitive results */
if (ca >= 'A' && ca <= 'Z') ca |= 32;
if (cb >= 'A' && cb <= 'Z') cb |= 32;
if (ca == cb) continue;
return ((int)ca) - ((int)cb);
}
if (a_len == b_len) return 0;
return a_len < b_len ? -1 : 1;
}
int buffer_is_equal_right_len(const buffer *b1, const buffer *b2, size_t len) {
/* no len -> equal */
if (len == 0) return 1;
/* len > 0, but empty buffers -> not equal */
if (b1->used == 0 || b2->used == 0) return 0;
/* buffers too small -> not equal */
if (b1->used - 1 < len || b2->used - 1 < len) return 0;
return 0 == memcmp(b1->ptr + b1->used - 1 - len, b2->ptr + b2->used - 1 - len, len);
}
void li_tohex(char *buf, size_t buf_len, const char *s, size_t s_len) {
size_t i;
force_assert(2 * s_len > s_len);
force_assert(2 * s_len < buf_len);
for (i = 0; i < s_len; i++) {
buf[2*i] = hex_chars[(s[i] >> 4) & 0x0F];
buf[2*i+1] = hex_chars[s[i] & 0x0F];
}
buf[2*s_len] = '\0';
}
void buffer_copy_string_hex(buffer *b, const char *in, size_t in_len) {
/* overflow protection */
force_assert(in_len * 2 > in_len);
buffer_string_set_length(b, 2 * in_len);
li_tohex(b->ptr, buffer_string_length(b)+1, in, in_len);
}
/* everything except: ! ( ) * - . 0-9 A-Z _ a-z */
static const char encoded_chars_rel_uri_part[] = {
/*
0 1 2 3 4 5 6 7 8 9 A B C D E F
*/
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 00 - 0F control chars */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 10 - 1F */
1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, /* 20 - 2F space " # $ % & ' + , / */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, /* 30 - 3F : ; < = > ? */
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 40 - 4F @ */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, /* 50 - 5F [ \ ] ^ */
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 60 - 6F ` */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, /* 70 - 7F { | } DEL */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 80 - 8F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 90 - 9F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* A0 - AF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* B0 - BF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* C0 - CF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* D0 - DF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* E0 - EF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* F0 - FF */
};
/* everything except: ! ( ) * - . / 0-9 A-Z _ a-z */
static const char encoded_chars_rel_uri[] = {
/*
0 1 2 3 4 5 6 7 8 9 A B C D E F
*/
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 00 - 0F control chars */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 10 - 1F */
1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, /* 20 - 2F space " # $ % & ' + , */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, /* 30 - 3F : ; < = > ? */
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 40 - 4F @ */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, /* 50 - 5F [ \ ] ^ */
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 60 - 6F ` */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, /* 70 - 7F { | } DEL */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 80 - 8F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 90 - 9F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* A0 - AF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* B0 - BF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* C0 - CF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* D0 - DF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* E0 - EF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* F0 - FF */
};
static const char encoded_chars_html[] = {
/*
0 1 2 3 4 5 6 7 8 9 A B C D E F
*/
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 00 - 0F control chars */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 10 - 1F */
0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, /* 20 - 2F " & ' */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, /* 30 - 3F < > */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 40 - 4F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 50 - 5F */
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 60 - 6F ` */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, /* 70 - 7F DEL */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 80 - 8F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 90 - 9F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* A0 - AF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* B0 - BF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* C0 - CF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* D0 - DF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* E0 - EF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* F0 - FF */
};
static const char encoded_chars_minimal_xml[] = {
/*
0 1 2 3 4 5 6 7 8 9 A B C D E F
*/
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 00 - 0F control chars */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 10 - 1F */
0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, /* 20 - 2F " & ' */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, /* 30 - 3F < > */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 40 - 4F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 50 - 5F */
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 60 - 6F ` */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, /* 70 - 7F DEL */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 80 - 8F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 90 - 9F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* A0 - AF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* B0 - BF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* C0 - CF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* D0 - DF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* E0 - EF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* F0 - FF */
};
static const char encoded_chars_hex[] = {
/*
0 1 2 3 4 5 6 7 8 9 A B C D E F
*/
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 00 - 0F control chars */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 10 - 1F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 20 - 2F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 30 - 3F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 40 - 4F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 50 - 5F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 60 - 6F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 70 - 7F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 80 - 8F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 90 - 9F */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* A0 - AF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* B0 - BF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* C0 - CF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* D0 - DF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* E0 - EF */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* F0 - FF */
};
static const char encoded_chars_http_header[] = {
/*
0 1 2 3 4 5 6 7 8 9 A B C D E F
*/
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, /* 00 - 0F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 10 - 1F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 20 - 2F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 30 - 3F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 40 - 4F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 50 - 5F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 60 - 6F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 70 - 7F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 80 - 8F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 90 - 9F */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* A0 - AF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* B0 - BF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* C0 - CF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* D0 - DF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* E0 - EF */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* F0 - FF */
};
void buffer_append_string_encoded(buffer *b, const char *s, size_t s_len, buffer_encoding_t encoding) {
unsigned char *ds, *d;
size_t d_len, ndx;
const char *map = NULL;
force_assert(NULL != b);
force_assert(NULL != s || 0 == s_len);
if (0 == s_len) return;
switch(encoding) {
case ENCODING_REL_URI:
map = encoded_chars_rel_uri;
break;
case ENCODING_REL_URI_PART:
map = encoded_chars_rel_uri_part;
break;
case ENCODING_HTML:
map = encoded_chars_html;
break;
case ENCODING_MINIMAL_XML:
map = encoded_chars_minimal_xml;
break;
case ENCODING_HEX:
map = encoded_chars_hex;
break;
case ENCODING_HTTP_HEADER:
map = encoded_chars_http_header;
break;
}
force_assert(NULL != map);
/* count to-be-encoded-characters */
for (ds = (unsigned char *)s, d_len = 0, ndx = 0; ndx < s_len; ds++, ndx++) {
if (map[*ds]) {
switch(encoding) {
case ENCODING_REL_URI:
case ENCODING_REL_URI_PART:
d_len += 3;
break;
case ENCODING_HTML:
case ENCODING_MINIMAL_XML:
d_len += 6;
break;
case ENCODING_HTTP_HEADER:
case ENCODING_HEX:
d_len += 2;
break;
}
} else {
d_len++;
}
}
d = (unsigned char*) buffer_string_prepare_append(b, d_len);
buffer_commit(b, d_len); /* fill below */
force_assert('\0' == *d);
for (ds = (unsigned char *)s, d_len = 0, ndx = 0; ndx < s_len; ds++, ndx++) {
if (map[*ds]) {
switch(encoding) {
case ENCODING_REL_URI:
case ENCODING_REL_URI_PART:
d[d_len++] = '%';
d[d_len++] = hex_chars[((*ds) >> 4) & 0x0F];
d[d_len++] = hex_chars[(*ds) & 0x0F];
break;
case ENCODING_HTML:
case ENCODING_MINIMAL_XML:
d[d_len++] = '&';
d[d_len++] = '#';
d[d_len++] = 'x';
d[d_len++] = hex_chars[((*ds) >> 4) & 0x0F];
d[d_len++] = hex_chars[(*ds) & 0x0F];
d[d_len++] = ';';
break;
case ENCODING_HEX:
d[d_len++] = hex_chars[((*ds) >> 4) & 0x0F];
d[d_len++] = hex_chars[(*ds) & 0x0F];
break;
case ENCODING_HTTP_HEADER:
d[d_len++] = *ds;
d[d_len++] = '\t';
break;
}
} else {
d[d_len++] = *ds;
}
}
}
void buffer_append_string_c_escaped(buffer *b, const char *s, size_t s_len) {
unsigned char *ds, *d;
size_t d_len, ndx;
force_assert(NULL != b);
force_assert(NULL != s || 0 == s_len);
if (0 == s_len) return;
/* count to-be-encoded-characters */
for (ds = (unsigned char *)s, d_len = 0, ndx = 0; ndx < s_len; ds++, ndx++) {
if ((*ds < 0x20) /* control character */
|| (*ds >= 0x7f)) { /* DEL + non-ASCII characters */
switch (*ds) {
case '\t':
case '\r':
case '\n':
d_len += 2;
break;
default:
d_len += 4; /* \xCC */
break;
}
} else {
d_len++;
}
}
d = (unsigned char*) buffer_string_prepare_append(b, d_len);
buffer_commit(b, d_len); /* fill below */
force_assert('\0' == *d);
for (ds = (unsigned char *)s, d_len = 0, ndx = 0; ndx < s_len; ds++, ndx++) {
if ((*ds < 0x20) /* control character */
|| (*ds >= 0x7f)) { /* DEL + non-ASCII characters */
d[d_len++] = '\\';
switch (*ds) {
case '\t':
d[d_len++] = 't';
break;
case '\r':
d[d_len++] = 'r';
break;
case '\n':
d[d_len++] = 'n';
break;
default:
d[d_len++] = 'x';
d[d_len++] = hex_chars[((*ds) >> 4) & 0x0F];
d[d_len++] = hex_chars[(*ds) & 0x0F];
break;
}
} else {
d[d_len++] = *ds;
}
}
}
void buffer_copy_string_encoded_cgi_varnames(buffer *b, const char *s, size_t s_len, int is_http_header) {
size_t i, j;
force_assert(NULL != b);
force_assert(NULL != s || 0 == s_len);
buffer_reset(b);
if (is_http_header && NULL != s && 0 != strcasecmp(s, "CONTENT-TYPE")) {
buffer_string_prepare_append(b, s_len + 5);
buffer_copy_string_len(b, CONST_STR_LEN("HTTP_"));
} else {
buffer_string_prepare_append(b, s_len);
}
j = buffer_string_length(b);
for (i = 0; i < s_len; ++i) {
unsigned char cr = s[i];
if (light_isalpha(cr)) {
/* upper-case */
cr &= ~32;
} else if (!light_isdigit(cr)) {
cr = '_';
}
b->ptr[j++] = cr;
}
b->used = j;
b->ptr[b->used++] = '\0';
}
/* decodes url-special-chars inplace.
* replaces non-printable characters with '_'
*/
static void buffer_urldecode_internal(buffer *url, int is_query) {
unsigned char high, low;
char *src;
char *dst;
force_assert(NULL != url);
if (buffer_string_is_empty(url)) return;
force_assert('\0' == url->ptr[url->used-1]);
src = (char*) url->ptr;
while ('\0' != *src) {
if ('%' == *src) break;
if (is_query && '+' == *src) *src = ' ';
src++;
}
dst = src;
while ('\0' != *src) {
if (is_query && *src == '+') {
*dst = ' ';
} else if (*src == '%') {
*dst = '%';
high = hex2int(*(src + 1));
if (0xFF != high) {
low = hex2int(*(src + 2));
if (0xFF != low) {
high = (high << 4) | low;
/* map control-characters out */
if (high < 32 || high == 127) high = '_';
*dst = high;
src += 2;
}
}
} else {
*dst = *src;
}
dst++;
src++;
}
*dst = '\0';
url->used = (dst - url->ptr) + 1;
}
void buffer_urldecode_path(buffer *url) {
buffer_urldecode_internal(url, 0);
}
void buffer_urldecode_query(buffer *url) {
buffer_urldecode_internal(url, 1);
}
/* - special case: empty string returns empty string
* - on windows or cygwin: replace \ with /
* - strip leading spaces
* - prepends "/" if not present already
* - resolve "/../", "//" and "/./" the usual way:
* the first one removes a preceding component, the other two
* get compressed to "/".
* - "/." and "/.." at the end are similar, but always leave a trailing
* "/"
*
* /blah/.. gets /
* /blah/../foo gets /foo
* /abc/./xyz gets /abc/xyz
* /abc//xyz gets /abc/xyz
*
* NOTE: src and dest can point to the same buffer, in which case,
* the operation is performed in-place.
*/
void buffer_path_simplify(buffer *dest, buffer *src)
{
/* current character, the one before, and the one before that from input */
char c, pre1, pre2;
char *start, *slash, *walk, *out;
force_assert(NULL != dest && NULL != src);
if (buffer_string_is_empty(src)) {
buffer_string_prepare_copy(dest, 0);
return;
}
force_assert('\0' == src->ptr[src->used-1]);
/* might need one character more for the '/' prefix */
if (src == dest) {
buffer_string_prepare_append(dest, 1);
} else {
buffer_string_prepare_copy(dest, buffer_string_length(src) + 1);
}
#if defined(__WIN32) || defined(__CYGWIN__)
/* cygwin is treating \ and / the same, so we have to that too */
{
char *p;
for (p = src->ptr; *p; p++) {
if (*p == '\\') *p = '/';
}
}
#endif
walk = src->ptr;
start = dest->ptr;
out = dest->ptr;
slash = dest->ptr;
/* skip leading spaces */
while (*walk == ' ') {
walk++;
}
pre1 = 0;
c = *(walk++);
/* prefix with '/' if not already present */
if (c != '/') {
pre1 = '/';
*(out++) = '/';
}
while (c != '\0') {
/* assert((src != dest || out <= walk) && slash <= out); */
/* the following comments about out and walk are only interesting if
* src == dest; otherwise the memory areas don't overlap anyway.
*/
pre2 = pre1;
pre1 = c;
/* possibly: out == walk - need to read first */
c = *walk;
*out = pre1;
out++;
walk++;
/* (out <= walk) still true; also now (slash < out) */
if (c == '/' || c == '\0') {
const size_t toklen = out - slash;
if (toklen == 3 && pre2 == '.' && pre1 == '.') {
/* "/../" or ("/.." at end of string) */
out = slash;
/* if there is something before "/..", there is at least one
* component, which needs to be removed */
if (out > start) {
out--;
while (out > start && *out != '/') out--;
}
/* don't kill trailing '/' at end of path */
if (c == '\0') out++;
/* slash < out before, so out_new <= slash + 1 <= out_before <= walk */
} else if (toklen == 1 || (pre2 == '/' && pre1 == '.')) {
/* "//" or "/./" or (("/" or "/.") at end of string) */
out = slash;
/* don't kill trailing '/' at end of path */
if (c == '\0') out++;
/* slash < out before, so out_new <= slash + 1 <= out_before <= walk */
}
slash = out;
}
}
buffer_string_set_length(dest, out - start);
}
int light_isdigit(int c) {
return (c >= '0' && c <= '9');
}
int light_isxdigit(int c) {
if (light_isdigit(c)) return 1;
c |= 32;
return (c >= 'a' && c <= 'f');
}
int light_isalpha(int c) {
c |= 32;
return (c >= 'a' && c <= 'z');
}
int light_isalnum(int c) {
return light_isdigit(c) || light_isalpha(c);
}
void buffer_to_lower(buffer *b) {
size_t i;
for (i = 0; i < b->used; ++i) {
char c = b->ptr[i];
if (c >= 'A' && c <= 'Z') b->ptr[i] |= 0x20;
}
}
void buffer_to_upper(buffer *b) {
size_t i;
for (i = 0; i < b->used; ++i) {
char c = b->ptr[i];
if (c >= 'A' && c <= 'Z') b->ptr[i] &= ~0x20;
}
}
#include <stdio.h>
#ifdef HAVE_LIBUNWIND
# define UNW_LOCAL_ONLY
# include <libunwind.h>
static void print_backtrace(FILE *file) {
unw_cursor_t cursor;
unw_context_t context;
int ret;
unsigned int frame = 0;
if (0 != (ret = unw_getcontext(&context))) goto error;
if (0 != (ret = unw_init_local(&cursor, &context))) goto error;
fprintf(file, "Backtrace:\n");
while (0 < (ret = unw_step(&cursor))) {
unw_word_t proc_ip = 0;
unw_proc_info_t procinfo;
char procname[256];
unw_word_t proc_offset = 0;
if (0 != (ret = unw_get_reg(&cursor, UNW_REG_IP, &proc_ip))) goto error;
if (0 == proc_ip) {
/* without an IP the other functions are useless; unw_get_proc_name would return UNW_EUNSPEC */
++frame;
fprintf(file, "%u: (nil)\n", frame);
continue;
}
if (0 != (ret = unw_get_proc_info(&cursor, &procinfo))) goto error;
if (0 != (ret = unw_get_proc_name(&cursor, procname, sizeof(procname), &proc_offset))) {
switch (-ret) {
case UNW_ENOMEM:
memset(procname + sizeof(procname) - 4, '.', 3);
procname[sizeof(procname) - 1] = '\0';
break;
case UNW_ENOINFO:
procname[0] = '?';
procname[1] = '\0';
proc_offset = 0;
break;
default:
snprintf(procname, sizeof(procname), "?? (unw_get_proc_name error %d)", -ret);
break;
}
}
++frame;
fprintf(file, "%u: %s (+0x%x) [%p]\n",
frame,
procname,
(unsigned int) proc_offset,
(void*)(uintptr_t)proc_ip);
}
if (0 != ret) goto error;
return;
error:
fprintf(file, "Error while generating backtrace: unwind error %i\n", (int) -ret);
}
#else
static void print_backtrace(FILE *file) {
UNUSED(file);
}
#endif
void log_failed_assert(const char *filename, unsigned int line, const char *msg) {
/* can't use buffer here; could lead to recursive assertions */
fprintf(stderr, "%s.%u: %s\n", filename, line, msg);
print_backtrace(stderr);
fflush(stderr);
abort();
}