bin_tree_t 37 lib/regcomp.c static reg_errcode_t preorder (bin_tree_t *root, bin_tree_t 38 lib/regcomp.c reg_errcode_t (fn (void *, bin_tree_t *)), bin_tree_t 40 lib/regcomp.c static reg_errcode_t postorder (bin_tree_t *root, bin_tree_t 41 lib/regcomp.c reg_errcode_t (fn (void *, bin_tree_t *)), bin_tree_t 43 lib/regcomp.c static reg_errcode_t optimize_subexps (void *extra, bin_tree_t *node); bin_tree_t 44 lib/regcomp.c static reg_errcode_t lower_subexps (void *extra, bin_tree_t *node); bin_tree_t 45 lib/regcomp.c static bin_tree_t *lower_subexp (reg_errcode_t *err, regex_t *preg, bin_tree_t 46 lib/regcomp.c bin_tree_t *node); bin_tree_t 47 lib/regcomp.c static reg_errcode_t calc_first (void *extra, bin_tree_t *node); bin_tree_t 48 lib/regcomp.c static reg_errcode_t calc_next (void *extra, bin_tree_t *node); bin_tree_t 49 lib/regcomp.c static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node); bin_tree_t 61 lib/regcomp.c static bin_tree_t *parse (re_string_t *regexp, regex_t *preg, bin_tree_t 63 lib/regcomp.c static bin_tree_t *parse_reg_exp (re_string_t *regexp, regex_t *preg, bin_tree_t 66 lib/regcomp.c static bin_tree_t *parse_branch (re_string_t *regexp, regex_t *preg, bin_tree_t 69 lib/regcomp.c static bin_tree_t *parse_expression (re_string_t *regexp, regex_t *preg, bin_tree_t 72 lib/regcomp.c static bin_tree_t *parse_sub_exp (re_string_t *regexp, regex_t *preg, bin_tree_t 75 lib/regcomp.c static bin_tree_t *parse_dup_op (bin_tree_t *dup_elem, re_string_t *regexp, bin_tree_t 78 lib/regcomp.c static bin_tree_t *parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, bin_tree_t 109 lib/regcomp.c static bin_tree_t *build_charclass_op (re_dfa_t *dfa, bin_tree_t 114 lib/regcomp.c static bin_tree_t *create_tree (re_dfa_t *dfa, bin_tree_t 115 lib/regcomp.c bin_tree_t *left, bin_tree_t *right, bin_tree_t 117 lib/regcomp.c static bin_tree_t *create_token_tree (re_dfa_t *dfa, bin_tree_t 118 lib/regcomp.c bin_tree_t *left, bin_tree_t *right, bin_tree_t 120 lib/regcomp.c static bin_tree_t *duplicate_tree (const bin_tree_t *src, re_dfa_t *dfa); bin_tree_t 122 lib/regcomp.c static reg_errcode_t free_tree (void *extra, bin_tree_t *node); bin_tree_t 123 lib/regcomp.c static reg_errcode_t mark_opt_subexp (void *extra, bin_tree_t *node); bin_tree_t 1210 lib/regcomp.c postorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), bin_tree_t 1213 lib/regcomp.c bin_tree_t *node, *prev; bin_tree_t 1242 lib/regcomp.c preorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), bin_tree_t 1245 lib/regcomp.c bin_tree_t *node; bin_tree_t 1258 lib/regcomp.c bin_tree_t *prev = NULL; bin_tree_t 1275 lib/regcomp.c optimize_subexps (void *extra, bin_tree_t *node) bin_tree_t 1306 lib/regcomp.c lower_subexps (void *extra, bin_tree_t *node) bin_tree_t 1327 lib/regcomp.c static bin_tree_t * bin_tree_t 1328 lib/regcomp.c lower_subexp (reg_errcode_t *err, regex_t *preg, bin_tree_t *node) bin_tree_t 1331 lib/regcomp.c bin_tree_t *body = node->left; bin_tree_t 1332 lib/regcomp.c bin_tree_t *op, *cls, *tree1, *tree; bin_tree_t 1365 lib/regcomp.c calc_first (void *extra, bin_tree_t *node) bin_tree_t 1387 lib/regcomp.c calc_next (void *extra _UNUSED_PARAMETER_, bin_tree_t *node) bin_tree_t 1410 lib/regcomp.c link_nfa_nodes (void *extra, bin_tree_t *node) bin_tree_t 2107 lib/regcomp.c static bin_tree_t * bin_tree_t 2112 lib/regcomp.c bin_tree_t *tree, *eor, *root; bin_tree_t 2141 lib/regcomp.c static bin_tree_t * bin_tree_t 2146 lib/regcomp.c bin_tree_t *tree, *branch = NULL; bin_tree_t 2182 lib/regcomp.c static bin_tree_t * bin_tree_t 2186 lib/regcomp.c bin_tree_t *tree, *expr; bin_tree_t 2222 lib/regcomp.c static bin_tree_t * bin_tree_t 2227 lib/regcomp.c bin_tree_t *tree; bin_tree_t 2243 lib/regcomp.c bin_tree_t *mbc_remain; bin_tree_t 2333 lib/regcomp.c bin_tree_t *tree_first, *tree_last; bin_tree_t 2438 lib/regcomp.c static bin_tree_t * bin_tree_t 2443 lib/regcomp.c bin_tree_t *tree; bin_tree_t 2476 lib/regcomp.c static bin_tree_t * bin_tree_t 2477 lib/regcomp.c parse_dup_op (bin_tree_t *elem, re_string_t *regexp, re_dfa_t *dfa, bin_tree_t 2480 lib/regcomp.c bin_tree_t *tree = NULL, *old_tree = NULL; bin_tree_t 2775 lib/regcomp.c static bin_tree_t * bin_tree_t 3051 lib/regcomp.c bin_tree_t *work_tree; bin_tree_t 3273 lib/regcomp.c bin_tree_t *mbc_tree; bin_tree_t 3602 lib/regcomp.c static bin_tree_t * bin_tree_t 3615 lib/regcomp.c bin_tree_t *tree; bin_tree_t 3679 lib/regcomp.c bin_tree_t *mbc_tree; bin_tree_t 3757 lib/regcomp.c static bin_tree_t * bin_tree_t 3758 lib/regcomp.c create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, bin_tree_t 3766 lib/regcomp.c static bin_tree_t * bin_tree_t 3767 lib/regcomp.c create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, bin_tree_t 3770 lib/regcomp.c bin_tree_t *tree; bin_tree_t 3804 lib/regcomp.c mark_opt_subexp (void *extra, bin_tree_t *node) bin_tree_t 3831 lib/regcomp.c free_tree (void *extra _UNUSED_PARAMETER_, bin_tree_t *node) bin_tree_t 3843 lib/regcomp.c static bin_tree_t * bin_tree_t 3844 lib/regcomp.c duplicate_tree (const bin_tree_t *root, re_dfa_t *dfa) bin_tree_t 3846 lib/regcomp.c const bin_tree_t *node; bin_tree_t 3847 lib/regcomp.c bin_tree_t *dup_root; bin_tree_t 3848 lib/regcomp.c bin_tree_t **p_new = &dup_root, *dup_node = root->parent; bin_tree_t 3868 lib/regcomp.c const bin_tree_t *prev = NULL; bin_tree_t 480 lib/regex_internal.h struct bin_tree_t *parent; bin_tree_t 481 lib/regex_internal.h struct bin_tree_t *left; bin_tree_t 482 lib/regex_internal.h struct bin_tree_t *right; bin_tree_t 483 lib/regex_internal.h struct bin_tree_t *first; bin_tree_t 484 lib/regex_internal.h struct bin_tree_t *next; bin_tree_t 492 lib/regex_internal.h typedef struct bin_tree_t bin_tree_t; bin_tree_t 495 lib/regex_internal.h ((1024 - sizeof (void *)) / sizeof (bin_tree_t)) bin_tree_t 500 lib/regex_internal.h bin_tree_t data[BIN_TREE_STORAGE_SIZE]; bin_tree_t 668 lib/regex_internal.h bin_tree_t *str_tree;