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 {
40 /* fifo buffered growing mem region */
41 typedef struct _ringbuffer_t
47 /* non-nul terminated string */
48 typedef struct _string_t {
53 /* key/value pairs of strings */
54 typedef struct _map_t {
58 /* type information */
59 typedef char (*equals_func)(const void*o1, const void*o2);
60 typedef unsigned int (*hash_func)(const void*o);
61 typedef void* (*dup_func)(const void*o);
62 typedef void (*free_func)(void*o);
64 typedef struct _type_t {
71 extern type_t charptr_type;
72 extern type_t stringstruct_type;
74 typedef struct _dictentry {
78 struct _dictentry*next;
81 /* (void*) pointers referenced by strings */
82 typedef struct _dict {
89 /* array of key/value pairs, with fast lookup */
90 typedef struct _array_entry {
95 typedef struct _array {
102 /* array of strings, string<->int mapping,
103 with O(1) for int->string lookup and
104 ~O(n/hashsize) for string->int lookup */
105 typedef struct _stringarray_t
118 int(*compare)(const void *, const void *);
121 char* strdup_n(const char*str, int size);
123 unsigned int crc32_add_byte(unsigned int crc32, unsigned char b);
124 unsigned int crc32_add_string(unsigned int crc32, const char*s);
126 void mem_init(mem_t*mem);
127 int mem_put(mem_t*m, void*data, int length);
128 int mem_putstring(mem_t*m, string_t str);
129 void mem_clear(mem_t*mem);
130 void mem_destroy(mem_t*mem);
132 void ringbuffer_init(ringbuffer_t*r);
133 void ringbuffer_put(ringbuffer_t*r, void*buf, int size);
134 int ringbuffer_read(ringbuffer_t*r, void*buf, int size);
135 void ringbuffer_clear(ringbuffer_t*r);
137 string_t string_new(const char*text, int len);
138 string_t string_new2(const char*text);
139 unsigned int string_hash(const string_t*str);
140 unsigned int string_hash2(const char*str);
141 unsigned int string_hash3(const char*str, int len);
142 void string_set(string_t*str, const char*text);
143 void string_set2(string_t*str, const char*text, int len);
144 void string_dup(string_t*str, const char*text);
145 void string_dup2(string_t*str, const char*text, int len);
146 int string_equals(string_t*str, const char*text);
148 void stringarray_init(stringarray_t*sa, int hashsize);
149 void stringarray_put(stringarray_t*sa, string_t str);
151 char* stringarray_at(stringarray_t*sa, int pos);
152 string_t stringarray_at2(stringarray_t*sa, int pos);
153 int stringarray_find(stringarray_t*sa, string_t*str);
154 void stringarray_clear(stringarray_t*sa);
155 void stringarray_destroy(stringarray_t*sa);
158 dict_t*dict_new2(type_t*type);
159 void dict_init(dict_t*dict, int size);
160 dictentry_t*dict_put(dict_t*h, const void*key, void* data);
161 void dict_put2(dict_t*h, const char*s, void*data);
162 int dict_count(dict_t*h);
163 void dict_dump(dict_t*h, FILE*fi, const char*prefix);
164 void* dict_lookup(dict_t*h, const void*s);
165 char dict_del(dict_t*h, const void*s);
167 void dict_foreach_keyvalue(dict_t*h, void (*runFunction)(void*data, const void*key, void*val), void*data);
168 void dict_foreach_value(dict_t*h, void (*runFunction)(void*));
169 void dict_free_all(dict_t*h, void (*freeFunction)(void*));
170 void dict_clear(dict_t*h);
171 void dict_destroy(dict_t*dict);
173 void map_init(map_t*map);
174 void map_put(map_t*map, string_t t1, string_t t2);
175 const char* map_lookup(map_t*map, const char*name);
176 void map_dump(map_t*map, FILE*fi, const char*prefix);
177 void map_clear(map_t*map);
178 void map_destroy(map_t*map);
180 void heap_init(heap_t*h,int n,int elem_size, int(*compare)(const void *, const void *));
181 void heap_clear(heap_t*h);
182 void heap_put(heap_t*h, void*e);
183 int heap_size(heap_t*h);
184 void* heap_max(heap_t*h);
185 void* heap_chopmax(heap_t*h);
186 void heap_dump(heap_t*h, FILE*fi);
187 void** heap_flatten(heap_t*h);
189 array_t* array_new();
190 array_t* array_new2(type_t*type);
191 void array_free(array_t*array);
192 void*array_getkey(array_t*array, int nr);
193 void*array_getvalue(array_t*array, int nr);
194 int array_append(array_t*array, const void*name, void*data);
195 #define array_contains(a,b) (array_find((a),(b))>=0)
196 int array_find(array_t*array, const void*name);
197 int array_find2(array_t*array, const void*name, void*data);
198 int array_update(array_t*array, const void*name, void*data);
199 int array_append_if_new(array_t*array, const void*name, void*data);
200 #define array_length(a) ((a)->num)
202 #define DECLARE(x) struct _##x;typedef struct _##x x##_t;
203 #define DECLARE_LIST(x) \
204 struct _##x##_list { \
206 struct _##x##_list*next; \
208 typedef struct _##x##_list x##_list_t;
209 int list_length_(void*_list);
210 void*list_clone_(void*_list);
211 void list_append_(void*_list, void*entry);
212 void list_prepend_(void*_list, void*entry);
213 void list_free_(void*_list);
214 #define list_new() ((void*)0)
215 #define list_append(list, e) {sizeof((list)->next);list_append_(&(list),(e));}
216 #define list_prepend(list, e) {sizeof((list)->next);list_prepend_(&(list),(e));}
217 #define list_free(list) {sizeof((list)->next);list_free_(&(list));}
218 #define list_clone(list) (sizeof((list)->next),list_clone_(&(list)))
219 #define list_length(list) (sizeof((list)->next),list_length_(list))