Searched defs:tree (Results 1 - 25 of 197) sorted by relevance

12345678

/freebsd-head/contrib/unbound/iterator/
H A Diter_donotq.h61 rbtree_type tree; member in struct:iter_donotq
H A Diter_hints.h55 * Hints are stored in this tree. Sort order is specially chosen.
62 rbtree_type tree; member in struct:iter_hints
69 /** tree sorted by name, class */
141 * the tree parents.
154 * recalcs the tree parents.
H A Diter_fwd.h54 * Zones are stored in this tree. Sort order is specially chosen.
60 rbtree_type* tree; member in struct:iter_forwards
81 /** pointer to parent in tree (or NULL if none) */
141 * Find next root item in forwards lookup tree.
160 * the tree parents.
172 * recalcs the tree parents.
/freebsd-head/contrib/subversion/subversion/include/private/
H A Dsvn_branch_nested.h150 svn_element__tree_t *tree; member in struct:svn_branch__subtree_t
194 * ELEMENTS, each with its given tree structure (parent, name) and payload.
/freebsd-head/contrib/ncurses/ncurses/base/
H A Dkey_defined.c39 find_definition(TRIES * tree, const char *str) argument
45 for (ptr = tree; ptr != 0; ptr = ptr->sibling) {
H A Dtries.c37 ** Functions to manage the tree of partial-completions for keycodes.
50 _nc_expand_try(TRIES * tree, unsigned code, int *count, size_t len) argument
52 TRIES *ptr = tree;
87 * Remove a code from the specified tree, freeing the unused nodes. Returns
91 _nc_remove_key(TRIES ** tree, unsigned code) argument
93 T((T_CALLED("_nc_remove_key(%p,%d)"), (void *) tree, code));
98 while (*tree != 0) {
99 if (_nc_remove_key(&(*tree)->child, code)) {
102 if ((*tree)->value == code) {
103 if ((*tree)
123 _nc_remove_string(TRIES ** tree, const char *string) argument
[all...]
/freebsd-head/contrib/ncurses/ncurses/trace/
H A Dtrace_tries.c46 recur_tries(TRIES * tree, unsigned level) argument
54 while (tree != 0) {
55 if ((my_buffer[level] = tree->ch) == 0)
58 if (tree->value != 0) {
59 _tracef("%5d: %s (%s)", tree->value,
60 _nc_visbuf((char *) my_buffer), keyname(tree->value));
62 if (tree->child)
63 recur_tries(tree->child, level + 1);
64 tree = tree
70 _nc_trace_tries(TRIES * tree) argument
[all...]
/freebsd-head/contrib/kyua/utils/config/
H A Dtree.hpp29 /// \file utils/config/tree.hpp
30 /// Data type to represent a tree of arbitrary values with string keys.
49 /// Representation of a tree.
51 /// The string keys of the tree are in dotted notation and actually represent
62 /// tree can be static or dynamic. Static inner nodes have a known subset of
67 /// For simplicity reasons, we force the root of the tree to be a static inner
75 /// tree and all of its public methods. Also, the tree accepts dotted notations
80 class tree { class in namespace:utils::config
84 /// The root of the tree
[all...]
H A Dtree.cpp29 #include "utils/config/tree.ipp"
42 config::tree::tree(const bool strict) : function in class:config::tree
51 /// \param root The root to the tree to be owned by this instance.
52 config::tree::tree(const bool strict, detail::static_inner_node* root) : function in class:config::tree
59 config::tree::~tree(void)
64 /// Generates a deep copy of the input tree.
66 /// \return A new tree tha
[all...]
H A Dlua_module.cpp36 #include "utils/config/tree.ipp"
45 /// Gets the tree singleton stored in the Lua state.
48 /// "tree" with a pointer to the singleton.
50 /// \return A reference to the tree associated with the Lua state.
52 /// \throw syntax_error If the tree cannot be located.
53 config::tree&
59 state.push_string("tree");
62 throw config::syntax_error("Cannot find tree singleton; global state "
64 config::tree& tree local
163 config::tree& tree = get_global_tree(state); local
220 const config::tree& tree = get_global_tree(state); local
278 config::tree** tree = state.new_userdata< config::tree* >(); local
[all...]
H A Dparser_test.cpp37 #include "utils/config/tree.ipp"
50 /// Initializes the tree keys before reading the file.
52 /// \param [in,out] tree The tree in which to define the key structure.
56 setup(config::tree& tree, const int syntax_version) argument
61 tree.define< config::string_node >("top_string");
62 tree.define< config::int_node >("inner.int");
63 tree.define_dynamic("inner.dynamic");
73 /// \param tree Th
74 mock_parser(config::tree& tree) argument
92 config::tree tree; local
107 config::tree tree; local
124 config::tree tree; local
178 config::tree tree; local
190 config::tree tree; local
208 config::tree tree; local
222 config::tree tree; local
[all...]
/freebsd-head/contrib/unbound/util/
H A Dtcp_conn_limit.h60 rbtree_type tree; member in struct:tcl_list
68 /** node in address tree */
/freebsd-head/contrib/ncurses/ncurses/tinfo/
H A Dadd_tries.c37 ** Add keycode/string to tries-tree.
49 _nc_add_to_try(TRIES ** tree, const char *str, unsigned code) argument
55 (void *) *tree, _nc_visbuf(str), code));
59 if ((*tree) != 0) {
60 ptr = savedptr = (*tree);
90 } else { /* (*tree) == 0 :: First sequence to be added */
91 savedptr = ptr = (*tree) = typeCalloc(TRIES, 1);
113 *tree = NULL;
/freebsd-head/sys/dev/rtwn/rtl8821a/usb/
H A Dr21au_attach.c123 struct sysctl_oid *tree = device_get_sysctl_tree(sc->sc_dev); local
131 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
/freebsd-head/usr.bin/find/
H A Dfind.c165 FTS *tree; /* pointer to top of FTS hierarchy */ variable
179 tree = fts_open(paths, ftsoptions, (issort ? find_compare : NULL));
180 if (tree == NULL)
184 while (errno = 0, (entry = fts_read(tree)) != NULL) {
186 if (fts_set(tree, entry, FTS_SKIP))
/freebsd-head/crypto/openssl/crypto/x509v3/
H A Dpcy_lib.c20 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument
22 if (!tree)
24 return tree->nlevel;
27 X509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, argument
30 if (!tree || (i < 0) || (i >= tree->nlevel))
32 return tree->levels + i;
37 *tree)
39 if (!tree)
41 return tree
[all...]
/freebsd-head/sys/mips/atheros/
H A Dar71xx_wdog.c107 struct sysctl_oid *tree = device_get_sysctl_tree(sc->dev); local
109 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
112 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
115 SYSCTL_ADD_INT(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
/freebsd-head/sys/dev/gpio/
H A Dgpiobacklight.c107 struct sysctl_oid *tree; local
132 tree = device_get_sysctl_tree(dev);
133 sc->sc_oid = SYSCTL_ADD_PROC(ctx, SYSCTL_CHILDREN(tree), OID_AUTO,
/freebsd-head/contrib/kyua/engine/
H A Dconfig.cpp40 #include "utils/config/tree.ipp"
54 /// Defines the schema of a configuration tree.
56 /// \param [in,out] tree The tree to populate. The tree should be empty on
59 init_tree(config::tree& tree) argument
61 tree.define< config::string_node >("architecture");
62 tree.define< config::positive_int_node >("parallelism");
63 tree
74 set_defaults(config::tree& tree) argument
100 setup(config::tree& tree, const int syntax_version) argument
[all...]
/freebsd-head/contrib/subversion/subversion/libsvn_diff/
H A Ddiff.c134 svn_diff__tree_t *tree; local
151 svn_diff__tree_create(&tree, treepool);
156 /* Insert the data into the tree */
158 tree,
165 tree,
171 num_tokens = svn_diff__get_node_count(tree);
179 /* We don't need the nodes in the tree either anymore, nor the tree itself */
H A Ddiff4.c174 svn_diff__tree_t *tree; local
199 svn_diff__tree_create(&tree, subpool3);
205 tree,
212 tree,
219 tree,
226 tree,
232 num_tokens = svn_diff__get_node_count(tree);
238 /* We don't need the nodes in the tree either anymore, nor the tree itself */
/freebsd-head/sys/arm/ti/am335x/
H A Dam335x_scm.c110 struct sysctl_oid_list *tree; local
128 tree = SYSCTL_CHILDREN(device_get_sysctl_tree(dev));
129 sc->sc_temp_oid = SYSCTL_ADD_PROC(ctx, tree, OID_AUTO,
/freebsd-head/usr.bin/dtc/
H A Dchecking.hh47 * Base class for all checkers. This will visit the entire tree and perform
51 * tree.
70 bool visit_node(device_tree *tree, const node_ptr &n);
104 * Runs the checker on the specified device tree.
106 bool check_tree(fdt::device_tree *tree) argument
108 return visit_node(tree, tree->get_root());
129 virtual bool check_property(device_tree *tree, const node_ptr &n, property_ptr p);
139 virtual bool check(device_tree *tree, const node_ptr &n, property_ptr p) = 0;
154 virtual bool check(device_tree *tree, cons
218 check(device_tree *tree, const node_ptr &, property_ptr p) argument
[all...]
/freebsd-head/crypto/openssh/
H A Dxmss_hash_address.c20 void setTreeADRS(uint32_t adrs[8], uint64_t tree){ argument
21 adrs[1] = (uint32_t) (tree >> 32);
22 adrs[2] = (uint32_t) tree;
51 // L-tree
57 // Hash Tree & L-tree
/freebsd-head/contrib/unbound/validator/
H A Dval_anchor.h55 * The tree must be locked, while no other locks (from trustanchors) are held.
57 * the tree can be unlocked again. This means you have to release the lock
64 * Anchors are store in this tree. Sort order is chosen, so that
69 rbtree_type* tree; member in struct:val_anchors
105 /** the ancestor in the trustanchor tree */

Completed in 109 milliseconds

12345678