lib/irc_string.c

   1 /* irc_string.c */
   2
   3 #include "irc_string.h"
   4 #include "chattr.tab.c"
   5 #include <stdlib.h>
   6 #include <stdio.h>
   7 #include <errno.h>
   8
   9 static unsigned long crc32_tab[] = {
  10       0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
  11       0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
  12       0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
  13       0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL,
  14       0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L,
  15       0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L,
  16       0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L,
  17       0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL,
  18       0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L,
  19       0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL,
  20       0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L,
  21       0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L,
  22       0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L,
  23       0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL,
  24       0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL,
  25       0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L,
  26       0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL,
  27       0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L,
  28       0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L,
  29       0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L,
  30       0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL,
  31       0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L,
  32       0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L,
  33       0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
  34       0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L,
  35       0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L,
  36       0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L,
  37       0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L,
  38       0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L,
  39       0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL,
  40       0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL,
  41       0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L,
  42       0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L,
  43       0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL,
  44       0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL,
  45       0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L,
  46       0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL,
  47       0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L,
  48       0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL,
  49       0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L,
  50       0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL,
  51       0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L,
  52       0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L,
  53       0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL,
  54       0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L,
  55       0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L,
  56       0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L,
  57       0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
  58       0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L,
  59       0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L,
  60       0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
  61       0x2d02ef8dL
  62 };
  63
  64 #if 0
  65 /* OLD MATCH FUNCTIONS */
  66
  67 /* Next proc is stolen from some library
  68    http://avrc.city.ac.uk/nethack/nethack-cxref-3.3.1/src/hacklib.c.src.html */
  69 int match2strings(const char *patrn, const char *strng) {
  70   char s, p;
  71   /*
  72    :  Simple pattern matcher:  '*' matches 0 or more characters, '?' matches
  73    :  any single character.  Returns TRUE if 'strng' matches 'patrn'.
  74    :  Case insensitive.
  75    */
  76  pmatch_top:
  77      s = ToLower(*strng++);  p = ToLower(*patrn++); /* get next chars and pre-advance */
  78      if (!p)                      /* end of pattern */
  79   return((s == '\0'));           /* matches iff end of string too */
  80      else if (p == '*')           /* wildcard reached */
  81   return(((!*patrn || match2strings(patrn, strng-1)) ? 1 : s ? match2strings(patrn-1, strng) : 0));
  82      else if (p != s && (p != '?' || !s))  /* check single character */
  83   return 0;           /* doesn't match */
  84      else                         /* return pmatch(patrn, strng); */
  85   goto pmatch_top;        /* optimize tail recursion */
  86 }
  87
  88 /* Adapted version of the above, to check if a new ban encloses another.
  89  * We want to know if one ban completely encloses another.  We do exactly the
  90  * same thing as before, but we don't allow a '?' in the pattern to match a '*'
  91  * in the string.  Also made case insensitive.
  92  **/
  93 int match2patterns(const char *patrn, const char *strng) {
  94   char s, p;
  95   /*
  96    :  Simple pattern matcher:  '*' matches 0 or more characters, '?' matches
  97    :  any single character.  Returns TRUE if 'strng' matches 'patrn'.
  98    */
  99  pmatch_top:
 100      s = ToLower(*strng++);  p = ToLower(*patrn++); /* get next chars and pre-advance */
 101      if (!p)                      /* end of pattern */
 102   return((s == '\0'));           /* matches iff end of string too */
 103      else if (p == '*')           /* wildcard reached */
 104   return(((!*patrn || match2strings(patrn, strng-1)) ? 1 : s ? match2strings(patrn-1, strng) : 0));
 105      else if (p != s && (s == '*' || p != '?' || !s))  /* check single character */
 106   return 0;           /* doesn't match */
 107      else                         /* return pmatch(patrn, strng); */
 108   goto pmatch_top;        /* optimize tail recursion */
 109 }
 110 #else /* 0 */
 111
 112 int match2strings(const char *patrn, const char *string) {
 113   return !match(patrn,string);
 114 }
 115
 116 int match2patterns(const char *patrn, const char *string) {
 117   return !mmatch(patrn,string);
 118 }
 119 #endif
 120
 121 /* This computes a 32 bit CRC of the data in the buffer, and returns the */
 122 /* CRC.  The polynomial used is 0xedb88320.                              */
 123 /* =============================================================         */
 124 /*  COPYRIGHT (C) 1986 Gary S. Brown.  You may use this program, or      */
 125 /*  code or tables extracted from it, as desired without restriction.    */
 126 /* Modified by Fox: no more length parameter, always does the whole string */
 127 unsigned long crc32(const char *s) {
 128   const char *cp;
 129   unsigned long crc32val;
 130
 131   crc32val = 0;
 132   for (cp=s;*cp;cp++) {
 133     crc32val=crc32_tab[(crc32val^(*cp)) & 0xff] ^ (crc32val >> 8);
 134   }
 135   return crc32val;
 136 }
 137
 138 /* Case insensitive version of the above */
 139 unsigned long crc32i(const char *s) {
 140   const char *cp;
 141   unsigned long crc32val;
 142
 143   crc32val = 0;
 144   for (cp=s;*cp;cp++) {
 145     crc32val=crc32_tab[(crc32val^(ToLower(*cp))) & 0xff] ^ (crc32val >> 8);
 146   }
 147   return crc32val;
 148 }
 149
 150 /*
 151  * ircd_strcmp - case insensitive comparison of 2 strings
 152  */
 153 int ircd_strcmp(const char *a, const char *b) {
 154   const char* ra = a;
 155   const char* rb = b;
 156   while (ToLower(*ra) == ToLower(*rb)) {
 157     if (!*ra++)
 158       return 0;
 159     else
 160       ++rb;
 161   }
 162   return (*ra - *rb);
 163 }
 164
 165 /*
 166  * ircd_strncmp - counted case insensitive comparison of 2 strings
 167  */
 168 int ircd_strncmp(const char *a, const char *b, size_t n) {
 169   const char* ra = a;
 170   const char* rb = b;
 171   int left = n;
 172   if (!left--)
 173     return 0;
 174   while (ToLower(*ra) == ToLower(*rb)) {
 175     if (!*ra++ || !left--)
 176       return 0;
 177     else
 178       ++rb;
 179   }
 180   return (*ra - *rb);
 181 }
 182
 183 /*
 184  * delchars: deletes characters occuring in badchars from string
 185  */
 186
 187 char *delchars(char *string, const char *badchars) {
 188   char *s,*d;
 189   const char *b;
 190   int isbad;
 191
 192   s=d=string;
 193   while (*s) {
 194     isbad=0;
 195     for(b=badchars;*b;b++) {
 196       if (*b==*s) {
 197         isbad=1;
 198         break;
 199       }
 200     }
 201     if (isbad) {
 202       s++;
 203     } else {
 204       *d++=*s++;
 205     }
 206   }
 207   *d='\0';
 208
 209   return string;
 210 }
 211
 212 /*
 213  * IPtostr:
 214  *  Converts a long into a "p.q.r.s" IP address
 215  */
 216
 217 const char *IPtostr(unsigned long IP) {
 218   static char buf[16];
 219
 220   sprintf(buf,"%lu.%lu.%lu.%lu",(IP>>24),(IP>>16)&255,(IP>>8)&255,IP&255);
 221
 222   return buf;
 223 }
 224
 225 /*
 226  * longtoduration:
 227  *  Converts a specified number of seconds into a duration string.
 228  *  format: 0 for the "/stats u" compatible output, 1 for more human-friendly output.
 229  */
 230
 231 const char *longtoduration(unsigned long interval, int format) {
 232   int days,hours,minutes,seconds;
 233   static char outstring[50];
 234   int pos=0;
 235
 236   seconds=interval%60;
 237   minutes=(interval%3600)/60;
 238   hours=(interval%(3600*24))/3600;
 239   days=interval/(3600*24);
 240
 241   if (days>0 || format==0) {
 242     sprintf(outstring,"%d day%s, %02d:%02d:%02d",
 243             days,(days==1)?"":"s",hours,minutes,seconds);
 244   } else {
 245     if (hours>0) {
 246       pos += sprintf(outstring+pos,"%d hour%s ",hours,hours==1?"":"s");
 247     }
 248     if (minutes>0 || (hours>0 && seconds>0)) {
 249       pos += sprintf(outstring+pos,"%d minute%s ",minutes,minutes==1?"":"s");
 250     }
 251     if (seconds>0) {
 252       pos += sprintf(outstring+pos,"%d second%s ",seconds,seconds==1?"":"s");
 253     }
 254   }
 255
 256   return outstring;
 257 }
 258
 259 /*
 260  * durationtolong:
 261  *  Converts the specified string into a number of seconds, as per O
 262  */
 263
 264 int durationtolong(const char *string) {
 265   int total=0;
 266   int current=0;
 267   char *ch=string,*och;
 268
 269   while (*ch) {
 270     och=ch;
 271     current=strtol(ch,&ch,10);
 272     if (och==ch) /* No numbers found */
 273       break;
 274     if (current) {
 275       switch (*ch++) {
 276       case '\0':
 277         ch--;
 278         /* Drop through */
 279       case 's':
 280         total+=current;
 281         break;
 282
 283       case 'm':
 284         total+=(current * 60);
 285         break;
 286
 287       case 'h':
 288         total+=(current * 3600);
 289         break;
 290
 291       case 'd':
 292         total+=(current * 86400);
 293         break;
 294
 295       case 'w':
 296         total+=(current * 604800);
 297         break;
 298
 299       case 'M':
 300         total+=(current * 2592000);
 301         break;
 302
 303       case 'y':
 304         total+=(current * 31557600);
 305       }
 306     }
 307   }
 308   return total;
 309 }
 310 /*
 311  * mmatch()
 312  *
 313  * Written by Run (carlo@runaway.xs4all.nl), 25-10-96
 314  *
 315  *
 316  * From: Carlo Wood <carlo@runaway.xs4all.nl>
 317  * Message-Id: <199609021026.MAA02393@runaway.xs4all.nl>
 318  * Subject: [C-Com] Analysis for `mmatch' (was: gline4 problem)
 319  * To: coder-com@mail.undernet.org (coder committee)
 320  * Date: Mon, 2 Sep 1996 12:26:01 +0200 (MET DST)
 321  *
 322  * We need a new function `mmatch(const char *old_mask, const char *new_mask)'
 323  * which returns `true' likewise the current `match' (start with copying it),
 324  * but which treats '*' and '?' in `new_mask' differently (not "\*" and "\?" !)
 325  * as follows:  a '*' in `new_mask' does not match a '?' in `old_mask' and
 326  * a '?' in `new_mask' does not match a '\?' in `old_mask'.
 327  * And ofcourse... a '*' in `new_mask' does not match a '\*' in `old_mask'...
 328  * And last but not least, '\?' and '\*' in `new_mask' now become one character.
 329  */
 330
 331 int mmatch(const char *old_mask, const char *new_mask)
 332 {
 333   const char *m = old_mask;
 334   const char *n = new_mask;
 335   const char *ma = m;
 336   const char *na = n;
 337   int wild = 0;
 338   int mq = 0, nq = 0;
 339
 340   while (1)
 341   {
 342     if (*m == '*')
 343     {
 344       while (*m == '*')
 345         m++;
 346       wild = 1;
 347       ma = m;
 348       na = n;
 349     }
 350
 351     if (!*m)
 352     {
 353       if (!*n)
 354         return 0;
 355       for (m--; (m > old_mask) && (*m == '?'); m--)
 356         ;
 357       if ((*m == '*') && (m > old_mask) && (m[-1] != '\\'))
 358         return 0;
 359       if (!wild)
 360         return 1;
 361       m = ma;
 362
 363       /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
 364       if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?')))
 365         ++na;
 366
 367       n = ++na;
 368     }
 369     else if (!*n)
 370     {
 371       while (*m == '*')
 372         m++;
 373       return (*m != 0);
 374     }
 375     if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?')))
 376     {
 377       m++;
 378       mq = 1;
 379     }
 380     else
 381       mq = 0;
 382
 383     /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
 384     if ((*n == '\\') && ((n[1] == '*') || (n[1] == '?')))
 385     {
 386       n++;
 387       nq = 1;
 388     }
 389     else
 390       nq = 0;
 391
 392 /*
 393  * This `if' has been changed compared to match() to do the following:
 394  * Match when:
 395  *   old (m)         new (n)         boolean expression
 396  *    *               any             (*m == '*' && !mq) ||
 397  *    ?               any except '*'  (*m == '?' && !mq && (*n != '*' || nq)) ||
 398  * any except * or ?  same as m       (!((*m == '*' || *m == '?') && !mq) &&
 399  *                                      ToLower(*m) == ToLower(*n) &&
 400  *                                        !((mq && !nq) || (!mq && nq)))
 401  *
 402  * Here `any' also includes \* and \? !
 403  *
 404  * After reworking the boolean expressions, we get:
 405  * (Optimized to use boolean shortcircuits, with most frequently occuring
 406  *  cases upfront (which took 2 hours!)).
 407  */
 408     if ((*m == '*' && !mq) ||
 409         ((!mq || nq) && ToLower(*m) == ToLower(*n)) ||
 410         (*m == '?' && !mq && (*n != '*' || nq)))
 411     {
 412       if (*m)
 413         m++;
 414       if (*n)
 415         n++;
 416     }
 417     else
 418     {
 419       if (!wild)
 420         return 1;
 421       m = ma;
 422
 423       /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
 424       if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?')))
 425         ++na;
 426
 427       n = ++na;
 428     }
 429   }
 430 }
 431
 432 /*
 433  * Compare if a given string (name) matches the given
 434  * mask (which can contain wild cards: '*' - match any
 435  * number of chars, '?' - match any single character.
 436  *
 437  * return  0, if match
 438  *         1, if no match
 439  */
 440
 441 /*
 442  * match
 443  *
 444  * Rewritten by Andrea Cocito (Nemesi), November 1998.
 445  *
 446  */
 447
 448 /****************** Nemesi's match() ***************/
 449
 450 int match(const char *mask, const char *string)
 451 {
 452   const char *m = mask, *s = string;
 453   char ch;
 454   const char *bm, *bs;          /* Will be reg anyway on a decent CPU/compiler */
 455
 456   /* Process the "head" of the mask, if any */
 457   while ((ch = *m++) && (ch != '*'))
 458     switch (ch)
 459     {
 460       case '\\':
 461         if (*m == '?' || *m == '*')
 462           ch = *m++;
 463       default:
 464         if (ToLower(*s) != ToLower(ch))
 465           return 1;
 466       case '?':
 467         if (!*s++)
 468           return 1;
 469     };
 470   if (!ch)
 471     return *s;
 472
 473   /* We got a star: quickly find if/where we match the next char */
 474 got_star:
 475   bm = m;                       /* Next try rollback here */
 476   while ((ch = *m++))
 477     switch (ch)
 478     {
 479       case '?':
 480         if (!*s++)
 481           return 1;
 482       case '*':
 483         bm = m;
 484         continue;               /* while */
 485       case '\\':
 486         if (*m == '?' || *m == '*')
 487           ch = *m++;
 488       default:
 489         goto break_while;       /* C is structured ? */
 490     };
 491 break_while:
 492   if (!ch)
 493     return 0;                   /* mask ends with '*', we got it */
 494   ch = ToLower(ch);
 495   while (ToLower(*s++) != ch)
 496     if (!*s)
 497       return 1;
 498   bs = s;                       /* Next try start from here */
 499
 500   /* Check the rest of the "chunk" */
 501   while ((ch = *m++))
 502   {
 503     switch (ch)
 504     {
 505       case '*':
 506         goto got_star;
 507       case '\\':
 508         if (*m == '?' || *m == '*')
 509           ch = *m++;
 510       default:
 511         if (ToLower(*s) != ToLower(ch))
 512         {
 513           /* If we've run out of string, give up */
 514           if (!*bs)
 515             return 1;
 516           m = bm;
 517           s = bs;
 518           goto got_star;
 519         };
 520       case '?':
 521         if (!*s++)
 522           return 1;
 523     };
 524   };
 525   if (*s)
 526   {
 527     m = bm;
 528     s = bs;
 529     goto got_star;
 530   };
 531   return 0;
 532 }
 533
 534 /*
 535  * collapse()
 536  * Collapse a pattern string into minimal components.
 537  * This particular version is "in place", so that it changes the pattern
 538  * which is to be reduced to a "minimal" size.
 539  *
 540  * (C) Carlo Wood - 6 Oct 1998
 541  * Speedup rewrite by Andrea Cocito, December 1998.
 542  * Note that this new optimized alghoritm can *only* work in place.
 543  */
 544
 545 char *collapse(char *mask)
 546 {
 547   int star = 0;
 548   char *m = mask;
 549   char *b;
 550
 551   if (m)
 552   {
 553     do
 554     {
 555       if ((*m == '*') && ((m[1] == '*') || (m[1] == '?')))
 556       {
 557         b = m;
 558         do
 559         {
 560           if (*m == '*')
 561             star = 1;
 562           else
 563           {
 564             if (star && (*m != '?'))
 565             {
 566               *b++ = '*';
 567               star = 0;
 568             };
 569             *b++ = *m;
 570             if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?')))
 571               *b++ = *++m;
 572           };
 573         }
 574         while (*m++);
 575         break;
 576       }
 577       else
 578       {
 579         if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?')))
 580           m++;
 581       };
 582     }
 583     while (*m++);
 584   };
 585   return mask;
 586 }
 587
 588 /* a protected version of atoi that will return an error if broke/etc */
 589 int protectedatoi(char *buf, int *value) {
 590   char *ep;
 591   long lval;
 592
 593   errno = 0;
 594   lval = strtol(buf, &ep, 10);
 595   if (buf[0] == '\0' || *ep != '\0')
 596     return 0;
 597
 598   if ((errno == ERANGE && (lval == LONG_MAX || lval == LONG_MIN)) || (lval > INT_MAX || lval < INT_MIN))
 599     return 0;
 600
 601   *value = lval;
 602   return 1;
 603 }