summaryrefslogtreecommitdiff
path: root/src/array.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/array.c')
-rw-r--r--src/array.c398
1 files changed, 0 insertions, 398 deletions
diff --git a/src/array.c b/src/array.c
deleted file mode 100644
index 6d740f1a..00000000
--- a/src/array.c
+++ /dev/null
@@ -1,398 +0,0 @@
-#include <string.h>
-#include <stdio.h>
-#include <stdlib.h>
-#include <limits.h>
-
-#include <errno.h>
-#include <assert.h>
-
-#include "array.h"
-#include "buffer.h"
-
-array *array_init(void) {
- array *a;
-
- a = calloc(1, sizeof(*a));
- assert(a);
-
- a->next_power_of_2 = 1;
-
- return a;
-}
-
-array *array_init_array(array *src) {
- size_t i;
- array *a = array_init();
-
- a->used = src->used;
- a->size = src->size;
- a->next_power_of_2 = src->next_power_of_2;
- a->unique_ndx = src->unique_ndx;
-
- a->data = malloc(sizeof(*src->data) * src->size);
- for (i = 0; i < src->size; i++) {
- if (src->data[i]) a->data[i] = src->data[i]->copy(src->data[i]);
- else a->data[i] = NULL;
- }
-
- a->sorted = malloc(sizeof(*src->sorted) * src->size);
- memcpy(a->sorted, src->sorted, sizeof(*src->sorted) * src->size);
- return a;
-}
-
-void array_free(array *a) {
- size_t i;
- if (!a) return;
-
- if (!a->is_weakref) {
- for (i = 0; i < a->size; i++) {
- if (a->data[i]) a->data[i]->free(a->data[i]);
- }
- }
-
- if (a->data) free(a->data);
- if (a->sorted) free(a->sorted);
-
- free(a);
-}
-
-void array_reset(array *a) {
- size_t i;
- if (!a) return;
-
- if (!a->is_weakref) {
- for (i = 0; i < a->used; i++) {
- a->data[i]->reset(a->data[i]);
- }
- }
-
- a->used = 0;
-}
-
-data_unset *array_pop(array *a) {
- data_unset *du;
-
- assert(a->used != 0);
-
- a->used --;
- du = a->data[a->used];
- a->data[a->used] = NULL;
-
- return du;
-}
-
-static int array_get_index(array *a, const char *key, size_t keylen, int *rndx) {
- int ndx = -1;
- int i, pos = 0;
-
- if (key == NULL) return -1;
-
- /* try to find the string */
- for (i = pos = a->next_power_of_2 / 2; ; i >>= 1) {
- int cmp;
-
- if (pos < 0) {
- pos += i;
- } else if (pos >= (int)a->used) {
- pos -= i;
- } else {
- cmp = buffer_caseless_compare(key, keylen, a->data[a->sorted[pos]]->key->ptr, a->data[a->sorted[pos]]->key->used);
-
- if (cmp == 0) {
- /* found */
- ndx = a->sorted[pos];
- break;
- } else if (cmp < 0) {
- pos -= i;
- } else {
- pos += i;
- }
- }
- if (i == 0) break;
- }
-
- if (rndx) *rndx = pos;
-
- return ndx;
-}
-
-data_unset *array_get_element(array *a, const char *key, size_t keylen) {
- int ndx;
-
- if (-1 != (ndx = array_get_index(a, key, keylen + 1, NULL))) {
- /* found, leave here */
-
- return a->data[ndx];
- }
-
- return NULL;
-}
-
-data_unset *array_get_unused_element(array *a, data_type_t t) {
- data_unset *ds = NULL;
-
- UNUSED(t);
-
- if (a->size == 0) return NULL;
-
- if (a->used == a->size) return NULL;
-
- if (a->data[a->used]) {
- ds = a->data[a->used];
-
- a->data[a->used] = NULL;
- }
-
- return ds;
-}
-
-void array_set_key_value(array *hdrs, const char *key, size_t key_len, const char *value, size_t val_len) {
- data_string *ds_dst;
-
- if (NULL != (ds_dst = (data_string *)array_get_element(hdrs, key, key_len))) {
- buffer_copy_string_len(ds_dst->value, value, val_len);
- return;
- }
-
- if (NULL == (ds_dst = (data_string *)array_get_unused_element(hdrs, TYPE_STRING))) {
- ds_dst = data_string_init();
- }
-
- buffer_copy_string_len(ds_dst->key, key, key_len);
- buffer_copy_string_len(ds_dst->value, value, val_len);
- array_insert_unique(hdrs, (data_unset *)ds_dst);
-}
-
-void array_append_key_value(array *hdrs, const char *key, size_t key_len, const char *value, size_t val_len) {
- data_string *ds_dst;
-
- if (NULL == (ds_dst = (data_string *)array_get_unused_element(hdrs, TYPE_STRING))) {
- ds_dst = data_string_init();
- }
-
- buffer_copy_string_len(ds_dst->key, key, key_len);
- buffer_copy_string_len(ds_dst->value, value, val_len);
- array_insert_unique(hdrs, (data_unset *)ds_dst);
-}
-
-/* replace or insert data, return the old one with the same key */
-data_unset *array_replace(array *a, data_unset *du) {
- int ndx;
-
- if (-1 == (ndx = array_get_index(a, du->key->ptr, du->key->used, NULL))) {
- array_insert_unique(a, du);
- return NULL;
- } else {
- data_unset *old = a->data[ndx];
- a->data[ndx] = du;
- return old;
- }
-}
-
-int array_insert_unique(array *a, data_unset *str) {
- int ndx = -1;
- int pos = 0;
- size_t j;
-
- /* generate unique index if necessary */
- if (str->key->used == 0 || str->is_index_key) {
- buffer_copy_long(str->key, a->unique_ndx++);
- str->is_index_key = 1;
- }
-
- /* try to find the string */
- if (-1 != (ndx = array_get_index(a, str->key->ptr, str->key->used, &pos))) {
- /* found, leave here */
- if (a->data[ndx]->type == str->type) {
- str->insert_dup(a->data[ndx], str);
- } else {
- fprintf(stderr, "a\n");
- }
- return 0;
- }
-
- /* insert */
-
- if (a->used+1 > INT_MAX) {
- /* we can't handle more then INT_MAX entries: see array_get_index() */
- return -1;
- }
-
- if (a->size == 0) {
- a->size = 16;
- a->data = malloc(sizeof(*a->data) * a->size);
- a->sorted = malloc(sizeof(*a->sorted) * a->size);
- assert(a->data);
- assert(a->sorted);
- for (j = a->used; j < a->size; j++) a->data[j] = NULL;
- } else if (a->size == a->used) {
- a->size += 16;
- a->data = realloc(a->data, sizeof(*a->data) * a->size);
- a->sorted = realloc(a->sorted, sizeof(*a->sorted) * a->size);
- assert(a->data);
- assert(a->sorted);
- for (j = a->used; j < a->size; j++) a->data[j] = NULL;
- }
-
- ndx = (int) a->used;
-
- a->data[a->used++] = str;
-
- if (pos != ndx &&
- ((pos < 0) ||
- buffer_caseless_compare(str->key->ptr, str->key->used, a->data[a->sorted[pos]]->key->ptr, a->data[a->sorted[pos]]->key->used) > 0)) {
- pos++;
- }
-
- /* move everything one step to the right */
- if (pos != ndx) {
- memmove(a->sorted + (pos + 1), a->sorted + (pos), (ndx - pos) * sizeof(*a->sorted));
- }
-
- /* insert */
- a->sorted[pos] = ndx;
-
- if (a->next_power_of_2 == (size_t)ndx) a->next_power_of_2 <<= 1;
-
- return 0;
-}
-
-void array_print_indent(int depth) {
- int i;
- for (i = 0; i < depth; i ++) {
- fprintf(stdout, " ");
- }
-}
-
-size_t array_get_max_key_length(array *a) {
- size_t maxlen, i;
-
- maxlen = 0;
- for (i = 0; i < a->used; i ++) {
- data_unset *du = a->data[i];
- size_t len = strlen(du->key->ptr);
-
- if (len > maxlen) {
- maxlen = len;
- }
- }
- return maxlen;
-}
-
-int array_print(array *a, int depth) {
- size_t i;
- size_t maxlen;
- int oneline = 1;
-
- if (a->used > 5) {
- oneline = 0;
- }
- for (i = 0; i < a->used && oneline; i++) {
- data_unset *du = a->data[i];
- if (!du->is_index_key) {
- oneline = 0;
- break;
- }
- switch (du->type) {
- case TYPE_INTEGER:
- case TYPE_STRING:
- case TYPE_COUNT:
- break;
- default:
- oneline = 0;
- break;
- }
- }
- if (oneline) {
- fprintf(stdout, "(");
- for (i = 0; i < a->used; i++) {
- data_unset *du = a->data[i];
- if (i != 0) {
- fprintf(stdout, ", ");
- }
- du->print(du, depth + 1);
- }
- fprintf(stdout, ")");
- return 0;
- }
-
- maxlen = array_get_max_key_length(a);
- fprintf(stdout, "(\n");
- for (i = 0; i < a->used; i++) {
- data_unset *du = a->data[i];
- array_print_indent(depth + 1);
- if (!du->is_index_key) {
- int j;
-
- if (i && (i % 5) == 0) {
- fprintf(stdout, "# %zd\n", i);
- array_print_indent(depth + 1);
- }
- fprintf(stdout, "\"%s\"", du->key->ptr);
- for (j = maxlen - strlen(du->key->ptr); j > 0; j --) {
- fprintf(stdout, " ");
- }
- fprintf(stdout, " => ");
- }
- du->print(du, depth + 1);
- fprintf(stdout, ",\n");
- }
- if (!(i && (i - 1 % 5) == 0)) {
- array_print_indent(depth + 1);
- fprintf(stdout, "# %zd\n", i);
- }
- array_print_indent(depth);
- fprintf(stdout, ")");
-
- return 0;
-}
-
-#ifdef DEBUG_ARRAY
-int main (int argc, char **argv) {
- array *a;
- data_string *ds;
- data_count *dc;
-
- UNUSED(argc);
- UNUSED(argv);
-
- a = array_init();
-
- ds = data_string_init();
- buffer_copy_string_len(ds->key, CONST_STR_LEN("abc"));
- buffer_copy_string_len(ds->value, CONST_STR_LEN("alfrag"));
-
- array_insert_unique(a, (data_unset *)ds);
-
- ds = data_string_init();
- buffer_copy_string_len(ds->key, CONST_STR_LEN("abc"));
- buffer_copy_string_len(ds->value, CONST_STR_LEN("hameplman"));
-
- array_insert_unique(a, (data_unset *)ds);
-
- ds = data_string_init();
- buffer_copy_string_len(ds->key, CONST_STR_LEN("123"));
- buffer_copy_string_len(ds->value, CONST_STR_LEN("alfrag"));
-
- array_insert_unique(a, (data_unset *)ds);
-
- dc = data_count_init();
- buffer_copy_string_len(dc->key, CONST_STR_LEN("def"));
-
- array_insert_unique(a, (data_unset *)dc);
-
- dc = data_count_init();
- buffer_copy_string_len(dc->key, CONST_STR_LEN("def"));
-
- array_insert_unique(a, (data_unset *)dc);
-
- array_print(a, 0);
-
- array_free(a);
-
- fprintf(stderr, "%d\n",
- buffer_caseless_compare(CONST_STR_LEN("Content-Type"), CONST_STR_LEN("Content-type")));
-
- return 0;
-}
-#endif
View Lorry Controller Status