3 Part of the swftools package.
5 Copyright (c) 2001,2002,2003,2004 Matthias Kramm <kramm@quiss.org>
7 This program is rfx_free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the rfx_free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the rfx_free Software
19 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
31 // ------------------------------- malloc, alloc routines ---------------------
34 char* strdup_n(const char*str, int size)
36 char*m = (char*)rfx_alloc(size+1);
42 char*qstrdup(const char*string)
44 return strdup(string);
46 char*qstrndup(const char*string, int len)
48 return strdup_n(string, len);
51 // ------------------------------- mem_t --------------------------------------
53 void mem_init(mem_t*mem)
55 memset(mem, 0, sizeof(mem_t));
57 void mem_clear(mem_t*mem)
59 rfx_free(mem->buffer);mem->buffer = 0;
61 void mem_destroy(mem_t*mem)
66 static int mem_put_(mem_t*m,const void*data, int length, int null)
69 m->pos += length + (null?1:0);
71 m->len = (m->pos+63)&~63;
72 m->buffer = m->buffer?(char*)rfx_realloc(m->buffer,m->len):(char*)rfx_alloc(m->len);
74 assert(n+length <= m->len);
75 memcpy(&m->buffer[n], data, length);
77 m->buffer[n + length] = 0;
80 int mem_put(mem_t*m,void*data, int length)
82 return mem_put_(m, data, length, 0);
84 int mem_putstring(mem_t*m,string_t str)
86 return mem_put_(m, str.str, str.len, 1);
89 // ------------------------------- ringbuffer_t -------------------------------
91 typedef struct _ringbuffer_internal_t
97 } ringbuffer_internal_t;
99 void ringbuffer_init(ringbuffer_t*r)
101 ringbuffer_internal_t*i = (ringbuffer_internal_t*)rfx_calloc(sizeof(ringbuffer_internal_t));
102 memset(r, 0, sizeof(ringbuffer_t));
104 i->buffer = (unsigned char*)rfx_alloc(1024);
105 i->buffersize = 1024;
107 int ringbuffer_read(ringbuffer_t*r, void*buf, int len)
109 unsigned char* data = (unsigned char*)buf;
110 ringbuffer_internal_t*i = (ringbuffer_internal_t*)r->internal;
111 if(r->available < len)
115 if(i->readpos + len > i->buffersize) {
116 int read1 = i->buffersize-i->readpos;
117 memcpy(data, &i->buffer[i->readpos], read1);
118 memcpy(&data[read1], &i->buffer[0], len - read1);
119 i->readpos = len - read1;
121 memcpy(data, &i->buffer[i->readpos], len);
123 i->readpos %= i->buffersize;
128 void ringbuffer_put(ringbuffer_t*r, void*buf, int len)
130 unsigned char* data = (unsigned char*)buf;
131 ringbuffer_internal_t*i = (ringbuffer_internal_t*)r->internal;
133 if(i->buffersize - r->available < len)
136 int newbuffersize = i->buffersize;
137 int oldavailable = r->available;
138 newbuffersize*=3;newbuffersize/=2; /*grow at least by 50% each time */
140 if(newbuffersize < r->available + len)
141 newbuffersize = r->available + len + 1024;
143 buf2 = (unsigned char*)rfx_alloc(newbuffersize);
144 ringbuffer_read(r, buf2, r->available);
147 i->buffersize = newbuffersize;
149 i->writepos = oldavailable;
150 r->available = oldavailable;
152 if(i->writepos + len > i->buffersize) {
153 int read1 = i->buffersize-i->writepos;
154 memcpy(&i->buffer[i->writepos], data, read1);
155 memcpy(&i->buffer[0], &data[read1], len - read1);
156 i->writepos = len - read1;
158 memcpy(&i->buffer[i->writepos], data, len);
160 i->writepos %= i->buffersize;
164 void ringbuffer_clear(ringbuffer_t*r)
166 ringbuffer_internal_t*i = (ringbuffer_internal_t*)r->internal;
167 rfx_free(i->buffer);i->buffer = 0;
171 // ------------------------------- heap_t -------------------------------
173 void heap_init(heap_t*h,int n,int elem_size, int(*compare)(const void *, const void *))
175 memset(h, 0, sizeof(heap_t));
178 h->elem_size = elem_size;
179 h->compare = compare;
180 h->elements = (void**)rfx_calloc(n*sizeof(void*));
181 h->data = (char*)rfx_calloc(h->max_size*h->elem_size);
183 void heap_clear(heap_t*h)
185 rfx_free(h->elements);
189 #define HEAP_NODE_SMALLER(h,node1,node2) ((h)->compare((node1),(node2))>0)
191 static void up(heap_t*h, int node)
193 void*node_p = h->elements[node];
199 h->elements[node] = h->elements[parent];
200 } while(HEAP_NODE_SMALLER(h,h->elements[parent], node_p));
202 h->elements[node] = node_p;
204 static void down(heap_t*h, int node)
206 void*node_p = h->elements[node];
211 /* determine new child's position */
215 if(child+1 < h->size && HEAP_NODE_SMALLER(h,h->elements[child],h->elements[child+1])) // search for bigger child
218 h->elements[node] = h->elements[child];
219 } while(HEAP_NODE_SMALLER(h,node_p, h->elements[child]));
221 h->elements[node] = node_p;
223 void heap_put(heap_t*h, void*e)
226 memcpy(&h->data[pos*h->elem_size],e,h->elem_size);
227 h->elements[pos] = &h->data[pos];
230 int heap_size(heap_t*h)
234 void* heap_max(heap_t*h)
236 return h->elements[0];
238 void* heap_chopmax(heap_t*h)
240 void*p = h->elements[0];
241 h->elements[0] = h->elements[--h->size];
245 void heap_dump(heap_t*h, FILE*fi)
248 for(t=0;t<h->size;t++) {
250 for(s=0;s<=t;s=(s+1)*2-1) {
251 if(s==t) fprintf(fi,"\n");
253 //fprintf(fi,"%d ", h->elements[t]->x); //?
256 void** heap_flatten(heap_t*h)
258 void**nodes = (void**)rfx_alloc(h->size*sizeof(void*));
262 /*printf("Heap Size: %d\n", h->size);
263 heap_print(stdout, h);
265 *p++ = heap_chopmax(h);
270 // ------------------------------- crc32 --------------------------------------
271 static unsigned int*crc32 = 0;
272 static void crc32_init(void)
277 crc32= (unsigned int*)rfx_alloc(sizeof(unsigned int)*256);
278 for(t=0; t<256; t++) {
281 for (s = 0; s < 8; s++) {
282 c = (0xedb88320L*(c&1)) ^ (c >> 1);
287 // ------------------------------- string_t -----------------------------------
289 void string_set2(string_t*str, const char*text, int len)
294 void string_set(string_t*str, const char*text)
297 str->len = strlen(text);
303 string_t string_new(const char*text, int len)
310 string_t string_new2(const char*text)
314 s.len = strlen(text);
321 char* string_cstr(string_t*str)
323 return strdup_n(str->str, str->len);
325 unsigned int string_hash(string_t*str)
328 unsigned int checksum = 0;
331 for(t=0;t<str->len;t++) {
332 checksum = checksum>>8 ^ crc32[(str->str[t]^checksum)&0xff];
336 unsigned int string_hash2(const char*str)
338 unsigned int checksum = 0;
343 checksum = checksum>>8 ^ crc32[(*p^checksum)&0xff];
348 unsigned int string_hash3(const char*str, int len)
353 return string_hash(&s);
355 void string_dup2(string_t*str, const char*text, int len)
358 str->str = strdup_n(text, len);
360 void string_dup(string_t*str, const char*text)
362 str->len = strlen(text);
363 str->str = strdup(text);
365 int string_equals(string_t*str, const char*text)
367 int l = strlen(text);
368 if(str->len == l && !memcmp(str->str, text, l))
372 int string_equals2(string_t*str, string_t*str2)
374 if(str->len == str2->len && !memcmp(str->str, str2->str, str->len))
379 // ------------------------------- stringarray_t ------------------------------
381 typedef struct _stringlist {
383 struct _stringlist*next;
386 typedef struct _stringarray_internal_t
392 } stringarray_internal_t;
394 void stringarray_init(stringarray_t*sa, int hashsize)
396 stringarray_internal_t*s;
398 sa->internal = (stringarray_internal_t*)rfx_calloc(sizeof(stringarray_internal_t));
399 s = (stringarray_internal_t*)sa->internal;
401 s->hash = rfx_calloc(sizeof(stringlist_t*)*hashsize);
402 s->hashsize = hashsize;
404 void stringarray_put(stringarray_t*sa, string_t str)
406 stringarray_internal_t*s = (stringarray_internal_t*)sa->internal;
408 int hash = string_hash(&str) % s->hashsize;
410 char*ss = string_cstr(&str);
411 mem_put(&s->pos, &ss, sizeof(char*));
413 stringlist_t*l = rfx_alloc(sizeof(stringlist_t));
415 l->next = s->hash[hash];
420 char* stringarray_at(stringarray_t*sa, int pos)
422 stringarray_internal_t*s = (stringarray_internal_t*)sa->internal;
424 if(pos<0 || pos>=s->num)
426 p = *(char**)&s->pos.buffer[pos*sizeof(char*)];
431 string_t stringarray_at2(stringarray_t*sa, int pos)
434 s.str = stringarray_at(sa, pos);
435 s.len = s.str?strlen(s.str):0;
438 static stringlist_t* stringlist_del(stringarray_t*sa, stringlist_t*l, int index)
441 stringlist_t*old = l;
443 if(index==l->index) {
445 memset(l, 0, sizeof(stringlist_t));
455 fprintf(stderr, "Internal error: did not find string %d in hash\n", index);
459 void stringarray_del(stringarray_t*sa, int pos)
461 stringarray_internal_t*s = (stringarray_internal_t*)sa->internal;
462 string_t str = stringarray_at2(sa, pos);
463 int hash = string_hash(&str) % s->hashsize;
464 s->hash[hash] = stringlist_del(sa, s->hash[hash], pos);
465 *(char**)&s->pos.buffer[pos*sizeof(char*)] = 0;
467 int stringarray_find(stringarray_t*sa, string_t* str)
469 stringarray_internal_t*s = (stringarray_internal_t*)sa->internal;
470 int hash = string_hash(str) % s->hashsize;
472 stringlist_t*l = s->hash[hash];
475 string_t s = stringarray_at2(sa, l->index);
476 if(string_equals2(str, &s)) {
483 void stringarray_clear(stringarray_t*sa)
485 stringarray_internal_t*s = (stringarray_internal_t*)sa->internal;
488 for(t=0;t<s->hashsize;t++) {
489 stringlist_t*l = s->hash[t];
491 stringlist_t*next = l->next;
492 memset(l, 0, sizeof(stringlist_t));
497 rfx_free(s->hash);s->hash=0;
500 void stringarray_destroy(stringarray_t*sa)
502 stringarray_clear(sa);
507 // ------------------------------- dictionary_t -------------------------------
509 #define INITIAL_SIZE 1
511 static int max(int x, int y) {
517 dict_t*d = rfx_alloc(sizeof(dict_t));
521 void dict_init(dict_t*h)
523 memset(h, 0, sizeof(dict_t));
524 h->hashsize = INITIAL_SIZE;
525 h->slots = h->hashsize?(dictentry_t**)rfx_calloc(sizeof(dictentry_t*)*h->hashsize):0;
528 static void dict_expand(dict_t*h, int newlen)
530 assert(h->hashsize < newlen);
531 dictentry_t**newslots = (dictentry_t**)rfx_calloc(sizeof(dictentry_t*)*newlen);
533 for(t=0;t<h->hashsize;t++) {
534 dictentry_t*e = h->slots[t];
536 dictentry_t*next = e->next;
537 unsigned int newhash = e->hash%newlen;
538 e->next = newslots[newhash];
539 newslots[newhash] = e;
546 h->hashsize = newlen;
548 void dict_put(dict_t*h, string_t s, void* data)
550 /* TODO: should we look for duplicates here? */
551 unsigned int hash = string_hash(&s);
552 dictentry_t*e = (dictentry_t*)rfx_alloc(sizeof(dictentry_t));
554 unsigned int hash2 = string_hash(&s) % h->hashsize;
555 char*sdata = rfx_alloc(s.len);
556 memcpy(sdata, s.str, s.len);
559 e->hash = hash; //for resizing
560 e->next = h->slots[hash2];
565 void dict_put2(dict_t*h, const char*s, void*data)
569 dict_put(h, s2, data);
571 void dict_put3(dict_t*h, const char* s, int len, void*data)
574 string_set2(&s3, s, len);
575 dict_put(h, s3, data);
577 void dict_dump(dict_t*h, FILE*fi, const char*prefix)
580 for(t=0;t<h->hashsize;t++) {
581 dictentry_t*e = h->slots[t];
583 char*s = strdup_n(e->s, e->len);
584 fprintf(fi, "%s%s=%08x\n", prefix, e->s, e->data);
591 int dict_count(dict_t*h)
595 void* dict_lookup4(dict_t*h, const char*s, int len, const void*data)
600 unsigned int ohash = string_hash2(s);
601 unsigned int hash = ohash % h->hashsize;
603 /* check first entry for match */
604 dictentry_t*e = h->slots[hash];
605 if(e && e->len == len && !memcmp(e->s, s, len)) {
611 /* if dict is 2/3 filled, double the size. Do
612 this the first time we have to actually iterate
613 through a slot to find our data */
614 if(e && h->num*3 >= h->hashsize*2) {
615 int newsize = h->hashsize;
616 while(h->num*3 >= newsize*2) {
617 newsize = newsize<15?15:(newsize+1)*2-1;
619 dict_expand(h, newsize);
620 hash = ohash % h->hashsize;
624 /* check subsequent entries for a match */
626 if(e->len == len && !memcmp(e->s, s, len) && (!data || data==e->data)) {
633 void* dict_lookup3(dict_t*h, const char*s, const void*data)
636 return dict_lookup4(h, s, l, data);
638 void* dict_lookup2(dict_t*h, const char*s, int len)
640 return dict_lookup4(h, s, len, 0);
642 void* dict_lookup(dict_t*h, const char*s)
645 return dict_lookup2(h, s, l);
647 char dict_del(dict_t*h, const char*s)
651 unsigned int hash = string_hash2(s) % h->hashsize;
653 dictentry_t*head = h->slots[hash];
654 dictentry_t*e = head, *prev=0;
656 if(e->len ==l && !memcmp(e->s, s, l)) {
657 dictentry_t*next = e->next;
658 rfx_free((void*)e->s);
659 memset(e, 0, sizeof(dictentry_t));
676 static dictentry_t* dict_get_all(dict_t*h, const char*s)
680 unsigned int ohash = string_hash2(s);
681 unsigned int hash = ohash % h->hashsize;
682 return h->slots[hash];
685 void dict_foreach_keyvalue(dict_t*h, void (*runFunction)(void*data, const char*key, void*val), void*data)
688 for(t=0;t<h->hashsize;t++) {
689 dictentry_t*e = h->slots[t];
691 dictentry_t*next = e->next;
693 char*s = strdup_n(e->s, e->len); //append \0
694 runFunction(data, s, e->data);
701 void dict_foreach_value(dict_t*h, void (*runFunction)(void*))
704 for(t=0;t<h->hashsize;t++) {
705 dictentry_t*e = h->slots[t];
707 dictentry_t*next = e->next;
709 runFunction(e->data);
716 void dict_free_all(dict_t*h, void (*freeFunction)(void*))
719 for(t=0;t<h->hashsize;t++) {
720 dictentry_t*e = h->slots[t];
722 dictentry_t*next = e->next;
723 rfx_free((void*)e->s);
725 freeFunction(e->data);
727 memset(e, 0, sizeof(dictentry_t));
733 memset(h, 0, sizeof(dict_t));
736 void dict_clear(dict_t*h)
741 void dict_destroy(dict_t*dict)
747 // ------------------------------- map_t --------------------------------------
749 typedef struct _map_internal_t
754 void map_init(map_t*map)
757 map->internal = (map_internal_t*)rfx_calloc(sizeof(map_internal_t));
758 m = (map_internal_t*)map->internal;
761 void map_put(map_t*map, string_t t1, string_t t2)
763 map_internal_t*m = (map_internal_t*)map->internal;
765 char* s1 = string_cstr(&t1);
766 dict_put2(&m->d, s1, (void*)string_cstr(&t2));
769 const char* map_lookup(map_t*map, const char*name)
771 map_internal_t*m = (map_internal_t*)map->internal;
772 const char*value = dict_lookup(&m->d, name);
775 static void freestring(void*data)
779 static void dumpmapentry(void*data, const char*key, void*value)
781 FILE*fi = (FILE*)data;
782 fprintf(fi, "%s=%s\n", key, (char*)value);
784 void map_dump(map_t*map, FILE*fi, const char*prefix)
787 map_internal_t*m = (map_internal_t*)map->internal;
788 dict_foreach_keyvalue(&m->d, dumpmapentry, fi);
790 void map_clear(map_t*map)
792 map_internal_t*m = (map_internal_t*)map->internal;
793 dict_free_all(&m->d, freestring);
796 void map_destroy(map_t*map)
802 // ------------------------------- array_t --------------------------------------
804 array_t* array_new() {
805 array_t*d = malloc(sizeof(array_t));
806 memset(d, 0, sizeof(array_t));
807 d->entry2pos = dict_new();
810 void array_free(array_t*array) {
811 dict_destroy(array->entry2pos);
814 free(array->d);array->d = 0;
818 const char*array_getkey(array_t*array, int nr) {
819 if(nr > array->num || nr<0) {
820 printf("error: reference to element %d in array[%d]\n", nr, array->num);
824 return array->d[nr].name;
826 char*array_getvalue(array_t*array, int nr) {
827 if(nr > array->num || nr<0) {
828 printf("error: reference to element %d in array[%d]\n", nr, array->num);
832 return array->d[nr].data;
834 int array_append(array_t*array, const char*name, const void*data) {
835 while(array->size <= array->num) {
838 array->d = malloc(sizeof(array_entry_t)*array->size);
840 array->d = realloc(array->d, sizeof(array_entry_t)*array->size);
844 array->d[array->num].name = strdup(name);
846 array->d[array->num].name = 0;
848 array->d[array->num].data = (void*)data;
849 dict_put2(array->entry2pos, name, (void*)(ptroff_t)(array->num+1));
852 int array_find(array_t*array, const char*name)
856 int pos = (int)(ptroff_t)dict_lookup(array->entry2pos, name);
859 int array_find2(array_t*array, const char*name, void*data)
863 int len= strlen(name);
865 dictentry_t*e = dict_get_all(array->entry2pos, name);
868 int index = ((int)(ptroff_t)e->data) - 1;
869 if(e->len == len && !memcmp(e->s, name, len) && array->d[index].data == data) {
876 int array_update(array_t*array, const char*name, void*data) {
877 int pos = array_find(array, name);
879 array->d[pos].data = data;
882 return array_append(array, name, data);
884 int array_append_if_new(array_t*array, const char*name, void*data) {
885 int pos = array_find(array, name);
888 return array_append(array, name, data);
891 // ------------------------------- list_t --------------------------------------
894 typedef struct _listinfo {
896 struct _commonlist*last;
899 typedef struct _commonlist {
901 struct _commonlist*next;
905 int list_length(void*_list)
907 commonlist_t*l = (commonlist_t*)_list;
910 return l->info[0].size;
912 void list_append_(void*_list, void*entry)
914 commonlist_t**list = (commonlist_t**)_list;
917 n = malloc(sizeof(commonlist_t)+sizeof(listinfo_t));
920 n = malloc(sizeof(commonlist_t));
921 (*list)->info[0].last->next = n;
925 (*list)->info[0].last = n;
926 (*list)->info[0].size++;
928 void list_free_(void*_list)
930 commonlist_t**list = (commonlist_t**)_list;
931 commonlist_t*l = *list;
933 commonlist_t*next = l->next;