Home
last modified time | relevance | path

Searched refs:nfa_node (Results 1 – 6 of 6) sorted by relevance

/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/dlg/
Ddlg.h68 #define nfa_node struct _nfa_node macro
69 nfa_node {
73 nfa_node *trans[2];
106 nfa_node *l,*r;
136 extern nfa_node **nfa_array; /* start of nfa "array" */
160 extern nfa_node *new_nfa_node(void);
162 extern dfa_node **nfa_to_dfa(nfa_node *);
179 extern int relabel(nfa_node *,int); /* MR1 */
195 extern void close1(nfa_node *,int,set *); /* MR1 */
196 extern void partition(nfa_node *,int); /* MR1 */
[all …]
Drelabel.c62 int relabel(nfa_node* start,int level) in relabel()
66 nfa_node *start;
82 void partition(nfa_node* start,int level) in partition()
85 nfa_node *start; /* beginning of nfa graph */ in partition()
140 void intersect_nfa_labels(nfa_node* start,set* maximal_class) in intersect_nfa_labels()
143 nfa_node *start; in intersect_nfa_labels()
153 void r_intersect(nfa_node* start,set* maximal_class) in r_intersect()
156 nfa_node *start; in r_intersect()
181 void label_with_classes(nfa_node* start) in label_with_classes()
184 nfa_node *start; in label_with_classes()
[all …]
Dautomata.c105 t = (dfa_node*) malloc(sizeof(nfa_node)+sizeof(int)*class_no);
125 nfa_to_dfa(nfa_node *start) in nfa_to_dfa()
128 nfa_node *start; in nfa_to_dfa()
264 register nfa_node *node;
294 register nfa_node *node,*n; /* current node being examined */
329 void close1(nfa_node *node, int o, set *b) in close1()
332 nfa_node *node; in close1()
337 register nfa_node *n; /* current node being examined */
Ddlg_p.c44 nfa_node **nfa_array = NULL;/* root of binary tree that stores nfa array */
45 nfa_node nfa_model_node; /* model to initialize new nodes */
242 {nfa_node *t1; in rule_list()
330 {nfa_node *t1, *t2; in reg_expr()
412 { nfa_node *t1,*t2; in repeat_expr()
800 nfa_node *
807 register nfa_node *t; in new_nfa_node()
816 nfa_array=(nfa_node **) malloc(sizeof(nfa_node*)* in new_nfa_node()
821 nfa_array=(nfa_node **) realloc(nfa_array, in new_nfa_node()
822 sizeof(nfa_node*)*nfa_size); in new_nfa_node()
[all …]
Ddlg_p.g47 nfa_node **nfa_array = NULL;/* root of binary tree that stores nfa array */
48 nfa_node nfa_model_node; /* model to initialize new nodes */
208 <<{nfa_node *t1;
236 <<{nfa_node *t1, *t2;
265 <<{ nfa_node *t1,*t2;
450 nfa_node *
457 register nfa_node *t;
466 nfa_array=(nfa_node **) malloc(sizeof(nfa_node*)*
471 nfa_array=(nfa_node **) realloc(nfa_array,
472 sizeof(nfa_node*)*nfa_size);
[all …]
Doutput.c724 void p_nfa_node(nfa_node *p) in p_nfa_node()
727 nfa_node *p; in p_nfa_node()
730 register nfa_node *t;
759 void p_nfa(nfa_node *p) in p_nfa()
760 nfa_node *p; /* state number also index into array */ in p_nfa()
770 void s_p_nfa(nfa_node *p) in s_p_nfa()
773 nfa_node *p; /* state number also index into array */ in s_p_nfa()