2008-10-23 19:49:19 +08:00
|
|
|
/***************************************************************************
|
|
|
|
* _ _ ____ _
|
|
|
|
* Project ___| | | | _ \| |
|
|
|
|
* / __| | | | |_) | |
|
|
|
|
* | (__| |_| | _ <| |___
|
|
|
|
* \___|\___/|_| \_\_____|
|
|
|
|
*
|
2011-04-20 21:17:42 +08:00
|
|
|
* Copyright (C) 1998 - 2011, Daniel Stenberg, <daniel@haxx.se>, et al.
|
2008-10-23 19:49:19 +08:00
|
|
|
*
|
|
|
|
* This software is licensed as described in the file COPYING, which
|
|
|
|
* you should have received as part of this distribution. The terms
|
|
|
|
* are also available at http://curl.haxx.se/docs/copyright.html.
|
|
|
|
*
|
|
|
|
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
|
|
|
* copies of the Software, and permit persons to whom the Software is
|
|
|
|
* furnished to do so, under the terms of the COPYING file.
|
|
|
|
*
|
|
|
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
|
|
* KIND, either express or implied.
|
|
|
|
*
|
|
|
|
***************************************************************************/
|
|
|
|
|
|
|
|
#include "setup.h"
|
|
|
|
|
|
|
|
#include "rawstr.h"
|
|
|
|
|
2009-01-21 12:42:47 +08:00
|
|
|
/* Portable, consistent toupper (remember EBCDIC). Do not use toupper() because
|
2008-10-23 19:49:19 +08:00
|
|
|
its behavior is altered by the current locale. */
|
2009-01-21 12:42:47 +08:00
|
|
|
char Curl_raw_toupper(char in)
|
2008-10-23 19:49:19 +08:00
|
|
|
{
|
|
|
|
switch (in) {
|
|
|
|
case 'a':
|
|
|
|
return 'A';
|
|
|
|
case 'b':
|
|
|
|
return 'B';
|
|
|
|
case 'c':
|
|
|
|
return 'C';
|
|
|
|
case 'd':
|
|
|
|
return 'D';
|
|
|
|
case 'e':
|
|
|
|
return 'E';
|
|
|
|
case 'f':
|
|
|
|
return 'F';
|
|
|
|
case 'g':
|
|
|
|
return 'G';
|
|
|
|
case 'h':
|
|
|
|
return 'H';
|
|
|
|
case 'i':
|
|
|
|
return 'I';
|
|
|
|
case 'j':
|
|
|
|
return 'J';
|
|
|
|
case 'k':
|
|
|
|
return 'K';
|
|
|
|
case 'l':
|
|
|
|
return 'L';
|
|
|
|
case 'm':
|
|
|
|
return 'M';
|
|
|
|
case 'n':
|
|
|
|
return 'N';
|
|
|
|
case 'o':
|
|
|
|
return 'O';
|
|
|
|
case 'p':
|
|
|
|
return 'P';
|
|
|
|
case 'q':
|
|
|
|
return 'Q';
|
|
|
|
case 'r':
|
|
|
|
return 'R';
|
|
|
|
case 's':
|
|
|
|
return 'S';
|
|
|
|
case 't':
|
|
|
|
return 'T';
|
|
|
|
case 'u':
|
|
|
|
return 'U';
|
|
|
|
case 'v':
|
|
|
|
return 'V';
|
|
|
|
case 'w':
|
|
|
|
return 'W';
|
|
|
|
case 'x':
|
|
|
|
return 'X';
|
|
|
|
case 'y':
|
|
|
|
return 'Y';
|
|
|
|
case 'z':
|
|
|
|
return 'Z';
|
|
|
|
}
|
|
|
|
return in;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Curl_raw_equal() is for doing "raw" case insensitive strings. This is meant
|
|
|
|
* to be locale independent and only compare strings we know are safe for
|
|
|
|
* this. See http://daniel.haxx.se/blog/2008/10/15/strcasecmp-in-turkish/ for
|
|
|
|
* some further explanation to why this function is necessary.
|
|
|
|
*
|
2009-02-08 06:53:37 +08:00
|
|
|
* The function is capable of comparing a-z case insensitively even for
|
|
|
|
* non-ascii.
|
2008-10-23 19:49:19 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
int Curl_raw_equal(const char *first, const char *second)
|
|
|
|
{
|
|
|
|
while(*first && *second) {
|
2009-01-21 12:42:47 +08:00
|
|
|
if(Curl_raw_toupper(*first) != Curl_raw_toupper(*second))
|
2008-10-23 19:49:19 +08:00
|
|
|
/* get out of the loop as soon as they don't match */
|
|
|
|
break;
|
|
|
|
first++;
|
|
|
|
second++;
|
|
|
|
}
|
|
|
|
/* we do the comparison here (possibly again), just to make sure that if the
|
|
|
|
loop above is skipped because one of the strings reached zero, we must not
|
|
|
|
return this as a successful match */
|
2009-01-21 12:42:47 +08:00
|
|
|
return (Curl_raw_toupper(*first) == Curl_raw_toupper(*second));
|
2008-10-23 19:49:19 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int Curl_raw_nequal(const char *first, const char *second, size_t max)
|
|
|
|
{
|
|
|
|
while(*first && *second && max) {
|
2009-01-21 12:42:47 +08:00
|
|
|
if(Curl_raw_toupper(*first) != Curl_raw_toupper(*second)) {
|
2008-10-23 19:49:19 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
max--;
|
|
|
|
first++;
|
|
|
|
second++;
|
|
|
|
}
|
|
|
|
if(0 == max)
|
|
|
|
return 1; /* they are equal this far */
|
|
|
|
|
2009-01-21 12:42:47 +08:00
|
|
|
return Curl_raw_toupper(*first) == Curl_raw_toupper(*second);
|
2008-10-23 19:49:19 +08:00
|
|
|
}
|
|
|
|
|
2009-02-08 06:53:37 +08:00
|
|
|
/* Copy an upper case version of the string from src to dest. The
|
|
|
|
* strings may overlap. No more than n characters of the string are copied
|
|
|
|
* (including any NUL) and the destination string will NOT be
|
|
|
|
* NUL-terminated if that limit is reached.
|
|
|
|
*/
|
|
|
|
void Curl_strntoupper(char *dest, const char *src, size_t n)
|
|
|
|
{
|
2011-04-20 21:17:42 +08:00
|
|
|
if(n < 1)
|
2009-02-08 06:53:37 +08:00
|
|
|
return;
|
|
|
|
|
|
|
|
do {
|
|
|
|
*dest++ = Curl_raw_toupper(*src);
|
2011-04-20 21:17:42 +08:00
|
|
|
} while(*src++ && --n);
|
2009-02-08 06:53:37 +08:00
|
|
|
}
|