Home
last modified time | relevance | path

Searched refs:cur_node (Results 1 – 15 of 15) sorted by relevance

/external/libxml2/doc/examples/
Dtree1.c33 xmlNode *cur_node = NULL; in print_element_names() local
35 for (cur_node = a_node; cur_node; cur_node = cur_node->next) { in print_element_names()
36 if (cur_node->type == XML_ELEMENT_NODE) { in print_element_names()
37 printf("node type: Element, name: %s\n", cur_node->name); in print_element_names()
40 print_element_names(cur_node->children); in print_element_names()
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_deadlock_detector.h206 bool onLockBefore(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in onLockBefore() argument
208 uptr cur_idx = nodeToIndex(cur_node); in onLockBefore()
217 void onLockAfter(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk = 0) {
219 uptr cur_idx = nodeToIndex(cur_node);
225 bool hasAllEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in hasAllEdges() argument
228 if (cur_node && local_epoch == current_epoch_ && in hasAllEdges()
229 local_epoch == nodeToEpoch(cur_node)) { in hasAllEdges()
230 uptr cur_idx = nodeToIndexUnchecked(cur_node); in hasAllEdges()
244 uptr addEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk, in addEdges() argument
247 uptr cur_idx = nodeToIndex(cur_node); in addEdges()
[all …]
/external/swiftshader/third_party/LLVM/test/CodeGen/X86/
D2008-01-16-InvalidDAGCombineXform.ll5 define void @localize_local_bb19_bb(%struct.node_t** %cur_node) {
7 %tmp1 = load %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
10 %tmp4 = load %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
13 %tmp6 = load %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
16 %tmp9 = load %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
19 %tmp11 = load %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
22 %tmp14 = load %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
25 %tmp16 = load %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
28 store %struct.node_t* %tmp18, %struct.node_t** %cur_node, align 4
/external/llvm/test/CodeGen/X86/
D2008-01-16-InvalidDAGCombineXform.ll5 define void @localize_local_bb19_bb(%struct.node_t** %cur_node) {
7 %tmp1 = load %struct.node_t*, %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
10 %tmp4 = load %struct.node_t*, %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
13 %tmp6 = load %struct.node_t*, %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
16 %tmp9 = load %struct.node_t*, %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
19 %tmp11 = load %struct.node_t*, %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
22 %tmp14 = load %struct.node_t*, %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
25 %tmp16 = load %struct.node_t*, %struct.node_t** %cur_node, align 4 ; <%struct.node_t*> [#uses=1]
28 store %struct.node_t* %tmp18, %struct.node_t** %cur_node, align 4
/external/ltp/utils/ffsb-6.0-rc2/
Drbt.c284 rb_node *cur_node; in rbtree_insert() local
304 cur_node = tree->root; in rbtree_insert()
309 while (cur_node) { in rbtree_insert()
313 comp_result = COMP_NODES(object, cur_node->object); in rbtree_insert()
321 if (!(cur_node->left)) { in rbtree_insert()
325 cur_node->left = new_node; in rbtree_insert()
326 new_node->parent = cur_node; in rbtree_insert()
327 cur_node = NULL; /* Terminate the while loop */ in rbtree_insert()
330 cur_node = cur_node->left; in rbtree_insert()
333 if (!(cur_node->right)) { in rbtree_insert()
[all …]
/external/syslinux/core/lwip/src/core/snmp/
Dmib_structs.c741 struct nse cur_node; in snmp_expand_tree() local
753 cur_node.r_ptr = an->nptr[j]; in snmp_expand_tree()
754 cur_node.r_id = an->objid[j]; in snmp_expand_tree()
755 cur_node.r_nl = 0; in snmp_expand_tree()
759 cur_node.r_ptr = NULL; in snmp_expand_tree()
761 push_node(&cur_node); in snmp_expand_tree()
859 struct nse cur_node; in snmp_expand_tree() local
869 cur_node.r_ptr = jn->nptr; in snmp_expand_tree()
870 cur_node.r_id = jn->objid; in snmp_expand_tree()
871 cur_node.r_nl = 0; in snmp_expand_tree()
[all …]
/external/tensorflow/tensorflow/contrib/framework/python/framework/
Dgraph_util.py89 cur_node = next_to_visit[0]
91 if cur_node in reachable_by_input and cur_node not in input_nodes_set:
93 (n, cur_node))
94 if cur_node not in input_nodes_set:
95 next_to_visit += name_to_input_name[cur_node]
/external/v8/src/
Dlocked-queue-inl.h34 Node* cur_node = head_;
35 while (cur_node != nullptr) {
36 old_node = cur_node;
37 cur_node = cur_node->next.Value();
/external/python/cpython3/Lib/xml/dom/
Dpulldom.py238 token, cur_node = event
239 if cur_node is node:
242 parents[-1].appendChild(cur_node)
244 parents.append(cur_node)
/external/python/cpython2/Lib/xml/dom/
Dpulldom.py244 token, cur_node = event
245 if cur_node is node:
248 parents[-1].appendChild(cur_node)
250 parents.append(cur_node)
/external/selinux/libsepol/src/
Dexpand.c2868 cond_node_t *cur_node; in discard_tunables() local
2897 for (cur_node = decl->cond_list; cur_node != NULL; in discard_tunables()
2898 cur_node = cur_node->next) { in discard_tunables()
2906 for (cur_expr = cur_node->expr; cur_expr != NULL; in discard_tunables()
2925 cur_node->flags &= ~COND_NODE_FLAGS_TUNABLE; in discard_tunables()
2931 cur_node->flags |= COND_NODE_FLAGS_TUNABLE; in discard_tunables()
2932 cur_state = cond_evaluate_expr(pol, cur_node->expr); in discard_tunables()
2941 cur_node->avtrue_list : cur_node->avfalse_list; in discard_tunables()
2951 cur_node->avtrue_list = NULL; in discard_tunables()
2953 cur_node->avfalse_list = NULL; in discard_tunables()
/external/swiftshader/third_party/LLVM/test/CodeGen/Generic/
D2006-01-12-BadSetCCFold.ll27 …%cur_node.0.i8.1.i.i = phi %struct.node_t* [ undef, %dealwithargs.exit ], [ null, %no_exit.i12.i.i…
/external/llvm/test/CodeGen/Generic/
D2006-01-12-BadSetCCFold.ll27 …%cur_node.0.i8.1.i.i = phi %struct.node_t* [ undef, %dealwithargs.exit ], [ null, %no_exit.i12.i.i…
/external/v8/src/heap/
Dspaces.cc2395 for (FreeSpace* cur_node = top(); cur_node != nullptr; in AllocateChunk() local
2396 cur_node = cur_node->next()) { in AllocateChunk()
2397 size_t size = cur_node->size(); in AllocateChunk()
2401 if (cur_node == top()) { in AllocateChunk()
2402 set_top(cur_node->next()); in AllocateChunk()
2405 prev_non_evac_node->set_next(cur_node->next()); in AllocateChunk()
2408 return cur_node; in AllocateChunk()
2411 prev_non_evac_node = cur_node; in AllocateChunk()
/external/libxml2/
Dxmlreader.c1707 xmlNodePtr node, cur_node; in xmlTextReaderReadInnerXml() local
1716 for (cur_node = reader->node->children; cur_node != NULL; in xmlTextReaderReadInnerXml()
1717 cur_node = cur_node->next) { in xmlTextReaderReadInnerXml()
1718 node = xmlDocCopyNode(cur_node, doc, 1); in xmlTextReaderReadInnerXml()