| /src/external/bsd/unbound/dist/iterator/ |
| iter_donotq.h | 57 * Tree of the address spans that are blocked.
61 rbtree_type tree; member in struct:iter_donotq
|
| iter_hints.h | 55 /** lock on the forwards tree.
60 * Hints are stored in this tree. Sort order is specially chosen.
67 rbtree_type tree; member in struct:iter_hints
74 /** tree sorted by name, class */
174 * the tree parents.
190 * recalcs the tree parents.
202 * Swap internal tree with preallocated entries. Caller should manage
|
| iter_fwd.h | 54 /** lock on the forwards tree.
60 * Zones are stored in this tree. Sort order is specially chosen.
66 rbtree_type* tree; member in struct:iter_forwards
87 /** pointer to parent in tree (or NULL if none) */
160 * Find next root item in forwards lookup tree.
184 * the tree parents.
199 * recalcs the tree parents.
238 * Swap internal tree with preallocated entries. Caller should manage
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/ |
| step-and-next-inline.h | 23 struct tree struct
31 inline tree *
32 tree_check (tree *t, int i)
36 tree *x = t;
|
| step-and-next-inline.cc | 29 struct tree struct
37 inline tree *
38 tree_check (tree *t, int i)
42 tree *x = t;
44 } // tree-check
49 get_alias_set (tree *t)
59 tree xx;
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.cp/ |
| step-and-next-inline.h | 23 struct tree struct
31 inline tree *
32 tree_check (tree *t, int i)
36 tree *x = t;
|
| step-and-next-inline.cc | 29 struct tree struct
37 inline tree *
38 tree_check (tree *t, int i)
42 tree *x = t;
44 } // tree-check
49 get_alias_set (tree *t)
59 tree xx;
|
| /src/external/bsd/kyua-cli/dist/utils/config/ |
| tree.hpp | 29 /// \file utils/config/tree.hpp
30 /// Data type to represent a tree of arbitrary values with string keys.
52 /// Representation of a tree.
54 /// The string keys of the tree are in dotted notation and actually represent
65 /// tree can be static or dynamic. Static inner nodes have a known subset of
70 /// For simplicity reasons, we force the root of the tree to be a static inner
78 /// tree and all of its public methods. Also, the tree accepts dotted notations
83 class tree { class in namespace:utils::config
84 /// The root of the tree
[all...] |
| lua_module.cpp | 35 #include "utils/config/tree.ipp"
43 /// Gets the tree singleton stored in the Lua state.
46 /// "tree" with a pointer to the singleton.
48 /// \return A reference to the tree associated with the Lua state.
50 /// \throw syntax_error If the tree cannot be located.
51 config::tree&
57 state.push_string("tree");
60 throw config::syntax_error("Cannot find tree singleton; global state "
62 config::tree& tree = **state.to_userdata< config::tree* >() local
161 config::tree& tree = get_global_tree(state); local
218 const config::tree& tree = get_global_tree(state); local
276 config::tree** tree = state.new_userdata< config::tree* >(); local
[all...] |
| tree.cpp | 29 #include "utils/config/tree.ipp"
40 config::tree::tree(void) : function in class:config::tree
48 /// \param root The root to the tree to be owned by this instance.
49 config::tree::tree(detail::static_inner_node* root) : function in class:config::tree
56 config::tree::~tree(void)
61 /// Generates a deep copy of the input tree.
63 /// \return A new tree that is an exact copy of this tree
[all...] |
| parser_test.cpp | 37 #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)
61 tree.define< config::string_node >("top_string");
62 tree.define< config::int_node >("inner.int");
63 tree.define_dynamic("inner.dynamic");
72 mock_parser(config::tree& tree)
90 config::tree tree; local
105 config::tree tree; local
122 config::tree tree; local
159 config::tree tree; local
171 config::tree tree; local
189 config::tree tree; local
203 config::tree tree; local
[all...] |
| /src/external/mit/isl/dist/ |
| isl_schedule_node_private.h | 8 /* An isl_schedule_node points to a particular location in a schedule tree.
17 * "tree" appears in child_pos[n - 1] of ancestor n - 1.
18 * "tree" is the subtree at the specified location.
21 * in a schedule tree and therefore does not uniquely identify a position
22 * in the schedule tree.
30 isl_schedule_tree *tree; member in struct:isl_schedule_node
34 __isl_take isl_schedule *schedule, __isl_take isl_schedule_tree *tree,
37 __isl_take isl_schedule_node *pos, __isl_take isl_schedule_tree *tree);
50 __isl_take isl_schedule_tree *tree);
|
| /src/external/gpl2/dtc/dist/Documentation/ |
| dtc-paper.tex | 44 flattened-tree representation of the system's hardware based on the
45 device tree supplied by Open Firmware on IBM\R servers and Apple\R
48 The ``blob'' representing the device tree can be created using \dtc
49 --- the Device Tree Compiler --- that turns a simple text
50 representation of the tree into the compact representation used by
55 This flattened-tree approach is now the only supported method of
63 \subsection{OF and the device tree}
67 Among other boot-time services, OF maintains a device tree that
70 the Linux kernel uses OF calls to scan the device tree and transfer it
74 The device tree consists of nodes representing devices o
[all...] |
| /src/external/bsd/unbound/dist/util/ |
| tcp_conn_limit.h | 57 * Tree of the addresses that are TCP connection limited.
60 rbtree_type tree; member in struct:tcl_list
68 /** node in address tree */
131 * Swap internal tree with preallocated entries. Caller should manage
|
| /src/external/gpl2/dtc/dist/ |
| fstree.c | 18 struct node *tree; local
24 tree = build_node(NULL, NULL, NULL);
52 add_property(tree, prop);
60 add_child(tree, newchild);
67 return tree;
72 struct node *tree; local
74 tree = read_fstree(dirname);
75 tree = name_node(tree, "");
77 return build_dt_info(DTSF_V1, NULL, tree, guess_boot_cpuid(tree))
[all...] |
| /src/external/gpl3/gdb/dist/gdb/ |
| cp-support.h | 61 struct demangle_component *tree = nullptr; member in struct:demangle_parse_info
200 struct demangle_component *tree,
|
| addrmap.h | 25 #include "splay-tree.h"
134 : tree (other.tree)
136 other.tree = nullptr;
141 std::swap (tree, other.tree);
164 We walk the tree of lexical blocks present in the debug info, and
190 /* A splay tree, with a node for each transition; there is a
202 our keys are pointers to CORE_ADDR values. Since the splay tree
207 splay_tree tree; member in struct:final
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/ |
| cp-support.h | 62 struct demangle_component *tree = nullptr; member in struct:demangle_parse_info
201 struct demangle_component *tree,
|
| addrmap.h | 23 #include "splay-tree.h"
133 : tree (other.tree)
135 other.tree = nullptr;
140 std::swap (tree, other.tree);
163 We walk the tree of lexical blocks present in the debug info, and
189 /* A splay tree, with a node for each transition; there is a
201 our keys are pointers to CORE_ADDR values. Since the splay tree
206 splay_tree tree; member in struct:final
[all...] |
| /src/external/ibm-public/postfix/dist/src/local/ |
| resolve.c | 77 TOK822 *tree; local
80 tree = tok822_scan_addr(addr);
81 result = deliver_resolve_tree(state, usr_attr, tree);
82 tok822_free_tree(tree);
|
| token.c | 179 TOK822 *tree; local
186 tree = tok822_parse(string);
187 for (addr = tree; addr != 0; addr = addr->next) {
194 tok822_free_tree(tree);
|
| /src/external/bsd/kyua-cli/dist/engine/ |
| config.cpp | 40 #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)
61 tree.define< config::string_node >("architecture");
62 tree.define< config::string_node >("platform");
63 tree.define< engine::user_node >("unprivileged_user")
200 config::tree tree; local
211 config::tree tree; local
228 config::tree tree; local
[all...] |
| /src/external/bsd/libbind/dist/include/isc/ |
| tree.h | 1 /* $NetBSD: tree.h,v 1.1.1.2 2012/09/09 16:07:49 christos Exp $ */
3 /* tree.h - declare structures used by tree library
6 * vix 27jun86 [broken out of tree.c]
8 * Id: tree.h,v 1.3 2005/04/27 04:56:18 sra Exp
49 tree; typedef in typeref:struct:tree_s
52 void tree_init __P((tree **));
53 tree_t tree_srch __P((tree **, int (*)(), tree_t));
54 tree_t tree_add __P((tree **, int (*)(), tree_t, void (*)()));
55 int tree_delete __P((tree **, int (*)(), tree_t, void (*)()))
[all...] |
| /src/external/bsd/openldap/dist/libraries/libldap/ |
| testavl.c | 54 Avlnode *tree = NULL; local
62 case 'n': /* new tree */
63 ( void ) ldap_avl_free( tree, free );
64 tree = NULL;
67 ( void ) myprint( tree );
72 for ( p = (char * ) ldap_avl_getfirst( tree );
86 if ( (p = (char *) ldap_avl_find( tree, name, avl_strcmp ))
97 if ( ldap_avl_insert( &tree, strdup( name ), avl_strcmp,
106 if ( ldap_avl_delete( &tree, name, avl_strcmp ) == NULL )
|
| testtavl.c | 54 TAvlnode *tree = NULL, *n; local
62 case 'n': /* new tree */
63 ( void ) ldap_tavl_free( tree, free );
64 tree = NULL;
67 ( void ) myprint( tree );
71 for ( n = ldap_tavl_end( tree, TAVL_DIR_LEFT );
82 if ( (p = (char *) ldap_tavl_find( tree, name, avl_strcmp ))
93 if ( ldap_tavl_insert( &tree, strdup( name ), avl_strcmp,
102 if ( ldap_tavl_delete( &tree, name, avl_strcmp ) == NULL )
|
