4 Part of the swftools package.
6 Copyright (c) 2001,2002,2003,2004 Matthias Kramm <kramm@quiss.org>
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
31 #define NEW(t,y) t*y = (t*)rfx_calloc(sizeof(t));
33 /* dynamically growing mem section */
34 typedef struct _mem_t {
41 /* fifo buffered growing mem region */
42 typedef struct _ringbuffer_t
48 /* non-nul terminated string */
49 typedef struct _string_t {
54 /* key/value pairs of strings */
55 typedef struct _map_t {
59 /* type information */
60 typedef char (*equals_func)(const void*o1, const void*o2);
61 typedef unsigned int (*hash_func)(const void*o);
62 typedef void* (*dup_func)(const void*o);
63 typedef void (*free_func)(void*o);
65 typedef struct _type_t {
72 extern type_t charptr_type;
73 extern type_t stringstruct_type;
74 extern type_t ptr_type;
76 typedef struct _dictentry {
80 struct _dictentry*next;
83 /* (void*) pointers referenced by strings */
84 typedef struct _dict {
91 /* array of key/value pairs, with fast lookup */
92 typedef struct _array_entry {
97 typedef struct _array {
104 /* array of strings, string<->int mapping,
105 with O(1) for int->string lookup and
106 ~O(n/hashsize) for string->int lookup */
107 typedef struct _stringarray_t
113 typedef struct _heap {
119 int(*compare)(const void *, const void *);
122 /* trie (with rollback) */
123 typedef struct _trielayer {
124 struct _trielayer*row[256];
129 typedef struct _trie {
134 char* strdup_n(const char*str, int size);
135 char* allocprintf(const char*str, ...);
137 unsigned int crc32_add_byte(unsigned int crc32, unsigned char b);
138 unsigned int crc32_add_string(unsigned int crc32, const char*s);
140 void mem_init(mem_t*mem);
141 int mem_put(mem_t*m, void*data, int length);
142 int mem_putstring(mem_t*m, string_t str);
143 int mem_get(mem_t*m, void*data, int length);
144 void mem_clear(mem_t*mem);
145 void mem_destroy(mem_t*mem);
147 void ringbuffer_init(ringbuffer_t*r);
148 void ringbuffer_put(ringbuffer_t*r, void*buf, int size);
149 int ringbuffer_read(ringbuffer_t*r, void*buf, int size);
150 void ringbuffer_clear(ringbuffer_t*r);
152 /* old style functions- should be renamed */
153 string_t string_new(const char*text, int len);
154 string_t string_new2(const char*text);
155 void string_dup(string_t*str, const char*text);
156 void string_dup2(string_t*str, const char*text, int len);
158 char* string_cstr(string_t*str);
159 char* string_escape(string_t*str);
160 string_t* string_new3(const char*text, int len);
161 string_t* string_new4(const char*text);
162 void string_free(string_t*s);
163 unsigned int string_hash(const string_t*str);
164 unsigned int string_hash2(const char*str);
165 unsigned int string_hash3(const char*str, int len);
166 void string_set(string_t*str, const char*text);
167 void string_set2(string_t*str, const char*text, int len);
168 string_t*string_dup3(string_t*s);
169 int string_equals(string_t*str, const char*text);
171 void stringarray_init(stringarray_t*sa, int hashsize);
172 void stringarray_put(stringarray_t*sa, string_t str);
174 char* stringarray_at(stringarray_t*sa, int pos);
175 string_t stringarray_at2(stringarray_t*sa, int pos);
176 int stringarray_find(stringarray_t*sa, string_t*str);
177 void stringarray_clear(stringarray_t*sa);
178 void stringarray_destroy(stringarray_t*sa);
181 dict_t*dict_new2(type_t*type);
182 void dict_init(dict_t*dict, int size);
183 void dict_init2(dict_t*dict, type_t*type, int size);
184 dictentry_t*dict_put(dict_t*h, const void*key, void* data);
185 void dict_put2(dict_t*h, const char*s, void*data);
186 int dict_count(dict_t*h);
187 void dict_dump(dict_t*h, FILE*fi, const char*prefix);
188 dictentry_t* dict_get_slot(dict_t*h, const void*key);
189 char dict_contains(dict_t*h, const void*s);
190 void* dict_lookup(dict_t*h, const void*s);
191 char dict_del(dict_t*h, const void*s);
192 dict_t*dict_clone(dict_t*);
194 void dict_foreach_keyvalue(dict_t*h, void (*runFunction)(void*data, const void*key, void*val), void*data);
195 void dict_foreach_value(dict_t*h, void (*runFunction)(void*));
196 void dict_free_all(dict_t*h, char free_keys, void (*free_data_function)(void*));
197 void dict_clear(dict_t*h);
198 void dict_destroy_shallow(dict_t*dict);
199 void dict_destroy(dict_t*dict);
200 #define DICT_ITERATE_DATA(d,t,v) int v##_i;dictentry_t*v##_e;t v;for(v##_i=0;v##_i<(d)->hashsize;v##_i++) for(v##_e=(d)->slots[v##_i]; v##_e && ((v=(t)v##_e->data)||1); v##_e=v##_e->next)
201 #define DICT_ITERATE_KEY(d,t,v) int v##_i;dictentry_t*v##_e;t v;for(v##_i=0;v##_i<(d)->hashsize;v##_i++) for(v##_e=(d)->slots[v##_i];v##_e && ((v=(t)v##_e->key)||1);v##_e=v##_e->next)
202 #define DICT_ITERATE_ITEMS(d,t1,v1,t2,v2) int v1##_i;dictentry_t*v1##_e;t1 v1;t2 v2;for(v1##_i=0;v1##_i<(d)->hashsize;v1##_i++) for(v1##_e=(d)->slots[v1##_i]; v1##_e && (((v1=(t1)v1##_e->key)&&(v2=(t2)v1##_e->data))||1); v1##_e=v1##_e->next)
204 void map_init(map_t*map);
205 void map_put(map_t*map, string_t t1, string_t t2);
206 const char* map_lookup(map_t*map, const char*name);
207 void map_dump(map_t*map, FILE*fi, const char*prefix);
208 void map_clear(map_t*map);
209 void map_destroy(map_t*map);
211 void heap_init(heap_t*h,int n,int elem_size, int(*compare)(const void *, const void *));
212 void heap_clear(heap_t*h);
213 void heap_put(heap_t*h, void*e);
214 int heap_size(heap_t*h);
215 void* heap_max(heap_t*h);
216 void* heap_chopmax(heap_t*h);
217 void heap_dump(heap_t*h, FILE*fi);
218 void** heap_flatten(heap_t*h);
221 void trie_put(trie_t*t, unsigned const char*id, void*data);
222 char trie_remove(trie_t*t, unsigned const char*id);
223 void*trie_lookup(trie_t*t, unsigned const char*id);
224 int trie_contains(trie_t*t, unsigned const char*id);
225 void trie_remember(trie_t*t);
226 void trie_rollback(trie_t*t);
227 void trie_dump(trie_t*t);
229 array_t* array_new();
230 array_t* array_new2(type_t*type);
231 void array_free(array_t*array);
232 void*array_getkey(array_t*array, int nr);
233 void*array_getvalue(array_t*array, int nr);
234 int array_append(array_t*array, const void*name, void*data);
235 #define array_contains(a,b) (array_find((a),(b))>=0)
236 int array_find(array_t*array, const void*name);
237 int array_find2(array_t*array, const void*name, void*data);
238 int array_update(array_t*array, const void*name, void*data);
239 int array_append_if_new(array_t*array, const void*name, void*data);
240 #define array_length(a) ((a)->num)
242 #define DECLARE(x) struct _##x;typedef struct _##x x##_t;
243 #define DECLARE_LIST(x) \
244 struct _##x##_list { \
246 struct _##x##_list*next; \
248 typedef struct _##x##_list x##_list_t;
249 int list_length_(void*_list);
250 void*list_clone_(void*_list);
251 void list_append_(void*_list, void*entry);
252 void list_prepend_(void*_list, void*entry);
253 void list_free_(void*_list);
254 void list_deep_free_(void*_list);
255 void list_concat_(void*l1, void*l2);
256 #define list_new() ((void*)0)
257 #define list_append(list, e) {sizeof((list)->next);list_append_(&(list),(e));}
258 #define list_concat(l1, l2) {sizeof((l1)->next);sizeof((l2)->next);list_concat_(&(l1),&(l2));}
259 #define list_prepend(list, e) {sizeof((list)->next);list_prepend_(&(list),(e));}
260 #define list_free(list) {sizeof((list)->next);list_free_(&(list));}
261 #define list_deep_free(list) {sizeof((list)->next);list_deep_free_(&(list));}
262 #define list_clone(list) (sizeof((list)->next),(list?list_clone_(&(list)):0))
263 #define list_length(list) (sizeof((list)->next),list_length_(list))