Commit | Line | Data |
---|---|---|
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> | |
8b17e919 | 24 | #ifdef DAEMON |
d3372da9 | 25 | #include "log.h" |
8b17e919 | 26 | #endif |
d3372da9 | 27 | |
9ec790e8 | 28 | struct wcspair { |
29 | struct wcspair *next; | |
30 | wchar_t *key; | |
31 | wchar_t *val; | |
32 | }; | |
33 | ||
8b17e919 | 34 | |
d3372da9 | 35 | /* "Safe" functions */ |
8b17e919 | 36 | #ifdef DAEMON |
12e320a0 | 37 | #define LOGOOM(size) flog(LOG_CRIT, "%s (%s:%i): out of memory (alloc %zi)", __FUNCTION__, __FILE__, __LINE__, (size)) |
38 | #define smalloc(size) ({void *__result__; ((__result__ = malloc(size)) == NULL)?({LOGOOM((ssize_t)(size)); abort(); (void *)0;}):__result__;}) | |
39 | #define srealloc(ptr, size) ({void *__result__; ((__result__ = realloc((ptr), (size))) == NULL)?({LOGOOM((ssize_t)(size)); abort(); (void *)0;}):__result__;}) | |
4344b8c8 | 40 | #define swcsdup(wcs) ({wchar_t *__eval__; __eval__ = (wcs); (wchar_t *)wcscpy(smalloc(sizeof(wchar_t) * (wcslen(__eval__) + 1)), __eval__);}) |
d3372da9 | 41 | #define sstrdup(str) ((char *)strcpy(smalloc(strlen(str) + 1), (str))) |
8b17e919 | 42 | #else |
43 | #define LOGOOM(size) | |
44 | #define smalloc(size) ({void *__result__; ((__result__ = malloc(size)) == NULL)?({exit(-1); (void *)0;}):__result__;}) | |
45 | #define srealloc(ptr, size) ({void *__result__; ((__result__ = realloc((ptr), (size))) == NULL)?({exit(-1); (void *)0;}):__result__;}) | |
46 | #define swcsdup(wcs) ((wchar_t *)wcscpy(smalloc(sizeof(wchar_t) * (wcslen(wcs) + 1)), (wcs))) | |
47 | #define sstrdup(str) ((char *)strcpy(smalloc(strlen(str) + 1), (str))) | |
48 | #endif | |
d3372da9 | 49 | |
50 | #define CBCHAIN(name, args...) \ | |
51 | struct cbchain_ ## name { \ | |
52 | struct cbchain_ ## name *next, *prev; \ | |
53 | int (*func)(args, void *data); \ | |
54 | void (*destroy)(void *data); \ | |
55 | void *data; \ | |
56 | } * name | |
57 | ||
58 | #define GCBCHAIN(name, args...) \ | |
59 | struct cbchain_ ## name * name = NULL | |
60 | ||
61 | #define EGCBCHAIN(name, args...) \ | |
62 | extern struct cbchain_ ## name { \ | |
63 | struct cbchain_ ## name *next, *prev; \ | |
64 | int (*func)(args, void *data); \ | |
65 | void *data; \ | |
66 | } * name | |
67 | ||
68 | extern int vswprintf (wchar_t *__restrict __s, size_t __n, | |
69 | __const wchar_t *__restrict __format, | |
70 | __gnuc_va_list __arg); | |
71 | extern int swprintf (wchar_t *__restrict __s, size_t __n, | |
72 | __const wchar_t *__restrict __format, ...); | |
73 | ||
74 | char *vsprintf2(char *format, va_list al); | |
75 | char *sprintf2(char *format, ...) | |
735f4b1a | 76 | #if defined(__GNUC__) |
d3372da9 | 77 | __attribute__ ((format (printf, 1, 2))) |
78 | #endif | |
d3372da9 | 79 | ; |
80 | wchar_t *vswprintf2(wchar_t *format, va_list al); | |
81 | wchar_t *swprintf2(wchar_t *format, ...); | |
6a3ef546 | 82 | int havecharset(char *charset); |
d3372da9 | 83 | wchar_t *icmbstowcs(char *mbs, char *charset); |
84 | wchar_t *icsmbstowcs(char *mbs, char *charset, wchar_t *def); | |
85 | char *icwcstombs(wchar_t *wcs, char *charset); | |
86 | char *icswcstombs(wchar_t *wcs, char *charset, char *def); | |
87 | wchar_t *wcstolower(wchar_t *wcs); | |
88 | wchar_t ucptowc(int ucp); | |
89 | void _sizebuf(void **buf, size_t *bufsize, size_t reqsize, size_t elsize, int algo); | |
90 | double ntime(void); | |
91 | int wcsexists(wchar_t *h, wchar_t *n); | |
92 | #ifndef HAVE_WCSCASECMP | |
93 | int wcscasecmp(const wchar_t *s1, const wchar_t *s2); | |
94 | #endif | |
95 | char *hexencode(char *data, size_t datalen); | |
96 | char *hexdecode(char *data, size_t *len); | |
97 | char *base64encode(char *data, size_t datalen); | |
98 | char *base64decode(char *data, size_t *datalen); | |
99 | char *base32encode(char *data, size_t datalen); | |
100 | char *base32decode(char *data, size_t *datalen); | |
101 | void _freeparr(void **arr); | |
102 | int _parrlen(void **arr); | |
7a83517c | 103 | char *findfile(char *name, char *homedir, int filldef); |
9ec790e8 | 104 | struct wcspair *newwcspair(wchar_t *key, wchar_t *val, struct wcspair **list); |
105 | void freewcspair(struct wcspair *pair, struct wcspair **list); | |
14a9e5fd | 106 | wchar_t *wpfind(struct wcspair *list, wchar_t *key); |
d3372da9 | 107 | |
108 | #define sizebuf(b, bs, rs, es, a) _sizebuf((void **)(b), (bs), (rs), (es), (a)) | |
109 | #define sizebuf2(b, rs, a) _sizebuf((void **)(&(b)), &(b ## size), (rs), sizeof(*(b)), (a)) | |
110 | #define addtobuf(b, c) \ | |
111 | do { \ | |
112 | _sizebuf((void **)(&(b)), &(b ## size), (b ## data) + 1, sizeof(*(b)), 1); \ | |
113 | (b)[(b ## data)++] = (c); \ | |
114 | } while(0) | |
115 | #define bufcat(d, s, n) \ | |
116 | do { \ | |
117 | size_t __bufcat_size__; \ | |
118 | __bufcat_size__ = (n); \ | |
119 | _sizebuf((void **)(&(d)), &(d ## size), (d ## data) + __bufcat_size__, sizeof(*(d)), 1); \ | |
120 | memcpy((d) + (d ## data), (s), sizeof(*(d)) * __bufcat_size__); \ | |
121 | (d ## data) += __bufcat_size__; \ | |
122 | } while (0) | |
c660fffa FT |
123 | #define bprintf(b, fmt...) \ |
124 | do { \ | |
125 | char *__bprintf_dest__; \ | |
126 | __bprintf_dest__ = sprintf2(fmt); \ | |
127 | bufcat(b, __bprintf_dest__, strlen(__bprintf_dest__)); \ | |
128 | free(__bprintf_dest__); \ | |
129 | } while(0) | |
d3372da9 | 130 | |
131 | #define freeparr(parr) _freeparr((void **)(parr)) | |
132 | #define parrlen(parr) _parrlen((void **)(parr)) | |
133 | ||
134 | #define CBREG(obj, name, funca, destroya, dataa) \ | |
135 | do { \ | |
136 | struct cbchain_ ## name *__new_cb__; \ | |
137 | __new_cb__ = smalloc(sizeof(*__new_cb__)); \ | |
138 | __new_cb__->func = funca; \ | |
139 | __new_cb__->destroy = destroya; \ | |
140 | __new_cb__->data = dataa; \ | |
141 | __new_cb__->prev = NULL; \ | |
142 | __new_cb__->next = (obj)->name; \ | |
5c851d43 | 143 | if((obj)->name != NULL) { \ |
144 | (obj)->name->prev = __new_cb__; \ | |
145 | } \ | |
d3372da9 | 146 | (obj)->name = __new_cb__; \ |
147 | } while(0) | |
148 | ||
cab0b442 | 149 | #define CBUNREG(obj, name, dataa) \ |
150 | do { \ | |
d3372da9 | 151 | struct cbchain_ ## name *__cur__; \ |
152 | for(__cur__ = (obj)->name; __cur__ != NULL; __cur__ = __cur__->next) { \ | |
cab0b442 | 153 | if(__cur__->data == (dataa)) { \ |
d3372da9 | 154 | if(__cur__->destroy != NULL) \ |
155 | __cur__->destroy(__cur__->data); \ | |
156 | if(__cur__->prev != NULL) \ | |
157 | __cur__->prev->next = __cur__->next; \ | |
158 | if(__cur__->next != NULL) \ | |
159 | __cur__->next->prev = __cur__->prev; \ | |
160 | if(__cur__ == (obj)->name) \ | |
161 | (obj)->name = __cur__->next; \ | |
162 | free(__cur__); \ | |
163 | break; \ | |
164 | } \ | |
165 | } \ | |
cab0b442 | 166 | } while(0) |
d3372da9 | 167 | |
168 | #define GCBREG(name, funca, dataa) \ | |
169 | do { \ | |
170 | struct cbchain_ ## name *__new_cb__; \ | |
171 | __new_cb__ = smalloc(sizeof(*__new_cb__)); \ | |
172 | __new_cb__->func = funca; \ | |
173 | __new_cb__->data = dataa; \ | |
174 | __new_cb__->prev = NULL; \ | |
175 | __new_cb__->next = name; \ | |
5c851d43 | 176 | if(name != NULL) { \ |
177 | name->prev = __new_cb__; \ | |
178 | } \ | |
d3372da9 | 179 | name = __new_cb__; \ |
180 | } while(0) | |
181 | ||
182 | #define CBCHAININIT(obj, name) (obj)->name = NULL | |
183 | ||
184 | #define CBCHAINFREE(obj, name) \ | |
185 | do { \ | |
186 | struct cbchain_ ## name *__cur__; \ | |
187 | while((__cur__ = (obj)->name) != NULL) { \ | |
188 | (obj)->name = __cur__->next; \ | |
cab0b442 | 189 | if(__cur__->destroy != NULL) \ |
190 | __cur__->destroy(__cur__->data); \ | |
191 | free(__cur__); \ | |
d3372da9 | 192 | } \ |
193 | } while(0) | |
194 | ||
195 | #define CBCHAINDOCB(obj, name, args...) \ | |
196 | do { \ | |
197 | struct cbchain_ ## name *__cur__, *__next__; \ | |
198 | for(__cur__ = (obj)->name; __cur__ != NULL; __cur__ = __next__) { \ | |
199 | __next__ = __cur__->next; \ | |
cab0b442 | 200 | if(__cur__->func(args, __cur__->data)) { \ |
d3372da9 | 201 | if(__cur__->next != NULL) \ |
202 | __cur__->next->prev = __cur__->prev; \ | |
203 | if(__cur__->prev != NULL) \ | |
204 | __cur__->prev->next = __cur__->next; \ | |
205 | if(__cur__ == (obj)->name) \ | |
206 | (obj)->name = __cur__->next; \ | |
207 | free(__cur__); \ | |
208 | } \ | |
209 | } \ | |
210 | } while(0) | |
211 | ||
212 | #define GCBCHAINDOCB(name, args...) \ | |
213 | ({ \ | |
214 | struct cbchain_ ## name *__cur__; \ | |
215 | int __ret__; \ | |
216 | __ret__ = 0; \ | |
217 | for(__cur__ = name; __cur__ != NULL; __cur__ = __cur__->next) { \ | |
218 | if(__cur__->func(args, __cur__->data)) { \ | |
219 | __ret__ = 1; \ | |
220 | break; \ | |
221 | } \ | |
222 | } \ | |
223 | __ret__; \ | |
224 | }) | |
225 | ||
226 | #endif |