HomeSort by: relevance | last modified time | path
    Searched defs:tree (Results 1 - 25 of 342) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /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_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_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
  /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.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;
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/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.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...]
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...]
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...]
  /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);
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...]
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
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...]
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/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);
  /src/external/gpl3/gdb.old/dist/gdb/
cp-support.h 61 struct demangle_component *tree = nullptr; member in struct:demangle_parse_info
200 struct demangle_component *tree,

Completed in 44 milliseconds

1 2 3 4 5 6 7 8 91011>>