Home
last modified time | relevance | path

Searched refs:root_node (Results 1 - 12 of 12) sorted by relevance

/third_party/libabigail/tools/
H A Dabilint.cc117 artifact_use_relation_tree *root_node = nullptr; member
212 artifact_use_relation_tree *root_node = get_root_node(); in artifact_in_tree() local
213 ABG_ASSERT(root_node); in artifact_in_tree()
214 return root_node->artifacts.find(artifact) != root_node->artifacts.end(); in artifact_in_tree()
227 artifact_use_relation_tree *root_node = get_root_node(); in record_artifact() local
228 ABG_ASSERT(root_node); in record_artifact()
229 root_node->artifacts.insert(artifact); in record_artifact()
238 if (root_node) in get_root_node()
239 return root_node; in get_root_node()
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dc2xml.c41 static xmlNodePtr root_node = NULL;/* root node pointer */ variable
191 examine_symbol(sym->ctype.base_type, root_node); in examine_symbol()
258 examine_macro(sym, root_node); in examine_namespace()
263 examine_symbol(sym, root_node); in examine_namespace()
308 root_node = xmlNewNode(NULL, BAD_CAST "parse"); in main()
309 xmlDocSetRootElement(doc, root_node); in main()
315 ns = xmlNewNs (root_node, "http://www.kernel.org/pub/software/devel/sparse/parse.dtd", NULL); in main()
317 xmlSetNs(root_node, ns); in main()
/third_party/selinux/libsepol/cil/src/
H A Dcil_fqn.c132 int cil_fqn_qualify(struct cil_tree_node *root_node) in cil_fqn_qualify() argument
134 struct cil_root *root = root_node->data; in cil_fqn_qualify()
139 fqn_args.node = root_node; in cil_fqn_qualify()
H A Dcil_fqn.h36 int cil_fqn_qualify(struct cil_tree_node *root_node);
/third_party/node/tools/gyp/pylib/gyp/
H A Dinput.py1964 # as dependent on root_node.
1965 root_node = DependencyGraphNode(None)
1970 target_node.dependencies = [root_node]
1971 root_node.dependents.append(target_node)
1983 flat_list = root_node.FlattenToList()
1988 if not root_node.dependents:
1990 # of root_node so that the cycle can be discovered from root_node.
1993 target_node.dependencies.append(root_node)
1994 root_node
[all...]
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/gyp/
H A Dinput.py1951 # as dependent on root_node.
1952 root_node = DependencyGraphNode(None)
1957 target_node.dependencies = [root_node]
1958 root_node.dependents.append(target_node)
1970 flat_list = root_node.FlattenToList()
1975 if not root_node.dependents:
1977 # of root_node so that the cycle can be discovered from root_node.
1980 target_node.dependencies.append(root_node)
1981 root_node
[all...]
/third_party/lwip/src/include/lwip/apps/
H A Dsnmp_core.h256 const struct snmp_node *root_node; member
259 #define SNMP_MIB_CREATE(oid_list, root_node) { (oid_list), (u8_t)LWIP_ARRAYSIZE(oid_list), root_node }
/third_party/python/Tools/peg_generator/scripts/
H A Dgrammar_grapher.py107 root_node = {"exec": "file", "eval": "eval", "single": "interactive"}[args.start]
111 print(f'\troot="{root_node}";')
112 print(f"\t{root_node} [color=green, shape=circle];")
/third_party/node/deps/v8/src/heap/cppgc-js/
H A Dcpp-snapshot.cc331 RootState& CreateRootState(EmbedderRootNode* root_node) { in CreateRootState() argument
332 CHECK(!StateExists(root_node)); in CreateRootState()
334 root_node, std::make_unique<RootState>(root_node, ++state_count_))); in CreateRootState()
/third_party/vixl/src/aarch64/
H A Ddecoder-aarch64.cc93 auto root_node{String("Root", GetAllocator().Adapter())}; in ConstructDecodeGraph()
94 compiled_decoder_root_ = GetDecodeNode(root_node)->Compile(this); in ConstructDecodeGraph()
/third_party/lwip/src/apps/snmp/
H A Dsnmp_core.c985 const struct snmp_node *const *node = &mib->root_node; in snmp_mib_tree_resolve_exact()
1025 if (mib->root_node->node_type != SNMP_NODE_TREE) { in snmp_mib_tree_resolve_next()
1031 node_stack[nsi] = (const struct snmp_tree_node *)(const void *)mib->root_node; in snmp_mib_tree_resolve_next()
/third_party/rust/crates/memchr/bench/data/code/
H A Drust-library.rs30034 let root_node = self.root.as_ref()?.reborrow(); in get()
30035 match root_node.search_tree(key) { in get()
30043 let root_node = map.root.as_mut()?.borrow_mut(); in take()
30044 match root_node.search_tree(key) { in take()
30054 let root_node = Self::ensure_is_owned(&mut map.root).borrow_mut(); in replace()
30055 match root_node.search_tree::<K>(&key) { in replace()
30331 let root_node = self.root.as_ref()?.reborrow(); in get()
30332 match root_node.search_tree(key) { in get()
30359 let root_node = self.root.as_ref()?.reborrow(); in get_key_value()
30360 match root_node in get_key_value()
38462 let mut root_node = self.borrow_mut(); clear_parent_link() variables
[all...]

Completed in 51 milliseconds