76 fa	*fatab[NFA];
79 fa *makedfa(const char *s, int anchor)	/* returns dfa for reg expr s */  in makedfa()
82 	fa *pfa;  in makedfa()
121 fa *mkdfa(const char *s, int anchor)	/* does the real work of making a dfa */  in mkdfa()
125 	fa *f;  in mkdfa()
135 	if ((f = (fa *) calloc(1, sizeof(fa) + poscnt*sizeof(rrow))) == NULL)  in mkdfa()
151 int makeinit(fa *f, int anchor)  in makeinit()
339 void cfoll(fa *f, Node *v)	/* enter follow set of each leaf of vertex v into lfollow[leaf] */  in cfoll()
468 int match(fa *f, const char *p0)	/* shortest match ? */  in match()
488 int pmatch(fa *f, const char *p0)	/* longest match, for sub */  in pmatch()
547 int nematch(fa *f, const char *p0)	/* non-empty match, for sub */  in nematch()
850 int cgoto(fa *f, int s, int c)  in cgoto()
940 void freefa(fa *f)	/* free a finite automaton */  in freefa()