[doldaconnect.git] / include / utils.h

/*
 *  Dolda Connect - Modular multiuser Direct Connect-style client
 *  Copyright (C) 2004 Fredrik Tolf (fredrik@dolda2000.com)
 *  
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *  
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *  
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/
#ifndef _UTILS_H
#define _UTILS_H

#include <stdarg.h>
#include <stdlib.h>
#include <malloc.h>
#ifdef DAEMON
#include "log.h"
#endif

struct wcspair {
    struct wcspair *next;
    wchar_t *key;
    wchar_t *val;
};


/* "Safe" functions */
#ifdef DAEMON
#define LOGOOM(size) flog(LOG_CRIT, "%s (%s:%i): out of memory (alloc %i)", __FUNCTION__, __FILE__, __LINE__, (size))
#define smalloc(size) ({void *__result__; ((__result__ = malloc(size)) == NULL)?({LOGOOM(size); abort(); (void *)0;}):__result__;})
#define srealloc(ptr, size) ({void *__result__; ((__result__ = realloc((ptr), (size))) == NULL)?({LOGOOM(size); abort(); (void *)0;}):__result__;})
#define swcsdup(wcs) ((wchar_t *)wcscpy(smalloc(sizeof(wchar_t) * (wcslen(wcs) + 1)), (wcs)))
#define sstrdup(str) ((char *)strcpy(smalloc(strlen(str) + 1), (str)))
#else
#define LOGOOM(size)
#define smalloc(size) ({void *__result__; ((__result__ = malloc(size)) == NULL)?({exit(-1); (void *)0;}):__result__;})
#define srealloc(ptr, size) ({void *__result__; ((__result__ = realloc((ptr), (size))) == NULL)?({exit(-1); (void *)0;}):__result__;})
#define swcsdup(wcs) ((wchar_t *)wcscpy(smalloc(sizeof(wchar_t) * (wcslen(wcs) + 1)), (wcs)))
#define sstrdup(str) ((char *)strcpy(smalloc(strlen(str) + 1), (str)))
#endif

#define CBCHAIN(name, args...) \
struct cbchain_ ## name { \
    struct cbchain_ ## name *next, *prev; \
    int (*func)(args, void *data); \
    void (*destroy)(void *data); \
    void *data; \
} * name

#define GCBCHAIN(name, args...) \
struct cbchain_ ## name * name = NULL

#define EGCBCHAIN(name, args...) \
extern struct cbchain_ ## name { \
    struct cbchain_ ## name *next, *prev; \
    int (*func)(args, void *data); \
    void *data; \
} * name

extern int vswprintf (wchar_t *__restrict __s, size_t __n,
		      __const wchar_t *__restrict __format,
		      __gnuc_va_list __arg);
extern int swprintf (wchar_t *__restrict __s, size_t __n,
		     __const wchar_t *__restrict __format, ...);

char *vsprintf2(char *format, va_list al);
char *sprintf2(char *format, ...)
#if defined(__GNUC__) && 0
    __attribute__ ((format (printf, 1, 2)))
#endif
;
wchar_t *vswprintf2(wchar_t *format, va_list al);
wchar_t *swprintf2(wchar_t *format, ...);
int havecharset(char *charset);
wchar_t *icmbstowcs(char *mbs, char *charset);
wchar_t *icsmbstowcs(char *mbs, char *charset, wchar_t *def);
char *icwcstombs(wchar_t *wcs, char *charset);
char *icswcstombs(wchar_t *wcs, char *charset, char *def);
wchar_t *wcstolower(wchar_t *wcs);
wchar_t ucptowc(int ucp);
void _sizebuf(void **buf, size_t *bufsize, size_t reqsize, size_t elsize, int algo);
double ntime(void);
int wcsexists(wchar_t *h, wchar_t *n);
#ifndef HAVE_WCSCASECMP
int wcscasecmp(const wchar_t *s1, const wchar_t *s2);
#endif
char *hexencode(char *data, size_t datalen);
char *hexdecode(char *data, size_t *len);
char *base64encode(char *data, size_t datalen);
char *base64decode(char *data, size_t *datalen);
char *base32encode(char *data, size_t datalen);
char *base32decode(char *data, size_t *datalen);
void _freeparr(void **arr);
int _parrlen(void **arr);
char *findfile(char *gname, char *uname, char *homedir, int filldef);
struct wcspair *newwcspair(wchar_t *key, wchar_t *val, struct wcspair **list);
void freewcspair(struct wcspair *pair, struct wcspair **list);
wchar_t *wpfind(struct wcspair *list, wchar_t *key);

#define sizebuf(b, bs, rs, es, a) _sizebuf((void **)(b), (bs), (rs), (es), (a))
#define sizebuf2(b, rs, a) _sizebuf((void **)(&(b)), &(b ## size), (rs), sizeof(*(b)), (a))
#define addtobuf(b, c) \
do { \
    _sizebuf((void **)(&(b)), &(b ## size), (b ## data) + 1, sizeof(*(b)), 1); \
    (b)[(b ## data)++] = (c); \
} while(0)
#define bufcat(d, s, n) \
do { \
    size_t __bufcat_size__; \
    __bufcat_size__ = (n); \
    _sizebuf((void **)(&(d)), &(d ## size), (d ## data) + __bufcat_size__, sizeof(*(d)), 1); \
    memcpy((d) + (d ## data), (s), sizeof(*(d)) * __bufcat_size__); \
    (d ## data) += __bufcat_size__; \
} while (0)

#define freeparr(parr) _freeparr((void **)(parr))
#define parrlen(parr) _parrlen((void **)(parr))

#define CBREG(obj, name, funca, destroya, dataa) \
do { \
    struct cbchain_ ## name *__new_cb__; \
    __new_cb__ = smalloc(sizeof(*__new_cb__)); \
    __new_cb__->func = funca; \
    __new_cb__->destroy = destroya; \
    __new_cb__->data = dataa; \
    __new_cb__->prev = NULL; \
    __new_cb__->next = (obj)->name; \
    if((obj)->name != NULL) { \
        (obj)->name->prev = __new_cb__; \
    } \
    (obj)->name = __new_cb__; \
} while(0)

#define CBUNREG(obj, name, dataa) \
do { \
    struct cbchain_ ## name *__cur__; \
    for(__cur__ = (obj)->name; __cur__ != NULL; __cur__ = __cur__->next) { \
        if(__cur__->data == (dataa)) { \
            if(__cur__->destroy != NULL) \
                __cur__->destroy(__cur__->data); \
            if(__cur__->prev != NULL) \
                __cur__->prev->next = __cur__->next; \
            if(__cur__->next != NULL) \
                __cur__->next->prev = __cur__->prev; \
            if(__cur__ == (obj)->name) \
                (obj)->name = __cur__->next; \
            free(__cur__); \
            break; \
        } \
    } \
} while(0)

#define GCBREG(name, funca, dataa) \
do { \
    struct cbchain_ ## name *__new_cb__; \
    __new_cb__ = smalloc(sizeof(*__new_cb__)); \
    __new_cb__->func = funca; \
    __new_cb__->data = dataa; \
    __new_cb__->prev = NULL; \
    __new_cb__->next = name; \
    if(name != NULL) { \
        name->prev = __new_cb__; \
    } \
    name = __new_cb__; \
} while(0)

#define CBCHAININIT(obj, name) (obj)->name = NULL

#define CBCHAINFREE(obj, name) \
do { \
    struct cbchain_ ## name *__cur__; \
    while((__cur__ = (obj)->name) != NULL) { \
        (obj)->name = __cur__->next; \
        if(__cur__->destroy != NULL) \
            __cur__->destroy(__cur__->data); \
        free(__cur__); \
    } \
} while(0)

#define CBCHAINDOCB(obj, name, args...) \
do { \
    struct cbchain_ ## name *__cur__, *__next__; \
    for(__cur__ = (obj)->name; __cur__ != NULL; __cur__ = __next__) { \
        __next__ = __cur__->next; \
        if(__cur__->func(args, __cur__->data)) { \
            if(__cur__->next != NULL) \
                __cur__->next->prev = __cur__->prev; \
            if(__cur__->prev != NULL) \
                __cur__->prev->next = __cur__->next; \
            if(__cur__ == (obj)->name) \
                (obj)->name = __cur__->next; \
            free(__cur__); \
        } \
    } \
} while(0)

#define GCBCHAINDOCB(name, args...) \
({ \
    struct cbchain_ ## name *__cur__; \
    int __ret__; \
    __ret__ = 0; \
    for(__cur__ = name; __cur__ != NULL; __cur__ = __cur__->next) { \
        if(__cur__->func(args, __cur__->data)) { \
            __ret__ = 1; \
            break; \
        } \
    } \
    __ret__; \
})

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