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 /*-
  10  * For some sections, the BSD license applies, specifically:
  11  * ircd_strcmp ircd_strncmp:
  12  *
  13  * Copyright (c) 1987
  14  *      The Regents of the University of California.  All rights reserved.
  15  *
  16  * match/collapse
  17  *
  18  * Copyright (c) 1998
  19  *      Andrea Cocito (Nemesi).
  20  *
  21  * License follows:
  22  *
  23  * Redistribution and use in source and binary forms, with or without
  24  * modification, are permitted provided that the following conditions
  25  * are met:
  26  * 1. Redistributions of source code must retain the above copyright
  27  *    notice, this list of conditions and the following disclaimer.
  28  * 2. Redistributions in binary form must reproduce the above copyright
  29  *    notice, this list of conditions and the following disclaimer in the
  30  *    documentation and/or other materials provided with the distribution.
  31  * 4. Neither the name of the University/owner? nor the names of its contributors
  32  *    may be used to endorse or promote products derived from this software
  33  *    without specific prior written permission.
  34  *
  35  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  36  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  37  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  38  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  39  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  40  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  41  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  42  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  43  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  44  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  45  * SUCH DAMAGE.
  46  */
  47
  48
  49 static unsigned long crc32_tab[] = {
  50       0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
  51       0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
  52       0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
  53       0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL,
  54       0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L,
  55       0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L,
  56       0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L,
  57       0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL,
  58       0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L,
  59       0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL,
  60       0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L,
  61       0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L,
  62       0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L,
  63       0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL,
  64       0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL,
  65       0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L,
  66       0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL,
  67       0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L,
  68       0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L,
  69       0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L,
  70       0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL,
  71       0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L,
  72       0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L,
  73       0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
  74       0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L,
  75       0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L,
  76       0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L,
  77       0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L,
  78       0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L,
  79       0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL,
  80       0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL,
  81       0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L,
  82       0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L,
  83       0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL,
  84       0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL,
  85       0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L,
  86       0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL,
  87       0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L,
  88       0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL,
  89       0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L,
  90       0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL,
  91       0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L,
  92       0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L,
  93       0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL,
  94       0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L,
  95       0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L,
  96       0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L,
  97       0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
  98       0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L,
  99       0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L,
 100       0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
 101       0x2d02ef8dL
 102 };
 103
 104 int match2strings(const char *patrn, const char *string) {
 105   return !match(patrn,string);
 106 }
 107
 108 int match2patterns(const char *patrn, const char *string) {
 109   return !mmatch(patrn,string);
 110 }
 111
 112 /* This computes a 32 bit CRC of the data in the buffer, and returns the */
 113 /* CRC.  The polynomial used is 0xedb88320.                              */
 114 /* =============================================================         */
 115 /*  COPYRIGHT (C) 1986 Gary S. Brown.  You may use this program, or      */
 116 /*  code or tables extracted from it, as desired without restriction.    */
 117 /* Modified by Fox: no more length parameter, always does the whole string */
 118 unsigned long crc32(const char *s) {
 119   const char *cp;
 120   unsigned long crc32val;
 121
 122   crc32val = 0;
 123   for (cp=s;*cp;cp++) {
 124     crc32val=crc32_tab[(crc32val^(*cp)) & 0xff] ^ (crc32val >> 8);
 125   }
 126   return crc32val;
 127 }
 128
 129 /* Case insensitive version of the above */
 130 unsigned long crc32i(const char *s) {
 131   const char *cp;
 132   unsigned long crc32val;
 133
 134   crc32val = 0;
 135   for (cp=s;*cp;cp++) {
 136     crc32val=crc32_tab[(crc32val^(ToLower(*cp))) & 0xff] ^ (crc32val >> 8);
 137   }
 138   return crc32val;
 139 }
 140
 141 /* ircd_strcmp/ircd_strncmp
 142  *
 143  * Copyright (c) 1987
 144  *      The Regents of the University of California.  All rights reserved.
 145  *
 146  * BSD license.
 147  *
 148  * Modified from this version for ircd usage.
 149  */
 150
 151 int ircd_strcmp(const char *s1, const char *s2) {
 152   register const char* u1 = s1;
 153   register const char* u2 = s2;
 154
 155   while(ToLower(*u1) == ToLower(*u2)) {
 156     if(*u1++)
 157       return 0;
 158
 159     u2++;
 160   }
 161   return ToLower(*u1) - ToLower(*u2);
 162 }
 163
 164
 165 int ircd_strncmp(const char *s1, const char *s2, size_t len) {
 166   register const char* u1 = s1;
 167   register const char* u2 = s2;
 168   size_t remaining = len - 1;
 169
 170   if(!remaining)
 171     return 0;
 172
 173   while(ToLower(*u1) == ToLower(*u2)) {
 174     if(*u1++ || !remaining--)
 175       return 0;
 176
 177     u2++;
 178   }
 179
 180   return ToLower(*u1) - ToLower(*u2);
 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=(char *)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 /* @GPL
 312  * mmatch()
 313  *
 314  * Written by Run (carlo@runaway.xs4all.nl), 25-10-96
 315  *
 316  *
 317  * From: Carlo Wood <carlo@runaway.xs4all.nl>
 318  * Message-Id: <199609021026.MAA02393@runaway.xs4all.nl>
 319  * Subject: [C-Com] Analysis for `mmatch' (was: gline4 problem)
 320  * To: coder-com@mail.undernet.org (coder committee)
 321  * Date: Mon, 2 Sep 1996 12:26:01 +0200 (MET DST)
 322  *
 323  * We need a new function `mmatch(const char *old_mask, const char *new_mask)'
 324  * which returns `true' likewise the current `match' (start with copying it),
 325  * but which treats '*' and '?' in `new_mask' differently (not "\*" and "\?" !)
 326  * as follows:  a '*' in `new_mask' does not match a '?' in `old_mask' and
 327  * a '?' in `new_mask' does not match a '\?' in `old_mask'.
 328  * And ofcourse... a '*' in `new_mask' does not match a '\*' in `old_mask'...
 329  * And last but not least, '\?' and '\*' in `new_mask' now become one character.
 330  */
 331
 332 int mmatch(const char *old_mask, const char *new_mask)
 333 {
 334   const char *m = old_mask;
 335   const char *n = new_mask;
 336   const char *ma = m;
 337   const char *na = n;
 338   int wild = 0;
 339   int mq = 0, nq = 0;
 340
 341   while (1)
 342   {
 343     if (*m == '*')
 344     {
 345       while (*m == '*')
 346         m++;
 347       wild = 1;
 348       ma = m;
 349       na = n;
 350     }
 351
 352     if (!*m)
 353     {
 354       if (!*n)
 355         return 0;
 356       for (m--; (m > old_mask) && (*m == '?'); m--)
 357         ;
 358       if ((*m == '*') && (m > old_mask) && (m[-1] != '\\'))
 359         return 0;
 360       if (!wild)
 361         return 1;
 362       m = ma;
 363
 364       /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
 365       if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?')))
 366         ++na;
 367
 368       n = ++na;
 369     }
 370     else if (!*n)
 371     {
 372       while (*m == '*')
 373         m++;
 374       return (*m != 0);
 375     }
 376     if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?')))
 377     {
 378       m++;
 379       mq = 1;
 380     }
 381     else
 382       mq = 0;
 383
 384     /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
 385     if ((*n == '\\') && ((n[1] == '*') || (n[1] == '?')))
 386     {
 387       n++;
 388       nq = 1;
 389     }
 390     else
 391       nq = 0;
 392
 393 /*
 394  * This `if' has been changed compared to match() to do the following:
 395  * Match when:
 396  *   old (m)         new (n)         boolean expression
 397  *    *               any             (*m == '*' && !mq) ||
 398  *    ?               any except '*'  (*m == '?' && !mq && (*n != '*' || nq)) ||
 399  * any except * or ?  same as m       (!((*m == '*' || *m == '?') && !mq) &&
 400  *                                      ToLower(*m) == ToLower(*n) &&
 401  *                                        !((mq && !nq) || (!mq && nq)))
 402  *
 403  * Here `any' also includes \* and \? !
 404  *
 405  * After reworking the boolean expressions, we get:
 406  * (Optimized to use boolean shortcircuits, with most frequently occuring
 407  *  cases upfront (which took 2 hours!)).
 408  */
 409     if ((*m == '*' && !mq) ||
 410         ((!mq || nq) && ToLower(*m) == ToLower(*n)) ||
 411         (*m == '?' && !mq && (*n != '*' || nq)))
 412     {
 413       if (*m)
 414         m++;
 415       if (*n)
 416         n++;
 417     }
 418     else
 419     {
 420       if (!wild)
 421         return 1;
 422       m = ma;
 423
 424       /* Added to `mmatch' : Because '\?' and '\*' now is one character: */
 425       if ((*na == '\\') && ((na[1] == '*') || (na[1] == '?')))
 426         ++na;
 427
 428       n = ++na;
 429     }
 430   }
 431 }
 432
 433 /*
 434  * Compare if a given string (name) matches the given
 435  * mask (which can contain wild cards: '*' - match any
 436  * number of chars, '?' - match any single character.
 437  *
 438  * return  0, if match
 439  *         1, if no match
 440  */
 441
 442 /*
 443  * match
 444  *
 445  * Rewritten by Andrea Cocito (Nemesi), November 1998.
 446  *
 447  * Permission kindly granted by Andrea to be used under the BSD license.
 448  *
 449  */
 450
 451 /****************** Nemesi's match() ***************/
 452
 453 int match(const char *mask, const char *string)
 454 {
 455   const char *m = mask, *s = string;
 456   char ch;
 457   const char *bm, *bs;          /* Will be reg anyway on a decent CPU/compiler */
 458
 459   /* Process the "head" of the mask, if any */
 460   while ((ch = *m++) && (ch != '*'))
 461     switch (ch)
 462     {
 463       case '\\':
 464         if (*m == '?' || *m == '*')
 465           ch = *m++;
 466       default:
 467         if (ToLower(*s) != ToLower(ch))
 468           return 1;
 469       case '?':
 470         if (!*s++)
 471           return 1;
 472     };
 473   if (!ch)
 474     return *s;
 475
 476   /* We got a star: quickly find if/where we match the next char */
 477 got_star:
 478   bm = m;                       /* Next try rollback here */
 479   while ((ch = *m++))
 480     switch (ch)
 481     {
 482       case '?':
 483         if (!*s++)
 484           return 1;
 485       case '*':
 486         bm = m;
 487         continue;               /* while */
 488       case '\\':
 489         if (*m == '?' || *m == '*')
 490           ch = *m++;
 491       default:
 492         goto break_while;       /* C is structured ? */
 493     };
 494 break_while:
 495   if (!ch)
 496     return 0;                   /* mask ends with '*', we got it */
 497   ch = ToLower(ch);
 498   while (ToLower(*s++) != ch)
 499     if (!*s)
 500       return 1;
 501   bs = s;                       /* Next try start from here */
 502
 503   /* Check the rest of the "chunk" */
 504   while ((ch = *m++))
 505   {
 506     switch (ch)
 507     {
 508       case '*':
 509         goto got_star;
 510       case '\\':
 511         if (*m == '?' || *m == '*')
 512           ch = *m++;
 513       default:
 514         if (ToLower(*s) != ToLower(ch))
 515         {
 516           /* If we've run out of string, give up */
 517           if (!*bs)
 518             return 1;
 519           m = bm;
 520           s = bs;
 521           goto got_star;
 522         };
 523       case '?':
 524         if (!*s++)
 525           return 1;
 526     };
 527   };
 528   if (*s)
 529   {
 530     m = bm;
 531     s = bs;
 532     goto got_star;
 533   };
 534   return 0;
 535 }
 536
 537 /*
 538  * collapse()
 539  * Collapse a pattern string into minimal components.
 540  * This particular version is "in place", so that it changes the pattern
 541  * which is to be reduced to a "minimal" size.
 542  *
 543  * (C) Carlo Wood - 6 Oct 1998
 544  * Speedup rewrite by Andrea Cocito, December 1998.
 545  * Note that this new optimized alghoritm can *only* work in place.
 546  *
 547  * Permission kindly granted by Andrea to be used under the BSD license.
 548  *
 549  */
 550
 551 char *collapse(char *mask)
 552 {
 553   int star = 0;
 554   char *m = mask;
 555   char *b;
 556
 557   if (m)
 558   {
 559     do
 560     {
 561       if ((*m == '*') && ((m[1] == '*') || (m[1] == '?')))
 562       {
 563         b = m;
 564         do
 565         {
 566           if (*m == '*')
 567             star = 1;
 568           else
 569           {
 570             if (star && (*m != '?'))
 571             {
 572               *b++ = '*';
 573               star = 0;
 574             };
 575             *b++ = *m;
 576             if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?')))
 577               *b++ = *++m;
 578           };
 579         }
 580         while (*m++);
 581         break;
 582       }
 583       else
 584       {
 585         if ((*m == '\\') && ((m[1] == '*') || (m[1] == '?')))
 586           m++;
 587       };
 588     }
 589     while (*m++);
 590   };
 591   return mask;
 592 }
 593
 594 /* a protected version of atoi that will return an error if broke/etc */
 595 int protectedatoi(char *buf, int *value) {
 596   char *ep;
 597   long lval;
 598
 599   errno = 0;
 600   lval = strtol(buf, &ep, 10);
 601   if (buf[0] == '\0' || *ep != '\0')
 602     return 0;
 603
 604   if ((errno == ERANGE && (lval == LONG_MAX || lval == LONG_MIN)) || (lval > INT_MAX || lval < INT_MIN))
 605     return 0;
 606
 607   *value = lval;
 608   return 1;
 609 }