michael@0: /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0:  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: #include "plstr.h"
michael@0: #include <string.h>
michael@0: 
michael@0: static const unsigned char uc[] =
michael@0: {
michael@0:     '\000', '\001', '\002', '\003', '\004', '\005', '\006', '\007',
michael@0:     '\010', '\011', '\012', '\013', '\014', '\015', '\016', '\017',
michael@0:     '\020', '\021', '\022', '\023', '\024', '\025', '\026', '\027',
michael@0:     '\030', '\031', '\032', '\033', '\034', '\035', '\036', '\037',
michael@0:     ' ',    '!',    '"',    '#',    '$',    '%',    '&',    '\'',
michael@0:     '(',    ')',    '*',    '+',    ',',    '-',    '.',    '/',
michael@0:     '0',    '1',    '2',    '3',    '4',    '5',    '6',    '7',
michael@0:     '8',    '9',    ':',    ';',    '<',    '=',    '>',    '?',
michael@0:     '@',    'A',    'B',    'C',    'D',    'E',    'F',    'G',
michael@0:     'H',    'I',    'J',    'K',    'L',    'M',    'N',    'O',
michael@0:     'P',    'Q',    'R',    'S',    'T',    'U',    'V',    'W',
michael@0:     'X',    'Y',    'Z',    '[',    '\\',   ']',    '^',    '_',
michael@0:     '`',    'A',    'B',    'C',    'D',    'E',    'F',    'G',
michael@0:     'H',    'I',    'J',    'K',    'L',    'M',    'N',    'O',
michael@0:     'P',    'Q',    'R',    'S',    'T',    'U',    'V',    'W',
michael@0:     'X',    'Y',    'Z',    '{',    '|',    '}',    '~',    '\177',
michael@0:     0200,   0201,   0202,   0203,   0204,   0205,   0206,   0207,
michael@0:     0210,   0211,   0212,   0213,   0214,   0215,   0216,   0217,
michael@0:     0220,   0221,   0222,   0223,   0224,   0225,   0226,   0227,
michael@0:     0230,   0231,   0232,   0233,   0234,   0235,   0236,   0237,
michael@0:     0240,   0241,   0242,   0243,   0244,   0245,   0246,   0247,
michael@0:     0250,   0251,   0252,   0253,   0254,   0255,   0256,   0257,
michael@0:     0260,   0261,   0262,   0263,   0264,   0265,   0266,   0267,
michael@0:     0270,   0271,   0272,   0273,   0274,   0275,   0276,   0277,
michael@0:     0300,   0301,   0302,   0303,   0304,   0305,   0306,   0307,
michael@0:     0310,   0311,   0312,   0313,   0314,   0315,   0316,   0317,
michael@0:     0320,   0321,   0322,   0323,   0324,   0325,   0326,   0327,
michael@0:     0330,   0331,   0332,   0333,   0334,   0335,   0336,   0337,
michael@0:     0340,   0341,   0342,   0343,   0344,   0345,   0346,   0347,
michael@0:     0350,   0351,   0352,   0353,   0354,   0355,   0356,   0357,
michael@0:     0360,   0361,   0362,   0363,   0364,   0365,   0366,   0367,
michael@0:     0370,   0371,   0372,   0373,   0374,   0375,   0376,   0377
michael@0: };
michael@0: 
michael@0: PR_IMPLEMENT(PRIntn)
michael@0: PL_strcasecmp(const char *a, const char *b)
michael@0: {
michael@0:     const unsigned char *ua = (const unsigned char *)a;
michael@0:     const unsigned char *ub = (const unsigned char *)b;
michael@0: 
michael@0:     if( ((const char *)0 == a) || (const char *)0 == b ) 
michael@0:         return (PRIntn)(a-b);
michael@0: 
michael@0:     while( (uc[*ua] == uc[*ub]) && ('\0' != *a) )
michael@0:     {
michael@0:         a++;
michael@0:         ua++;
michael@0:         ub++;
michael@0:     }
michael@0: 
michael@0:     return (PRIntn)(uc[*ua] - uc[*ub]);
michael@0: }
michael@0: 
michael@0: PR_IMPLEMENT(PRIntn)
michael@0: PL_strncasecmp(const char *a, const char *b, PRUint32 max)
michael@0: {
michael@0:     const unsigned char *ua = (const unsigned char *)a;
michael@0:     const unsigned char *ub = (const unsigned char *)b;
michael@0: 
michael@0:     if( ((const char *)0 == a) || (const char *)0 == b ) 
michael@0:         return (PRIntn)(a-b);
michael@0: 
michael@0:     while( max && (uc[*ua] == uc[*ub]) && ('\0' != *a) )
michael@0:     {
michael@0:         a++;
michael@0:         ua++;
michael@0:         ub++;
michael@0:         max--;
michael@0:     }
michael@0: 
michael@0:     if( 0 == max ) return (PRIntn)0;
michael@0: 
michael@0:     return (PRIntn)(uc[*ua] - uc[*ub]);
michael@0: }
michael@0: 
michael@0: PR_IMPLEMENT(char *)
michael@0: PL_strcasestr(const char *big, const char *little)
michael@0: {
michael@0:     PRUint32 ll;
michael@0: 
michael@0:     if( ((const char *)0 == big) || ((const char *)0 == little) ) return (char *)0;
michael@0:     if( ((char)0 == *big) || ((char)0 == *little) ) return (char *)0;
michael@0: 
michael@0:     ll = strlen(little);
michael@0: 
michael@0:     for( ; *big; big++ )
michael@0:         /* obvious improvement available here */
michael@0:             if( 0 == PL_strncasecmp(big, little, ll) )
michael@0:                 return (char *)big;
michael@0: 
michael@0:     return (char *)0;
michael@0: }
michael@0: 
michael@0: PR_IMPLEMENT(char *)
michael@0: PL_strcaserstr(const char *big, const char *little)
michael@0: {
michael@0:     const char *p;
michael@0:     PRUint32 bl, ll;
michael@0: 
michael@0:     if( ((const char *)0 == big) || ((const char *)0 == little) ) return (char *)0;
michael@0:     if( ((char)0 == *big) || ((char)0 == *little) ) return (char *)0;
michael@0: 
michael@0:     bl = strlen(big);
michael@0:     ll = strlen(little);
michael@0:     if( bl < ll ) return (char *)0;
michael@0:     p = &big[ bl - ll ];
michael@0: 
michael@0:     for( ; p >= big; p-- )
michael@0:         /* obvious improvement available here */
michael@0:             if( 0 == PL_strncasecmp(p, little, ll) )
michael@0:                 return (char *)p;
michael@0: 
michael@0:     return (char *)0;
michael@0: }
michael@0: 
michael@0: PR_IMPLEMENT(char *)
michael@0: PL_strncasestr(const char *big, const char *little, PRUint32 max)
michael@0: {
michael@0:     PRUint32 ll;
michael@0: 
michael@0:     if( ((const char *)0 == big) || ((const char *)0 == little) ) return (char *)0;
michael@0:     if( ((char)0 == *big) || ((char)0 == *little) ) return (char *)0;
michael@0: 
michael@0:     ll = strlen(little);
michael@0:     if( ll > max ) return (char *)0;
michael@0:     max -= ll;
michael@0:     max++;
michael@0: 
michael@0:     for( ; max && *big; big++, max-- )
michael@0:         /* obvious improvement available here */
michael@0:             if( 0 == PL_strncasecmp(big, little, ll) )
michael@0:                 return (char *)big;
michael@0: 
michael@0:     return (char *)0;
michael@0: }
michael@0: 
michael@0: PR_IMPLEMENT(char *)
michael@0: PL_strncaserstr(const char *big, const char *little, PRUint32 max)
michael@0: {
michael@0:     const char *p;
michael@0:     PRUint32 ll;
michael@0: 
michael@0:     if( ((const char *)0 == big) || ((const char *)0 == little) ) return (char *)0;
michael@0:     if( ((char)0 == *big) || ((char)0 == *little) ) return (char *)0;
michael@0: 
michael@0:     ll = strlen(little);
michael@0: 
michael@0:     for( p = big; max && *p; p++, max-- )
michael@0:         ;
michael@0: 
michael@0:     p -= ll;
michael@0:     if( p < big ) return (char *)0;
michael@0: 
michael@0:     for( ; p >= big; p-- )
michael@0:         /* obvious improvement available here */
michael@0:             if( 0 == PL_strncasecmp(p, little, ll) )
michael@0:                 return (char *)p;
michael@0: 
michael@0:     return (char *)0;
michael@0: }