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  * <regexp.h> library support
25*4887Schin  */
26*4887Schin 
27*4887Schin #define _REGEXP_DECLARE
28*4887Schin 
29*4887Schin #include <ast.h>
30*4887Schin #include <regexp.h>
31*4887Schin #include <regex.h>
32*4887Schin #include <align.h>
33*4887Schin 
34*4887Schin typedef struct
35*4887Schin {
36*4887Schin 	regex_t		re;
37*4887Schin 	char*		buf;
38*4887Schin 	char*		cur;
39*4887Schin 	unsigned int	size;
40*4887Schin } Env_t;
41*4887Schin 
42*4887Schin static void*
43*4887Schin block(void* handle, void* data, size_t size)
44*4887Schin {
45*4887Schin 	register Env_t*	env = (Env_t*)handle;
46*4887Schin 
47*4887Schin 	if (data || (size = roundof(size, ALIGN_BOUND2)) > (env->buf + env->size - env->cur))
48*4887Schin 		return 0;
49*4887Schin 	data = (void*)env->cur;
50*4887Schin 	env->cur += size;
51*4887Schin 	return data;
52*4887Schin }
53*4887Schin 
54*4887Schin int
55*4887Schin _re_comp(regexp_t* re, const char* pattern, char* handle, unsigned int size)
56*4887Schin {
57*4887Schin 	register Env_t*	env = (Env_t*)handle;
58*4887Schin 	register int	n;
59*4887Schin 
60*4887Schin 	if (size <= sizeof(Env_t))
61*4887Schin 		return 50;
62*4887Schin 	env->buf = env->cur = (char*)env + sizeof(Env_t);
63*4887Schin 	env->size = size - sizeof(Env_t);
64*4887Schin 	regalloc(env, block, REG_NOFREE);
65*4887Schin 	n = regcomp(&env->re, pattern, REG_LENIENT|REG_NULL);
66*4887Schin 	switch (n)
67*4887Schin 	{
68*4887Schin 	case 0:
69*4887Schin 		break;
70*4887Schin 	case REG_ERANGE:
71*4887Schin 		n = 11;
72*4887Schin 		break;
73*4887Schin 	case REG_BADBR:
74*4887Schin 		n = 16;
75*4887Schin 		break;
76*4887Schin 	case REG_ESUBREG:
77*4887Schin 		n = 25;
78*4887Schin 		break;
79*4887Schin 	case REG_EPAREN:
80*4887Schin 		n = 42;
81*4887Schin 		break;
82*4887Schin 	case REG_EBRACK:
83*4887Schin 		n = 49;
84*4887Schin 		break;
85*4887Schin 	default:
86*4887Schin 		n = 50;
87*4887Schin 		break;
88*4887Schin 	}
89*4887Schin 	re->re_nbra = env->re.re_nsub;
90*4887Schin 	return n;
91*4887Schin }
92*4887Schin 
93*4887Schin int
94*4887Schin _re_exec(regexp_t* re, const char* subject, const char* handle, int anchor)
95*4887Schin {
96*4887Schin 	register Env_t*	env = (Env_t*)handle;
97*4887Schin 	register int	n;
98*4887Schin 	regmatch_t	match[elementsof(re->re_braslist)+1];
99*4887Schin 
100*4887Schin 	if (regexec(&env->re, subject, elementsof(match), match, 0) || anchor && match[0].rm_so)
101*4887Schin 		return 0;
102*4887Schin 	re->re_loc1 = (char*)subject + match[0].rm_so;
103*4887Schin 	re->re_loc2 = (char*)subject + match[0].rm_eo;
104*4887Schin 	for (n = 1; n <= env->re.re_nsub; n++)
105*4887Schin 	{
106*4887Schin 		re->re_braslist[n-1] = (char*)subject + match[n].rm_so;
107*4887Schin 		re->re_braelist[n-1] = (char*)subject + match[n].rm_eo;
108*4887Schin 	}
109*4887Schin 	return 1;
110*4887Schin }
111*4887Schin 
112*4887Schin char*
113*4887Schin _re_putc(int c)
114*4887Schin {
115*4887Schin 	static Sfio_t*	sp;
116*4887Schin 
117*4887Schin 	if (!sp && !(sp = sfstropen()))
118*4887Schin 		return 0;
119*4887Schin 	if (!c)
120*4887Schin 		return sfstruse(sp);
121*4887Schin 	sfputc(sp, c);
122*4887Schin 	return 0;
123*4887Schin }
124