1 /* tools.c - miscellaneous utility functions
2 * Copyright 2000-2004 srvx Development Team
4 * This file is part of srvx.
6 * srvx is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with srvx; if not, write to the Free Software Foundation,
18 * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
29 #ifdef HAVE_SYS_SOCKET_H
30 #include <sys/socket.h>
32 #ifdef HAVE_ARPA_INET_H
33 #include <arpa/inet.h>
37 #define NUMNICKBASE (1 << NUMNICKLOG)
38 #define NUMNICKMASK (NUMNICKBASE - 1)
40 /* Yes, P10's encoding here is almost-but-not-quite MIME Base64. Yay
41 * for gratuitous incompatibilities. */
42 static const char convert2y[256] = {
43 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P',
44 'Q','R','S','T','U','V','W','X','Y','Z','a','b','c','d','e','f',
45 'g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v',
46 'w','x','y','z','0','1','2','3','4','5','6','7','8','9','[',']'
49 static const unsigned char convert2n[256] = {
50 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
51 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
52 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
53 52,53,54,55,56,57,58,59,60,61, 0, 0, 0, 0, 0, 0,
54 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,
55 15,16,17,18,19,20,21,22,23,24,25,62, 0,63, 0, 0,
56 0,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,
57 41,42,43,44,45,46,47,48,49,50,51, 0, 0, 0, 0, 0
60 static const unsigned char ctype[256] = {
61 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
62 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
63 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
64 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0,
65 0,10,11,12,13,14,15, 0, 0, 0, 0, 0, 0, 0, 0, 0,
66 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
67 0,10,11,12,13,14,15, 0, 0, 0, 0, 0, 0, 0, 0, 0,
71 base64toint(const char* s, int count)
75 i = (i << NUMNICKLOG) + convert2n[(unsigned char)*s++];
81 const char* inttobase64(char* buf, unsigned int v, unsigned int count)
85 buf[--count] = convert2y[(unsigned char)(v & NUMNICKMASK)];
92 irc_ntop(char *output, unsigned int out_size, const irc_in_addr_t *addr)
94 static const char hexdigits[] = "0123456789abcdef";
100 if (irc_in_addr_is_ipv4(*addr)) {
103 ip4 = (ntohs(addr->in6[6]) << 16) | ntohs(addr->in6[7]);
104 pos = snprintf(output, out_size, "%u.%u.%u.%u", (ip4 >> 24), (ip4 >> 16) & 255, (ip4 >> 8) & 255, ip4 & 255);
106 unsigned int part, max_start, max_zeros, curr_zeros, ii;
108 /* Find longest run of zeros. */
109 for (max_start = max_zeros = curr_zeros = ii = 0; ii < 8; ++ii) {
112 else if (curr_zeros > max_zeros) {
113 max_start = ii - curr_zeros;
114 max_zeros = curr_zeros;
118 if (curr_zeros > max_zeros) {
119 max_start = ii - curr_zeros;
120 max_zeros = curr_zeros;
123 /* Print out address. */
124 #define APPEND(CH) do { if (pos < out_size) output[pos] = (CH); pos++; } while (0)
125 for (pos = 0, ii = 0; ii < 8; ++ii) {
126 if ((max_zeros > 0) && (ii == max_start)) {
133 part = ntohs(addr->in6[ii]);
135 APPEND(hexdigits[part >> 12]);
137 APPEND(hexdigits[(part >> 8) & 15]);
139 APPEND(hexdigits[(part >> 4) & 15]);
140 APPEND(hexdigits[part & 15]);
145 output[pos < out_size ? pos : out_size - 1] = '\0';
152 irc_ntop_mask(char *output, unsigned int out_size, const irc_in_addr_t *addr, unsigned char bits)
154 char base_addr[IRC_NTOP_MAX_SIZE];
158 return irc_ntop(output, out_size, addr);
159 if (!irc_ntop(base_addr, sizeof(base_addr), addr))
161 len = snprintf(output, out_size, "%s/%d", base_addr, bits);
162 if ((unsigned int)len >= out_size)
168 irc_pton_ip4(const char *input, unsigned char *pbits, uint32_t *output)
170 unsigned int dots = 0, pos = 0, part = 0, ip = 0, bits = 32;
172 /* Intentionally no support for bizarre IPv4 formats (plain
173 * integers, octal or hex components) -- only vanilla dotted
174 * decimal quads, optionally with trailing /nn.
178 while (1) switch (input[pos]) {
183 ip |= part << (24 - 8 * dots++);
189 if (input[++pos] == '.')
191 ip |= part << (24 - 8 * dots++);
193 if (input[pos] == '*') {
194 while (input[++pos] == '*') ;
195 if (input[pos] != '\0')
204 if (!pbits || !isdigit(input[pos + 1]))
206 for (bits = 0; isdigit(input[++pos]); )
207 bits = bits * 10 + input[pos] - '0';
211 case '0': case '1': case '2': case '3': case '4':
212 case '5': case '6': case '7': case '8': case '9':
213 part = part * 10 + input[pos++] - '0';
221 irc_pton(irc_in_addr_t *addr, unsigned char *bits, const char *input)
223 const char *part_start = NULL;
226 unsigned int part = 0, pos = 0, ii = 0, cpos = 8;
229 memset(addr, 0, sizeof(*addr));
230 colon = strchr(input, ':');
231 dot = strchr(input, '.');
233 if (colon && (!dot || (dot > colon))) {
234 /* Parse IPv6, possibly like ::127.0.0.1.
235 * This is pretty straightforward; the only trick is borrowed
236 * from Paul Vixie (BIND): when it sees a "::" continue as if
237 * it were a single ":", but note where it happened, and fill
238 * with zeros afterwards.
240 if (input[pos] == ':') {
241 if ((input[pos+1] != ':') || (input[pos+2] == ':'))
245 part_start = input + pos;
247 while (ii < 8) switch (input[pos]) {
248 case '0': case '1': case '2': case '3': case '4':
249 case '5': case '6': case '7': case '8': case '9':
250 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
251 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
252 part = (part << 4) | (ctype[(unsigned char)input[pos++]] & 15);
257 part_start = input + ++pos;
258 if (input[pos] == '.')
260 addr->in6[ii++] = htons(part);
262 if (input[pos] == ':') {
271 len = irc_pton_ip4(part_start, bits, &ip4);
272 if (!len || (ii > 6))
274 memcpy(addr->in6 + ii, &ip4, sizeof(ip4));
278 pos = part_start + len - input;
282 if (!bits || !isdigit(input[pos + 1]))
284 addr->in6[ii++] = htons(part);
285 for (part = 0; isdigit(input[++pos]); )
286 part = part * 10 + input[pos] - '0';
292 while (input[++pos] == '*') ;
293 if (input[pos] != '\0' || cpos < 8)
299 addr->in6[ii++] = htons(part);
300 if (cpos == 8 && ii < 8)
307 /* Shift stuff after "::" up and fill middle with zeros. */
310 for (jj = 0; jj < ii - cpos; jj++)
311 addr->in6[7 - jj] = addr->in6[ii - jj - 1];
312 for (jj = 0; jj < 8 - ii; jj++)
313 addr->in6[cpos + jj] = 0;
317 pos = irc_pton_ip4(input, bits, &ip4);
319 /* glibc's htons() macro is not -Wshadow-safe. */
321 addr->in6[5] = htons(65535);
322 addr->in6[6] = htons(ntohl(ip4) >> 16);
323 addr->in6[7] = htons(ntohl(ip4) & 65535);
327 } else if (input[0] == '*') {
328 while (input[++pos] == '*') ;
329 if (input[pos] != '\0')
337 const char *irc_ntoa(const irc_in_addr_t *addr)
339 static char ntoa[IRC_NTOP_MAX_SIZE];
340 irc_ntop(ntoa, sizeof(ntoa), addr);
345 irc_check_mask(const irc_in_addr_t *check, const irc_in_addr_t *mask, unsigned char bits)
349 for (ii = 0; (ii < 8) && (bits > 16); bits -= 16, ++ii)
350 if (check->in6[ii] != mask->in6[ii])
352 if (ii < 8 && bits > 0
353 && (ntohs(check->in6[ii] ^ mask->in6[ii]) >> (16 - bits)))
358 static char irc_tolower[256];
360 #define tolower(X) irc_tolower[(unsigned char)(X)]
363 irccasecmp(const char *stra, const char *strb) {
364 while (*stra && (tolower(*stra) == tolower(*strb)))
366 return tolower(*stra) - tolower(*strb);
370 ircncasecmp(const char *stra, const char *strb, unsigned int len) {
372 while (*stra && (tolower(*stra) == tolower(*strb)) && len)
373 stra++, strb++, len--;
374 return tolower(*stra) - tolower(*strb);
378 irccasestr(const char *haystack, const char *needle) {
379 unsigned int hay_len = strlen(haystack), needle_len = strlen(needle), pos;
380 if (hay_len < needle_len)
382 for (pos=0; pos<hay_len+1-needle_len; ++pos) {
383 if ((tolower(haystack[pos]) == tolower(*needle))
384 && !ircncasecmp(haystack+pos, needle, needle_len))
391 ircstrlower(char *str) {
393 for (ii = 0; str[ii] != '\0'; ++ii)
394 str[ii] = tolower(str[ii]);
399 split_line(char *line, int irc_colon, int argv_size, char *argv[])
403 while (*line && (argc < argv_size)) {
406 if (*line == ':' && irc_colon && argc > 0) {
407 /* the rest is a single parameter */
408 argv[argc++] = line + 1;
414 if (argc >= argv_size)
416 while (*line != ' ' && *line)
422 for (n=argc; n<argv_size; n++)
423 argv[n] = (char*)0xFEEDBEEF;
428 /* This is ircu's mmatch() function, from match.c. */
429 int mmatch(const char *old_mask, const char *new_mask)
431 register const char *m = old_mask;
432 register const char *n = new_mask;
453 for (m--; (m > old_mask) && (*m == '?'); m--)
455 if ((*m == '*') && (m > old_mask) && (m[-1] != '\\'))
461 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
462 if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?')))
473 if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?')))
481 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
482 if ((*n == '\\') && ((n[1] == '*') || (n[1] == '?')))
491 * This `if' has been changed compared to match() to do the following:
493 * old (m) new (n) boolean expression
494 * * any (*m == '*' && !mq) ||
495 * ? any except '*' (*m == '?' && !mq && (*n != '*' || nq)) ||
496 * any except * or ? same as m (!((*m == '*' || *m == '?') && !mq) &&
497 * toLower(*m) == toLower(*n) &&
498 * !((mq && !nq) || (!mq && nq)))
500 * Here `any' also includes \* and \? !
502 * After reworking the boolean expressions, we get:
503 * (Optimized to use boolean shortcircuits, with most frequently occuring
504 * cases upfront (which took 2 hours!)).
506 if ((*m == '*' && !mq) ||
507 ((!mq || nq) && tolower(*m) == tolower(*n)) ||
508 (*m == '?' && !mq && (*n != '*' || nq)))
521 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
522 if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?')))
531 match_ircglob(const char *text, const char *glob)
533 const char *m = glob, *n = text;
534 const char *m_tmp = glob, *n_tmp = text;
537 for (;;) switch (*m) {
551 /* allow escaping to force capitalization */
556 for (star_p = 0; ; m++) {
559 else if (*m == '?') {
567 else if (*m == '\\') {
571 for (n_tmp = n; *n && *n != *m; n++) ;
574 for (n_tmp = n; *n && tolower(*n) != tolower(*m); n++) ;
577 /* and fall through */
581 if (tolower(*m) != tolower(*n))
589 extern const char *hidden_host_suffix;
592 user_matches_glob(struct userNode *user, const char *orig_glob, int flags)
596 /* Make a writable copy of the glob */
597 glob = alloca(strlen(orig_glob)+1);
598 strcpy(glob, orig_glob);
599 /* Check the nick, if it's present */
600 if (flags & MATCH_USENICK) {
601 if (!(marker = strchr(glob, '!'))) {
602 log_module(MAIN_LOG, LOG_ERROR, "user_matches_glob(\"%s\", \"%s\", %d) called, and glob doesn't include a '!'", user->nick, orig_glob, flags);
606 if (!match_ircglob(user->nick, glob)) return 0;
609 /* Check the ident */
610 if (!(marker = strchr(glob, '@'))) {
611 log_module(MAIN_LOG, LOG_ERROR, "user_matches_glob(\"%s\", \"%s\", %d) called, and glob doesn't include an '@'", user->nick, orig_glob, flags);
615 if (!match_ircglob(user->ident, glob))
618 /* Check for a fakehost match. */
619 if (IsFakeHost(user) && match_ircglob(user->fakehost, glob))
621 /* Check for an account match. */
622 if (hidden_host_suffix && user->handle_info) {
623 char hidden_host[HOSTLEN+1];
624 snprintf(hidden_host, sizeof(hidden_host), "%s.%s", user->handle_info->handle, hidden_host_suffix);
625 if (match_ircglob(hidden_host, glob))
628 /* If only matching the visible hostnames, bail early. */
629 if ((flags & MATCH_VISIBLE) && IsHiddenHost(user)
630 && (IsFakeHost(user) || (hidden_host_suffix && user->handle_info)))
632 /* If it might be an IP glob, test that. */
633 if (!glob[strspn(glob, "0123456789./*?")]
634 && match_ircglob(irc_ntoa(&user->ip), glob))
636 /* None of the above; could only be a hostname match. */
637 return match_ircglob(user->hostname, glob);
641 is_ircmask(const char *text)
643 while (*text && (isalnum((char)*text) || strchr("-_[]|\\`^{}?*", *text)))
647 while (*text && *text != '@' && !isspace((char)*text))
651 while (*text && !isspace((char)*text))
657 is_gline(const char *text)
661 text += strcspn(text, "@!% \t\r\n");
666 while (*text && (isalnum((char)*text) || strchr(".-?*:", *text)))
672 split_ircmask(char *text, char **nick, char **ident, char **host)
677 while (isalnum((char)*text) || strchr("=[]\\`^{}?*", *text))
679 if (*text != '!' || ((text - start) > NICKLEN))
686 while (*text && *text != '@' && !isspace((char)*text))
688 if (*text != '@' || ((text - start) > USERLEN))
695 while (*text && (isalnum((char)*text) || strchr(".-?*:", *text)))
699 return !*text && ((text - start) <= HOSTLEN) && nick && ident && host;
703 sanitize_ircmask(char *input)
705 unsigned int length, flag;
706 char *mask, *start, *output;
708 /* Sanitize everything in place; input *must* be a valid
713 /* The nick is truncated at the end. */
716 while(*input++ != '!')
725 /* This flag is used to indicate following parts should
734 /* The ident and host must be truncated at the beginning and
735 replaced with a '*' to be compatible with ircu. */
738 while(*input++ != '@')
742 if(length > USERLEN || flag)
746 start = input - USERLEN;
768 if(length > HOSTLEN || flag)
772 start = input - HOSTLEN;
786 TypeLength(char type)
789 case 'y': return 365*24*60*60;
790 case 'M': return 31*24*60*60;
791 case 'w': return 7*24*60*60;
792 case 'd': return 24*60*60;
793 case 'h': return 60*60;
801 ParseInterval(const char *interval)
803 unsigned long seconds = 0;
807 /* process the string, resetting the count if we find a unit character */
808 while ((c = *interval++)) {
809 if (isdigit((int)c)) {
810 partial = partial*10 + c - '0';
811 } else if (strchr("yMwdhms", c)) {
812 seconds += TypeLength(c) * partial;
818 /* assume the last chunk is seconds (the normal case) */
819 return seconds + partial;
823 GetSizeMultiplier(char type)
826 case 'G': case 'g': return 1024*1024*1024;
827 case 'M': case 'm': return 1024*1024;
828 case 'K': case 'k': return 1024;
829 case 'B': case 'b': return 1;
835 ParseVolume(const char *volume)
837 unsigned long accum = 0, partial = 0;
839 while ((c = *volume++)) {
840 if (isdigit((int)c)) {
841 partial = partial*10 + c - '0';
843 accum += GetSizeMultiplier(c) * partial;
847 return accum + partial;
851 unsplit_string(char *set[], unsigned int max, char *dest)
853 static char unsplit_buffer[MAXLEN*2];
854 unsigned int ii, jj, pos;
857 dest = unsplit_buffer;
858 for (ii=pos=0; ii<max; ii++) {
859 for (jj=0; set[ii][jj]; jj++)
860 dest[pos++] = set[ii][jj];
868 intervalString(char *output, unsigned long interval, struct handle_info *hi)
870 static const struct {
871 const char *msg_single;
872 const char *msg_plural;
873 unsigned long length;
875 { "MSG_YEAR", "MSG_YEARS", 365 * 24 * 60 * 60 },
876 { "MSG_WEEK", "MSG_WEEKS", 7 * 24 * 60 * 60 },
877 { "MSG_DAY", "MSG_DAYS", 24 * 60 * 60 },
878 { "MSG_HOUR", "MSG_HOURS", 60 * 60 },
879 { "MSG_MINUTE", "MSG_MINUTES", 60 },
880 { "MSG_SECOND", "MSG_SECONDS", 1 }
882 struct language *lang;
884 unsigned int type, words, pos, count;
886 lang = hi ? hi->language : lang_C;
889 msg = language_find_message(lang, "MSG_0_SECONDS");
890 return strcpy(output, msg);
893 for (type = 0, words = pos = 0;
894 interval && (words < 2) && (type < ArrayLength(unit));
896 if (interval < unit[type].length)
898 count = interval / unit[type].length;
899 interval = interval % unit[type].length;
902 msg = language_find_message(lang, "MSG_AND");
903 pos += sprintf(output + pos, " %s ", msg);
906 msg = language_find_message(lang, unit[type].msg_single);
908 msg = language_find_message(lang, unit[type].msg_plural);
909 pos += sprintf(output + pos, "%d %s", count, msg);
917 getipbyname(const char *name, unsigned long *ip)
919 struct hostent *he = gethostbyname(name);
922 if (he->h_addrtype != AF_INET)
924 memcpy(ip, he->h_addr_list[0], sizeof(*ip));
928 DEFINE_LIST(string_buffer, char)
931 string_buffer_append_substring(struct string_buffer *buf, const char *tail, unsigned int len)
933 while (buf->used + len >= buf->size) {
938 buf->list = realloc(buf->list, buf->size*sizeof(buf->list[0]));
940 memcpy(buf->list + buf->used, tail, len+1);
945 string_buffer_append_string(struct string_buffer *buf, const char *tail)
947 string_buffer_append_substring(buf, tail, strlen(tail));
951 string_buffer_append_vprintf(struct string_buffer *buf, const char *fmt, va_list args)
957 VA_COPY(working, args);
959 if (!buf->list || ((buf->used + buf->size) < len)) {
960 buf->size = buf->used + len;
961 buf->list = realloc(buf->list, buf->size);
963 ret = vsnprintf(buf->list + buf->used, buf->size - buf->used, fmt, working);
965 /* pre-C99 behavior; double buffer size until it is big enough */
967 VA_COPY(working, args);
968 while ((ret = vsnprintf(buf->list + buf->used, buf->size - buf->used, fmt, working)) <= 0) {
970 buf->list = realloc(buf->list, buf->size);
972 VA_COPY(working, args);
975 } else if (buf->used + ret < buf->size) {
976 /* no need to increase allocation size */
979 /* now we know exactly how much space we need */
980 if (buf->size <= buf->used + ret) {
981 buf->size = buf->used + ret + 1;
982 buf->list = realloc(buf->list, buf->size);
985 VA_COPY(working, args);
986 buf->used += vsnprintf(buf->list + buf->used, buf->size, fmt, working);
992 void string_buffer_append_printf(struct string_buffer *buf, const char *fmt, ...)
996 string_buffer_append_vprintf(buf, fmt, args);
1000 string_buffer_replace(struct string_buffer *buf, unsigned int from, unsigned int len, const char *repl)
1002 unsigned int repl_len = strlen(repl);
1003 if (from > buf->used)
1005 if (len + from > buf->used)
1006 len = buf->used - from;
1007 buf->used = buf->used + repl_len - len;
1008 if (buf->size <= buf->used) {
1009 while (buf->used >= buf->size)
1011 buf->list = realloc(buf->list, buf->size*sizeof(buf->list[0]));
1013 memmove(buf->list+from+repl_len, buf->list+from+len, strlen(buf->list+from+len));
1014 strcpy(buf->list+from, repl);
1017 struct string_list str_tab;
1020 strtab(unsigned int ii) {
1023 if (ii > str_tab.size) {
1024 unsigned int old_size = str_tab.size;
1025 while (ii >= str_tab.size)
1027 str_tab.list = realloc(str_tab.list, str_tab.size*sizeof(str_tab.list[0]));
1028 memset(str_tab.list+old_size, 0, (str_tab.size-old_size)*sizeof(str_tab.list[0]));
1030 if (!str_tab.list[ii]) {
1031 str_tab.list[ii] = malloc(12);
1032 sprintf(str_tab.list[ii], "%u", ii);
1034 return str_tab.list[ii];
1040 unsigned int upr, lwr;
1041 for (lwr=0; lwr<256; ++lwr)
1043 for (upr='A', lwr='a'; lwr <= 'z'; ++upr, ++lwr)
1045 #ifdef WITH_PROTOCOL_P10
1046 for (upr='[', lwr='{'; lwr <= '~'; ++upr, ++lwr)
1048 for (upr=0xc0, lwr=0xe0; lwr <= 0xf6; ++upr, ++lwr)
1050 for (upr=0xd8, lwr=0xf8; lwr <= 0xfe; ++upr, ++lwr)
1053 str_tab.size = 1001;
1054 str_tab.list = calloc(str_tab.size, sizeof(str_tab.list[0]));
1061 for (ii=0; ii<str_tab.size; ++ii)
1062 free(str_tab.list[ii]);