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 * return the tab table index that matches s ignoring case and .'s 36*4887Schin * tm_data.format checked if tminfo.format!=tm_data.format 37*4887Schin * 38*4887Schin * ntab and nsuf are the number of elements in tab and suf, 39*4887Schin * -1 for 0 sentinel 40*4887Schin * 41*4887Schin * all isalpha() chars in str must match 42*4887Schin * suf is a table of nsuf valid str suffixes 43*4887Schin * if e is non-null then it will point to first unmatched char in str 44*4887Schin * which will always be non-isalpha() 45*4887Schin */ 46*4887Schin 47*4887Schin int 48*4887Schin tmlex(register const char* s, char** e, char** tab, int ntab, char** suf, int nsuf) 49*4887Schin { 50*4887Schin register char** p; 51*4887Schin register char* x; 52*4887Schin register int n; 53*4887Schin 54*4887Schin for (p = tab, n = ntab; n-- && (x = *p); p++) 55*4887Schin if (*x && *x != '%' && tmword(s, e, x, suf, nsuf)) 56*4887Schin return p - tab; 57*4887Schin if (tm_info.format != tm_data.format && tab >= tm_info.format && tab < tm_info.format + TM_NFORM) 58*4887Schin { 59*4887Schin tab = tm_data.format + (tab - tm_info.format); 60*4887Schin if (suf && tab >= tm_info.format && tab < tm_info.format + TM_NFORM) 61*4887Schin suf = tm_data.format + (suf - tm_info.format); 62*4887Schin for (p = tab, n = ntab; n-- && (x = *p); p++) 63*4887Schin if (*x && *x != '%' && tmword(s, e, x, suf, nsuf)) 64*4887Schin return p - tab; 65*4887Schin } 66*4887Schin return -1; 67*4887Schin } 68