2 * Dolda Connect - Modular multiuser Direct Connect-style client
3 * Copyright (C) 2004 Fredrik Tolf <fredrik@dolda2000.com>
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.
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.
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
31 #include <netinet/in.h>
49 static char *base64set = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
50 static int base64rev[] = {
51 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
52 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
53 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 62, -1, -1, -1, 63,
54 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, -1, -1, -1, -1,
55 -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
56 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1,
57 -1, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
58 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, -1, -1, -1, -1, -1,
59 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
60 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
61 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
62 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
63 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
64 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
65 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
66 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
68 static char *base32set = "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567";
69 static int base32rev[] = {
70 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
71 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
72 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
73 -1, -1, 26, 27, 28, 29, 30, 31, -1, -1, -1, -1, -1, -1, -1, -1,
74 -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
75 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1,
76 -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
77 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1,
78 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
79 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
80 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
81 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
82 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
83 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
84 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
85 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
88 char *vsprintf2(char *format, va_list al)
95 ret = vsnprintf(NULL, 0, format, al2);
97 if((buf = malloc(ret + 1)) == NULL)
103 vsnprintf(buf, ret + 1, format, al2);
108 char *sprintf2(char *format, ...)
113 va_start(args, format);
114 buf = vsprintf2(format, args);
119 wchar_t *vswprintf2(wchar_t *format, va_list al)
126 buf = smalloc(sizeof(wchar_t) * (bufsize = 1024));
130 ret = vswprintf(buf, bufsize, format, al2);
134 buf = srealloc(buf, sizeof(wchar_t) * (bufsize *= 2));
136 if(bufsize > ret + 1)
137 buf = srealloc(buf, sizeof(wchar_t) * (ret + 1));
141 wchar_t *swprintf2(wchar_t *format, ...)
146 va_start(args, format);
147 buf = vswprintf2(format, args);
152 int havecharset(char *charset)
156 if((cd = iconv_open("wchar_t", charset)) == (iconv_t)-1)
159 if((cd = iconv_open(charset, "wchar_t")) == (iconv_t)-1)
165 wchar_t *icmbstowcs(char *mbs, char *charset)
170 size_t len1, len2, bufsize, data;
173 len1 = strlen(mbs) + 1;
174 bufsize = len2 = len1 * sizeof(wchar_t);
175 if((buf = malloc(bufsize)) == NULL)
181 charset = nl_langinfo(CODESET);
182 if((cd = iconv_open("wchar_t", charset)) == (iconv_t)-1)
185 flog(LOG_ERR, "icmbstowcs: could not open iconv structure for %s: %s", charset, strerror(errno));
193 ret = iconv(cd, &mbs, &len1, &p, &len2);
201 if((p2 = realloc(buf, bufsize)) == NULL)
218 buf = realloc(buf, p - buf);
220 return((wchar_t *)buf);
223 wchar_t *icsmbstowcs(char *mbs, char *charset, wchar_t *def)
225 static wchar_t *buf = NULL;
229 if((buf = icmbstowcs(mbs, charset)) == NULL)
231 if((def != NULL) && (*def == L'~'))
234 flog(LOG_WARNING, "icsmbstowcs: could not convert wcs string into charset %s: %s", charset, strerror(errno));
243 char *icwcstombs(wchar_t *wcs, char *charset)
248 size_t len1, len2, bufsize, data;
251 len1 = sizeof(wchar_t) * (wcslen(wcs) + 1);
252 bufsize = len2 = len1;
253 if((buf = malloc(bufsize)) == NULL)
261 charset = nl_langinfo(CODESET);
262 if((cd = iconv_open(charset, "wchar_t")) == (iconv_t)-1)
265 flog(LOG_ERR, "icwcstombs: could not open iconv structure for %s: %s", charset, strerror(errno));
273 ret = iconv(cd, (char **)&wcs, &len1, &p, &len2);
281 if((p2 = realloc(buf, bufsize)) == NULL)
298 buf = realloc(buf, p - buf);
303 char *icswcstombs(wchar_t *wcs, char *charset, char *def)
305 static char *buf = NULL;
309 if((buf = icwcstombs(wcs, charset)) == NULL)
311 if((def != NULL) && (*def == '~'))
314 flog(LOG_WARNING, "icswcstombs: could not convert mbs string from charset %s: %s", charset, strerror(errno));
323 wchar_t *wcstolower(wchar_t *wcs)
327 for(p = wcs; *p != L'\0'; p++)
332 wchar_t ucptowc(int ucp)
335 unsigned long ucpbuf;
339 size_t len1, len2, bufsize, data;
343 mbsp = (char *)&ucpbuf;
345 bufsize = len2 = len1 * sizeof(wchar_t);
346 if((buf = malloc(bufsize)) == NULL)
351 if((cd = iconv_open("wchar_t", "UCS-4BE")) == (iconv_t)-1)
354 flog(LOG_ERR, "ucptowc: could not open iconv structure for UCS-4BE: %s", strerror(errno));
362 ret = iconv(cd, &mbsp, &len1, &p, &len2);
370 if((p2 = realloc(buf, bufsize)) == NULL)
387 buf = realloc(buf, p - buf);
389 res = *(wchar_t *)buf;
394 void _sizebuf(void **buf, size_t *bufsize, size_t reqsize, size_t elsize, int algo)
396 if(*bufsize >= reqsize)
401 *buf = srealloc(*buf, elsize * ((*bufsize) = reqsize));
406 while(*bufsize < reqsize)
408 *buf = srealloc(*buf, elsize * (*bufsize));
417 gettimeofday(&tv, NULL);
418 return((double)tv.tv_sec + ((double)tv.tv_usec / 1000000.0));
421 int wcsexists(wchar_t *h, wchar_t *n)
426 ln = alloca(sizeof(*ln) * (nl = wcslen(n)));
427 for(i = 0; i < nl; i++)
428 ln[i] = towlower(n[i]);
429 lh = alloca(sizeof(*lh) * (hl = wcslen(h)));
432 for(i = 0; i < nl; i++)
433 lh[i] = towlower(h[i]);
437 for(o = 0; o < nl; o++)
439 if(lh[i + o] != ln[o])
446 lh[i + nl] = towlower(h[i + nl]);
451 #ifndef HAVE_WCSCASECMP
452 int wcscasecmp(const wchar_t *s1, const wchar_t *s2)
454 for(; (towlower(*s1) == towlower(*s2)) && (*s1 != L'\0'); s1++, s2++);
455 return(towlower(*s1) - towlower(*s2));
459 char *hexencode(char *data, size_t datalen)
462 size_t bufsize, bufdata;
466 bufsize = bufdata = 0;
467 for(; datalen > 0; datalen--, data++)
469 dig = (*data & 0xF0) >> 4;
471 this = 'A' + dig - 10;
477 this = 'A' + dig - 10;
486 char *hexdecode(char *data, size_t *len)
488 char *buf, this, bit;
489 size_t bufsize, bufdata;
492 bufsize = bufdata = 0;
493 for(bit = 4, this = 0; *data; data++)
495 if((*data >= 'A') && (*data <= 'F'))
497 this |= (this & 0x0F) | ((*data - 'A' + 10) << bit);
498 } else if((*data >= 'a') && (*data <= 'f')) {
499 this |= (this & 0x0F) | ((*data - 'a' + 10) << bit);
500 } else if((*data >= '0') && (*data <= '9')) {
501 this |= (this & 0x0F) | ((*data - '0') << bit);
502 } else if(*data == '\n') {
528 char *base64encode(char *data, size_t datalen)
531 size_t bufsize, bufdata;
536 bufsize = bufdata = 0;
539 addtobuf(buf, base64set[(data[0] & 0xfc) >> 2]);
540 addtobuf(buf, base64set[((data[0] & 0x03) << 4) | ((data[1] & 0xf0) >> 4)]);
541 addtobuf(buf, base64set[((data[1] & 0x0f) << 2) | ((data[2] & 0xc0) >> 6)]);
542 addtobuf(buf, base64set[data[2] & 0x3f]);
548 addtobuf(buf, base64set[(data[0] & 0xfc) >> 2]);
549 addtobuf(buf, base64set[(data[0] & 0x03) << 4]);
550 bufcat(buf, "==", 2);
554 addtobuf(buf, base64set[(data[0] & 0xfc) >> 2]);
555 addtobuf(buf, base64set[((data[0] & 0x03) << 4) | ((data[1] & 0xf0) >> 4)]);
556 addtobuf(buf, base64set[(data[1] & 0x0f) << 2]);
563 char *base64decode(char *data, size_t *datalen)
567 size_t bufsize, bufdata;
570 bufsize = bufdata = 0;
573 for(; *data > 0; data++)
575 c = (int)(unsigned char)*data;
580 if(base64rev[c] == -1)
589 cur |= base64rev[c] >> -b;
594 cur |= base64rev[c] << b;
602 char *base32encode(char *data, size_t datalen)
605 size_t bufsize, bufdata;
610 bufsize = bufdata = 0;
613 addtobuf(buf, base32set[((data[0] & 0xf8) >> 3)]);
614 addtobuf(buf, base32set[((data[0] & 0x07) << 2) | ((data[1] & 0xc0) >> 6)]);
615 addtobuf(buf, base32set[((data[1] & 0x3e) >> 1)]);
616 addtobuf(buf, base32set[((data[1] & 0x01) << 4) | ((data[2] & 0xf0) >> 4)]);
617 addtobuf(buf, base32set[((data[2] & 0x0f) << 1) | ((data[3] & 0x80) >> 7)]);
618 addtobuf(buf, base32set[((data[3] & 0x7c) >> 2)]);
619 addtobuf(buf, base32set[((data[3] & 0x03) << 3) | ((data[4] & 0xe0) >> 5)]);
620 addtobuf(buf, base32set[data[4] & 0x1f]);
626 addtobuf(buf, base32set[((data[0] & 0xf8) >> 3)]);
627 addtobuf(buf, base32set[((data[0] & 0x07) << 2)]);
628 bufcat(buf, "======", 6);
632 addtobuf(buf, base32set[((data[0] & 0xf8) >> 3)]);
633 addtobuf(buf, base32set[((data[0] & 0x07) << 2) | ((data[1] & 0xc0) >> 6)]);
634 addtobuf(buf, base32set[((data[1] & 0x3e) >> 1)]);
635 addtobuf(buf, base32set[((data[1] & 0x01) << 4)]);
636 bufcat(buf, "====", 4);
640 addtobuf(buf, base32set[((data[0] & 0xf8) >> 3)]);
641 addtobuf(buf, base32set[((data[0] & 0x07) << 2) | ((data[1] & 0xc0) >> 6)]);
642 addtobuf(buf, base32set[((data[1] & 0x3e) >> 1)]);
643 addtobuf(buf, base32set[((data[1] & 0x01) << 4) | ((data[2] & 0xf0) >> 4)]);
644 addtobuf(buf, base32set[((data[2] & 0x0f) << 1)]);
645 bufcat(buf, "===", 3);
649 addtobuf(buf, base32set[((data[0] & 0xf8) >> 3)]);
650 addtobuf(buf, base32set[((data[0] & 0x07) << 2) | ((data[1] & 0xc0) >> 6)]);
651 addtobuf(buf, base32set[((data[1] & 0x3e) >> 1)]);
652 addtobuf(buf, base32set[((data[1] & 0x01) << 4) | ((data[2] & 0xf0) >> 4)]);
653 addtobuf(buf, base32set[((data[2] & 0x0f) << 1) | ((data[3] & 0x80) >> 7)]);
654 addtobuf(buf, base32set[((data[3] & 0x7c) >> 2)]);
655 addtobuf(buf, base32set[((data[3] & 0x03) << 3)]);
662 char *base32decode(char *data, size_t *datalen)
666 size_t bufsize, bufdata;
669 bufsize = bufdata = 0;
672 for(; *data > 0; data++)
674 c = (int)(unsigned char)*data;
679 if(base32rev[c] == -1)
688 cur |= base32rev[c] >> -b;
693 cur |= base32rev[c] << b;
701 void _freeparr(void **arr)
707 for(buf = arr; *buf != NULL; buf++)
712 int _parrlen(void **arr)
718 for(i = 0; *arr != NULL; arr++)
723 char *getetcpath(char *binpath)
727 size_t etcpathsize, etcpathdata;
730 etcpathsize = etcpathdata = 0;
738 for(p = binpath; *p && (*p != ':'); p++);
739 for(; (p >= binpath) && (*p != '/'); p--);
743 addtobuf(etcpath, ':');
744 bufcat(etcpath, binpath, p - binpath + 1);
745 bufcat(etcpath, "etc", 3);
747 } while((binpath = strchr(binpath, ':')) != NULL);
748 addtobuf(etcpath, 0);
752 char *findfile(char *name, char *homedir, int filldef)
754 char *path, *binpath, *etcpath, *p;
761 mode = R_OK | (filldef ? W_OK : 0);
762 homeonly = homedir != NULL;
764 if(!strchr(name, '/'))
767 homedir = getenv("HOME");
768 if((homedir == NULL) && ((pw = getpwuid(getuid())) != NULL))
769 homedir = pw->pw_dir;
770 if((homedir != NULL) && ((path = sprintf2("%s/.%s", homedir, name)) != NULL))
772 if(!access(path, mode))
780 if(strchr(name, '/') != NULL)
782 if(!access(name, mode))
783 return(sstrdup(name));
785 if((binpath = getenv("PATH")) == NULL)
786 etcpath = sstrdup("/usr/local/etc:/etc:/usr/etc");
788 etcpath = getetcpath(binpath);
789 for(p = strtok(etcpath, ":"); p != NULL; p = strtok(NULL, ":"))
791 if((path = sprintf2("%s/%s", p, name)) != NULL)
793 if(!access(path, mode))
807 return(sprintf2("%s/.%s", homedir, name));
808 return(sprintf2("/etc/%s", name));
814 struct strpair *newstrpair(char *key, char *val, struct strpair **list)
816 struct strpair *pair;
818 pair = smalloc(sizeof(*pair));
819 memset(pair, 0, sizeof(*pair));
821 pair->key = sstrdup(key);
823 pair->val = sstrdup(val);
832 void freestrpair(struct strpair *pair, struct strpair **list)
836 for(cur = *list; cur != NULL; list = &(cur->next), cur = cur->next)
849 char *spfind(struct strpair *list, char *key)
851 for(; list != NULL; list = list->next)
853 if(!strcmp(list->key, key))
859 struct wcspair *newwcspair(wchar_t *key, wchar_t *val, struct wcspair **list)
861 struct wcspair *pair;
863 pair = smalloc(sizeof(*pair));
864 memset(pair, 0, sizeof(*pair));
866 pair->key = swcsdup(key);
868 pair->val = swcsdup(val);
877 void freewcspair(struct wcspair *pair, struct wcspair **list)
881 for(cur = *list; cur != NULL; list = &(cur->next), cur = cur->next)
894 wchar_t *wpfind(struct wcspair *list, wchar_t *key)
896 for(; list != NULL; list = list->next)
898 if(!wcscmp(list->key, key))
904 static int btheight(struct btree *tree)
911 static void btsetheight(struct btree *tree)
917 lh = btheight(tree->l);
918 rh = btheight(tree->r);
919 tree->h = ((lh > rh)?lh:rh) + 1;
922 static void bbtrl(struct btree **tree);
924 static void bbtrr(struct btree **tree)
926 struct btree *m, *l, *r;
928 if(btheight((*tree)->l->r) > btheight((*tree)->l->l))
940 static void bbtrl(struct btree **tree)
942 struct btree *m, *l, *r;
944 if(btheight((*tree)->r->l) > btheight((*tree)->r->r))
956 int bbtreedel(struct btree **tree, void *item, int (*cmp)(void *, void *))
959 struct btree *s, **sp, *o;
963 if((c = cmp(item, (*tree)->d)) < 0) {
964 r = bbtreedel(&(*tree)->l, item, cmp);
966 r = bbtreedel(&(*tree)->r, item, cmp);
970 if(((*tree)->r != NULL) && ((*tree)->l != NULL)) {
973 while(s->l != NULL) {
981 } else if((*tree)->l != NULL) {
983 } else if((*tree)->r != NULL) {
992 if(btheight((*tree)->l) > btheight((*tree)->r) + 1)
994 if(btheight((*tree)->r) > btheight((*tree)->l) + 1)
1000 int bbtreeput(struct btree **tree, void *item, int (*cmp)(void *, void *))
1005 *tree = smalloc(sizeof(**tree));
1006 (*tree)->l = (*tree)->r = NULL;
1011 if((c = cmp(item, (*tree)->d)) < 0)
1012 r = bbtreeput(&(*tree)->l, item, cmp);
1014 r = bbtreeput(&(*tree)->r, item, cmp);
1018 if(btheight((*tree)->l) > btheight((*tree)->r) + 1)
1020 if(btheight((*tree)->r) > btheight((*tree)->l) + 1)
1025 void *btreeget(struct btree *tree, void *key, int (*cmp)(void *, void *))
1032 c = cmp(key, tree->d);
1042 void btreefree(struct btree *tree)
1051 static void *btreenext(void **iterp)
1053 struct treeiter *iter;
1057 if((iter = *iterp) == NULL)
1060 s = iter->st[iter->sp].s;
1061 n = iter->st[iter->sp].n;
1063 iter->st[iter->sp].s = 1;
1066 sizebuf2(iter->st, iter->sp + 1, 1);
1067 iter->st[iter->sp].s = 0;
1068 iter->st[iter->sp].n = n->l;
1071 iter->st[iter->sp].s = 2;
1072 return(iter->st[iter->sp].n->d);
1074 iter->st[iter->sp].s = 3;
1077 sizebuf2(iter->st, iter->sp + 1, 1);
1078 iter->st[iter->sp].s = 0;
1079 iter->st[iter->sp].n = n->r;
1093 static void *btreefirst(struct btree *tree, void **iterp)
1095 struct treeiter *iter;
1101 *iterp = iter = memset(smalloc(sizeof(*iter)), 0, sizeof(*iter));
1102 sizebuf2(iter->st, 1, 1);
1103 iter->st[0].n = tree;
1105 return(btreenext(iterp));
1108 static void btreestop(void **iterp)
1110 struct treeiter *iter;
1112 if((iter = *iterp) == NULL)
1114 if(iter->st != NULL)
1120 void *btreeiter(struct btree *tree)
1122 static void *iter = NULL;
1125 return(btreenext(&iter));
1129 return(btreefirst(tree, &iter));