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
120 int(*compare)(const void *, const void *);
123 char* strdup_n(const char*str, int size);
125 unsigned int crc32_add_byte(unsigned int crc32, unsigned char b);
126 unsigned int crc32_add_string(unsigned int crc32, const char*s);
128 void mem_init(mem_t*mem);
129 int mem_put(mem_t*m, void*data, int length);
130 int mem_putstring(mem_t*m, string_t str);
131 int mem_get(mem_t*m, void*data, int length);
132 void mem_clear(mem_t*mem);
133 void mem_destroy(mem_t*mem);
135 void ringbuffer_init(ringbuffer_t*r);
136 void ringbuffer_put(ringbuffer_t*r, void*buf, int size);
137 int ringbuffer_read(ringbuffer_t*r, void*buf, int size);
138 void ringbuffer_clear(ringbuffer_t*r);
140 /* old style functions- should be renamed */
141 string_t string_new(const char*text, int len);
142 string_t string_new2(const char*text);
143 void string_dup(string_t*str, const char*text);
144 void string_dup2(string_t*str, const char*text, int len);
146 char* string_cstr(string_t*str);
147 char* string_escape(string_t*str);
148 string_t* string_new3(const char*text, int len);
149 string_t* string_new4(const char*text);
150 void string_free(string_t*s);
151 unsigned int string_hash(const string_t*str);
152 unsigned int string_hash2(const char*str);
153 unsigned int string_hash3(const char*str, int len);
154 void string_set(string_t*str, const char*text);
155 void string_set2(string_t*str, const char*text, int len);
156 string_t*string_dup3(string_t*s);
157 int string_equals(string_t*str, const char*text);
159 void stringarray_init(stringarray_t*sa, int hashsize);
160 void stringarray_put(stringarray_t*sa, string_t str);
162 char* stringarray_at(stringarray_t*sa, int pos);
163 string_t stringarray_at2(stringarray_t*sa, int pos);
164 int stringarray_find(stringarray_t*sa, string_t*str);
165 void stringarray_clear(stringarray_t*sa);
166 void stringarray_destroy(stringarray_t*sa);
169 dict_t*dict_new2(type_t*type);
170 void dict_init(dict_t*dict, int size);
171 dictentry_t*dict_put(dict_t*h, const void*key, void* data);
172 void dict_put2(dict_t*h, const char*s, void*data);
173 int dict_count(dict_t*h);
174 void dict_dump(dict_t*h, FILE*fi, const char*prefix);
175 dictentry_t* dict_get_slot(dict_t*h, const void*key);
176 char dict_contains(dict_t*h, const void*s);
177 void* dict_lookup(dict_t*h, const void*s);
178 char dict_del(dict_t*h, const void*s);
179 dict_t*dict_clone(dict_t*);
181 void dict_foreach_keyvalue(dict_t*h, void (*runFunction)(void*data, const void*key, void*val), void*data);
182 void dict_foreach_value(dict_t*h, void (*runFunction)(void*));
183 void dict_free_all(dict_t*h, char free_keys, void (*free_data_function)(void*));
184 void dict_clear(dict_t*h);
185 void dict_destroy_shallow(dict_t*dict);
186 void dict_destroy(dict_t*dict);
188 void map_init(map_t*map);
189 void map_put(map_t*map, string_t t1, string_t t2);
190 const char* map_lookup(map_t*map, const char*name);
191 void map_dump(map_t*map, FILE*fi, const char*prefix);
192 void map_clear(map_t*map);
193 void map_destroy(map_t*map);
195 void heap_init(heap_t*h,int n,int elem_size, int(*compare)(const void *, const void *));
196 void heap_clear(heap_t*h);
197 void heap_put(heap_t*h, void*e);
198 int heap_size(heap_t*h);
199 void* heap_max(heap_t*h);
200 void* heap_chopmax(heap_t*h);
201 void heap_dump(heap_t*h, FILE*fi);
202 void** heap_flatten(heap_t*h);
204 array_t* array_new();
205 array_t* array_new2(type_t*type);
206 void array_free(array_t*array);
207 void*array_getkey(array_t*array, int nr);
208 void*array_getvalue(array_t*array, int nr);
209 int array_append(array_t*array, const void*name, void*data);
210 #define array_contains(a,b) (array_find((a),(b))>=0)
211 int array_find(array_t*array, const void*name);
212 int array_find2(array_t*array, const void*name, void*data);
213 int array_update(array_t*array, const void*name, void*data);
214 int array_append_if_new(array_t*array, const void*name, void*data);
215 #define array_length(a) ((a)->num)
217 #define DECLARE(x) struct _##x;typedef struct _##x x##_t;
218 #define DECLARE_LIST(x) \
219 struct _##x##_list { \
221 struct _##x##_list*next; \
223 typedef struct _##x##_list x##_list_t;
224 int list_length_(void*_list);
225 void*list_clone_(void*_list);
226 void list_append_(void*_list, void*entry);
227 void list_prepend_(void*_list, void*entry);
228 void list_free_(void*_list);
229 void list_concat_(void*l1, void*l2);
230 #define list_new() ((void*)0)
231 #define list_append(list, e) {sizeof((list)->next);list_append_(&(list),(e));}
232 #define list_concat(l1, l2) {sizeof((l1)->next);sizeof((l2)->next);list_concat_(&(l1),&(l2));}
233 #define list_prepend(list, e) {sizeof((list)->next);list_prepend_(&(list),(e));}
234 #define list_free(list) {sizeof((list)->next);list_free_(&(list));}
235 #define list_clone(list) (sizeof((list)->next),list_clone_(&(list)))
236 #define list_length(list) (sizeof((list)->next),list_length_(list))