bin_tree_t 35 lib/regcomp.c static reg_errcode_t preorder (bin_tree_t *root, bin_tree_t 36 lib/regcomp.c reg_errcode_t (fn (void *, bin_tree_t *)), bin_tree_t 38 lib/regcomp.c static reg_errcode_t postorder (bin_tree_t *root, bin_tree_t 39 lib/regcomp.c reg_errcode_t (fn (void *, bin_tree_t *)), bin_tree_t 41 lib/regcomp.c static reg_errcode_t optimize_subexps (void *extra, bin_tree_t *node); bin_tree_t 42 lib/regcomp.c static reg_errcode_t lower_subexps (void *extra, bin_tree_t *node); bin_tree_t 43 lib/regcomp.c static bin_tree_t *lower_subexp (reg_errcode_t *err, regex_t *preg, bin_tree_t 44 lib/regcomp.c bin_tree_t *node); bin_tree_t 45 lib/regcomp.c static reg_errcode_t calc_first (void *extra, bin_tree_t *node); bin_tree_t 46 lib/regcomp.c static reg_errcode_t calc_next (void *extra, bin_tree_t *node); bin_tree_t 47 lib/regcomp.c static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node); bin_tree_t 59 lib/regcomp.c static bin_tree_t *parse (re_string_t *regexp, regex_t *preg, bin_tree_t 61 lib/regcomp.c static bin_tree_t *parse_reg_exp (re_string_t *regexp, regex_t *preg, bin_tree_t 64 lib/regcomp.c static bin_tree_t *parse_branch (re_string_t *regexp, regex_t *preg, bin_tree_t 67 lib/regcomp.c static bin_tree_t *parse_expression (re_string_t *regexp, regex_t *preg, bin_tree_t 70 lib/regcomp.c static bin_tree_t *parse_sub_exp (re_string_t *regexp, regex_t *preg, bin_tree_t 73 lib/regcomp.c static bin_tree_t *parse_dup_op (bin_tree_t *dup_elem, re_string_t *regexp, bin_tree_t 76 lib/regcomp.c static bin_tree_t *parse_bracket_exp (re_string_t *regexp, re_dfa_t *dfa, bin_tree_t 98 lib/regcomp.c static bin_tree_t *build_charclass_op (re_dfa_t *dfa, bin_tree_t 103 lib/regcomp.c static bin_tree_t *create_tree (re_dfa_t *dfa, bin_tree_t 104 lib/regcomp.c bin_tree_t *left, bin_tree_t *right, bin_tree_t 106 lib/regcomp.c static bin_tree_t *create_token_tree (re_dfa_t *dfa, bin_tree_t 107 lib/regcomp.c bin_tree_t *left, bin_tree_t *right, bin_tree_t 109 lib/regcomp.c static bin_tree_t *duplicate_tree (const bin_tree_t *src, re_dfa_t *dfa); bin_tree_t 111 lib/regcomp.c static reg_errcode_t free_tree (void *extra, bin_tree_t *node); bin_tree_t 112 lib/regcomp.c static reg_errcode_t mark_opt_subexp (void *extra, bin_tree_t *node); bin_tree_t 1188 lib/regcomp.c postorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), bin_tree_t 1191 lib/regcomp.c bin_tree_t *node, *prev; bin_tree_t 1220 lib/regcomp.c preorder (bin_tree_t *root, reg_errcode_t (fn (void *, bin_tree_t *)), bin_tree_t 1223 lib/regcomp.c bin_tree_t *node; bin_tree_t 1236 lib/regcomp.c bin_tree_t *prev = NULL; bin_tree_t 1253 lib/regcomp.c optimize_subexps (void *extra, bin_tree_t *node) bin_tree_t 1284 lib/regcomp.c lower_subexps (void *extra, bin_tree_t *node) bin_tree_t 1305 lib/regcomp.c static bin_tree_t * bin_tree_t 1306 lib/regcomp.c lower_subexp (reg_errcode_t *err, regex_t *preg, bin_tree_t *node) bin_tree_t 1309 lib/regcomp.c bin_tree_t *body = node->left; bin_tree_t 1310 lib/regcomp.c bin_tree_t *op, *cls, *tree1, *tree; bin_tree_t 1344 lib/regcomp.c calc_first (void *extra, bin_tree_t *node) bin_tree_t 1366 lib/regcomp.c calc_next (void *extra, bin_tree_t *node) bin_tree_t 1389 lib/regcomp.c link_nfa_nodes (void *extra, bin_tree_t *node) bin_tree_t 2080 lib/regcomp.c static bin_tree_t * bin_tree_t 2085 lib/regcomp.c bin_tree_t *tree, *eor, *root; bin_tree_t 2114 lib/regcomp.c static bin_tree_t * bin_tree_t 2119 lib/regcomp.c bin_tree_t *tree, *branch = NULL; bin_tree_t 2163 lib/regcomp.c static bin_tree_t * bin_tree_t 2167 lib/regcomp.c bin_tree_t *tree, *expr; bin_tree_t 2185 lib/regcomp.c bin_tree_t *newtree = create_tree (dfa, tree, expr, CONCAT); bin_tree_t 2208 lib/regcomp.c static bin_tree_t * bin_tree_t 2213 lib/regcomp.c bin_tree_t *tree; bin_tree_t 2228 lib/regcomp.c bin_tree_t *mbc_remain; bin_tree_t 2322 lib/regcomp.c bin_tree_t *tree_first, *tree_last; bin_tree_t 2409 lib/regcomp.c bin_tree_t *dup_tree = parse_dup_op (tree, regexp, dfa, token, bin_tree_t 2440 lib/regcomp.c static bin_tree_t * bin_tree_t 2445 lib/regcomp.c bin_tree_t *tree; bin_tree_t 2483 lib/regcomp.c static bin_tree_t * bin_tree_t 2484 lib/regcomp.c parse_dup_op (bin_tree_t *elem, re_string_t *regexp, re_dfa_t *dfa, bin_tree_t 2487 lib/regcomp.c bin_tree_t *tree = NULL, *old_tree = NULL; bin_tree_t 3022 lib/regcomp.c static bin_tree_t * bin_tree_t 3039 lib/regcomp.c bin_tree_t *work_tree; bin_tree_t 3241 lib/regcomp.c bin_tree_t *mbc_tree; bin_tree_t 3539 lib/regcomp.c static bin_tree_t * bin_tree_t 3549 lib/regcomp.c bin_tree_t *tree; bin_tree_t 3596 lib/regcomp.c bin_tree_t *mbc_tree; bin_tree_t 3668 lib/regcomp.c static bin_tree_t * bin_tree_t 3669 lib/regcomp.c create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, bin_tree_t 3676 lib/regcomp.c static bin_tree_t * bin_tree_t 3677 lib/regcomp.c create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, bin_tree_t 3680 lib/regcomp.c bin_tree_t *tree; bin_tree_t 3714 lib/regcomp.c mark_opt_subexp (void *extra, bin_tree_t *node) bin_tree_t 3738 lib/regcomp.c free_tree (void *extra, bin_tree_t *node) bin_tree_t 3750 lib/regcomp.c static bin_tree_t * bin_tree_t 3751 lib/regcomp.c duplicate_tree (const bin_tree_t *root, re_dfa_t *dfa) bin_tree_t 3753 lib/regcomp.c const bin_tree_t *node; bin_tree_t 3754 lib/regcomp.c bin_tree_t *dup_root; bin_tree_t 3755 lib/regcomp.c bin_tree_t **p_new = &dup_root, *dup_node = root->parent; bin_tree_t 3775 lib/regcomp.c const bin_tree_t *prev = NULL; bin_tree_t 458 lib/regex_internal.h struct bin_tree_t *parent; bin_tree_t 459 lib/regex_internal.h struct bin_tree_t *left; bin_tree_t 460 lib/regex_internal.h struct bin_tree_t *right; bin_tree_t 461 lib/regex_internal.h struct bin_tree_t *first; bin_tree_t 462 lib/regex_internal.h struct bin_tree_t *next; bin_tree_t 470 lib/regex_internal.h typedef struct bin_tree_t bin_tree_t; bin_tree_t 473 lib/regex_internal.h ((1024 - sizeof (void *)) / sizeof (bin_tree_t)) bin_tree_t 478 lib/regex_internal.h bin_tree_t data[BIN_TREE_STORAGE_SIZE]; bin_tree_t 641 lib/regex_internal.h bin_tree_t *str_tree;