Home
last modified time | relevance | path

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

12345678910

/freebsd-12-stable/contrib/unbound/util/storage/
Ddnstree.c82 void name_tree_init(rbtree_type* tree) in name_tree_init()
87 void addr_tree_init(rbtree_type* tree) in addr_tree_init()
92 void addr_tree_addrport_init(rbtree_type* tree) in addr_tree_addrport_init()
97 int name_tree_insert(rbtree_type* tree, struct name_tree_node* node, in name_tree_insert()
109 int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node, in addr_tree_insert()
147 void addr_tree_init_parents(rbtree_type* tree) in addr_tree_init_parents()
153 void name_tree_init_parents(rbtree_type* tree) in name_tree_init_parents()
179 struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name, in name_tree_find()
191 struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name, in name_tree_lookup()
223 struct addr_tree_node* addr_tree_lookup(rbtree_type* tree, in addr_tree_lookup()
[all …]
/freebsd-12-stable/sys/cddl/contrib/opensolaris/common/avl/
Davl.c136 avl_walk(avl_tree_t *tree, void *oldnode, int left) in avl_walk()
183 avl_first(avl_tree_t *tree) in avl_first()
202 avl_last(avl_tree_t *tree) in avl_last()
226 avl_nearest(avl_tree_t *tree, avl_index_t where, int direction) in avl_nearest()
255 avl_find(avl_tree_t *tree, const void *value, avl_index_t *where) in avl_find()
303 avl_rotation(avl_tree_t *tree, avl_node_t *node, int balance) in avl_rotation()
482 avl_insert(avl_tree_t *tree, void *new_data, avl_index_t where) in avl_insert()
573 avl_tree_t *tree, in avl_insert_here()
632 avl_add(avl_tree_t *tree, void *new_node) in avl_add()
678 avl_remove(avl_tree_t *tree, void *data) in avl_remove()
[all …]
/freebsd-12-stable/contrib/gcc/
Dtree-ssa-threadedge.c117 remove_temporary_equivalences (VEC(tree, heap) **stack) in remove_temporary_equivalences()
140 record_temporary_equivalence (tree x, tree y, VEC(tree, heap) **stack) in record_temporary_equivalence()
163 record_temporary_equivalences_from_phis (edge e, VEC(tree, heap) **stack) in record_temporary_equivalences_from_phis()
212 record_temporary_equivalences_from_stmts_at_dest (edge e, in record_temporary_equivalences_from_stmts_at_dest()
213 VEC(tree, heap) **stack, in record_temporary_equivalences_from_stmts_at_dest()
354 simplify_control_stmt_condition (edge e, in simplify_control_stmt_condition()
357 tree (*simplify) (tree, tree), in simplify_control_stmt_condition() argument
494 thread_across_edge (tree dummy_cond, in thread_across_edge() argument
497 VEC(tree, heap) **stack, in thread_across_edge()
Dtree-vn.c194 static VEC (tree, gc) * in VEC() argument
211 static VEC (tree, gc) *shared_lookup_vuses; in VEC() argument
252 vn_add_with_vuses (tree expr, tree val, VEC (tree, gc) *vuses) in vn_add_with_vuses()
291 vn_lookup_with_vuses (tree expr, VEC (tree, gc) *vuses) in vn_lookup_with_vuses()
330 print_creation_to_file (tree v, tree expr, VEC (tree, gc) *vuses) in print_creation_to_file()
387 sort_vuses (VEC (tree,gc) *vuses) in sort_vuses()
402 vn_lookup_or_add_with_vuses (tree expr, VEC (tree, gc) *vuses) in vn_lookup_or_add_with_vuses()
Dcoretypes.h47 typedef union tree_node *tree; typedef
75 #define tree union _dont_use_tree_here_ * macro
Dlambda-code.c1115 VEC(tree,heap) *outerinductionvars, in gcc_tree_to_linear_expression()
1211 VEC(tree,heap) ** invariants, in gcc_loop_to_lambda_loop()
1462 VEC(tree,heap) **inductionvars, in gcc_loopnest_to_lambda_loopnest()
1531 tree type, VEC(tree,heap) *induction_vars, in lbv_to_gcc_expression()
1614 VEC(tree,heap) *induction_vars, in lle_to_gcc_expression()
1808 VEC(tree,heap) *old_ivs, in lambda_loopnest_to_gcc_loopnest()
2444 VEC(tree,heap) *lbounds, in perfect_nestify()
/freebsd-12-stable/crypto/openssl/crypto/x509v3/
Dpcy_tree.c62 static void tree_print(char *str, X509_POLICY_TREE *tree, in tree_print()
106 X509_POLICY_TREE *tree; in tree_init() local
264 X509_POLICY_TREE *tree) in tree_link_matching_nodes()
294 X509_POLICY_TREE *tree) in tree_link_nodes()
317 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_add_unmatched()
345 X509_POLICY_NODE *node, X509_POLICY_TREE *tree) in tree_link_unmatched()
381 X509_POLICY_TREE *tree) in tree_link_any()
410 static int tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) in tree_prune()
485 static int tree_calculate_authority_set(X509_POLICY_TREE *tree, in tree_calculate_authority_set()
534 static int tree_calculate_user_set(X509_POLICY_TREE *tree, in tree_calculate_user_set()
[all …]
Dpcy_lib.c20 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) in X509_policy_tree_level_count()
27 X509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, in X509_policy_tree_get0_level()
/freebsd-12-stable/contrib/unbound/edns-subnet/
Daddrtree.c90 node_create(struct addrtree *tree, void *elem, addrlen_t scope, in node_create()
115 node_size(const struct addrtree *tree, const struct addrnode *n) in node_size()
125 struct addrtree *tree; in addrtree_create() local
154 clean_node(struct addrtree *tree, struct addrnode *node) in clean_node()
165 lru_pop(struct addrtree *tree, struct addrnode *node) in lru_pop()
186 lru_push(struct addrtree *tree, struct addrnode *node) in lru_push()
201 lru_update(struct addrtree *tree, struct addrnode *node) in lru_update()
215 purge_node(struct addrtree *tree, struct addrnode *node) in purge_node()
244 lru_cleanup(struct addrtree *tree) in lru_cleanup()
272 addrtree_size(const struct addrtree *tree) in addrtree_size()
[all …]
/freebsd-12-stable/contrib/libarchive/libarchive/
Darchive_read_disk_posix.c196 struct tree { struct
197 struct tree_entry *stack; argument
198 struct tree_entry *current; argument
209 int tree_errno; argument
212 struct archive_string path;
215 const char *basename;
217 size_t dirname_length;
219 int depth;
220 int openCount;
221 int maxOpenCount;
[all …]
/freebsd-12-stable/contrib/binutils/ld/
Dldexp.c207 fold_unary (etree_type *tree) in fold_unary()
279 fold_binary (etree_type *tree) in fold_binary()
466 fold_trinary (etree_type *tree) in fold_trinary()
476 fold_name (etree_type *tree) in fold_name()
680 exp_fold_tree_1 (etree_type *tree) in exp_fold_tree_1()
823 exp_fold_tree (etree_type *tree, asection *current_section, bfd_vma *dotp) in exp_fold_tree()
832 exp_fold_tree_no_dot (etree_type *tree) in exp_fold_tree_no_dot()
965 exp_print_tree (etree_type *tree) in exp_print_tree()
1046 exp_get_vma (etree_type *tree, bfd_vma def, char *name) in exp_get_vma()
1060 exp_get_value_int (etree_type *tree, int def, char *name) in exp_get_value_int()
[all …]
/freebsd-12-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
Dzfs_rlock.c144 avl_tree_t *tree = &rl->rl_tree; in rangelock_enter_writer() local
213 rangelock_proxify(avl_tree_t *tree, locked_range_t *lr) in rangelock_proxify()
245 rangelock_split(avl_tree_t *tree, locked_range_t *lr, uint64_t off) in rangelock_split()
274 rangelock_new_proxy(avl_tree_t *tree, uint64_t off, uint64_t len) in rangelock_new_proxy()
289 rangelock_add_reader(avl_tree_t *tree, locked_range_t *new, in rangelock_add_reader()
381 avl_tree_t *tree = &rl->rl_tree; in rangelock_enter_reader() local
490 avl_tree_t *tree = &rl->rl_tree; in rangelock_exit_reader() local
/freebsd-12-stable/gnu/usr.bin/grep/
Dkwset.c52 struct tree struct
54 struct tree *llink; /* Left link; MUST be first field. */ argument
55 struct tree *rlink; /* Right link (to larger labels). */ argument
58 char balance; /* Difference in depths of subtrees. */ argument
65 struct tree *links; /* Tree of edges leaving this node. */ argument
284 enqueue (struct tree *tree, struct trie **last) in enqueue()
297 treefails (register struct tree const *tree, struct trie const *fail, in treefails()
332 treedelta (register struct tree const *tree, in treedelta()
365 treenext (struct tree const *tree, struct trie *next[]) in treenext()
592 register struct tree const *tree; in cwexec() local
/freebsd-12-stable/contrib/ldns/
Dradix.c116 ldns_radix_t* tree; in ldns_radix_create() local
134 ldns_radix_init(ldns_radix_t* tree) in ldns_radix_init()
150 ldns_radix_free(ldns_radix_t* tree) in ldns_radix_free()
168 ldns_radix_insert(ldns_radix_t* tree, uint8_t* key, radix_strlen_t len, in ldns_radix_insert()
314 void* ldns_radix_delete(ldns_radix_t* tree, const uint8_t* key, radix_strlen_t len) in ldns_radix_delete()
334 ldns_radix_search(ldns_radix_t* tree, const uint8_t* key, radix_strlen_t len) in ldns_radix_search()
380 ldns_radix_find_less_equal(ldns_radix_t* tree, const uint8_t* key, in ldns_radix_find_less_equal()
480 ldns_radix_first(const ldns_radix_t* tree) in ldns_radix_first()
499 ldns_radix_last(const ldns_radix_t* tree) in ldns_radix_last()
624 ldns_radix_printf(FILE* fd, const ldns_radix_t* tree) in ldns_radix_printf()
[all …]
/freebsd-12-stable/contrib/ncurses/ncurses/trace/
Dtrace_tries.c45 recur_tries(TRIES * tree, unsigned level) in recur_tries()
69 _nc_trace_tries(TRIES * tree) in _nc_trace_tries()
/freebsd-12-stable/contrib/subversion/subversion/libsvn_diff/
Dtoken.c65 svn_diff__get_node_count(svn_diff__tree_t *tree) in svn_diff__get_node_count() argument
75 svn_diff__tree_create(svn_diff__tree_t **tree, apr_pool_t *pool) in svn_diff__tree_create()
84 tree_insert_token(svn_diff__node_t **node, svn_diff__tree_t *tree, in tree_insert_token()
151 svn_diff__tree_t *tree, in svn_diff__get_tokens()
/freebsd-12-stable/sys/contrib/zlib/
Dtrees.c161 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
165 # define send_code(s, c, tree) \ argument
430 #define pqremove(s, tree, top) \ argument
441 #define smaller(tree, n, m, depth) \ argument
451 local void pqdownheap(s, tree, k) in pqdownheap() argument
490 ct_data *tree = desc->dyn_tree; local
572 local void gen_codes(tree, max_code, bl_count) in gen_codes() argument
619 ct_data *tree = desc->dyn_tree; local
703 local void scan_tree(s, tree, max_code) in scan_tree() argument
748 local void send_tree(s, tree, max_code) in send_tree() argument
/freebsd-12-stable/contrib/ncurses/ncurses/base/
Dtries.c90 _nc_remove_key(TRIES ** tree, unsigned code) in _nc_remove_key()
122 _nc_remove_string(TRIES ** tree, const char *string) in _nc_remove_string()
/freebsd-12-stable/contrib/dtc/
Dfstree.c31 struct node *tree; in read_fstree() local
84 struct node *tree; in dt_from_fs() local
/freebsd-12-stable/sys/dev/ena/
Dena_sysctl.c117 struct sysctl_oid *tree; in ena_sysctl_add_wd() local
162 struct sysctl_oid *tree; in ena_sysctl_add_stats() local
335 struct sysctl_oid *tree; in ena_sysctl_add_eni_metrics() local
386 struct sysctl_oid *tree; in ena_sysctl_add_tuneables() local
421 struct sysctl_oid *tree; in ena_sysctl_add_rss() local
/freebsd-12-stable/contrib/subversion/subversion/libsvn_subr/
Dprefix_string.c115 auto_realloc_sub_nodes(svn_prefix_tree__t *tree, in auto_realloc_sub_nodes() argument
164 svn_prefix_tree__t *tree = apr_pcalloc(pool, sizeof(*tree)); in svn_prefix_tree__create() local
174 svn_prefix_string__create(svn_prefix_tree__t *tree, in svn_prefix_string__create()
/freebsd-12-stable/sys/cddl/contrib/opensolaris/uts/common/sys/
Davl.h224 #define AVL_NEXT(tree, node) avl_walk(tree, node, AVL_AFTER) argument
225 #define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE) argument
/freebsd-12-stable/sys/dev/ath/
Dif_ath_sysctl.c787 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctl_alq_attach() local
816 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctlattach() local
1028 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctl_stats_attach_rxphyerr() local
1046 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctl_stats_attach_intr() local
1064 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctl_stats_attach() local
1316 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); in ath_sysctl_hal_attach() local
/freebsd-12-stable/usr.bin/dtc/
Dchecking.cc119 checker::visit_node(device_tree *tree, const node_ptr &n) in visit_node()
166 property_checker::check_property(device_tree *tree, const node_ptr &n, property_ptr p) in check_property()
241 check_manager::run_checks(device_tree *tree, bool keep_going) in run_checks()
/freebsd-12-stable/contrib/unbound/util/data/
Dmsgencode.c107 compress_tree_search(struct compress_tree_node** tree, uint8_t* dname, in compress_tree_search()
147 compress_tree_lookup(struct compress_tree_node** tree, uint8_t* dname, in compress_tree_lookup()
288 struct regional* region, struct compress_tree_node** tree, in compress_owner()
337 struct regional* region, struct compress_tree_node** tree) in compress_any_dname()
368 struct regional* region, struct compress_tree_node** tree, in compress_rdata()
451 int do_data, int do_sig, struct compress_tree_node** tree, in packed_rrset_encode()
546 struct regional* region, struct compress_tree_node** tree, in insert_section()
599 insert_query(struct query_info* qinfo, struct compress_tree_node** tree, in insert_query()
677 struct compress_tree_node* tree = 0; in reply_info_encode() local

12345678910