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);
326 unsigned int crc32_add_byte(unsigned int checksum, unsigned char b)
330 return checksum>>8 ^ crc32[(b^checksum)&0xff];
332 unsigned int crc32_add_string(unsigned int checksum, const char*s)
337 checksum = crc32_add_byte(checksum, *s);
343 unsigned int string_hash(const string_t*str)
346 unsigned int checksum = 0;
349 for(t=0;t<str->len;t++) {
350 checksum = checksum>>8 ^ crc32[(str->str[t]^checksum)&0xff];
354 unsigned int string_hash2(const char*str)
356 unsigned int checksum = 0;
361 checksum = checksum>>8 ^ crc32[(*p^checksum)&0xff];
366 unsigned int string_hash3(const char*str, int len)
371 return string_hash(&s);
373 void string_dup2(string_t*str, const char*text, int len)
376 str->str = strdup_n(text, len);
378 void string_dup(string_t*str, const char*text)
380 str->len = strlen(text);
381 str->str = strdup(text);
383 int string_equals(string_t*str, const char*text)
385 int l = strlen(text);
386 if(str->len == l && !memcmp(str->str, text, l))
390 int string_equals2(string_t*str, string_t*str2)
392 if(str->len == str2->len && !memcmp(str->str, str2->str, str->len))
397 // ------------------------------- stringarray_t ------------------------------
399 typedef struct _stringlist {
401 struct _stringlist*next;
404 typedef struct _stringarray_internal_t
410 } stringarray_internal_t;
412 void stringarray_init(stringarray_t*sa, int hashsize)
414 stringarray_internal_t*s;
416 sa->internal = (stringarray_internal_t*)rfx_calloc(sizeof(stringarray_internal_t));
417 s = (stringarray_internal_t*)sa->internal;
419 s->hash = rfx_calloc(sizeof(stringlist_t*)*hashsize);
420 s->hashsize = hashsize;
422 void stringarray_put(stringarray_t*sa, string_t str)
424 stringarray_internal_t*s = (stringarray_internal_t*)sa->internal;
426 int hash = string_hash(&str) % s->hashsize;
428 char*ss = string_cstr(&str);
429 mem_put(&s->pos, &ss, sizeof(char*));
431 stringlist_t*l = rfx_alloc(sizeof(stringlist_t));
433 l->next = s->hash[hash];
438 char* stringarray_at(stringarray_t*sa, int pos)
440 stringarray_internal_t*s = (stringarray_internal_t*)sa->internal;
442 if(pos<0 || pos>=s->num)
444 p = *(char**)&s->pos.buffer[pos*sizeof(char*)];
449 string_t stringarray_at2(stringarray_t*sa, int pos)
452 s.str = stringarray_at(sa, pos);
453 s.len = s.str?strlen(s.str):0;
456 static stringlist_t* stringlist_del(stringarray_t*sa, stringlist_t*l, int index)
459 stringlist_t*old = l;
461 if(index==l->index) {
463 memset(l, 0, sizeof(stringlist_t));
473 fprintf(stderr, "Internal error: did not find string %d in hash\n", index);
477 void stringarray_del(stringarray_t*sa, int pos)
479 stringarray_internal_t*s = (stringarray_internal_t*)sa->internal;
480 string_t str = stringarray_at2(sa, pos);
481 int hash = string_hash(&str) % s->hashsize;
482 s->hash[hash] = stringlist_del(sa, s->hash[hash], pos);
483 *(char**)&s->pos.buffer[pos*sizeof(char*)] = 0;
485 int stringarray_find(stringarray_t*sa, string_t* str)
487 stringarray_internal_t*s = (stringarray_internal_t*)sa->internal;
488 int hash = string_hash(str) % s->hashsize;
490 stringlist_t*l = s->hash[hash];
493 string_t s = stringarray_at2(sa, l->index);
494 if(string_equals2(str, &s)) {
501 void stringarray_clear(stringarray_t*sa)
503 stringarray_internal_t*s = (stringarray_internal_t*)sa->internal;
506 for(t=0;t<s->hashsize;t++) {
507 stringlist_t*l = s->hash[t];
509 stringlist_t*next = l->next;
510 memset(l, 0, sizeof(stringlist_t));
515 rfx_free(s->hash);s->hash=0;
518 void stringarray_destroy(stringarray_t*sa)
520 stringarray_clear(sa);
524 // ------------------------------- type_t -------------------------------
526 char charptr_equals(const void*o1, const void*o2)
530 return !strcmp(o1,o2);
532 unsigned int charptr_hash(const void*o)
536 return string_hash2(o);
538 void* charptr_dup(const void*o)
544 void charptr_free(void*o)
550 char stringstruct_equals(const void*o1, const void*o2)
552 string_t*s1 = (string_t*)o1;
553 string_t*s2 = (string_t*)o2;
554 int l = s1->len<s2->len?s1->len:s2->len;
555 int r = memcmp(s1->str, s2->str, l);
559 return s1->len==s2->len;
561 unsigned int stringstruct_hash(const void*o)
563 return string_hash(o);
565 void*stringstruct_dup(const void*o)
567 string_t*s = malloc(sizeof(string_t));
568 string_set2(s, ((string_t*)o)->str, ((string_t*)o)->len);
571 void stringstruct_free(void*o)
573 rfx_free((void*)(((string_t*)o)->str));
578 type_t charptr_type = {
579 equals: charptr_equals,
585 type_t stringstruct_type = {
586 equals: stringstruct_equals,
587 hash: stringstruct_hash,
588 dup: stringstruct_dup,
589 free: stringstruct_free,
592 // ------------------------------- dictionary_t -------------------------------
594 #define INITIAL_SIZE 1
596 static int max(int x, int y) {
602 dict_t*d = rfx_alloc(sizeof(dict_t));
603 dict_init(d, INITIAL_SIZE);
606 dict_t*dict_new2(type_t*t)
608 dict_t*d = rfx_alloc(sizeof(dict_t));
609 dict_init(d, INITIAL_SIZE);
613 void dict_init(dict_t*h, int size)
615 memset(h, 0, sizeof(dict_t));
617 h->slots = h->hashsize?(dictentry_t**)rfx_calloc(sizeof(dictentry_t*)*h->hashsize):0;
619 h->key_type = &charptr_type;
622 dict_t*dict_clone(dict_t*o)
624 dict_t*h = rfx_alloc(sizeof(dict_t));
625 memcpy(h, o, sizeof(dict_t));
626 h->slots = h->hashsize?(dictentry_t**)rfx_calloc(sizeof(dictentry_t*)*h->hashsize):0;
628 for(t=0;t<o->hashsize;t++) {
629 dictentry_t*e = o->slots[t];
631 dictentry_t*n = (dictentry_t*)rfx_alloc(sizeof(dictentry_t));
632 memcpy(n, e, sizeof(dictentry_t));
633 n->key = h->key_type->dup(e->key);
635 n->next = h->slots[t];
643 static void dict_expand(dict_t*h, int newlen)
645 assert(h->hashsize < newlen);
646 dictentry_t**newslots = (dictentry_t**)rfx_calloc(sizeof(dictentry_t*)*newlen);
648 for(t=0;t<h->hashsize;t++) {
649 dictentry_t*e = h->slots[t];
651 dictentry_t*next = e->next;
652 unsigned int newhash = e->hash%newlen;
653 e->next = newslots[newhash];
654 newslots[newhash] = e;
661 h->hashsize = newlen;
664 dictentry_t* dict_put(dict_t*h, const void*key, void* data)
666 unsigned int hash = h->key_type->hash(key);
667 dictentry_t*e = (dictentry_t*)rfx_alloc(sizeof(dictentry_t));
668 unsigned int hash2 = hash % h->hashsize;
670 e->key = h->key_type->dup(key);
671 e->hash = hash; //for resizing
672 e->next = h->slots[hash2];
678 void dict_put2(dict_t*h, const char*s, void*data)
680 assert(h->key_type == &charptr_type);
681 dict_put(h, s, data);
683 void dict_dump(dict_t*h, FILE*fi, const char*prefix)
686 for(t=0;t<h->hashsize;t++) {
687 dictentry_t*e = h->slots[t];
689 if(h->key_type!=&charptr_type) {
690 fprintf(fi, "%s%08x=%08x\n", prefix, e->key, e->data);
692 fprintf(fi, "%s%s=%08x\n", prefix, e->key, e->data);
699 int dict_count(dict_t*h)
704 void* dict_lookup(dict_t*h, const void*key)
709 unsigned int ohash = h->key_type->hash(key);
710 unsigned int hash = ohash % h->hashsize;
712 /* check first entry for match */
713 dictentry_t*e = h->slots[hash];
714 if(e && h->key_type->equals(e->key, key)) {
720 /* if dict is 2/3 filled, double the size. Do
721 this the first time we have to actually iterate
722 through a slot to find our data */
723 if(e && h->num*3 >= h->hashsize*2) {
724 int newsize = h->hashsize;
725 while(h->num*3 >= newsize*2) {
726 newsize = newsize<15?15:(newsize+1)*2-1;
728 dict_expand(h, newsize);
729 hash = ohash % h->hashsize;
733 /* check subsequent entries for a match */
735 if(h->key_type->equals(e->key, key)) {
742 char dict_del(dict_t*h, const void*key)
746 unsigned int hash = h->key_type->hash(key) % h->hashsize;
747 dictentry_t*head = h->slots[hash];
748 dictentry_t*e = head, *prev=0;
750 if(h->key_type->equals(e->key, key)) {
751 dictentry_t*next = e->next;
752 rfx_free((void*)e->key);
753 memset(e, 0, sizeof(dictentry_t));
770 dictentry_t* dict_get_slot(dict_t*h, const void*key)
774 unsigned int ohash = h->key_type->hash(key);
775 unsigned int hash = ohash % h->hashsize;
776 return h->slots[hash];
779 void dict_foreach_keyvalue(dict_t*h, void (*runFunction)(void*data, const void*key, void*val), void*data)
782 for(t=0;t<h->hashsize;t++) {
783 dictentry_t*e = h->slots[t];
785 dictentry_t*next = e->next;
787 runFunction(data, e->key, e->data);
793 void dict_foreach_value(dict_t*h, void (*runFunction)(void*))
796 for(t=0;t<h->hashsize;t++) {
797 dictentry_t*e = h->slots[t];
799 dictentry_t*next = e->next;
801 runFunction(e->data);
808 void dict_free_all(dict_t*h, void (*freeFunction)(void*))
811 for(t=0;t<h->hashsize;t++) {
812 dictentry_t*e = h->slots[t];
814 dictentry_t*next = e->next;
815 h->key_type->free(e->key);
817 freeFunction(e->data);
819 memset(e, 0, sizeof(dictentry_t));
826 memset(h, 0, sizeof(dict_t));
829 void dict_clear(dict_t*h)
834 void dict_destroy(dict_t*dict)
840 // ------------------------------- map_t --------------------------------------
842 typedef struct _map_internal_t
847 void map_init(map_t*map)
850 map->internal = (map_internal_t*)rfx_calloc(sizeof(map_internal_t));
851 m = (map_internal_t*)map->internal;
852 dict_init(&m->d, INITIAL_SIZE);
854 void map_put(map_t*map, string_t t1, string_t t2)
856 map_internal_t*m = (map_internal_t*)map->internal;
858 char* s1 = string_cstr(&t1);
859 dict_put2(&m->d, s1, (void*)string_cstr(&t2));
862 const char* map_lookup(map_t*map, const char*name)
864 map_internal_t*m = (map_internal_t*)map->internal;
865 const char*value = dict_lookup(&m->d, name);
868 static void freestring(void*data)
872 static void dumpmapentry(void*data, const void*key, void*value)
874 FILE*fi = (FILE*)data;
875 fprintf(fi, "%s=%s\n", key, (char*)value);
877 void map_dump(map_t*map, FILE*fi, const char*prefix)
880 map_internal_t*m = (map_internal_t*)map->internal;
881 dict_foreach_keyvalue(&m->d, dumpmapentry, fi);
883 void map_clear(map_t*map)
885 map_internal_t*m = (map_internal_t*)map->internal;
886 dict_free_all(&m->d, freestring);
889 void map_destroy(map_t*map)
895 // ------------------------------- array_t --------------------------------------
897 array_t* array_new() {
898 array_t*d = malloc(sizeof(array_t));
899 memset(d, 0, sizeof(array_t));
900 d->entry2pos = dict_new();
903 array_t* array_new2(type_t*type) {
904 array_t*d = malloc(sizeof(array_t));
905 memset(d, 0, sizeof(array_t));
906 d->entry2pos = dict_new2(type);
909 void*array_getkey(array_t*array, int nr) {
910 if(nr > array->num || nr<0) {
911 printf("error: reference to element %d in array[%d]\n", nr, array->num);
915 return array->d[nr].name;
917 void*array_getvalue(array_t*array, int nr) {
918 if(nr > array->num || nr<0) {
919 printf("error: reference to element %d in array[%d]\n", nr, array->num);
923 return array->d[nr].data;
925 int array_append(array_t*array, const void*name, void*data) {
926 while(array->size <= array->num) {
929 array->d = malloc(sizeof(array_entry_t)*array->size);
931 array->d = realloc(array->d, sizeof(array_entry_t)*array->size);
935 dictentry_t*e = dict_put(array->entry2pos, name, (void*)(ptroff_t)(array->num+1));
938 array->d[array->num].name = e->key;
940 array->d[array->num].name = 0;
942 array->d[array->num].data = (void*)data;
945 int array_find(array_t*array, const void*name)
947 int pos = (int)(ptroff_t)dict_lookup(array->entry2pos, name);
950 int array_find2(array_t*array, const void*name, void*data)
952 dict_t*h= array->entry2pos;
953 dictentry_t*e = dict_get_slot(array->entry2pos, name);
956 int index = ((int)(ptroff_t)e->data) - 1;
957 if(h->key_type->equals(e->key, name) && array->d[index].data == data) {
964 int array_update(array_t*array, const void*name, void*data) {
965 int pos = array_find(array, name);
967 array->d[pos].data = data;
970 return array_append(array, name, data);
972 int array_append_if_new(array_t*array, const void*name, void*data) {
973 int pos = array_find(array, name);
976 return array_append(array, name, data);
978 void array_free(array_t*array) {
979 dict_destroy(array->entry2pos);
981 free(array->d);array->d = 0;
986 // ------------------------------- list_t --------------------------------------
989 typedef struct _listinfo {
991 struct _commonlist*last;
994 typedef struct _commonlist {
996 struct _commonlist*next;
1000 int list_length_(void*_list)
1002 commonlist_t*l = (commonlist_t*)_list;
1005 return l->info[0].size;
1007 void list_append_(void*_list, void*entry)
1009 commonlist_t**list = (commonlist_t**)_list;
1010 commonlist_t* n = 0;
1012 n = (commonlist_t*)malloc(sizeof(commonlist_t)+sizeof(listinfo_t));
1014 (*list)->info[0].size = 0;
1016 n = malloc(sizeof(commonlist_t));
1017 (*list)->info[0].last->next = n;
1021 (*list)->info[0].last = n;
1022 (*list)->info[0].size++;
1024 /* notice: prepending uses slighly more space than appending */
1025 void list_prepend_(void*_list, void*entry)
1027 commonlist_t**list = (commonlist_t**)_list;
1028 commonlist_t* n = (commonlist_t*)malloc(sizeof(commonlist_t)+sizeof(listinfo_t));
1030 commonlist_t* last = 0;
1032 last = (*list)->info[0].last;
1033 size = (*list)->info[0].size;
1038 (*list)->info[0].last = last;
1039 (*list)->info[0].size = size+1;
1041 void list_free_(void*_list)
1043 commonlist_t**list = (commonlist_t**)_list;
1044 commonlist_t*l = *list;
1046 commonlist_t*next = l->next;
1052 void*list_clone_(void*_list)
1054 commonlist_t*l = *(commonlist_t**)_list;
1058 commonlist_t*next = l->next;
1059 list_append_(&dest, l->entry);