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)) {
118 while (*line == ' ') *line++ = 0;
119 if (*line == ':' && irc_colon && argc > 0) {
120 /* the rest is a single parameter */
121 argv[argc++] = line + 1;
127 if (argc >= argv_size)
129 while (*line != ' ' && *line) line++;
134 for (n=argc; n<argv_size; n++) {
135 argv[n] = (char*)0xFEEDBEEF;
141 /* This is ircu's mmatch() function, from match.c. */
142 int mmatch(const char *old_mask, const char *new_mask)
144 register const char *m = old_mask;
145 register const char *n = new_mask;
166 for (m--; (m > old_mask) && (*m == '?'); m--)
168 if ((*m == '*') && (m > old_mask) && (m[-1] != '\\'))
174 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
175 if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?')))
186 if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?')))
194 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
195 if ((*n == '\\') && ((n[1] == '*') || (n[1] == '?')))
204 * This `if' has been changed compared to match() to do the following:
206 * old (m) new (n) boolean expression
207 * * any (*m == '*' && !mq) ||
208 * ? any except '*' (*m == '?' && !mq && (*n != '*' || nq)) ||
209 * any except * or ? same as m (!((*m == '*' || *m == '?') && !mq) &&
210 * toLower(*m) == toLower(*n) &&
211 * !((mq && !nq) || (!mq && nq)))
213 * Here `any' also includes \* and \? !
215 * After reworking the boolean expressions, we get:
216 * (Optimized to use boolean shortcircuits, with most frequently occuring
217 * cases upfront (which took 2 hours!)).
219 if ((*m == '*' && !mq) ||
220 ((!mq || nq) && tolower(*m) == tolower(*n)) ||
221 (*m == '?' && !mq && (*n != '*' || nq)))
234 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
235 if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?')))
244 match_ircglob(const char *text, const char *glob)
246 unsigned int star_p, q_cnt;
253 /* intentionally not tolower(...) so people can force
254 * capitalization, or we can overload \ in the future */
255 if (*text++ != *glob++)
264 else if (*glob == '?')
276 /* if this is the last glob character, it will match any text */
279 /* Thanks to the loop above, we know that the next
280 * character is a normal character. So just look for
281 * the right character.
283 for (; *text; text++) {
284 if ((tolower(*text) == tolower(*glob))
285 && match_ircglob(text+1, glob+1)) {
291 /* if !star_p, fall through to normal character case,
292 * first checking to see if ?s carried us to the end */
293 if (!*glob && !*text)
298 while (*text && *glob && *glob != '*' && *glob != '?' && *glob != '\\') {
299 if (tolower(*text++) != tolower(*glob++))
306 extern const char *hidden_host_suffix;
309 user_matches_glob(struct userNode *user, const char *orig_glob, int include_nick)
313 /* Make a writable copy of the glob */
314 glob = alloca(strlen(orig_glob)+1);
315 strcpy(glob, orig_glob);
316 /* Check the nick, if it's present */
318 if (!(marker = strchr(glob, '!'))) {
319 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);
323 if (!match_ircglob(user->nick, glob)) return 0;
326 /* Check the ident */
327 if (!(marker = strchr(glob, '@'))) {
328 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);
332 if (!match_ircglob(user->ident, glob))
335 /* Now check the host part */
336 if (isdigit(*glob) && !glob[strspn(glob, "0123456789./*?")]) {
337 /* Looks like an IP-based mask */
338 return match_ircglob(inet_ntoa(user->ip), glob);
340 /* The host part of the mask isn't IP-based */
341 if (hidden_host_suffix && user->handle_info) {
342 char hidden_host[HOSTLEN+1];
343 snprintf(hidden_host, sizeof(hidden_host), "%s.%s", user->handle_info->handle, hidden_host_suffix);
344 if (match_ircglob(hidden_host, glob))
347 return match_ircglob(user->hostname, glob);
352 is_ircmask(const char *text)
354 while (*text && (isalnum((char)*text) || strchr("-_[]|\\`^{}?*", *text)))
358 while (*text && *text != '@' && !isspace((char)*text))
362 while (*text && !isspace((char)*text))
368 is_gline(const char *text)
372 text += strcspn(text, "@!% \t\r\n");
377 while (*text && (isalnum((char)*text) || strchr(".-?*", *text)))
383 split_ircmask(char *text, char **nick, char **ident, char **host)
388 while (isalnum((char)*text) || strchr("=[]\\`^{}?*", *text))
390 if (*text != '!' || ((text - start) > NICKLEN))
397 while (*text && *text != '@' && !isspace((char)*text))
399 if (*text != '@' || ((text - start) > USERLEN))
406 while (*text && (isalnum((char)*text) || strchr(".-?*", *text)))
410 return !*text && ((text - start) <= HOSTLEN) && nick && ident && host;
414 sanitize_ircmask(char *input)
416 unsigned int length, flag;
417 char *mask, *start, *output;
419 /* Sanitize everything in place; input *must* be a valid
424 /* The nick is truncated at the end. */
427 while(*input++ != '!')
436 /* This flag is used to indicate following parts should
445 /* The ident and host must be truncated at the beginning and
446 replaced with a '*' to be compatible with ircu. */
449 while(*input++ != '@')
453 if(length > USERLEN || flag)
457 start = input - USERLEN;
479 if(length > HOSTLEN || flag)
483 start = input - HOSTLEN;
497 TypeLength(char type)
500 case 'y': return 365*24*60*60;
501 case 'M': return 31*24*60*60;
502 case 'w': return 7*24*60*60;
503 case 'd': return 24*60*60;
504 case 'h': return 60*60;
512 ParseInterval(const char *interval)
514 unsigned long seconds = 0;
518 /* process the string, resetting the count if we find a unit character */
519 while ((c = *interval++)) {
520 if (isdigit((int)c)) {
521 partial = partial*10 + c - '0';
523 seconds += TypeLength(c) * partial;
527 /* assume the last chunk is seconds (the normal case) */
528 return seconds + partial;
532 GetSizeMultiplier(char type)
535 case 'G': case 'g': return 1024*1024*1024;
536 case 'M': case 'm': return 1024*1024;
537 case 'K': case 'k': return 1024;
538 case 'B': case 'b': return 1;
544 ParseVolume(const char *volume)
546 unsigned long accum = 0, partial = 0;
548 while ((c = *volume++)) {
549 if (isdigit((int)c)) {
550 partial = partial*10 + c - '0';
552 accum += GetSizeMultiplier(c) * partial;
556 return accum + partial;
560 parse_ipmask(const char *str, struct in_addr *addr, unsigned long *mask)
563 unsigned long t_a, t_m;
567 addr->s_addr = htonl(t_a);
575 accum = (accum * 10) + *str++ - '0';
576 } while (isdigit(*str));
579 t_a = (t_a << 8) | accum;
580 t_m = (t_m << 8) | 255;
584 while (*str == '*') {
591 } else if (*str == 0) {
599 } else if (*str == '/') {
603 accum = (accum * 10) + *str++ - '0';
604 } while (isdigit(*str));
605 while (pos < start+accum && pos < 32) {
606 t_a = (t_a << 1) | 0;
607 t_m = (t_m << 1) | 1;
610 if (pos != start+accum)
612 } else if (*str == 0)
621 addr->s_addr = htonl(t_a);
628 unsplit_string(char *set[], unsigned int max, char *dest)
630 static char unsplit_buffer[MAXLEN*2];
631 unsigned int ii, jj, pos;
634 dest = unsplit_buffer;
635 for (ii=pos=0; ii<max; ii++) {
636 for (jj=0; set[ii][jj]; jj++)
637 dest[pos++] = set[ii][jj];
645 intervalString2(char *output, time_t interval, int brief)
647 static const struct {
651 { "year", 365 * 24 * 60 * 60 },
652 { "week", 7 * 24 * 60 * 60 },
653 { "day", 24 * 60 * 60 },
658 unsigned int type, words, pos, count;
662 strcpy(output, brief ? "0s" : "0 seconds");
666 for (type = 0, words = pos = 0;
667 interval && (words < 2) && (type < ArrayLength(unit));
669 if (interval < unit[type].length)
671 count = interval / unit[type].length;
672 interval = interval % unit[type].length;
675 pos += sprintf(output + pos, "%d%c", count, unit[type].name[0]);
677 pos += sprintf(output + pos, " and %d %s", count, unit[type].name);
679 pos += sprintf(output + pos, "%d %s", count, unit[type].name);
690 getipbyname(const char *name, unsigned long *ip)
692 struct hostent *he = gethostbyname(name);
695 if (he->h_addrtype != AF_INET)
697 memcpy(ip, he->h_addr_list[0], sizeof(*ip));
701 DEFINE_LIST(string_buffer, char)
704 string_buffer_append_substring(struct string_buffer *buf, const char *tail, unsigned int len)
706 while (buf->used + len >= buf->size) {
711 buf->list = realloc(buf->list, buf->size*sizeof(buf->list[0]));
713 memcpy(buf->list + buf->used, tail, len+1);
718 string_buffer_append_string(struct string_buffer *buf, const char *tail)
720 string_buffer_append_substring(buf, tail, strlen(tail));
724 string_buffer_append_vprintf(struct string_buffer *buf, const char *fmt, va_list args)
730 VA_COPY(working, args);
732 if (!buf->list || ((buf->used + buf->size) < len)) {
733 buf->size = buf->used + len;
734 buf->list = realloc(buf->list, buf->size);
736 ret = vsnprintf(buf->list + buf->used, buf->size - buf->used, fmt, working);
738 /* pre-C99 behavior; double buffer size until it is big enough */
740 VA_COPY(working, args);
741 while ((ret = vsnprintf(buf->list + buf->used, buf->size, fmt, working)) == -1) {
743 buf->list = realloc(buf->list, buf->size);
745 VA_COPY(working, args);
748 } else if (buf->used + ret < buf->size) {
749 /* no need to increase allocation size */
752 /* now we know exactly how much space we need */
753 if (buf->size <= buf->used + ret) {
754 buf->size = buf->used + ret + 1;
755 buf->list = realloc(buf->list, buf->size);
758 VA_COPY(working, args);
759 buf->used += vsnprintf(buf->list + buf->used, buf->size, fmt, working);
765 void string_buffer_append_printf(struct string_buffer *buf, const char *fmt, ...)
769 string_buffer_append_vprintf(buf, fmt, args);
773 string_buffer_replace(struct string_buffer *buf, unsigned int from, unsigned int len, const char *repl)
775 unsigned int repl_len = strlen(repl);
776 if (from > buf->used)
778 if (len + from > buf->used)
779 len = buf->used - from;
780 buf->used = buf->used + repl_len - len;
781 if (buf->size <= buf->used) {
782 while (buf->used >= buf->size)
784 buf->list = realloc(buf->list, buf->size*sizeof(buf->list[0]));
786 memmove(buf->list+from+repl_len, buf->list+from+len, strlen(buf->list+from+len));
787 strcpy(buf->list+from, repl);
790 struct string_list str_tab;
793 strtab(unsigned int ii) {
796 if (ii > str_tab.size) {
797 unsigned int old_size = str_tab.size;
798 while (ii >= str_tab.size)
800 str_tab.list = realloc(str_tab.list, str_tab.size*sizeof(str_tab.list[0]));
801 memset(str_tab.list+old_size, 0, (str_tab.size-old_size)*sizeof(str_tab.list[0]));
803 if (!str_tab.list[ii]) {
804 str_tab.list[ii] = malloc(12);
805 sprintf(str_tab.list[ii], "%u", ii);
807 return str_tab.list[ii];
813 unsigned int upr, lwr;
814 for (lwr=0; lwr<256; ++lwr)
816 for (upr='A', lwr='a'; lwr <= 'z'; ++upr, ++lwr)
818 #ifdef WITH_PROTOCOL_P10
819 for (upr='[', lwr='{'; lwr <= '~'; ++upr, ++lwr)
821 for (upr=0xc0, lwr=0xe0; lwr <= 0xf6; ++upr, ++lwr)
823 for (upr=0xd8, lwr=0xf8; lwr <= 0xfe; ++upr, ++lwr)
827 str_tab.list = calloc(str_tab.size, sizeof(str_tab.list[0]));
834 for (ii=0; ii<str_tab.size; ++ii)
835 free(str_tab.list[ii]);