1*4887Schin /*********************************************************************** 2*4887Schin * * 3*4887Schin * This software is part of the ast package * 4*4887Schin * Copyright (c) 1985-2007 AT&T Knowledge Ventures * 5*4887Schin * and is licensed under the * 6*4887Schin * Common Public License, Version 1.0 * 7*4887Schin * by AT&T Knowledge Ventures * 8*4887Schin * * 9*4887Schin * A copy of the License is available at * 10*4887Schin * http://www.opensource.org/licenses/cpl1.0.txt * 11*4887Schin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * 12*4887Schin * * 13*4887Schin * Information and Software Systems Research * 14*4887Schin * AT&T Research * 15*4887Schin * Florham Park NJ * 16*4887Schin * * 17*4887Schin * Glenn Fowler <gsf@research.att.com> * 18*4887Schin * David Korn <dgk@research.att.com> * 19*4887Schin * Phong Vo <kpv@research.att.com> * 20*4887Schin * * 21*4887Schin ***********************************************************************/ 22*4887Schin #pragma prototyped 23*4887Schin /* 24*4887Schin * Glenn Fowler 25*4887Schin * AT&T Bell Laboratories 26*4887Schin * 27*4887Schin * time conversion support 28*4887Schin */ 29*4887Schin 30*4887Schin #include <ast.h> 31*4887Schin #include <tm.h> 32*4887Schin #include <ctype.h> 33*4887Schin 34*4887Schin /* 35*4887Schin * match s against t ignoring case and .'s 36*4887Schin * 37*4887Schin * suf is an n element table of suffixes that may trail s 38*4887Schin * if all isalpha() chars in s match then 1 is returned 39*4887Schin * and if e is non-null it will point to the first unmatched 40*4887Schin * char in s, otherwise 0 is returned 41*4887Schin */ 42*4887Schin 43*4887Schin int 44*4887Schin tmword(register const char* s, char** e, register const char* t, char** suf, int n) 45*4887Schin { 46*4887Schin register int c; 47*4887Schin const char* b; 48*4887Schin 49*4887Schin if (*s && *t) 50*4887Schin { 51*4887Schin b = s; 52*4887Schin while (c = *s++) 53*4887Schin { 54*4887Schin if (c != '.') 55*4887Schin { 56*4887Schin if (!isalpha(c) || c != *t && (islower(c) ? toupper(c) : tolower(c)) != *t) 57*4887Schin break; 58*4887Schin t++; 59*4887Schin } 60*4887Schin } 61*4887Schin s--; 62*4887Schin if (!isalpha(c)) 63*4887Schin { 64*4887Schin if (c == '_') 65*4887Schin s++; 66*4887Schin if (e) 67*4887Schin *e = (char*)s; 68*4887Schin return s > b; 69*4887Schin } 70*4887Schin if (!*t && s > (b + 1)) 71*4887Schin { 72*4887Schin b = s; 73*4887Schin while (n-- && (t = *suf++)) 74*4887Schin { 75*4887Schin s = b; 76*4887Schin while (isalpha(c = *s++) && (c == *t || (islower(c) ? toupper(c) : tolower(c)) == *t)) t++; 77*4887Schin if (!*t && !isalpha(c)) 78*4887Schin { 79*4887Schin if (c != '_') 80*4887Schin s--; 81*4887Schin if (e) 82*4887Schin *e = (char*)s; 83*4887Schin return 1; 84*4887Schin } 85*4887Schin } 86*4887Schin } 87*4887Schin } 88*4887Schin return 0; 89*4887Schin } 90