Lines Matching refs:fa
80 fa *fatab[NFA];
116 static int get_gototab(fa*, int, int);
117 static int set_gototab(fa*, int, int, int);
118 static void clear_gototab(fa*, int);
144 resize_state(fa *f, int state) in resize_state()
186 fa *makedfa(const char *s, bool anchor) /* returns dfa for reg expr s */ in makedfa()
189 fa *pfa; in makedfa()
224 fa *mkdfa(const char *s, bool anchor) /* does the real work of making a dfa */ in mkdfa()
228 fa *f; in mkdfa()
240 if ((f = (fa *) calloc(1, sizeof(fa) + poscnt * sizeof(rrow))) == NULL) in mkdfa()
259 int makeinit(fa *f, bool anchor) in makeinit()
474 void cfoll(fa *f, Node *v) /* enter follow set of each leaf of vertex v into lfollow[leaf] */ in cfoll()
599 static void resize_gototab(fa *f, int state) in resize_gototab()
614 static int get_gototab(fa *f, int state, int ch) /* hide gototab implementation */ in get_gototab()
641 static int set_gototab(fa *f, int state, int ch, int val) /* hide gototab implementation */ in set_gototab()
690 static void clear_gototab(fa *f, int state) in clear_gototab()
697 int match(fa *f, const char *p0) /* shortest match ? */ in match()
727 int pmatch(fa *f, const char *p0) /* longest match, for sub */ in pmatch()
783 int nematch(fa *f, const char *p0) /* non-empty match, for sub */ in nematch()
850 bool fnematch(fa *pfa, FILE *f, char **pbuf, int *pbufsize, int quantum) in fnematch()
1462 int cgoto(fa *f, int s, int c) in cgoto()
1541 void freefa(fa *f) /* free a finite automaton */ in freefa()