]>
jfr.im git - irc/evilnet/x3.git/blob - src/tools.c
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
61 base64toint(const char* s
, int count
)
65 i
= (i
<< NUMNICKLOG
) + convert2n
[(unsigned char)*s
++];
71 const char* inttobase64(char* buf
, unsigned int v
, unsigned int count
)
75 buf
[--count
] = convert2y
[(unsigned char)(v
& NUMNICKMASK
)];
81 static char irc_tolower
[256];
83 #define tolower(X) irc_tolower[(unsigned char)(X)]
86 irccasecmp(const char *stra
, const char *strb
) {
87 while (*stra
&& (tolower(*stra
) == tolower(*strb
)))
89 return tolower(*stra
) - tolower(*strb
);
93 ircncasecmp(const char *stra
, const char *strb
, unsigned int len
) {
95 while (*stra
&& (tolower(*stra
) == tolower(*strb
)) && len
)
96 stra
++, strb
++, len
--;
97 return tolower(*stra
) - tolower(*strb
);
101 irccasestr(const char *haystack
, const char *needle
) {
102 unsigned int hay_len
= strlen(haystack
), needle_len
= strlen(needle
), pos
;
103 if (hay_len
< needle_len
)
105 for (pos
=0; pos
<hay_len
+1-needle_len
; ++pos
) {
106 if ((tolower(haystack
[pos
]) == tolower(*needle
))
107 && !ircncasecmp(haystack
+pos
, needle
, needle_len
))
114 split_line(char *line
, int irc_colon
, int argv_size
, char *argv
[])
118 while (*line
&& (argc
< argv_size
)) {
121 if (*line
== ':' && irc_colon
&& argc
> 0) {
122 /* the rest is a single parameter */
123 argv
[argc
++] = line
+ 1;
129 if (argc
>= argv_size
)
131 while (*line
!= ' ' && *line
)
137 for (n
=argc
; n
<argv_size
; n
++)
138 argv
[n
] = (char*)0xFEEDBEEF;
143 /* This is ircu's mmatch() function, from match.c. */
144 int mmatch(const char *old_mask
, const char *new_mask
)
146 register const char *m
= old_mask
;
147 register const char *n
= new_mask
;
168 for (m
--; (m
> old_mask
) && (*m
== '?'); m
--)
170 if ((*m
== '*') && (m
> old_mask
) && (m
[-1] != '\\'))
176 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
177 if ((*na
== '\\') && ((na
[1] == '*') || (na
[1] == '?')))
188 if ((*m
== '\\') && ((m
[1] == '*') || (m
[1] == '?')))
196 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
197 if ((*n
== '\\') && ((n
[1] == '*') || (n
[1] == '?')))
206 * This `if' has been changed compared to match() to do the following:
208 * old (m) new (n) boolean expression
209 * * any (*m == '*' && !mq) ||
210 * ? any except '*' (*m == '?' && !mq && (*n != '*' || nq)) ||
211 * any except * or ? same as m (!((*m == '*' || *m == '?') && !mq) &&
212 * toLower(*m) == toLower(*n) &&
213 * !((mq && !nq) || (!mq && nq)))
215 * Here `any' also includes \* and \? !
217 * After reworking the boolean expressions, we get:
218 * (Optimized to use boolean shortcircuits, with most frequently occuring
219 * cases upfront (which took 2 hours!)).
221 if ((*m
== '*' && !mq
) ||
222 ((!mq
|| nq
) && tolower(*m
) == tolower(*n
)) ||
223 (*m
== '?' && !mq
&& (*n
!= '*' || nq
)))
236 /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
237 if ((*na
== '\\') && ((na
[1] == '*') || (na
[1] == '?')))
246 match_ircglob(const char *text
, const char *glob
)
248 unsigned int star_p
, q_cnt
;
255 /* intentionally not tolower(...) so people can force
256 * capitalization, or we can overload \ in the future */
257 if (*text
++ != *glob
++)
266 else if (*glob
== '?')
278 /* if this is the last glob character, it will match any text */
281 /* Thanks to the loop above, we know that the next
282 * character is a normal character. So just look for
283 * the right character.
285 for (; *text
; text
++) {
286 if ((tolower(*text
) == tolower(*glob
))
287 && match_ircglob(text
+1, glob
+1)) {
293 /* if !star_p, fall through to normal character case,
294 * first checking to see if ?s carried us to the end */
295 if (!*glob
&& !*text
)
300 while (*text
&& *glob
&& *glob
!= '*' && *glob
!= '?' && *glob
!= '\\') {
301 if (tolower(*text
++) != tolower(*glob
++))
308 extern const char *hidden_host_suffix
;
311 user_matches_glob(struct userNode
*user
, const char *orig_glob
, int include_nick
)
314 char *setident
= NULL
, *sethostname
= NULL
; // sethost - reed/apples
316 /* Make a writable copy of the glob */
317 glob
= alloca(strlen(orig_glob
)+1);
318 strcpy(glob
, orig_glob
);
319 /* Check the nick, if it's present */
321 if (!(marker
= strchr(glob
, '!'))) {
322 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
);
326 if (!match_ircglob(user
->nick
, glob
)) return 0;
329 /* Check the ident */
330 if (!(marker
= strchr(glob
, '@'))) {
331 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
);
336 // sethost - reed/apples
337 if (IsSetHost(user
)) {
338 setident
= alloca(strcspn(user
->sethost
, "@")+2);
339 safestrncpy(setident
, user
->sethost
, strcspn(user
->sethost
, "@")+1);
340 sethostname
= strchr(user
->sethost
, '@') + 1;
343 if (!match_ircglob(user
->ident
, glob
) && (IsSetHost(user
) && !match_ircglob(setident
, glob
)))
346 /* Now check the host part */
347 if (isdigit(*glob
) && !glob
[strspn(glob
, "0123456789./*?")]) {
348 /* Looks like an IP-based mask */
349 return match_ircglob(inet_ntoa(user
->ip
), glob
);
351 /* The host part of the mask isn't IP-based */
352 if (IsSetHost(user
) && match_ircglob(sethostname
, glob
))
354 if (IsFakeHost(user
) && match_ircglob(user
->fakehost
, glob
))
356 if (hidden_host_suffix
&& user
->handle_info
) {
357 char hidden_host
[HOSTLEN
+1];
358 snprintf(hidden_host
, sizeof(hidden_host
), "%s.%s", user
->handle_info
->handle
, hidden_host_suffix
);
359 if (match_ircglob(hidden_host
, glob
))
362 return match_ircglob(user
->hostname
, glob
);
367 is_ircmask(const char *text
)
369 while (*text
&& (isalnum((char)*text
) || strchr("-_[]|\\`^{}?*", *text
)))
373 while (*text
&& *text
!= '@' && !isspace((char)*text
))
377 while (*text
&& !isspace((char)*text
))
383 is_gline(const char *text
)
387 text
+= strcspn(text
, "@!% \t\r\n");
392 while (*text
&& (isalnum((char)*text
) || strchr(".-?*", *text
)))
398 split_ircmask(char *text
, char **nick
, char **ident
, char **host
)
403 while (isalnum((char)*text
) || strchr("=[]\\`^{}?*", *text
))
405 if (*text
!= '!' || ((text
- start
) > NICKLEN
))
412 while (*text
&& *text
!= '@' && !isspace((char)*text
))
414 if (*text
!= '@' || ((text
- start
) > USERLEN
))
421 while (*text
&& (isalnum((char)*text
) || strchr(".-?*", *text
)))
425 return !*text
&& ((text
- start
) <= HOSTLEN
) && nick
&& ident
&& host
;
429 sanitize_ircmask(char *input
)
431 unsigned int length
, flag
;
432 char *mask
, *start
, *output
;
434 /* Sanitize everything in place; input *must* be a valid
439 /* The nick is truncated at the end. */
442 while(*input
++ != '!')
451 /* This flag is used to indicate following parts should
460 /* The ident and host must be truncated at the beginning and
461 replaced with a '*' to be compatible with ircu. */
464 while(*input
++ != '@')
468 if(length
> USERLEN
|| flag
)
472 start
= input
- USERLEN
;
494 if(length
> HOSTLEN
|| flag
)
498 start
= input
- HOSTLEN
;
512 TypeLength(char type
)
515 case 'y': return 365*24*60*60;
516 case 'M': return 31*24*60*60;
517 case 'w': return 7*24*60*60;
518 case 'd': return 24*60*60;
519 case 'h': return 60*60;
527 ParseInterval(const char *interval
)
529 unsigned long seconds
= 0;
533 /* process the string, resetting the count if we find a unit character */
534 while ((c
= *interval
++)) {
535 if (isdigit((int)c
)) {
536 partial
= partial
*10 + c
- '0';
538 seconds
+= TypeLength(c
) * partial
;
542 /* assume the last chunk is seconds (the normal case) */
543 return seconds
+ partial
;
547 GetSizeMultiplier(char type
)
550 case 'G': case 'g': return 1024*1024*1024;
551 case 'M': case 'm': return 1024*1024;
552 case 'K': case 'k': return 1024;
553 case 'B': case 'b': return 1;
559 ParseVolume(const char *volume
)
561 unsigned long accum
= 0, partial
= 0;
563 while ((c
= *volume
++)) {
564 if (isdigit((int)c
)) {
565 partial
= partial
*10 + c
- '0';
567 accum
+= GetSizeMultiplier(c
) * partial
;
571 return accum
+ partial
;
575 parse_ipmask(const char *str
, struct in_addr
*addr
, unsigned long *mask
)
578 unsigned long t_a
, t_m
;
582 addr
->s_addr
= htonl(t_a
);
590 accum
= (accum
* 10) + *str
++ - '0';
591 } while (isdigit(*str
));
594 t_a
= (t_a
<< 8) | accum
;
595 t_m
= (t_m
<< 8) | 255;
599 while (*str
== '*') {
606 } else if (*str
== 0) {
614 } else if (*str
== '/') {
618 accum
= (accum
* 10) + *str
++ - '0';
619 } while (isdigit(*str
));
620 while (pos
< start
+accum
&& pos
< 32) {
621 t_a
= (t_a
<< 1) | 0;
622 t_m
= (t_m
<< 1) | 1;
625 if (pos
!= start
+accum
)
627 } else if (*str
== 0)
636 addr
->s_addr
= htonl(t_a
);
643 unsplit_string(char *set
[], unsigned int max
, char *dest
)
645 static char unsplit_buffer
[MAXLEN
*2];
646 unsigned int ii
, jj
, pos
;
649 dest
= unsplit_buffer
;
650 for (ii
=pos
=0; ii
<max
; ii
++) {
651 for (jj
=0; set
[ii
][jj
]; jj
++)
652 dest
[pos
++] = set
[ii
][jj
];
660 intervalString(char *output
, time_t interval
, struct handle_info
*hi
)
662 static const struct {
663 const char *msg_single
;
664 const char *msg_plural
;
667 { "MSG_YEAR", "MSG_YEARS", 365 * 24 * 60 * 60 },
668 { "MSG_WEEK", "MSG_WEEKS", 7 * 24 * 60 * 60 },
669 { "MSG_DAY", "MSG_DAYS", 24 * 60 * 60 },
670 { "MSG_HOUR", "MSG_HOURS", 60 * 60 },
671 { "MSG_MINUTE", "MSG_MINUTES", 60 },
672 { "MSG_SECOND", "MSG_SECONDS", 1 }
674 struct language
*lang
;
676 unsigned int type
, words
, pos
, count
;
678 lang
= hi
? hi
->language
: lang_C
;
681 msg
= language_find_message(lang
, "MSG_0_SECONDS");
682 return strcpy(output
, msg
);
685 for (type
= 0, words
= pos
= 0;
686 interval
&& (words
< 2) && (type
< ArrayLength(unit
));
688 if (interval
< unit
[type
].length
)
690 count
= interval
/ unit
[type
].length
;
691 interval
= interval
% unit
[type
].length
;
694 msg
= language_find_message(lang
, "MSG_AND");
695 pos
+= sprintf(output
+ pos
, " %s ", msg
);
698 msg
= language_find_message(lang
, unit
[type
].msg_single
);
700 msg
= language_find_message(lang
, unit
[type
].msg_plural
);
701 pos
+= sprintf(output
+ pos
, "%d %s", count
, msg
);
709 getipbyname(const char *name
, unsigned long *ip
)
711 struct hostent
*he
= gethostbyname(name
);
714 if (he
->h_addrtype
!= AF_INET
)
716 memcpy(ip
, he
->h_addr_list
[0], sizeof(*ip
));
720 DEFINE_LIST(string_buffer
, char)
723 string_buffer_append_substring(struct string_buffer
*buf
, const char *tail
, unsigned int len
)
725 while (buf
->used
+ len
>= buf
->size
) {
730 buf
->list
= realloc(buf
->list
, buf
->size
*sizeof(buf
->list
[0]));
732 memcpy(buf
->list
+ buf
->used
, tail
, len
+1);
737 string_buffer_append_string(struct string_buffer
*buf
, const char *tail
)
739 string_buffer_append_substring(buf
, tail
, strlen(tail
));
743 string_buffer_append_vprintf(struct string_buffer
*buf
, const char *fmt
, va_list args
)
749 VA_COPY(working
, args
);
751 if (!buf
->list
|| ((buf
->used
+ buf
->size
) < len
)) {
752 buf
->size
= buf
->used
+ len
;
753 buf
->list
= realloc(buf
->list
, buf
->size
);
755 ret
= vsnprintf(buf
->list
+ buf
->used
, buf
->size
- buf
->used
, fmt
, working
);
757 /* pre-C99 behavior; double buffer size until it is big enough */
759 VA_COPY(working
, args
);
760 while ((ret
= vsnprintf(buf
->list
+ buf
->used
, buf
->size
, fmt
, working
)) == -1) {
762 buf
->list
= realloc(buf
->list
, buf
->size
);
764 VA_COPY(working
, args
);
767 } else if (buf
->used
+ ret
< buf
->size
) {
768 /* no need to increase allocation size */
771 /* now we know exactly how much space we need */
772 if (buf
->size
<= buf
->used
+ ret
) {
773 buf
->size
= buf
->used
+ ret
+ 1;
774 buf
->list
= realloc(buf
->list
, buf
->size
);
777 VA_COPY(working
, args
);
778 buf
->used
+= vsnprintf(buf
->list
+ buf
->used
, buf
->size
, fmt
, working
);
784 void string_buffer_append_printf(struct string_buffer
*buf
, const char *fmt
, ...)
788 string_buffer_append_vprintf(buf
, fmt
, args
);
792 string_buffer_replace(struct string_buffer
*buf
, unsigned int from
, unsigned int len
, const char *repl
)
794 unsigned int repl_len
= strlen(repl
);
795 if (from
> buf
->used
)
797 if (len
+ from
> buf
->used
)
798 len
= buf
->used
- from
;
799 buf
->used
= buf
->used
+ repl_len
- len
;
800 if (buf
->size
<= buf
->used
) {
801 while (buf
->used
>= buf
->size
)
803 buf
->list
= realloc(buf
->list
, buf
->size
*sizeof(buf
->list
[0]));
805 memmove(buf
->list
+from
+repl_len
, buf
->list
+from
+len
, strlen(buf
->list
+from
+len
));
806 strcpy(buf
->list
+from
, repl
);
809 struct string_list str_tab
;
812 strtab(unsigned int ii
) {
815 if (ii
> str_tab
.size
) {
816 unsigned int old_size
= str_tab
.size
;
817 while (ii
>= str_tab
.size
)
819 str_tab
.list
= realloc(str_tab
.list
, str_tab
.size
*sizeof(str_tab
.list
[0]));
820 memset(str_tab
.list
+old_size
, 0, (str_tab
.size
-old_size
)*sizeof(str_tab
.list
[0]));
822 if (!str_tab
.list
[ii
]) {
823 str_tab
.list
[ii
] = malloc(12);
824 sprintf(str_tab
.list
[ii
], "%u", ii
);
826 return str_tab
.list
[ii
];
832 unsigned int upr
, lwr
;
833 for (lwr
=0; lwr
<256; ++lwr
)
835 for (upr
='A', lwr
='a'; lwr
<= 'z'; ++upr
, ++lwr
)
837 #ifdef WITH_PROTOCOL_P10
838 for (upr
='[', lwr
='{'; lwr
<= '~'; ++upr
, ++lwr
)
840 for (upr
=0xc0, lwr
=0xe0; lwr
<= 0xf6; ++upr
, ++lwr
)
842 for (upr
=0xd8, lwr
=0xf8; lwr
<= 0xfe; ++upr
, ++lwr
)
846 str_tab
.list
= calloc(str_tab
.size
, sizeof(str_tab
.list
[0]));
853 for (ii
=0; ii
<str_tab
.size
; ++ii
)
854 free(str_tab
.list
[ii
]);