Searched refs:transitions (Results 1 - 2 of 2) sorted by relevance

/seL4-camkes-master/projects/musllibc/src/regex/
H A Dregcomp.c2457 tre_tnfa_transition_t *transitions,
2464 if (transitions != NULL)
2480 trans = transitions + offs[p1->position];
2509 trans->state = transitions + offs[p2->position];
2590 /* Compute a maximum limit for the number of transitions leaving
2605 /* Converts the syntax tree to a TNFA. All the transitions in the TNFA are
2606 labelled with one character range (there are no transitions on empty
2610 tre_ast_to_tnfa(tre_ast_node_t *node, tre_tnfa_transition_t *transitions, argument
2625 errcode = tre_ast_to_tnfa(uni->left, transitions, counts, offs);
2628 errcode = tre_ast_to_tnfa(uni->right, transitions, count
2456 tre_make_trans(tre_pos_and_tags_t *p1, tre_pos_and_tags_t *p2, tre_tnfa_transition_t *transitions, int *counts, int *offs) argument
2684 tre_tnfa_transition_t *transitions, *initial; local
[all...]
H A Dtre.h91 /* TNFA transition type. A TNFA state is an array of transitions,
155 tre_tnfa_transition_t *transitions; member in struct:tnfa

Completed in 92 milliseconds