129 lines
		
	
	
		
			3.2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			129 lines
		
	
	
		
			3.2 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| /***************************************************************************
 | |
|  *                                  _   _ ____  _
 | |
|  *  Project                     ___| | | |  _ \| |
 | |
|  *                             / __| | | | |_) | |
 | |
|  *                            | (__| |_| |  _ <| |___
 | |
|  *                             \___|\___/|_| \_\_____|
 | |
|  *
 | |
|  * Copyright (C) 1998 - 2008, Daniel Stenberg, <daniel@haxx.se>, et al.
 | |
|  *
 | |
|  * 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.
 | |
|  *
 | |
|  * $Id: rawstr.c,v 1.1 2008-10-23 11:49:19 bagder Exp $
 | |
|  ***************************************************************************/
 | |
| 
 | |
| #include "setup.h"
 | |
| 
 | |
| #include "rawstr.h"
 | |
| 
 | |
| /* Portable toupper (remember EBCDIC). Do not use tupper() because
 | |
|    its behavior is altered by the current locale. */
 | |
| static unsigned char my_toupper(unsigned char in)
 | |
| {
 | |
|   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.
 | |
|  *
 | |
|  * The function is capable of comparing a-z case insensitively even for non-ascii.
 | |
|  */
 | |
| 
 | |
| int Curl_raw_equal(const char *first, const char *second)
 | |
| {
 | |
|   while(*first && *second) {
 | |
|     if(my_toupper(*first) != my_toupper(*second))
 | |
|       /* 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 */
 | |
|   return (my_toupper(*first) == my_toupper(*second));
 | |
| }
 | |
| 
 | |
| int Curl_raw_nequal(const char *first, const char *second, size_t max)
 | |
| {
 | |
|   while(*first && *second && max) {
 | |
|     if(my_toupper(*first) != my_toupper(*second)) {
 | |
|       break;
 | |
|     }
 | |
|     max--;
 | |
|     first++;
 | |
|     second++;
 | |
|   }
 | |
|   if(0 == max)
 | |
|     return 1; /* they are equal this far */
 | |
| 
 | |
|   return my_toupper(*first) == my_toupper(*second);
 | |
| }
 | |
| 
 |