Lines Matching defs:transitions
2471 tre_tnfa_transition_t *transitions,
2478 if (transitions != NULL)
2494 trans = transitions + offs[p1->position];
2523 trans->state = transitions + offs[p2->position];
2604 /* Compute a maximum limit for the number of transitions leaving
2619 /* Converts the syntax tree to a TNFA. All the transitions in the TNFA are
2620 labelled with one character range (there are no transitions on empty
2624 tre_ast_to_tnfa(tre_ast_node_t *node, tre_tnfa_transition_t *transitions,
2639 errcode = tre_ast_to_tnfa(uni->left, transitions, counts, offs);
2642 errcode = tre_ast_to_tnfa(uni->right, transitions, counts, offs);
2650 transitions, counts, offs);
2653 errcode = tre_ast_to_tnfa(cat->left, transitions, counts, offs);
2656 errcode = tre_ast_to_tnfa(cat->right, transitions, counts, offs);
2669 transitions, counts, offs);
2673 errcode = tre_ast_to_tnfa(iter->arg, transitions, counts, offs);
2698 tre_tnfa_transition_t *transitions, *initial;
2829 transitions = xcalloc((unsigned)add + 1, sizeof(*transitions));
2830 if (transitions == NULL)
2832 tnfa->transitions = transitions;
2835 errcode = tre_ast_to_tnfa(tree, transitions, counts, offs);
2857 initial[i].state = transitions + offs[p->position];
2877 tnfa->final = transitions + offs[tree->lastpos[0].position];
2918 if (tnfa->transitions[i].state)
2920 if (tnfa->transitions[i].tags)
2921 xfree(tnfa->transitions[i].tags);
2922 if (tnfa->transitions[i].neg_classes)
2923 xfree(tnfa->transitions[i].neg_classes);
2925 if (tnfa->transitions)
2926 xfree(tnfa->transitions);