65 uchar	*rlxstr;
66 uchar	*prestr;	/* current position in current re */
67 uchar	*lastre;	/* origin of last re */
72 uchar	*patbeg;
79 static fa	*mkdfa(uchar *, int);
86 static Node	*reparse(uchar *);
92 makedfa(uchar *s, int anchor)	/* returns dfa for reg expr s */  in makedfa()
127 mkdfa(uchar *s, int anchor)	/* does the real work of making a dfa */  in mkdfa()
241 uchar *
242 cclenter(uchar *p)  in cclenter()
245 	uchar *op, *chars, *ret;  in cclenter()
278 				while ((uchar)c < *p) {	/* fails if *p is \\ */  in cclenter()
355 		if (type(p) == CCL && (*(uchar *)right(p)) == '\0')  in first()
418 member(uchar c, uchar *s)	/* is c in s? */  in member()
428 match(fa *f, uchar *p)  in match()
447 pmatch(fa *f, uchar *p)  in pmatch()
450 	register uchar *q;  in pmatch()
505 nematch(fa *f, uchar *p)  in nematch()
508 	register uchar *q;  in nematch()
566 reparse(uchar *p)  in reparse()
632 			    (Node *)tostring((uchar *)""))));  in primary()
693 	uchar *cbuf;  in relex()
790 			    member(c, (uchar *)f->re[p[i]].lval) ||  in cgoto()
792 			    !member(c, (uchar *)f->re[p[i]].lval) &&  in cgoto()