1da2e3ebdSchin /*********************************************************************** 2da2e3ebdSchin * * 3da2e3ebdSchin * This software is part of the ast package * 4*3e14f97fSRoger A. Faulkner * Copyright (c) 1985-2010 AT&T Intellectual Property * 5da2e3ebdSchin * and is licensed under the * 6da2e3ebdSchin * Common Public License, Version 1.0 * 77c2fbfb3SApril Chin * by AT&T Intellectual Property * 8da2e3ebdSchin * * 9da2e3ebdSchin * A copy of the License is available at * 10da2e3ebdSchin * http://www.opensource.org/licenses/cpl1.0.txt * 11da2e3ebdSchin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * 12da2e3ebdSchin * * 13da2e3ebdSchin * Information and Software Systems Research * 14da2e3ebdSchin * AT&T Research * 15da2e3ebdSchin * Florham Park NJ * 16da2e3ebdSchin * * 17da2e3ebdSchin * Glenn Fowler <gsf@research.att.com> * 18da2e3ebdSchin * David Korn <dgk@research.att.com> * 19da2e3ebdSchin * Phong Vo <kpv@research.att.com> * 20da2e3ebdSchin * * 21da2e3ebdSchin ***********************************************************************/ 22da2e3ebdSchin #pragma prototyped 23da2e3ebdSchin 24da2e3ebdSchin /* 25da2e3ebdSchin * ccmapc(c, CC_NATIVE, CC_ASCII) and strncmp 26da2e3ebdSchin */ 27da2e3ebdSchin 28da2e3ebdSchin #include <ast.h> 29da2e3ebdSchin #include <ccode.h> 30da2e3ebdSchin 31da2e3ebdSchin #if _lib_strnacmp 32da2e3ebdSchin 33da2e3ebdSchin NoN(strnacmp) 34da2e3ebdSchin 35da2e3ebdSchin #else 36da2e3ebdSchin 37da2e3ebdSchin #include <ctype.h> 38da2e3ebdSchin 39da2e3ebdSchin int 40da2e3ebdSchin strnacmp(const char* a, const char* b, size_t n) 41da2e3ebdSchin { 42da2e3ebdSchin #if CC_NATIVE == CC_ASCII 43da2e3ebdSchin return strncmp(a, b, n); 44da2e3ebdSchin #else 45da2e3ebdSchin register unsigned char* ua = (unsigned char*)a; 46da2e3ebdSchin register unsigned char* ub = (unsigned char*)b; 47da2e3ebdSchin register unsigned char* ue; 48da2e3ebdSchin register unsigned char* m; 49da2e3ebdSchin register int c; 50da2e3ebdSchin register int d; 51da2e3ebdSchin 52da2e3ebdSchin m = ccmap(CC_NATIVE, CC_ASCII); 53da2e3ebdSchin ue = ua + n; 54da2e3ebdSchin while (ua < ue) 55da2e3ebdSchin { 56da2e3ebdSchin c = m[*ua++]; 57da2e3ebdSchin if (d = c - m[*ub++]) 58da2e3ebdSchin return d; 59da2e3ebdSchin if (!c) 60da2e3ebdSchin return 0; 61da2e3ebdSchin } 62da2e3ebdSchin return 0; 63da2e3ebdSchin #endif 64da2e3ebdSchin } 65da2e3ebdSchin 66da2e3ebdSchin #endif 67