Home
last modified time | relevance | path

Searched defs:node (Results 1 – 15 of 15) sorted by relevance

/art/tools/ahat/src/test/com/android/ahat/
DDominatorsTest.java38 public void setDominatorsComputationState(String node, Object state) { in setDominatorsComputationState()
42 @Override public Object getDominatorsComputationState(String node) { in getDominatorsComputationState()
47 public Collection<String> getReferencesForDominators(String node) { in getReferencesForDominators()
52 public void setDominator(String node, String dominator) { in setDominator()
59 public void node(String src, String... dsts) { in node() method in DominatorsTest.Graph
66 public String dom(String node) { in dom()
/art/compiler/optimizing/
Dgvn.cc102 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Lookup() local
118 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Contains() local
128 DeleteAllImpureWhich([side_effects](Node* node) { in Kill()
150 DeleteAllImpureWhich([predecessor](Node* node) { in IntersectWith()
175 for (Node* node = other.buckets_[i]; node != nullptr; node = node->GetNext()) { in PopulateFromInternal() local
194 void SetNext(Node* node) { next_ = node; } in SetNext()
232 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in CloneBucket() local
253 Node* node = buckets_[i]; in DeleteAllImpureWhich() local
Dscheduler.h220 bool HasDataDependency(const SchedulingNode* node) const { in HasDataDependency()
224 bool HasOtherDependency(const SchedulingNode* node) const { in HasOtherDependency()
361 void AddDataDependency(SchedulingNode* node, SchedulingNode* dependency) { in AddDataDependency()
364 void AddOtherDependency(SchedulingNode* node, SchedulingNode* dependency) { in AddOtherDependency()
421 void CalculateLatency(SchedulingNode* node) { in CalculateLatency()
533 SchedulingNode* node = in BuildSchedulingGraph() local
Dloop_optimization.cc621 LoopNode* node = new (loop_allocator_) LoopNode(loop_info); in AddLoop() local
643 void HLoopOptimization::RemoveLoop(LoopNode* node) { in RemoveLoop()
666 bool HLoopOptimization::TraverseLoopsInnerToOuter(LoopNode* node) { in TraverseLoopsInnerToOuter()
704 void HLoopOptimization::CalculateAndSetTryCatchKind(LoopNode* node) { in CalculateAndSetTryCatchKind()
783 void HLoopOptimization::SimplifyInduction(LoopNode* node) { in SimplifyInduction()
810 void HLoopOptimization::SimplifyBlocks(LoopNode* node) { in SimplifyBlocks()
885 bool HLoopOptimization::TryOptimizeInnerLoopFinite(LoopNode* node) { in TryOptimizeInnerLoopFinite()
948 bool HLoopOptimization::TryVectorizePredicated(LoopNode* node, in TryVectorizePredicated()
972 bool HLoopOptimization::TryVectorizedTraditional(LoopNode* node, in TryVectorizedTraditional()
989 bool HLoopOptimization::OptimizeInnerLoop(LoopNode* node) { in OptimizeInnerLoop()
[all …]
Dscheduler.cc37 void SchedulingGraph::AddDependency(SchedulingNode* node, in AddDependency()
257 void SchedulingGraph::AddCrossIterationDependencies(SchedulingNode* node) { in AddCrossIterationDependencies()
391 static void DumpAsDotNode(std::ostream& output, const SchedulingNode* node) { in DumpAsDotNode()
436 SchedulingNode* node = entry.second.get(); in DumpAsDotGraph() local
583 SchedulingNode* node = selector_->PopHighestPriorityNode(&candidates, scheduling_graph); in Schedule() local
Dscheduler_test.cc362 const SchedulingNode* node = GetNode(instruction); in HasImmediateDataDependency() local
376 const SchedulingNode* node = GetNode(instruction); in HasImmediateOtherDependency() local
Dloop_optimization_test.cc107 std::string LoopStructureRecurse(HLoopOptimization::LoopNode* node) { in LoopStructureRecurse()
/art/tools/ahat/src/main/com/android/ahat/dominators/
DDominators.java68 void setDominatorsComputationState(Node node, Object state); in setDominatorsComputationState()
80 Object getDominatorsComputationState(Node node); in getDominatorsComputationState()
92 Iterable<? extends Node> getReferencesForDominators(Node node); in getReferencesForDominators()
101 void setDominator(Node node, Node dominator); in setDominator()
131 public Object node; field in Dominators.NodeS
/art/tools/dexanalyze/
Ddexanalyze_strings.cc188 MatchTrie* node = this; in Add() local
209 MatchTrie* node = this; in LongestPrefix() local
369 MatchTrie* node = prefixe_trie->LongestPrefix(str); in Build() local
403 MatchTrie* node = prefixe_trie->LongestPrefix(str); in Build() local
/art/libartbase/base/
Dsafe_map.h86 insert_return_type insert(node_type&& node) { return map_.insert(std::move(node)); } in insert()
87 insert_return_type insert(const_iterator hint, node_type&& node) { in insert()
Dmem_map.cc842 auto node = gMaps->extract(it); in ReleaseReservedMemory() local
1391 auto node = gMaps->extract(it); in AlignBy() local
Dintrusive_forward_list.h388 bool ContainsNode(const_reference node) const { in ContainsNode()
/art/dex2oat/utils/
Dswap_space.cc131 auto node = free_by_size_.extract(it); in Alloc() local
/art/test/odsign/test-src/com/android/tests/odsign/
DDeviceState.java140 Element node = (Element) list.item(i); in updateApexInfo() local
/art/runtime/
Dtransaction.cc428 auto node = container.extract(old_root); in UpdateKeys() local