Home
last modified time | relevance | path

Searched defs:tree (Results 1 – 23 of 23) sorted by relevance

/mirbsd/src/gnu/usr.bin/lynx/WWW/Library/Implementation/
DHTBTree.c22 HTBTree *tree = typeMalloc(HTBTree); in HTBTree_new() local
52 void HTBTree_free(HTBTree *tree) in HTBTree_free()
76 void HTBTreeAndObject_free(HTBTree *tree) in HTBTreeAndObject_free()
85 void *HTBTree_search(HTBTree *tree, in HTBTree_search()
110 void HTBTree_add(HTBTree *tree, in HTBTree_add()
475 HTBTElement *HTBTree_next(HTBTree *tree, in HTBTree_next()
537 HTBTree *tree; in main() local
/mirbsd/src/lib/libssl/src/crypto/x509v3/
Dpcy_tree.c77 X509_POLICY_TREE *tree; in tree_init() local
284 X509_POLICY_TREE *tree) in tree_link_any()
336 static int tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) in tree_prune()
412 static int tree_calculate_authority_set(X509_POLICY_TREE *tree, in tree_calculate_authority_set()
458 static int tree_calculate_user_set(X509_POLICY_TREE *tree, in tree_calculate_user_set()
522 static int tree_evaluate(X509_POLICY_TREE *tree) in tree_evaluate()
553 void X509_policy_tree_free(X509_POLICY_TREE *tree) in X509_policy_tree_free()
598 X509_POLICY_TREE *tree = NULL; in X509_policy_check() local
Dpcy_lib.c70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) in X509_policy_tree_level_count()
78 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i) in X509_policy_tree_get0_level()
Dpcy_node.c104 X509_POLICY_TREE *tree) in level_add_node()
Dv3_ncons.c173 GENERAL_SUBTREE *tree; in do_i2r_name_constraints() local
/mirbsd/src/gnu/usr.bin/binutils/ld/
Dldexp.c201 fold_unary (etree_type *tree) in fold_unary()
273 fold_binary (etree_type *tree) in fold_binary()
460 fold_trinary (etree_type *tree) in fold_trinary()
470 fold_name (etree_type *tree) in fold_name()
631 exp_fold_tree_1 (etree_type *tree) in exp_fold_tree_1()
781 exp_fold_tree (etree_type *tree, asection *current_section, bfd_vma *dotp) in exp_fold_tree()
790 exp_fold_tree_no_dot (etree_type *tree) in exp_fold_tree_no_dot()
915 exp_print_tree (etree_type *tree) in exp_print_tree()
996 exp_get_vma (etree_type *tree, bfd_vma def, char *name) in exp_get_vma()
1010 exp_get_value_int (etree_type *tree, int def, char *name) in exp_get_value_int()
[all …]
Dldlang.c3233 etree_type *tree; in print_assignment() local
3931 etree_type *tree, in os_region_check()
/mirbsd/src/lib/libncurses/src/ncurses/trace/
Dtrace_tries.c45 recur_tries(struct tries *tree, unsigned level) in recur_tries()
65 _nc_trace_tries(struct tries *tree) in _nc_trace_tries()
/mirbsd/src/usr.sbin/dhcpd/
Dtree.h55 struct tree { struct
59 struct tree *left; argument
70 struct tree *tree; member
90 struct tree *tree; member
Dtree.c61 tree_cache(struct tree *tree) in tree_cache()
133 tree_limit(struct tree *tree, int limit) in tree_limit()
210 int *bufcount, struct tree *tree) in tree_evaluate_recurse()
Dconfpars.c180 struct tree *tree; local
863 struct tree *tree = NULL; local
900 struct tree *tree = NULL; local
/mirbsd/src/lib/libncurses/src/ncurses/base/
Dtries.c86 _nc_remove_key(struct tries **tree, unsigned short code) in _nc_remove_key()
118 _nc_remove_string(struct tries **tree, const char *string) in _nc_remove_string()
Dkey_defined.c38 find_definition(struct tries *tree, const char *str) in find_definition()
/mirbsd/src/kern/z/
Dtrees.c163 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
167 # define send_code(s, c, tree) \ argument
432 #define pqremove(s, tree, top) \ argument
443 #define smaller(tree, n, m, depth) \ argument
453 local void pqdownheap(s, tree, k) in pqdownheap() argument
492 ct_data *tree = desc->dyn_tree; local
575 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
621 ct_data *tree = desc->dyn_tree; local
705 local void scan_tree (s, tree, max_code) in scan_tree() argument
750 local void send_tree (s, tree, max_code) in send_tree() argument
/mirbsd/src/gnu/usr.bin/perl/lib/Pod/Perldoc/
DToTk.pm16 sub tree { shift->_perldoc_elem('tree' , @_) } subroutine
/mirbsd/src/usr.bin/bc/
Dbc.y54 struct tree { struct
77 static void free_tree(void); argument
/mirbsd/src/usr.bin/find/
Dfind.c141 FTS *tree; /* pointer to top of FTS hierarchy */ variable
/mirbsd/src/gnu/usr.bin/perl/ext/B/B/
DConcise.pm849 sub tree { subroutine
/mirbsd/src/gnu/usr.bin/cvs/lib/
Dregcomp.c1278 bin_tree_t *op, *cls, *tree1, *tree; in lower_subexp() local
2059 bin_tree_t *tree, *eor, *root; in parse() local
2093 bin_tree_t *tree, *branch = NULL; in parse_reg_exp() local
2133 bin_tree_t *tree, *exp; in parse_branch() local
2174 bin_tree_t *tree; in parse_expression() local
2390 bin_tree_t *tree; in parse_sub_exp() local
2427 bin_tree_t *tree = NULL, *old_tree = NULL; in parse_dup_op() local
3507 bin_tree_t *tree; in build_charclass_op() local
3666 bin_tree_t *tree; in create_token_tree() local
/mirbsd/src/gnu/usr.bin/binutils/binutils/
Dcoffdump.c474 struct coff_ofile *tree; in main() local
Dsrconv.c97 static struct coff_ofile *tree; variable
1691 prescan (struct coff_ofile *tree) in prescan()
/mirbsd/src/sys/net/
Dpf_norm.c281 pf_find_fragment(struct ip *ip, struct pf_frag_tree *tree) in pf_find_fragment()
Dpf.c491 pf_find_state_recurse(struct pfi_kif *kif, struct pf_state *key, u_int8_t tree) in pf_find_state_recurse()
520 pf_find_state_all(struct pf_state *key, u_int8_t tree, int *more) in pf_find_state_all()