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.
28 #ifdef HAVE_SYS_SOCKET_H
29 #include <sys/socket.h>
31 #ifdef HAVE_ARPA_INET_H
32 #include <arpa/inet.h>
36 #define NUMNICKBASE (1 << NUMNICKLOG)
37 #define NUMNICKMASK (NUMNICKBASE - 1)
39 /* Yes, P10's encoding here is almost-but-not-quite MIME Base64. Yay
40 * for gratuitous incompatibilities. */
41 static const char convert2y[256] = {
42 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P',
43 'Q','R','S','T','U','V','W','X','Y','Z','a','b','c','d','e','f',
44 'g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v',
45 'w','x','y','z','0','1','2','3','4','5','6','7','8','9','[',']'
48 static const unsigned char convert2n[256] = {
49 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
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 52,53,54,55,56,57,58,59,60,61, 0, 0, 0, 0, 0, 0,
53 0, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12,13,14,
54 15,16,17,18,19,20,21,22,23,24,25,62, 0,63, 0, 0,
55 0,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,
56 41,42,43,44,45,46,47,48,49,50,51, 0, 0, 0, 0, 0
60 base64toint(const char* s, int count)
64 i = (i << NUMNICKLOG) + convert2n[(unsigned char)*s++];
70 const char* inttobase64(char* buf, unsigned int v, unsigned int count)
74 buf[--count] = convert2y[(unsigned char)(v & NUMNICKMASK)];
80 static char irc_tolower[256];
82 #define tolower(X) irc_tolower[(unsigned char)(X)]
85 irccasecmp(const char *stra, const char *strb) {
86 while (*stra && (tolower(*stra) == tolower(*strb)))
88 return tolower(*stra) - tolower(*strb);
92 ircncasecmp(const char *stra, const char *strb, unsigned int len) {
94 while (*stra && (tolower(*stra) == tolower(*strb)) && len)
95 stra++, strb++, len--;
96 return tolower(*stra) - tolower(*strb);
100 irccasestr(const char *haystack, const char *needle) {
101 unsigned int hay_len = strlen(haystack), needle_len = strlen(needle), pos;
102 if (hay_len < needle_len)
104 for (pos=0; pos<hay_len+1-needle_len; ++pos) {
105 if ((tolower(haystack[pos]) == tolower(*needle))
106 && !ircncasecmp(haystack+pos, needle, needle_len))
113 split_line(char *line, int irc_colon, int argv_size, char *argv[])
117 while (*line && (argc < argv_size)) {
120 if (*line == ':' && irc_colon && argc > 0) {
121 /* the rest is a single parameter */
122 argv[argc++] = line + 1;
128 if (argc >= argv_size)
130 while (*line != ' ' && *line)
136 for (n=argc; n<argv_size; n++)
137 argv[n] = (char*)0xFEEDBEEF;
142 /* This is ircu's mmatch() function, from match.c. */
143 int mmatch(const char *old_mask, const char *new_mask)
145 register const char *m = old_mask;
146 register const char *n = new_mask;
167 for (m--; (m > old_mask) && (*m == '?'); m--)
169 if ((*m == '*') && (m > old_mask) && (m[-1] != '\\'))
175 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
176 if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?')))
187 if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?')))
195 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
196 if ((*n == '\\') && ((n[1] == '*') || (n[1] == '?')))
205 * This `if' has been changed compared to match() to do the following:
207 * old (m) new (n) boolean expression
208 * * any (*m == '*' && !mq) ||
209 * ? any except '*' (*m == '?' && !mq && (*n != '*' || nq)) ||
210 * any except * or ? same as m (!((*m == '*' || *m == '?') && !mq) &&
211 * toLower(*m) == toLower(*n) &&
212 * !((mq && !nq) || (!mq && nq)))
214 * Here `any' also includes \* and \? !
216 * After reworking the boolean expressions, we get:
217 * (Optimized to use boolean shortcircuits, with most frequently occuring
218 * cases upfront (which took 2 hours!)).
220 if ((*m == '*' && !mq) ||
221 ((!mq || nq) && tolower(*m) == tolower(*n)) ||
222 (*m == '?' && !mq && (*n != '*' || nq)))
235 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
236 if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?')))
245 match_ircglob(const char *text, const char *glob)
247 unsigned int star_p, q_cnt;
254 /* intentionally not tolower(...) so people can force
255 * capitalization, or we can overload \ in the future */
256 if (*text++ != *glob++)
265 else if (*glob == '?')
277 /* if this is the last glob character, it will match any text */
280 /* Thanks to the loop above, we know that the next
281 * character is a normal character. So just look for
282 * the right character.
284 for (; *text; text++) {
285 if ((tolower(*text) == tolower(*glob))
286 && match_ircglob(text+1, glob+1)) {
292 /* if !star_p, fall through to normal character case,
293 * first checking to see if ?s carried us to the end */
294 if (!*glob && !*text)
299 while (*text && *glob && *glob != '*' && *glob != '?' && *glob != '\\') {
300 if (tolower(*text++) != tolower(*glob++))
307 extern const char *hidden_host_suffix;
310 user_matches_glob(struct userNode *user, const char *orig_glob, int include_nick)
314 /* Make a writable copy of the glob */
315 glob = alloca(strlen(orig_glob)+1);
316 strcpy(glob, orig_glob);
317 /* Check the nick, if it's present */
319 if (!(marker = strchr(glob, '!'))) {
320 log_module(MAIN_LOG, LOG_ERROR, "user_matches_glob(\"%s\", \"%s\", %d) called, and glob doesn't include a '!'", user->nick, orig_glob, include_nick);
324 if (!match_ircglob(user->nick, glob)) return 0;
327 /* Check the ident */
328 if (!(marker = strchr(glob, '@'))) {
329 log_module(MAIN_LOG, LOG_ERROR, "user_matches_glob(\"%s\", \"%s\", %d) called, and glob doesn't include an '@'", user->nick, orig_glob, include_nick);
333 if (!match_ircglob(user->ident, glob))
336 /* Now check the host part */
337 if (isdigit(*glob) && !glob[strspn(glob, "0123456789./*?")]) {
338 /* Looks like an IP-based mask */
339 return match_ircglob(inet_ntoa(user->ip), glob);
341 /* The host part of the mask isn't IP-based */
342 if (hidden_host_suffix && user->handle_info) {
343 char hidden_host[HOSTLEN+1];
344 snprintf(hidden_host, sizeof(hidden_host), "%s.%s", user->handle_info->handle, hidden_host_suffix);
345 if (match_ircglob(hidden_host, glob))
348 return match_ircglob(user->hostname, glob);
353 is_ircmask(const char *text)
355 while (*text && (isalnum((char)*text) || strchr("-_[]|\\`^{}?*", *text)))
359 while (*text && *text != '@' && !isspace((char)*text))
363 while (*text && !isspace((char)*text))
369 is_gline(const char *text)
373 text += strcspn(text, "@!% \t\r\n");
378 while (*text && (isalnum((char)*text) || strchr(".-?*", *text)))
384 split_ircmask(char *text, char **nick, char **ident, char **host)
389 while (isalnum((char)*text) || strchr("=[]\\`^{}?*", *text))
391 if (*text != '!' || ((text - start) > NICKLEN))
398 while (*text && *text != '@' && !isspace((char)*text))
400 if (*text != '@' || ((text - start) > USERLEN))
407 while (*text && (isalnum((char)*text) || strchr(".-?*", *text)))
411 return !*text && ((text - start) <= HOSTLEN) && nick && ident && host;
415 sanitize_ircmask(char *input)
417 unsigned int length, flag;
418 char *mask, *start, *output;
420 /* Sanitize everything in place; input *must* be a valid
425 /* The nick is truncated at the end. */
428 while(*input++ != '!')
437 /* This flag is used to indicate following parts should
446 /* The ident and host must be truncated at the beginning and
447 replaced with a '*' to be compatible with ircu. */
450 while(*input++ != '@')
454 if(length > USERLEN || flag)
458 start = input - USERLEN;
480 if(length > HOSTLEN || flag)
484 start = input - HOSTLEN;
498 TypeLength(char type)
501 case 'y': return 365*24*60*60;
502 case 'M': return 31*24*60*60;
503 case 'w': return 7*24*60*60;
504 case 'd': return 24*60*60;
505 case 'h': return 60*60;
513 ParseInterval(const char *interval)
515 unsigned long seconds = 0;
519 /* process the string, resetting the count if we find a unit character */
520 while ((c = *interval++)) {
521 if (isdigit((int)c)) {
522 partial = partial*10 + c - '0';
524 seconds += TypeLength(c) * partial;
528 /* assume the last chunk is seconds (the normal case) */
529 return seconds + partial;
533 GetSizeMultiplier(char type)
536 case 'G': case 'g': return 1024*1024*1024;
537 case 'M': case 'm': return 1024*1024;
538 case 'K': case 'k': return 1024;
539 case 'B': case 'b': return 1;
545 ParseVolume(const char *volume)
547 unsigned long accum = 0, partial = 0;
549 while ((c = *volume++)) {
550 if (isdigit((int)c)) {
551 partial = partial*10 + c - '0';
553 accum += GetSizeMultiplier(c) * partial;
557 return accum + partial;
561 parse_ipmask(const char *str, struct in_addr *addr, unsigned long *mask)
564 unsigned long t_a, t_m;
568 addr->s_addr = htonl(t_a);
576 accum = (accum * 10) + *str++ - '0';
577 } while (isdigit(*str));
580 t_a = (t_a << 8) | accum;
581 t_m = (t_m << 8) | 255;
585 while (*str == '*') {
592 } else if (*str == 0) {
600 } else if (*str == '/') {
604 accum = (accum * 10) + *str++ - '0';
605 } while (isdigit(*str));
606 while (pos < start+accum && pos < 32) {
607 t_a = (t_a << 1) | 0;
608 t_m = (t_m << 1) | 1;
611 if (pos != start+accum)
613 } else if (*str == 0)
622 addr->s_addr = htonl(t_a);
629 unsplit_string(char *set[], unsigned int max, char *dest)
631 static char unsplit_buffer[MAXLEN*2];
632 unsigned int ii, jj, pos;
635 dest = unsplit_buffer;
636 for (ii=pos=0; ii<max; ii++) {
637 for (jj=0; set[ii][jj]; jj++)
638 dest[pos++] = set[ii][jj];
646 intervalString2(char *output, time_t interval, int brief)
648 static const struct {
652 { "year", 365 * 24 * 60 * 60 },
653 { "week", 7 * 24 * 60 * 60 },
654 { "day", 24 * 60 * 60 },
659 unsigned int type, words, pos, count;
663 strcpy(output, brief ? "0s" : "0 seconds");
667 for (type = 0, words = pos = 0;
668 interval && (words < 2) && (type < ArrayLength(unit));
670 if (interval < unit[type].length)
672 count = interval / unit[type].length;
673 interval = interval % unit[type].length;
676 pos += sprintf(output + pos, "%d%c", count, unit[type].name[0]);
678 pos += sprintf(output + pos, " and %d %s", count, unit[type].name);
680 pos += sprintf(output + pos, "%d %s", count, unit[type].name);
691 getipbyname(const char *name, unsigned long *ip)
693 struct hostent *he = gethostbyname(name);
696 if (he->h_addrtype != AF_INET)
698 memcpy(ip, he->h_addr_list[0], sizeof(*ip));
702 DEFINE_LIST(string_buffer, char)
705 string_buffer_append_substring(struct string_buffer *buf, const char *tail, unsigned int len)
707 while (buf->used + len >= buf->size) {
712 buf->list = realloc(buf->list, buf->size*sizeof(buf->list[0]));
714 memcpy(buf->list + buf->used, tail, len+1);
719 string_buffer_append_string(struct string_buffer *buf, const char *tail)
721 string_buffer_append_substring(buf, tail, strlen(tail));
725 string_buffer_append_vprintf(struct string_buffer *buf, const char *fmt, va_list args)
731 VA_COPY(working, args);
733 if (!buf->list || ((buf->used + buf->size) < len)) {
734 buf->size = buf->used + len;
735 buf->list = realloc(buf->list, buf->size);
737 ret = vsnprintf(buf->list + buf->used, buf->size - buf->used, fmt, working);
739 /* pre-C99 behavior; double buffer size until it is big enough */
741 VA_COPY(working, args);
742 while ((ret = vsnprintf(buf->list + buf->used, buf->size, fmt, working)) == -1) {
744 buf->list = realloc(buf->list, buf->size);
746 VA_COPY(working, args);
749 } else if (buf->used + ret < buf->size) {
750 /* no need to increase allocation size */
753 /* now we know exactly how much space we need */
754 if (buf->size <= buf->used + ret) {
755 buf->size = buf->used + ret + 1;
756 buf->list = realloc(buf->list, buf->size);
759 VA_COPY(working, args);
760 buf->used += vsnprintf(buf->list + buf->used, buf->size, fmt, working);
766 void string_buffer_append_printf(struct string_buffer *buf, const char *fmt, ...)
770 string_buffer_append_vprintf(buf, fmt, args);
774 string_buffer_replace(struct string_buffer *buf, unsigned int from, unsigned int len, const char *repl)
776 unsigned int repl_len = strlen(repl);
777 if (from > buf->used)
779 if (len + from > buf->used)
780 len = buf->used - from;
781 buf->used = buf->used + repl_len - len;
782 if (buf->size <= buf->used) {
783 while (buf->used >= buf->size)
785 buf->list = realloc(buf->list, buf->size*sizeof(buf->list[0]));
787 memmove(buf->list+from+repl_len, buf->list+from+len, strlen(buf->list+from+len));
788 strcpy(buf->list+from, repl);
791 struct string_list str_tab;
794 strtab(unsigned int ii) {
797 if (ii > str_tab.size) {
798 unsigned int old_size = str_tab.size;
799 while (ii >= str_tab.size)
801 str_tab.list = realloc(str_tab.list, str_tab.size*sizeof(str_tab.list[0]));
802 memset(str_tab.list+old_size, 0, (str_tab.size-old_size)*sizeof(str_tab.list[0]));
804 if (!str_tab.list[ii]) {
805 str_tab.list[ii] = malloc(12);
806 sprintf(str_tab.list[ii], "%u", ii);
808 return str_tab.list[ii];
814 unsigned int upr, lwr;
815 for (lwr=0; lwr<256; ++lwr)
817 for (upr='A', lwr='a'; lwr <= 'z'; ++upr, ++lwr)
819 #ifdef WITH_PROTOCOL_P10
820 for (upr='[', lwr='{'; lwr <= '~'; ++upr, ++lwr)
822 for (upr=0xc0, lwr=0xe0; lwr <= 0xf6; ++upr, ++lwr)
824 for (upr=0xd8, lwr=0xf8; lwr <= 0xfe; ++upr, ++lwr)
828 str_tab.list = calloc(str_tab.size, sizeof(str_tab.list[0]));
835 for (ii=0; ii<str_tab.size; ++ii)
836 free(str_tab.list[ii]);