Lines Matching defs:transitions
1571 tre_tnfa_transition_t *transitions,
1578 if (transitions != NULL)
1594 trans = transitions + offs[p1->position];
1624 trans->state = transitions + offs[p2->position];
1768 /* Compute a maximum limit for the number of transitions leaving
1783 /* Converts the syntax tree to a TNFA. All the transitions in the TNFA are
1784 labelled with one character range (there are no transitions on empty
1788 tre_ast_to_tnfa(tre_ast_node_t *node, tre_tnfa_transition_t *transitions,
1803 errcode = tre_ast_to_tnfa(uni->left, transitions, counts, offs);
1806 errcode = tre_ast_to_tnfa(uni->right, transitions, counts, offs);
1814 transitions, counts, offs);
1817 errcode = tre_ast_to_tnfa(cat->left, transitions, counts, offs);
1820 errcode = tre_ast_to_tnfa(cat->right, transitions, counts, offs);
1833 transitions, counts, offs);
1837 errcode = tre_ast_to_tnfa(iter->arg, transitions, counts, offs);
1862 tre_tnfa_transition_t *transitions, *initial;
2018 transitions = xcalloc((unsigned)add + 1, sizeof(*transitions));
2019 if (transitions == NULL)
2021 tnfa->transitions = transitions;
2025 errcode = tre_ast_to_tnfa(tree, transitions, counts, offs);
2042 tre_tnfa_transition_t *j = transitions + offs[p->position];
2120 initial[i].state = transitions + offs[p->position];
2149 tnfa->final = transitions + offs[tree->lastpos[0].position];
2192 if (tnfa->transitions[i].state)
2194 if (tnfa->transitions[i].tags)
2195 xfree(tnfa->transitions[i].tags);
2196 if (tnfa->transitions[i].neg_classes)
2197 xfree(tnfa->transitions[i].neg_classes);
2198 if (tnfa->transitions[i].params)
2199 xfree(tnfa->transitions[i].params);
2201 if (tnfa->transitions)
2202 xfree(tnfa->transitions);