1da2e3ebdSchin /***********************************************************************
2da2e3ebdSchin * *
3da2e3ebdSchin * This software is part of the ast package *
4*b30d1939SAndy Fiddaman * Copyright (c) 1985-2011 AT&T Intellectual Property *
5da2e3ebdSchin * and is licensed under the *
6*b30d1939SAndy Fiddaman * Eclipse Public License, Version 1.0 *
77c2fbfb3SApril Chin * by AT&T Intellectual Property *
8da2e3ebdSchin * *
9da2e3ebdSchin * A copy of the License is available at *
10*b30d1939SAndy Fiddaman * http://www.eclipse.org/org/documents/epl-v10.html *
11*b30d1939SAndy Fiddaman * (with md5 checksum b35adb5213ca9657e911e9befb180842) *
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 * Glenn Fowler
25da2e3ebdSchin * AT&T Bell Laboratories
26da2e3ebdSchin *
27da2e3ebdSchin * time conversion support
28da2e3ebdSchin */
29da2e3ebdSchin
30da2e3ebdSchin #include <ast.h>
31da2e3ebdSchin #include <tm.h>
32da2e3ebdSchin #include <ctype.h>
33da2e3ebdSchin
34da2e3ebdSchin /*
35da2e3ebdSchin * return the tab table index that matches s ignoring case and .'s
36da2e3ebdSchin * tm_data.format checked if tminfo.format!=tm_data.format
37da2e3ebdSchin *
38da2e3ebdSchin * ntab and nsuf are the number of elements in tab and suf,
39da2e3ebdSchin * -1 for 0 sentinel
40da2e3ebdSchin *
41da2e3ebdSchin * all isalpha() chars in str must match
42da2e3ebdSchin * suf is a table of nsuf valid str suffixes
43da2e3ebdSchin * if e is non-null then it will point to first unmatched char in str
44da2e3ebdSchin * which will always be non-isalpha()
45da2e3ebdSchin */
46da2e3ebdSchin
47da2e3ebdSchin int
tmlex(register const char * s,char ** e,char ** tab,int ntab,char ** suf,int nsuf)48da2e3ebdSchin tmlex(register const char* s, char** e, char** tab, int ntab, char** suf, int nsuf)
49da2e3ebdSchin {
50da2e3ebdSchin register char** p;
51da2e3ebdSchin register char* x;
52da2e3ebdSchin register int n;
53da2e3ebdSchin
54da2e3ebdSchin for (p = tab, n = ntab; n-- && (x = *p); p++)
55da2e3ebdSchin if (*x && *x != '%' && tmword(s, e, x, suf, nsuf))
56da2e3ebdSchin return p - tab;
57da2e3ebdSchin if (tm_info.format != tm_data.format && tab >= tm_info.format && tab < tm_info.format + TM_NFORM)
58da2e3ebdSchin {
59da2e3ebdSchin tab = tm_data.format + (tab - tm_info.format);
60da2e3ebdSchin if (suf && tab >= tm_info.format && tab < tm_info.format + TM_NFORM)
61da2e3ebdSchin suf = tm_data.format + (suf - tm_info.format);
62da2e3ebdSchin for (p = tab, n = ntab; n-- && (x = *p); p++)
63da2e3ebdSchin if (*x && *x != '%' && tmword(s, e, x, suf, nsuf))
64da2e3ebdSchin return p - tab;
65da2e3ebdSchin }
66da2e3ebdSchin return -1;
67da2e3ebdSchin }
68