#ifndef _UTILS_H
#define _UTILS_H
+#include <stdio.h>
#include <stdarg.h>
+#include <sys/types.h>
#define max(a, b) (((b) > (a))?(b):(a))
#define min(a, b) (((b) < (a))?(b):(a))
#define bufinit(buf) memset(&(buf), 0, sizeof(buf))
#define buffree(buf) do { if((buf).b != NULL) {free((buf).b);} bufinit(buf); } while(0)
#define sizebuf(buf, wanted) (_sizebuf((struct buffer *)&(buf), (wanted), sizeof(*((buf).b))))
+#define bufdel(buf, i) (memmove((buf).b + (i), (buf).b + (i) + 1, (--((buf).d) - (i)) * sizeof(*((buf).b))))
#define bufadd(buf, new) \
do { \
_sizebuf((struct buffer *)&(buf), (buf).d + 1, sizeof(*((buf).b))); \
size_t s, d;
};
+struct btree {
+ struct btree *l, *r;
+ int h;
+ void *d;
+};
+
void _sizebuf(struct buffer *buf, size_t wanted, size_t el);
char *decstr(char **p, size_t *len);
char *vsprintf2(char *format, va_list al);
void bvprintf(struct charbuf *buf, char *format, va_list al);
void bprintf(struct charbuf *buf, char *format, ...);
void replstr(char **p, char *n);
+char *base64encode(char *data, size_t datalen);
+char *base64decode(char *data, size_t *datalen);
+int hexdigit(char c);
+int bbtreedel(struct btree **tree, void *item, int (*cmp)(void *, void *));
+void freebtree(struct btree **tree, void (*ffunc)(void *));
+int bbtreeput(struct btree **tree, void *item, int (*cmp)(void *, void *));
+void *btreeget(struct btree *tree, void *key, int (*cmp)(void *, void *));
+FILE *funstdio(void *pdata,
+ ssize_t (*read)(void *pdata, void *buf, size_t len),
+ ssize_t (*write)(void *pdata, const void *buf, size_t len),
+ off_t (*seek)(void *pdata, off_t offset, int whence),
+ int (*close)(void *pdata));
#endif