Home
last modified time | relevance | path

Searched refs:tree (Results 1 – 25 of 1895) sorted by relevance

12345678910>>...76

/freebsd-14.2/contrib/kyua/utils/config/
H A Dtree_test.cpp134 config::tree tree; in ATF_TEST_CASE_BODY() local
153 config::tree tree; in ATF_TEST_CASE_BODY() local
400 config::tree tree; in ATF_TEST_CASE_BODY() local
410 config::tree tree; in ATF_TEST_CASE_BODY() local
452 config::tree tree; in ATF_TEST_CASE_BODY() local
470 config::tree tree; in ATF_TEST_CASE_BODY() local
498 config::tree tree; in ATF_TEST_CASE_BODY() local
507 config::tree tree; in ATF_TEST_CASE_BODY() local
517 config::tree tree; in ATF_TEST_CASE_BODY() local
532 config::tree tree; in ATF_TEST_CASE_BODY() local
[all …]
H A Dlua_module_test.cpp125 config::tree tree; in ATF_TEST_CASE_BODY() local
149 config::tree tree; in ATF_TEST_CASE_BODY() local
174 config::tree tree; in ATF_TEST_CASE_BODY() local
192 config::tree tree; in ATF_TEST_CASE_BODY() local
208 config::tree tree; in ATF_TEST_CASE_BODY() local
225 config::tree tree; in ATF_TEST_CASE_BODY() local
249 config::tree tree; in ATF_TEST_CASE_BODY() local
268 config::tree tree; in ATF_TEST_CASE_BODY() local
284 config::tree tree; in ATF_TEST_CASE_BODY() local
301 config::tree tree; in ATF_TEST_CASE_BODY() local
[all …]
H A Dparser_test.cpp56 setup(config::tree& tree, const int syntax_version) in setup() argument
74 mock_parser(config::tree& tree) : in mock_parser() argument
92 config::tree tree; in ATF_TEST_CASE_BODY() local
107 config::tree tree; in ATF_TEST_CASE_BODY() local
124 config::tree tree; in ATF_TEST_CASE_BODY() local
145 config::tree tree(false); in ATF_TEST_CASE_BODY() local
159 config::tree tree1; in ATF_TEST_CASE_BODY()
178 config::tree tree; in ATF_TEST_CASE_BODY() local
190 config::tree tree; in ATF_TEST_CASE_BODY() local
208 config::tree tree; in ATF_TEST_CASE_BODY() local
[all …]
H A Dtree.cpp42 config::tree::tree(const bool strict) : in tree() function in config::tree
52 config::tree::tree(const bool strict, detail::static_inner_node* root) : in tree() function in config::tree
59 config::tree::~tree(void) in ~tree()
67 config::tree
68 config::tree::deep_copy(void) const in deep_copy()
72 return config::tree(_strict, new_root); in deep_copy()
92 config::tree
93 config::tree::combine(const tree& overrides) const in combine()
102 return config::tree(_strict, new_root); in combine()
321 config::tree::operator==(const tree& other) const in operator ==()
[all …]
H A Dlua_module.cpp53 config::tree&
64 config::tree& tree = **state.to_userdata< config::tree* >(-1); in get_global_tree() local
66 return tree; in get_global_tree()
163 config::tree& tree = get_global_tree(state); in redirect_newindex() local
164 tree.set_lua(dotted_key, state, -1); in redirect_newindex()
220 const config::tree& tree = get_global_tree(state); in redirect_index() local
222 if (tree.is_set(tree_key)) { in redirect_index()
225 tree.push_lua(tree_key, state); in redirect_index()
260 config::redirect(lutok::state& state, tree& out_tree) in redirect()
278 config::tree** tree = state.new_userdata< config::tree* >(); in redirect() local
[all …]
H A Dtree.hpp80 class tree { class
87 tree(const bool, detail::static_inner_node*);
90 tree(const bool = true);
91 ~tree(void);
93 tree deep_copy(void) const;
94 tree combine(const tree&) const;
120 bool operator==(const tree&) const;
121 bool operator!=(const tree&) const;
/freebsd-14.2/contrib/unbound/edns-subnet/
H A Daddrtree.c131 tree->root = node_create(tree, NULL, 0, 0); in addrtree_create()
136 tree->size_bytes = sizeof *tree + sizeof *tree->root; in addrtree_create()
157 tree->size_bytes -= tree->sizefunc(node->elem); in clean_node()
158 tree->delfunc(tree->env, node->elem); in clean_node()
232 tree->size_bytes -= node_size(tree, node); in purge_node()
274 return tree?tree->size_bytes:0; in addrtree_size()
281 clean_node(tree, tree->root); in addrtree_delete()
287 tree->size_bytes -= node_size(tree, n); in addrtree_delete()
389 tree->size_bytes += tree->sizefunc(elem); in addrtree_insert()
413 tree->size_bytes += node_size(tree, newnode); in addrtree_insert()
[all …]
/freebsd-14.2/sys/contrib/openzfs/module/zfs/
H A Dbtree.c215 memset(tree, 0, sizeof (*tree)); in zfs_btree_create_custom()
314 void *d = tree->bt_find_in_buf(tree, in zfs_btree_find()
338 void *d = tree->bt_find_in_buf(tree, node->btc_elems, in zfs_btree_find()
358 void *d = tree->bt_find_in_buf(tree, leaf->btl_elems + in zfs_btree_find()
682 VERIFY3P(tree->bt_find_in_buf(tree, parent->btc_elems, in zfs_btree_insert_into_parent()
858 if (tree->bt_bulk != NULL && leaf == tree->bt_bulk) in zfs_btree_insert_into_leaf()
1937 zfs_btree_clear_helper(tree, tree->bt_root); in zfs_btree_clear()
1986 if (tree->bt_root != hdr && tree->bt_bulk && in zfs_btree_verify_counts_helper()
1996 if (tree->bt_root != hdr && tree->bt_bulk == NULL) in zfs_btree_verify_counts_helper()
2057 tree->bt_height), ==, tree->bt_num_nodes); in zfs_btree_verify_height()
[all …]
H A Dzfs_rlock.c186 if (avl_numnodes(tree) == 0) { in zfs_rangelock_enter_writer()
187 avl_add(tree, new); in zfs_rangelock_enter_writer()
208 avl_insert(tree, new, where); in zfs_rangelock_enter_writer()
241 avl_remove(tree, lr); in zfs_rangelock_proxify()
253 avl_add(tree, proxy); in zfs_rangelock_proxify()
307 avl_add(tree, lr); in zfs_rangelock_new_proxy()
346 avl_insert(tree, new, where); in zfs_rangelock_add_reader()
443 next = AVL_NEXT(tree, prev); in zfs_rangelock_enter_reader()
567 avl_remove(tree, remove); in zfs_rangelock_exit_reader()
590 next = AVL_NEXT(tree, lr); in zfs_rangelock_exit_reader()
[all …]
/freebsd-14.2/contrib/kyua/engine/
H A Dconfig.cpp61 init_tree(config::tree& tree) in init_tree() argument
77 set_defaults(config::tree& tree) in set_defaults() argument
111 setup(config::tree& tree, const int syntax_version) in setup() argument
225 config::tree
228 config::tree tree(false); in default_config() local
231 return tree; in default_config()
238 config::tree
241 config::tree tree(false); in empty_config() local
250 return tree; in empty_config()
262 config::tree
[all …]
/freebsd-14.2/contrib/ncurses/ncurses/base/
H A Dtries.c53 TRIES *ptr = tree; in NCURSES_EXPORT()
99 while (*tree != 0) { in _nc_remove_key()
104 if ((*tree)->child) { in _nc_remove_key()
106 (*tree)->value = 0; in _nc_remove_key()
108 TRIES *to_free = *tree; in _nc_remove_key()
109 *tree = (*tree)->sibling; in _nc_remove_key()
114 tree = &(*tree)->sibling; in _nc_remove_key()
131 while (*tree != 0) { in _nc_remove_string()
136 TRIES *to_free = *tree; in _nc_remove_string()
137 *tree = (*tree)->sibling; in _nc_remove_string()
[all …]
/freebsd-14.2/crypto/openssl/crypto/x509/
H A Dpcy_tree.c60 curr = tree->levels + tree->nlevel; in tree_print()
174 if ((tree = OPENSSL_zalloc(sizeof(*tree))) == NULL) { in tree_init()
189 if ((tree->levels = OPENSSL_zalloc(sizeof(*tree->levels)*(n+1))) == NULL) { in tree_init()
194 tree->nlevel = n+1; in tree_init()
246 *ptree = tree; in tree_init()
488 curr = tree->levels + tree->nlevel - 1; in tree_calculate_authority_set()
547 anyPolicy = tree->levels[tree->nlevel - 1].anyPolicy; in tree_calculate_user_set()
634 if (!tree) in X509_policy_tree_free()
640 for (i = 0, curr = tree->levels; i < tree->nlevel; i++, curr++) { in X509_policy_tree_free()
648 OPENSSL_free(tree); in X509_policy_tree_free()
[all …]
H A Dpcy_lib.c20 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) in X509_policy_tree_level_count() argument
22 if (!tree) in X509_policy_tree_level_count()
24 return tree->nlevel; in X509_policy_tree_level_count()
30 if (!tree || (i < 0) || (i >= tree->nlevel)) in X509_policy_tree_get0_level()
32 return tree->levels + i; in X509_policy_tree_get0_level()
39 if (!tree) in STACK_OF()
41 return tree->auth_policies; in STACK_OF()
48 if (!tree) in STACK_OF()
50 if (tree->flags & POLICY_FLAG_ANY_POLICY) in STACK_OF()
51 return tree->auth_policies; in STACK_OF()
[all …]
/freebsd-14.2/sys/contrib/openzfs/module/avl/
H A Davl.c488 ++tree->avl_numnodes; in avl_insert()
560 avl_tree_t *tree, in avl_insert_here() argument
571 ASSERT(tree != NULL); in avl_insert_here()
732 --tree->avl_numnodes; in avl_remove()
798 avl_add((tree), (obj))
878 ASSERT(tree); in avl_create()
887 tree->avl_root = NULL; in avl_create()
898 ASSERT(tree); in avl_destroy()
910 ASSERT(tree); in avl_numnodes()
917 ASSERT(tree); in avl_is_empty()
[all …]
/freebsd-14.2/share/man/man3/
H A DMakefile36 tree.3
330 tree.3 RB_EMPTY.3 \
332 tree.3 RB_FIND.3 \
350 tree.3 RB_HEAD.3 \
351 tree.3 RB_INIT.3 \
354 tree.3 RB_LEFT.3 \
355 tree.3 RB_MAX.3 \
356 tree.3 RB_MIN.3 \
357 tree.3 RB_NEXT.3 \
360 tree.3 RB_PREV.3 \
[all …]
/freebsd-14.2/contrib/ncurses/ncurses/trace/
H A Dtrace_tries.c46 recur_tries(TRIES * tree, unsigned level) in recur_tries() argument
54 while (tree != 0) { in recur_tries()
58 if (tree->value != 0) { in recur_tries()
59 _tracef("%5d: %s (%s)", tree->value, in recur_tries()
62 if (tree->child) in recur_tries()
63 recur_tries(tree->child, level + 1); in recur_tries()
64 tree = tree->sibling; in recur_tries()
70 _nc_trace_tries(TRIES * tree) in _nc_trace_tries() argument
73 _tracef("BEGIN tries %p", (void *) tree); in _nc_trace_tries()
74 recur_tries(tree, 0); in _nc_trace_tries()
[all …]
/freebsd-14.2/sys/contrib/openzfs/include/sys/
H A Davl.h163 _AVL_H void avl_create(avl_tree_t *tree,
205 _AVL_H void *avl_first(avl_tree_t *tree);
206 _AVL_H void *avl_last(avl_tree_t *tree);
216 #define AVL_NEXT(tree, node) avl_walk(tree, node, AVL_AFTER) argument
217 #define AVL_PREV(tree, node) avl_walk(tree, node, AVL_BEFORE) argument
252 _AVL_H void avl_add(avl_tree_t *tree, void *node);
260 _AVL_H void avl_remove(avl_tree_t *tree, void *node);
281 _AVL_H ulong_t avl_numnodes(avl_tree_t *tree);
286 _AVL_H boolean_t avl_is_empty(avl_tree_t *tree);
309 _AVL_H void *avl_destroy_nodes(avl_tree_t *tree, void **cookie);
[all …]
/freebsd-14.2/sys/cddl/contrib/opensolaris/uts/common/sys/
H A Davl.h171 extern void avl_create(avl_tree_t *tree,
213 extern void *avl_first(avl_tree_t *tree);
214 extern void *avl_last(avl_tree_t *tree);
224 #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
260 extern void avl_add(avl_tree_t *tree, void *node);
268 extern void avl_remove(avl_tree_t *tree, void *node);
289 extern ulong_t avl_numnodes(avl_tree_t *tree);
294 extern boolean_t avl_is_empty(avl_tree_t *tree);
317 extern void *avl_destroy_nodes(avl_tree_t *tree, void **cookie);
[all …]
/freebsd-14.2/usr.sbin/etcupdate/tests/
H A Dignore_test.sh76 mkdir -p $i/tree
193 D /tree/remove
195 U /tree/modify
196 A /tree/add
203 missing /tree/remove
204 file /tree/modify "new"
205 file /tree/add "foo"
224 file /tree/remove "old"
226 missing /tree/add
247 missing /tree/add
[all …]
/freebsd-14.2/contrib/kyua/model/
H A Dmetadata.cpp67 static optional< config::tree > defaults;
245 init_tree(config::tree& tree) in init_tree() argument
249 tree.define_dynamic("custom"); in init_tree()
261 tree.define< delta_node >("timeout"); in init_tree()
269 set_defaults(config::tree& tree) in set_defaults() argument
297 const config::tree&
301 config::tree props; in get_defaults()
321 lookup_rw(config::tree& tree, const std::string& key) in lookup_rw() argument
344 set(config::tree& tree, const std::string& key, in set() argument
364 config::tree props;
[all …]
/freebsd-14.2/contrib/unbound/util/storage/
H A Ddnstree.c82 void name_tree_init(rbtree_type* tree) in name_tree_init() argument
84 rbtree_init(tree, &name_tree_compare); in name_tree_init()
87 void addr_tree_init(rbtree_type* tree) in addr_tree_init() argument
89 rbtree_init(tree, &addr_tree_compare); in addr_tree_init()
92 void addr_tree_addrport_init(rbtree_type* tree) in addr_tree_addrport_init() argument
147 void addr_tree_init_parents(rbtree_type* tree) in addr_tree_init_parents() argument
153 void name_tree_init_parents(rbtree_type* tree) in name_tree_init_parents() argument
263 res = rbtree_search(tree, &key); in addr_tree_find()
275 n = rbtree_first(tree); in name_tree_next_root()
285 return name_tree_next_root(tree, dclass); in name_tree_next_root()
[all …]
H A Ddnstree.h94 void name_tree_init(rbtree_type* tree);
108 int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,
116 void name_tree_init_parents(rbtree_type* tree);
127 struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,
148 int name_tree_next_root(rbtree_type* tree, uint16_t* dclass);
154 void addr_tree_init(rbtree_type* tree);
161 void addr_tree_addrport_init(rbtree_type* tree);
173 int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node,
181 void addr_tree_init_parents(rbtree_type* tree);
197 struct addr_tree_node* addr_tree_lookup(rbtree_type* tree,
[all …]
/freebsd-14.2/usr.bin/dtc/
H A Ddtc.cc114 class device_tree tree; in main() local
130 tree.write_symbols = true; in main()
230 tree.set_phandle_format(device_tree::BOTH); in main()
234 tree.set_phandle_format(device_tree::EPAPR); in main()
282 tree.add_include_path(optarg); in main()
298 if (!tree.parse_define(optarg)) in main()
331 (tree.*read_fn)(in_file, depfile); in main()
335 tree.set_boot_cpu(boot_cpu); in main()
339 tree.sort(); in main()
346 if (!(tree.is_valid() || keep_going)) in main()
[all …]
/freebsd-14.2/tools/tools/nanobsd/
H A Dmtree-dedup.awk137 delete tree[path]; # unlink
148 line2kv(old_kvs, tree[from]); # old_kvs = kv's in entry
150 tree[path] = mtree_from_kvs(path, old_kvs);
159 line2kv(old_kvs, tree[from]); # old_kvs = kv's in entry
161 tree[path] = mtree_from_kvs(path, old_kvs);
162 delete tree[from]; # unlink
164 line2kv(old_kvs, tree[path]); # old_kvs = kv's in entry
166 tree[path] = mtree_from_kvs(path, old_kvs);
171 tree[path] = mtree_from_kvs(path, old_kvs);
198 for (x in tree)
[all …]
/freebsd-14.2/sys/contrib/zlib/
H A Dtrees.c238 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
244 send_bits(s, tree[c].Code, tree[c].Len); }
498 (tree[n].Freq < tree[m].Freq || \
499 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
561 bits = tree[tree[n].Dad].Len + 1; in gen_bitlen()
571 f = tree[n].Freq; in gen_bitlen()
605 s->opt_len += ((ulg)bits - tree[m].Len) * tree[m].Freq; in gen_bitlen()
644 tree[n].Len = 0; in build_tree()
679 tree[node].Freq = tree[n].Freq + tree[m].Freq; in build_tree()
682 tree[n].Dad = tree[m].Dad = (ush)node; in build_tree()
[all …]

12345678910>>...76