Home
last modified time | relevance | path

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

12345678910>>...67

/freebsd/contrib/kyua/utils/config/
H A Dtree_test.cpp134 config::tree tree; in ATF_TEST_CASE_BODY() local
136 tree.define< config::int_node >("var1"); in ATF_TEST_CASE_BODY()
137 tree.define< config::string_node >("var2"); in ATF_TEST_CASE_BODY()
138 tree.define< config::bool_node >("var3"); in ATF_TEST_CASE_BODY()
140 tree.set< config::int_node >("var1", 42); in ATF_TEST_CASE_BODY()
141 tree.set< config::string_node >("var2", "hello"); in ATF_TEST_CASE_BODY()
142 tree.set< config::bool_node >("var3", false); in ATF_TEST_CASE_BODY()
144 ATF_REQUIRE_EQ(42, tree.lookup< config::int_node >("var1")); in ATF_TEST_CASE_BODY()
145 ATF_REQUIRE_EQ("hello", tree.lookup< config::string_node >("var2")); in ATF_TEST_CASE_BODY()
146 ATF_REQUIRE(!tree.lookup< config::bool_node >("var3")); in ATF_TEST_CASE_BODY()
[all …]
H A Dlua_module_test.cpp125 config::tree tree; in ATF_TEST_CASE_BODY() local
126 tree.define< config::bool_node >("top_boolean"); in ATF_TEST_CASE_BODY()
127 tree.define< config::int_node >("top_integer"); in ATF_TEST_CASE_BODY()
128 tree.define< config::string_node >("top_string"); in ATF_TEST_CASE_BODY()
132 config::redirect(state, tree); in ATF_TEST_CASE_BODY()
140 ATF_REQUIRE_EQ(true, tree.lookup< config::bool_node >("top_boolean")); in ATF_TEST_CASE_BODY()
141 ATF_REQUIRE_EQ(12345, tree.lookup< config::int_node >("top_integer")); in ATF_TEST_CASE_BODY()
142 ATF_REQUIRE_EQ("a foo", tree.lookup< config::string_node >("top_string")); in ATF_TEST_CASE_BODY()
149 config::tree tree; in ATF_TEST_CASE_BODY() local
150 tree.define< config::bool_node >("top_boolean"); in ATF_TEST_CASE_BODY()
[all …]
H A Dparser_test.cpp56 setup(config::tree& tree, const int syntax_version) in setup() argument
61 tree.define< config::string_node >("top_string"); in setup()
62 tree.define< config::int_node >("inner.int"); in setup()
63 tree.define_dynamic("inner.dynamic"); in setup()
74 mock_parser(config::tree& tree) : in mock_parser() argument
75 config::parser(tree) in mock_parser()
92 config::tree tree; in ATF_TEST_CASE_BODY() local
93 mock_parser(tree).parse(fs::path("output.lua")); in ATF_TEST_CASE_BODY()
95 tree.lookup< config::string_node >("foo")); in ATF_TEST_CASE_BODY()
107 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()
119 config::tree::define_dynamic(const std::string& dotted_key) in define_dynamic()
[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/contrib/unbound/edns-subnet/
H A Daddrtree.c90 node_create(struct addrtree *tree, void *elem, addrlen_t scope, in node_create() argument
97 tree->node_count++; in node_create()
115 node_size(const struct addrtree *tree, const struct addrnode *n) in node_size() argument
118 (n->elem?tree->sizefunc(n->elem):0); in node_size()
125 struct addrtree *tree; in addrtree_create() local
128 tree = (struct addrtree *)calloc(1, sizeof(*tree)); in addrtree_create()
129 if (!tree) in addrtree_create()
131 tree->root = node_create(tree, NULL, 0, 0); in addrtree_create()
132 if (!tree->root) { in addrtree_create()
133 free(tree); in addrtree_create()
[all …]
/freebsd/sys/contrib/openzfs/module/zfs/
H A Dbtree.c87 zfs_btree_poison_node(zfs_btree_t *tree, zfs_btree_hdr_t *hdr) in zfs_btree_poison_node() argument
90 size_t size = tree->bt_elem_size; in zfs_btree_poison_node()
105 tree->bt_leaf_size - offsetof(zfs_btree_leaf_t, btl_elems) - in zfs_btree_poison_node()
112 zfs_btree_poison_node_at(zfs_btree_t *tree, zfs_btree_hdr_t *hdr, in zfs_btree_poison_node_at() argument
116 size_t size = tree->bt_elem_size; in zfs_btree_poison_node_at()
128 ASSERT3U(idx, <=, tree->bt_leaf_cap); in zfs_btree_poison_node_at()
129 ASSERT3U(idx + count, <=, tree->bt_leaf_cap); in zfs_btree_poison_node_at()
138 zfs_btree_verify_poison_at(zfs_btree_t *tree, zfs_btree_hdr_t *hdr, in zfs_btree_verify_poison_at() argument
142 size_t size = tree->bt_elem_size; in zfs_btree_verify_poison_at()
151 ASSERT3U(idx, <, tree->bt_leaf_cap); in zfs_btree_verify_poison_at()
[all …]
H A Dzfs_rlock.c160 avl_tree_t *tree = &rl->rl_tree; in zfs_rangelock_enter_writer() local
186 if (avl_numnodes(tree) == 0) { in zfs_rangelock_enter_writer()
187 avl_add(tree, new); in zfs_rangelock_enter_writer()
194 lr = avl_find(tree, new, &where); in zfs_rangelock_enter_writer()
198 lr = avl_nearest(tree, where, AVL_AFTER); in zfs_rangelock_enter_writer()
203 lr = avl_nearest(tree, where, AVL_BEFORE); in zfs_rangelock_enter_writer()
208 avl_insert(tree, new, where); in zfs_rangelock_enter_writer()
231 zfs_rangelock_proxify(avl_tree_t *tree, zfs_locked_range_t *lr) in zfs_rangelock_proxify() argument
241 avl_remove(tree, lr); in zfs_rangelock_proxify()
253 avl_add(tree, proxy); in zfs_rangelock_proxify()
[all …]
/freebsd/contrib/kyua/engine/
H A Dconfig.cpp61 init_tree(config::tree& tree) in init_tree() argument
63 tree.define< config::string_node >("architecture"); in init_tree()
64 tree.define< config::strings_set_node >("execenvs"); in init_tree()
65 tree.define< config::positive_int_node >("parallelism"); in init_tree()
66 tree.define< config::string_node >("platform"); in init_tree()
67 tree.define< engine::user_node >("unprivileged_user"); in init_tree()
68 tree.define_dynamic("test_suites"); in init_tree()
77 set_defaults(config::tree& tree) in set_defaults() argument
79 tree.set< config::string_node >("architecture", KYUA_ARCHITECTURE); in set_defaults()
86 tree.set< config::strings_set_node >("execenvs", supported); in set_defaults()
[all …]
/freebsd/crypto/openssl/crypto/x509/
H A Dpcy_tree.c54 char *str, X509_POLICY_TREE *tree, in tree_print() argument
60 curr = tree->levels + tree->nlevel; in tree_print()
66 (long)(curr - tree->levels)); in tree_print()
67 for (plev = tree->levels; plev != curr; plev++) { in tree_print()
71 (long)(plev - tree->levels), plev->flags); in tree_print()
85 #define TREE_PRINT(str, tree, curr) \ argument
87 tree_print(trc_out, "before tree_prune()", tree, curr); \
100 X509_POLICY_TREE *tree; in tree_init() local
174 if ((tree = OPENSSL_zalloc(sizeof(*tree))) == NULL) { in tree_init()
180 tree->node_maximum = OPENSSL_POLICY_TREE_NODES_MAX; in tree_init()
[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()
27 X509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, in X509_policy_tree_get0_level() argument
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()
37 *tree) in STACK_OF()
39 if (!tree) in STACK_OF()
41 return tree->auth_policies; in STACK_OF()
46 *tree) in STACK_OF()
[all …]
/freebsd/contrib/ncurses/ncurses/base/
H A Dtries.c51 _nc_expand_try(TRIES * tree, unsigned code, int *count, size_t len) in NCURSES_EXPORT()
53 TRIES *ptr = tree; in NCURSES_EXPORT()
92 _nc_remove_key(TRIES ** tree, unsigned code) in _nc_remove_key() argument
94 T((T_CALLED("_nc_remove_key(%p,%d)"), (void *) tree, code)); in _nc_remove_key()
99 while (*tree != 0) { in _nc_remove_key()
100 if (_nc_remove_key(&(*tree)->child, code)) { in _nc_remove_key()
103 if ((*tree)->value == code) { 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()
[all …]
/freebsd/sys/contrib/openzfs/module/avl/
H A Davl.c129 avl_walk(avl_tree_t *tree, void *oldnode, int left) in avl_walk() argument
131 size_t off = tree->avl_offset; in avl_walk()
176 avl_first(avl_tree_t *tree) in avl_first() argument
180 size_t off = tree->avl_offset; in avl_first()
182 for (node = tree->avl_root; node != NULL; node = node->avl_child[0]) in avl_first()
195 avl_last(avl_tree_t *tree) in avl_last() argument
199 size_t off = tree->avl_offset; in avl_last()
201 for (node = tree->avl_root; node != NULL; node = node->avl_child[1]) in avl_last()
219 avl_nearest(avl_tree_t *tree, avl_index_t where, int direction) in avl_nearest() argument
224 size_t off = tree->avl_offset; in avl_nearest()
[all …]
/freebsd/share/man/man3/
H A DMakefile34 tree.3
326 MLINKS+= tree.3 RB_AUGMENT.3 \
327 tree.3 RB_AUGMENT_CHECK.3 \
328 tree.3 RB_EMPTY.3 \
329 tree.3 RB_ENTRY.3 \
330 tree.3 RB_FIND.3 \
331 tree.3 RB_FOREACH.3 \
332 tree.3 RB_FOREACH_FROM.3 \
333 tree.3 RB_FOREACH_REVERSE.3 \
334 tree.3 RB_FOREACH_REVERSE_FROM.3 \
[all …]
/freebsd/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()
55 if ((my_buffer[level] = tree->ch) == 0) in recur_tries()
58 if (tree->value != 0) { in recur_tries()
59 _tracef("%5d: %s (%s)", tree->value, in recur_tries()
60 _nc_visbuf((char *) my_buffer), keyname(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
[all …]
/freebsd/sys/contrib/openzfs/include/sys/
H A Davl.h163 _AVL_H void avl_create(avl_tree_t *tree,
175 _AVL_H void *avl_find(avl_tree_t *tree, const void *node, avl_index_t *where);
183 _AVL_H void avl_insert(avl_tree_t *tree, void *node, avl_index_t where);
196 _AVL_H void avl_insert_here(avl_tree_t *tree, void *new_data, void *here,
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
242 _AVL_H void *avl_nearest(avl_tree_t *tree, avl_index_t where, int direction);
252 _AVL_H void avl_add(avl_tree_t *tree, void *node);
[all …]
/freebsd/sys/cddl/contrib/opensolaris/uts/common/sys/
H A Davl.h171 extern void avl_create(avl_tree_t *tree,
183 extern void *avl_find(avl_tree_t *tree, const void *node, avl_index_t *where);
191 extern void avl_insert(avl_tree_t *tree, void *node, avl_index_t where);
204 extern void avl_insert_here(avl_tree_t *tree, void *new_data, void *here,
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
250 extern void *avl_nearest(avl_tree_t *tree, avl_index_t where, int direction);
260 extern void avl_add(avl_tree_t *tree, void *node);
[all …]
/freebsd/usr.sbin/etcupdate/tests/
H A Dignore_test.sh76 mkdir -p $i/tree
81 echo "foo" > $NEW/tree/add
83 echo "old" > $i/tree/modify
85 echo "new" > $NEW/tree/modify
87 echo "old" > $i/tree/remove
193 D /tree/remove
195 U /tree/modify
196 A /tree/add
203 missing /tree/remove
204 file /tree/modify "new"
[all …]
/freebsd/contrib/kyua/model/
H A Dmetadata.cpp67 static optional< config::tree > defaults;
245 init_tree(config::tree& tree) in init_tree() argument
247 tree.define< config::strings_set_node >("allowed_architectures"); in init_tree()
248 tree.define< config::strings_set_node >("allowed_platforms"); in init_tree()
249 tree.define_dynamic("custom"); in init_tree()
250 tree.define< config::string_node >("description"); in init_tree()
251 tree.define< config::string_node >("execenv"); in init_tree()
252 tree.define< config::string_node >("execenv_jail_params"); in init_tree()
253 tree.define< config::bool_node >("has_cleanup"); in init_tree()
254 tree.define< config::bool_node >("is_exclusive"); in init_tree()
[all …]
/freebsd/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
94 rbtree_init(tree, &addr_tree_addrport_compare); in addr_tree_addrport_init()
97 int name_tree_insert(rbtree_type* tree, struct name_tree_node* node, in name_tree_insert() argument
106 return rbtree_insert(tree, &node->node) != NULL; in name_tree_insert()
109 int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node, in addr_tree_insert() argument
117 return rbtree_insert(tree, &node->node) != NULL; in addr_tree_insert()
[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,
139 struct name_tree_node* name_tree_lookup(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);
[all …]
/freebsd/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()
238 tree.set_phandle_format(device_tree::LINUX); in main()
282 tree.add_include_path(optarg); in main()
289 tree.set_empty_reserve_map_entries(strtoll(optarg, 0, 10)); in main()
292 tree.set_blob_minimum_size(strtoll(optarg, 0, 10)); in main()
295 tree.set_blob_padding(strtoll(optarg, 0, 10)); in main()
298 if (!tree.parse_define(optarg)) in main()
[all …]
/freebsd/sys/contrib/zlib/
H A Dtrees.c202 local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) { in gen_codes() argument
223 int len = tree[n].Len; in gen_codes()
226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len); in gen_codes()
228 Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ", in gen_codes()
229 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1)); in gen_codes()
238 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
242 # define send_code(s, c, tree) \ argument
244 send_bits(s, tree[c].Code, tree[c].Len); }
486 #define pqremove(s, tree, top) \ argument
490 pqdownheap(s, tree, SMALLEST); \
[all …]
/freebsd/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
163 } else if (tree[path]) { # Update existing entry with new line
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);
[all …]

12345678910>>...67