Home
last modified time | relevance | path

Searched defs:cur_node (Results 1 – 25 of 30) sorted by relevance

12

/aosp_15_r20/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_deadlock_detector.h206 bool onLockBefore(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in onLockBefore()
225 bool hasAllEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in hasAllEdges()
244 uptr addEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk, in addEdges()
316 uptr findPathToLock(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, uptr *path, in findPathToLock()
/aosp_15_r20/external/webrtc/test/network/
H A Dnetwork_emulation_manager.cc145 EmulatedNetworkNode* cur_node = via_nodes[0]; in CreateRoute() local
177 EmulatedNetworkNode* cur_node = via_nodes[0]; in CreateDefaultRoute() local
232 EmulatedNetworkNode* cur_node = via_nodes[0]; in CreateCrossTrafficRoute() local
/aosp_15_r20/external/ComputeLibrary/src/runtime/CL/mlgo/
H A DHeuristicTree.cpp109 auto cur_node = _tree.at(_root).get(); in query() local
204 auto cur_node = _tree.at(id).get(); in check_if_structurally_correct() local
/aosp_15_r20/external/icing/icing/legacy/index/
H A Dicing-dynamic-trie.cc2253 const Node *cur_node = storage_->GetRootNode(); in FindBestNode() local
2309 const Node *cur_node = storage_->GetNode(best_node_index); in FindNewBranchingPrefixLength() local
2368 const Node *cur_node = storage_->GetRootNode(); in FindBranchingPrefixLengths() local
2417 const Node *cur_node = storage_->GetNode(best_node_index); in IsBranchingTerm() local
/aosp_15_r20/external/libxml2/example/
H A Dtree1.c31 xmlNode *cur_node = NULL; in print_element_names() local
/aosp_15_r20/external/coreboot/util/cbfstool/
H A Dfmd_parser.y163 struct descriptor_node *cur_node = children.head; variable
/aosp_15_r20/prebuilts/rust/linux-x86/1.81.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/
H A Dappend.rs42 let mut cur_node = self.borrow_mut().last_leaf_edge().into_node(); in bulk_push() localVariable
H A Dfix.rs100 let mut cur_node = self.borrow_mut(); in fix_right_border_of_plentiful() localVariable
/aosp_15_r20/prebuilts/rust/linux-x86/1.81.0.u1/lib/rustlib/src/rust/library/alloc/src/collections/btree/
H A Dappend.rs42 let mut cur_node = self.borrow_mut().last_leaf_edge().into_node(); in bulk_push() localVariable
H A Dfix.rs100 let mut cur_node = self.borrow_mut(); in fix_right_border_of_plentiful() localVariable
/aosp_15_r20/prebuilts/rust/linux-musl-x86/1.81.0/lib/rustlib/src/rust/library/alloc/src/collections/btree/
H A Dappend.rs42 let mut cur_node = self.borrow_mut().last_leaf_edge().into_node(); in bulk_push() localVariable
H A Dfix.rs100 let mut cur_node = self.borrow_mut(); in fix_right_border_of_plentiful() localVariable
/aosp_15_r20/prebuilts/rust/linux-x86/1.80.1/lib/rustlib/src/rust/library/alloc/src/collections/btree/
H A Dappend.rs42 let mut cur_node = self.borrow_mut().last_leaf_edge().into_node(); in bulk_push() localVariable
H A Dfix.rs100 let mut cur_node = self.borrow_mut(); in fix_right_border_of_plentiful() localVariable
/aosp_15_r20/prebuilts/rust/linux-musl-x86/1.80.1/lib/rustlib/src/rust/library/alloc/src/collections/btree/
H A Dappend.rs42 let mut cur_node = self.borrow_mut().last_leaf_edge().into_node(); in bulk_push() localVariable
H A Dfix.rs100 let mut cur_node = self.borrow_mut(); in fix_right_border_of_plentiful() localVariable
/aosp_15_r20/external/tensorflow/tensorflow/compiler/mlir/lite/quantization/
H A Dquantization_config.cc63 for (auto& cur_node : custom_nodes) { in ParseCustomOpSpecs() local
/aosp_15_r20/trusty/user/base/app/line-coverage/
Dclient.c53 struct list_node* cur_node = list_next(coverage_record_list, ctx->last_sent_node); in handle_send_list() local
/aosp_15_r20/system/libufdt/
H A Dufdt_node.c224 struct ufdt_node *cur_node = it; in merge_children() local
/aosp_15_r20/system/libufdt/tests/libufdt_verify/
H A Dufdt_test_overlay.cpp44 struct ufdt_node *cur_node = it; in compare_child_nodes() local
/aosp_15_r20/external/tensorflow/tensorflow/core/common_runtime/
H A Dgraph_constructor.cc1058 void GraphConstructor::DFS(int cur_node, std::vector<int>* cur_branch, in DFS()
1104 int cur_node = *unvisited.begin(); in PrintCycles() local
/aosp_15_r20/art/tools/dexanalyze/
H A Ddexanalyze_strings.cc220 for (const std::unique_ptr<MatchTrie>& cur_node : nodes_) { in IsLeaf() local
/aosp_15_r20/external/tensorflow/tensorflow/core/profiler/utils/
H A Dgroup_events.cc405 EventNode* cur_node = in ConnectIntraThread() local
/aosp_15_r20/external/perfetto/src/trace_processor/importers/proto/
H A Dheap_graph_tracker.cc843 ObjectTable::RowReference cur_node = stack.back(); in MarkRoot() local
/aosp_15_r20/external/openscreen/third_party/abseil/src/absl/strings/
H A Dcord.cc1930 const CordRep* cur_node = rep; in MemoryUsageAux() local

12