gonzui


Format: Advanced Search

t2ex/bsd_source/lib/libc/src_bsd/string/strcasecmp.cbare sourcepermlink (0.01 seconds)

Search this content:

    1: /*      $OpenBSD: strcasecmp.c,v 1.6 2005/08/08 08:05:37 espie Exp $ */
    2: 
    3: /*
    4:  * Copyright (c) 1987, 1993
    5:  *      The Regents of the University of California.  All rights reserved.
    6:  *
    7:  * Redistribution and use in source and binary forms, with or without
    8:  * modification, are permitted provided that the following conditions
    9:  * are met:
   10:  * 1. Redistributions of source code must retain the above copyright
   11:  *    notice, this list of conditions and the following disclaimer.
   12:  * 2. Redistributions in binary form must reproduce the above copyright
   13:  *    notice, this list of conditions and the following disclaimer in the
   14:  *    documentation and/or other materials provided with the distribution.
   15:  * 3. Neither the name of the University nor the names of its contributors
   16:  *    may be used to endorse or promote products derived from this software
   17:  *    without specific prior written permission.
   18:  *
   19:  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
   20:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   21:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   22:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
   23:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   24:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   25:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   26:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   27:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   28:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   29:  * SUCH DAMAGE.
   30:  */
   31: 
   32: #include <string.h>
   33: 
   34: typedef unsigned char u_char;
   35: 
   36: #ifndef _T2EX
   37: /*
   38:  * This array is designed for mapping upper and lower case letter
   39:  * together for a case independent comparison.  The mappings are
   40:  * based upon ascii character sequences.
   41:  */
   42: static const u_char charmap[] = {
   43:         '\000', '\001', '\002', '\003', '\004', '\005', '\006', '\007',
   44:         '\010', '\011', '\012', '\013', '\014', '\015', '\016', '\017',
   45:         '\020', '\021', '\022', '\023', '\024', '\025', '\026', '\027',
   46:         '\030', '\031', '\032', '\033', '\034', '\035', '\036', '\037',
   47:         '\040', '\041', '\042', '\043', '\044', '\045', '\046', '\047',
   48:         '\050', '\051', '\052', '\053', '\054', '\055', '\056', '\057',
   49:         '\060', '\061', '\062', '\063', '\064', '\065', '\066', '\067',
   50:         '\070', '\071', '\072', '\073', '\074', '\075', '\076', '\077',
   51:         '\100', '\141', '\142', '\143', '\144', '\145', '\146', '\147',
   52:         '\150', '\151', '\152', '\153', '\154', '\155', '\156', '\157',
   53:         '\160', '\161', '\162', '\163', '\164', '\165', '\166', '\167',
   54:         '\170', '\171', '\172', '\133', '\134', '\135', '\136', '\137',
   55:         '\140', '\141', '\142', '\143', '\144', '\145', '\146', '\147',
   56:         '\150', '\151', '\152', '\153', '\154', '\155', '\156', '\157',
   57:         '\160', '\161', '\162', '\163', '\164', '\165', '\166', '\167',
   58:         '\170', '\171', '\172', '\173', '\174', '\175', '\176', '\177',
   59:         '\200', '\201', '\202', '\203', '\204', '\205', '\206', '\207',
   60:         '\210', '\211', '\212', '\213', '\214', '\215', '\216', '\217',
   61:         '\220', '\221', '\222', '\223', '\224', '\225', '\226', '\227',
   62:         '\230', '\231', '\232', '\233', '\234', '\235', '\236', '\237',
   63:         '\240', '\241', '\242', '\243', '\244', '\245', '\246', '\247',
   64:         '\250', '\251', '\252', '\253', '\254', '\255', '\256', '\257',
   65:         '\260', '\261', '\262', '\263', '\264', '\265', '\266', '\267',
   66:         '\270', '\271', '\272', '\273', '\274', '\275', '\276', '\277',
   67:         '\300', '\301', '\302', '\303', '\304', '\305', '\306', '\307',
   68:         '\310', '\311', '\312', '\313', '\314', '\315', '\316', '\317',
   69:         '\320', '\321', '\322', '\323', '\324', '\325', '\326', '\327',
   70:         '\330', '\331', '\332', '\333', '\334', '\335', '\336', '\337',
   71:         '\340', '\341', '\342', '\343', '\344', '\345', '\346', '\347',
   72:         '\350', '\351', '\352', '\353', '\354', '\355', '\356', '\357',
   73:         '\360', '\361', '\362', '\363', '\364', '\365', '\366', '\367',
   74:         '\370', '\371', '\372', '\373', '\374', '\375', '\376', '\377',
   75: };
   76: 
   77: int
   78: strcasecmp(const char *s1, const char *s2)
   79: {
   80:         const u_char *cm = charmap;
   81:         const u_char *us1 = (const u_char *)s1;
   82:         const u_char *us2 = (const u_char *)s2;
   83: 
   84:         while (cm[*us1] == cm[*us2++])
   85:                 if (*us1++ == '\0')
   86:                         return (0);
   87:         return (cm[*us1] - cm[*--us2]);
   88: }
   89: 
   90: int
   91: strncasecmp(const char *s1, const char *s2, size_t n)
   92: {
   93:         if (n != 0) {
   94:                 const u_char *cm = charmap;
   95:                 const u_char *us1 = (const u_char *)s1;
   96:                 const u_char *us2 = (const u_char *)s2;
   97: 
   98:                 do {
   99:                         if (cm[*us1] != cm[*us2++])
  100:                                 return (cm[*us1] - cm[*--us2]);
  101:                         if (*us1++ == '\0')
  102:                                 break;
  103:                 } while (--n != 0);
  104:         }
  105:         return (0);
  106: }
  107: #else
  108: static inline u_char
  109: _internal_tolower(u_char c)
  110: {
  111:         return (c >= 'A' && c <= 'Z') ? (c - 'A' + 'a') : c;
  112: }
  113: 
  114: int
  115: strcasecmp(const char *s1, const char *s2)
  116: {
  117:         const u_char *us1 = (const u_char *)s1;
  118:         const u_char *us2 = (const u_char *)s2;
  119:         u_char u1, u2;
  120: 
  121:         while ((u1 = _internal_tolower(*us1++)) == (u2 = _internal_tolower(*us2++)))
  122:                 if (u1 == '\0')
  123:                         return (0);
  124:         return (u1 - u2);
  125: }
  126: 
  127: int
  128: strncasecmp(const char *s1, const char *s2, size_t n)
  129: {
  130:         if (n != 0) {
  131:                 const u_char *us1 = (const u_char *)s1;
  132:                 const u_char *us2 = (const u_char *)s2;
  133:                 u_char u1, u2;
  134: 
  135:                 do {
  136:                         if ((u1 = _internal_tolower(*us1++)) != (u2 = _internal_tolower(*us2++)))
  137:                                 return (u1 - u2);
  138:                         if (u1 == '\0')
  139:                                 break;
  140:                 } while (--n != 0);
  141:         }
  142:         return (0);
  143: }
  144: #endif