d3372da9 |
1 | /* |
2 | * Dolda Connect - Modular multiuser Direct Connect-style client |
3 | * Copyright (C) 2004 Fredrik Tolf (fredrik@dolda2000.com) |
4 | * |
5 | * This program is free software; you can redistribute it and/or modify |
6 | * it under the terms of the GNU General Public License as published by |
7 | * the Free Software Foundation; either version 2 of the License, or |
8 | * (at your option) any later version. |
9 | * |
10 | * This program is distributed in the hope that it will be useful, |
11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
13 | * GNU General Public License for more details. |
14 | * |
15 | * You should have received a copy of the GNU General Public License |
16 | * along with this program; if not, write to the Free Software |
17 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
18 | */ |
19 | #ifndef _UTILS_H |
20 | #define _UTILS_H |
21 | |
22 | #include <stdarg.h> |
23 | #include <stdlib.h> |
24 | #include <malloc.h> |
049aedb6 |
25 | #include <assert.h> |
8b17e919 |
26 | #ifdef DAEMON |
d3372da9 |
27 | #include "log.h" |
8b17e919 |
28 | #endif |
d3372da9 |
29 | |
9ec790e8 |
30 | struct wcspair { |
31 | struct wcspair *next; |
32 | wchar_t *key; |
33 | wchar_t *val; |
34 | }; |
35 | |
8b17e919 |
36 | |
d3372da9 |
37 | /* "Safe" functions */ |
8b17e919 |
38 | #ifdef DAEMON |
39 | #define LOGOOM(size) flog(LOG_CRIT, "%s (%s:%i): out of memory (alloc %i)", __FUNCTION__, __FILE__, __LINE__, (size)) |
d3372da9 |
40 | #define smalloc(size) ({void *__result__; ((__result__ = malloc(size)) == NULL)?({LOGOOM(size); abort(); (void *)0;}):__result__;}) |
41 | #define srealloc(ptr, size) ({void *__result__; ((__result__ = realloc((ptr), (size))) == NULL)?({LOGOOM(size); abort(); (void *)0;}):__result__;}) |
42 | #define swcsdup(wcs) ((wchar_t *)wcscpy(smalloc(sizeof(wchar_t) * (wcslen(wcs) + 1)), (wcs))) |
43 | #define sstrdup(str) ((char *)strcpy(smalloc(strlen(str) + 1), (str))) |
8b17e919 |
44 | #else |
45 | #define LOGOOM(size) |
46 | #define smalloc(size) ({void *__result__; ((__result__ = malloc(size)) == NULL)?({exit(-1); (void *)0;}):__result__;}) |
47 | #define srealloc(ptr, size) ({void *__result__; ((__result__ = realloc((ptr), (size))) == NULL)?({exit(-1); (void *)0;}):__result__;}) |
48 | #define swcsdup(wcs) ((wchar_t *)wcscpy(smalloc(sizeof(wchar_t) * (wcslen(wcs) + 1)), (wcs))) |
49 | #define sstrdup(str) ((char *)strcpy(smalloc(strlen(str) + 1), (str))) |
50 | #endif |
d3372da9 |
51 | |
52 | #define CBCHAIN(name, args...) \ |
53 | struct cbchain_ ## name { \ |
54 | struct cbchain_ ## name *next, *prev; \ |
55 | int (*func)(args, void *data); \ |
56 | void (*destroy)(void *data); \ |
57 | void *data; \ |
049aedb6 |
58 | int running, free; \ |
d3372da9 |
59 | } * name |
60 | |
61 | #define GCBCHAIN(name, args...) \ |
62 | struct cbchain_ ## name * name = NULL |
63 | |
64 | #define EGCBCHAIN(name, args...) \ |
65 | extern struct cbchain_ ## name { \ |
66 | struct cbchain_ ## name *next, *prev; \ |
67 | int (*func)(args, void *data); \ |
68 | void *data; \ |
69 | } * name |
70 | |
71 | extern int vswprintf (wchar_t *__restrict __s, size_t __n, |
72 | __const wchar_t *__restrict __format, |
73 | __gnuc_va_list __arg); |
74 | extern int swprintf (wchar_t *__restrict __s, size_t __n, |
75 | __const wchar_t *__restrict __format, ...); |
76 | |
77 | char *vsprintf2(char *format, va_list al); |
78 | char *sprintf2(char *format, ...) |
79 | #if defined(__GNUC__) && 0 |
80 | __attribute__ ((format (printf, 1, 2))) |
81 | #endif |
d3372da9 |
82 | ; |
83 | wchar_t *vswprintf2(wchar_t *format, va_list al); |
84 | wchar_t *swprintf2(wchar_t *format, ...); |
6a3ef546 |
85 | int havecharset(char *charset); |
d3372da9 |
86 | wchar_t *icmbstowcs(char *mbs, char *charset); |
87 | wchar_t *icsmbstowcs(char *mbs, char *charset, wchar_t *def); |
88 | char *icwcstombs(wchar_t *wcs, char *charset); |
89 | char *icswcstombs(wchar_t *wcs, char *charset, char *def); |
90 | wchar_t *wcstolower(wchar_t *wcs); |
91 | wchar_t ucptowc(int ucp); |
92 | void _sizebuf(void **buf, size_t *bufsize, size_t reqsize, size_t elsize, int algo); |
93 | double ntime(void); |
94 | int wcsexists(wchar_t *h, wchar_t *n); |
95 | #ifndef HAVE_WCSCASECMP |
96 | int wcscasecmp(const wchar_t *s1, const wchar_t *s2); |
97 | #endif |
98 | char *hexencode(char *data, size_t datalen); |
99 | char *hexdecode(char *data, size_t *len); |
100 | char *base64encode(char *data, size_t datalen); |
101 | char *base64decode(char *data, size_t *datalen); |
102 | char *base32encode(char *data, size_t datalen); |
103 | char *base32decode(char *data, size_t *datalen); |
104 | void _freeparr(void **arr); |
105 | int _parrlen(void **arr); |
955b43aa |
106 | char *findfile(char *gname, char *uname, char *homedir, int filldef); |
9ec790e8 |
107 | struct wcspair *newwcspair(wchar_t *key, wchar_t *val, struct wcspair **list); |
108 | void freewcspair(struct wcspair *pair, struct wcspair **list); |
14a9e5fd |
109 | wchar_t *wpfind(struct wcspair *list, wchar_t *key); |
d3372da9 |
110 | |
111 | #define sizebuf(b, bs, rs, es, a) _sizebuf((void **)(b), (bs), (rs), (es), (a)) |
112 | #define sizebuf2(b, rs, a) _sizebuf((void **)(&(b)), &(b ## size), (rs), sizeof(*(b)), (a)) |
113 | #define addtobuf(b, c) \ |
114 | do { \ |
115 | _sizebuf((void **)(&(b)), &(b ## size), (b ## data) + 1, sizeof(*(b)), 1); \ |
116 | (b)[(b ## data)++] = (c); \ |
117 | } while(0) |
118 | #define bufcat(d, s, n) \ |
119 | do { \ |
120 | size_t __bufcat_size__; \ |
121 | __bufcat_size__ = (n); \ |
122 | _sizebuf((void **)(&(d)), &(d ## size), (d ## data) + __bufcat_size__, sizeof(*(d)), 1); \ |
123 | memcpy((d) + (d ## data), (s), sizeof(*(d)) * __bufcat_size__); \ |
124 | (d ## data) += __bufcat_size__; \ |
125 | } while (0) |
126 | |
127 | #define freeparr(parr) _freeparr((void **)(parr)) |
128 | #define parrlen(parr) _parrlen((void **)(parr)) |
129 | |
130 | #define CBREG(obj, name, funca, destroya, dataa) \ |
131 | do { \ |
132 | struct cbchain_ ## name *__new_cb__; \ |
133 | __new_cb__ = smalloc(sizeof(*__new_cb__)); \ |
049aedb6 |
134 | __new_cb__->running = __new_cb__->free = 0; \ |
d3372da9 |
135 | __new_cb__->func = funca; \ |
136 | __new_cb__->destroy = destroya; \ |
137 | __new_cb__->data = dataa; \ |
138 | __new_cb__->prev = NULL; \ |
139 | __new_cb__->next = (obj)->name; \ |
5c851d43 |
140 | if((obj)->name != NULL) { \ |
141 | (obj)->name->prev = __new_cb__; \ |
142 | } \ |
d3372da9 |
143 | (obj)->name = __new_cb__; \ |
144 | } while(0) |
145 | |
049aedb6 |
146 | #define CBUNREG(obj, name, funca, dataa) \ |
147 | ({ \ |
d3372da9 |
148 | struct cbchain_ ## name *__cur__; \ |
049aedb6 |
149 | int __found__ = 0; \ |
d3372da9 |
150 | for(__cur__ = (obj)->name; __cur__ != NULL; __cur__ = __cur__->next) { \ |
049aedb6 |
151 | if(((void *)(__cur__->func) == (void *)(funca)) && (__cur__->data == (void *)(dataa))) { \ |
d3372da9 |
152 | if(__cur__->destroy != NULL) \ |
153 | __cur__->destroy(__cur__->data); \ |
154 | if(__cur__->prev != NULL) \ |
155 | __cur__->prev->next = __cur__->next; \ |
156 | if(__cur__->next != NULL) \ |
157 | __cur__->next->prev = __cur__->prev; \ |
158 | if(__cur__ == (obj)->name) \ |
159 | (obj)->name = __cur__->next; \ |
160 | free(__cur__); \ |
049aedb6 |
161 | __found__ = 1; \ |
d3372da9 |
162 | break; \ |
163 | } \ |
164 | } \ |
049aedb6 |
165 | __found__;}) |
d3372da9 |
166 | |
167 | #define GCBREG(name, funca, dataa) \ |
168 | do { \ |
169 | struct cbchain_ ## name *__new_cb__; \ |
170 | __new_cb__ = smalloc(sizeof(*__new_cb__)); \ |
171 | __new_cb__->func = funca; \ |
172 | __new_cb__->data = dataa; \ |
173 | __new_cb__->prev = NULL; \ |
174 | __new_cb__->next = name; \ |
5c851d43 |
175 | if(name != NULL) { \ |
176 | name->prev = __new_cb__; \ |
177 | } \ |
d3372da9 |
178 | name = __new_cb__; \ |
179 | } while(0) |
180 | |
181 | #define CBCHAININIT(obj, name) (obj)->name = NULL |
182 | |
183 | #define CBCHAINFREE(obj, name) \ |
184 | do { \ |
185 | struct cbchain_ ## name *__cur__; \ |
186 | while((__cur__ = (obj)->name) != NULL) { \ |
187 | (obj)->name = __cur__->next; \ |
049aedb6 |
188 | if(__cur__->running) { \ |
189 | __cur__->free = 1; \ |
190 | } else { \ |
191 | if(__cur__->destroy != NULL) \ |
192 | __cur__->destroy(__cur__->data); \ |
193 | free(__cur__); \ |
194 | } \ |
d3372da9 |
195 | } \ |
196 | } while(0) |
197 | |
198 | #define CBCHAINDOCB(obj, name, args...) \ |
199 | do { \ |
200 | struct cbchain_ ## name *__cur__, *__next__; \ |
049aedb6 |
201 | int __res__; \ |
d3372da9 |
202 | for(__cur__ = (obj)->name; __cur__ != NULL; __cur__ = __next__) { \ |
203 | __next__ = __cur__->next; \ |
049aedb6 |
204 | __cur__->running = 1; \ |
205 | __res__ = __cur__->func(args, __cur__->data); \ |
206 | __cur__->running = 0; \ |
207 | if(__cur__->free) { \ |
208 | free(__cur__); \ |
209 | break; \ |
210 | } \ |
211 | if(__res__) { \ |
d3372da9 |
212 | if(__cur__->next != NULL) \ |
213 | __cur__->next->prev = __cur__->prev; \ |
214 | if(__cur__->prev != NULL) \ |
215 | __cur__->prev->next = __cur__->next; \ |
216 | if(__cur__ == (obj)->name) \ |
217 | (obj)->name = __cur__->next; \ |
218 | free(__cur__); \ |
219 | } \ |
220 | } \ |
221 | } while(0) |
222 | |
223 | #define GCBCHAINDOCB(name, args...) \ |
224 | ({ \ |
225 | struct cbchain_ ## name *__cur__; \ |
226 | int __ret__; \ |
227 | __ret__ = 0; \ |
228 | for(__cur__ = name; __cur__ != NULL; __cur__ = __cur__->next) { \ |
229 | if(__cur__->func(args, __cur__->data)) { \ |
230 | __ret__ = 1; \ |
231 | break; \ |
232 | } \ |
233 | } \ |
234 | __ret__; \ |
235 | }) |
236 | |
237 | #endif |