| /art/compiler/optimizing/ |
| D | scheduler.cc | 36 void SchedulingGraph::AddDependency(SchedulingNode* node, in AddDependency()
54 static bool MayHaveReorderingDependency(SideEffects node, SideEffects other) { in MayHaveReorderingDependency()
81 bool SchedulingGraph::ArrayAccessMayAlias(HInstruction* node, in ArrayAccessMayAlias()
163 bool SchedulingGraph::FieldAccessMayAlias(const HInstruction* node, in FieldAccessMayAlias()
197 bool SchedulingGraph::HasMemoryDependency(HInstruction* node, in HasMemoryDependency()
248 bool SchedulingGraph::HasExceptionDependency(const HInstruction* node, in HasExceptionDependency()
267 bool SchedulingGraph::HasSideEffectDependency(HInstruction* node, in HasSideEffectDependency()
391 bool SchedulingGraph::HasImmediateDataDependency(const SchedulingNode* node, in HasImmediateDataDependency()
398 const SchedulingNode* node = GetNode(instruction); in HasImmediateDataDependency() local
410 bool SchedulingGraph::HasImmediateOtherDependency(const SchedulingNode* node, in HasImmediateOtherDependency()
[all …]
|
| D | gvn.cc | 102 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()
217 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in CloneBucket() local
238 Node* node = buckets_[i]; in DeleteAllImpureWhich() local
|
| D | scheduler.h | 299 void AddDataDependency(SchedulingNode* node, SchedulingNode* dependency) { in AddDataDependency()
302 void AddOtherDependency(SchedulingNode* node, SchedulingNode* dependency) { in AddOtherDependency()
352 void CalculateLatency(SchedulingNode* node) { in CalculateLatency()
463 void CalculateLatency(SchedulingNode* node) { in CalculateLatency()
|
| D | loop_optimization.cc | 568 LoopNode* node = new (loop_allocator_) LoopNode(loop_info); in AddLoop() local
590 void HLoopOptimization::RemoveLoop(LoopNode* node) { in RemoveLoop()
613 bool HLoopOptimization::TraverseLoopsInnerToOuter(LoopNode* node) { in TraverseLoopsInnerToOuter()
643 void HLoopOptimization::SimplifyInduction(LoopNode* node) { in SimplifyInduction()
670 void HLoopOptimization::SimplifyBlocks(LoopNode* node) { in SimplifyBlocks()
707 bool HLoopOptimization::TryOptimizeInnerLoopFinite(LoopNode* node) { in TryOptimizeInnerLoopFinite()
777 bool HLoopOptimization::OptimizeInnerLoop(LoopNode* node) { in OptimizeInnerLoop()
884 bool HLoopOptimization::TryPeelingAndUnrolling(LoopNode* node) { in TryPeelingAndUnrolling()
923 bool HLoopOptimization::ShouldVectorize(LoopNode* node, HBasicBlock* block, int64_t trip_count) { in ShouldVectorize()
1039 void HLoopOptimization::Vectorize(LoopNode* node, in Vectorize()
[all …]
|
| D | register_allocator_graph_color.cc | 1209 InterferenceNode* node = in BuildInterferenceGraph() local
1252 InterferenceNode* node; in BuildInterferenceGraph() local
1453 static bool IsLowDegreeNode(InterferenceNode* node, size_t num_regs) { in IsLowDegreeNode()
1457 static bool IsHighDegreeNode(InterferenceNode* node, size_t num_regs) { in IsHighDegreeNode()
1499 InterferenceNode* node = simplify_worklist_.front(); in PruneInterferenceGraph() local
1514 InterferenceNode* node = freeze_worklist_.front(); in PruneInterferenceGraph() local
1525 InterferenceNode* node = spill_worklist_.top(); in PruneInterferenceGraph() local
1540 void ColoringIteration::EnableCoalesceOpportunities(InterferenceNode* node) { in EnableCoalesceOpportunities()
1549 void ColoringIteration::PruneNode(InterferenceNode* node) { in PruneNode()
1587 void ColoringIteration::CheckTransitionFromFreezeWorklist(InterferenceNode* node) { in CheckTransitionFromFreezeWorklist()
[all …]
|
| D | loop_optimization_test.cc | 93 std::string LoopStructureRecurse(HLoopOptimization::LoopNode* node) { in LoopStructureRecurse()
|
| /art/tools/ahat/src/test/com/android/ahat/ |
| D | DominatorsTest.java | 38 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/tools/ahat/src/main/com/android/ahat/dominators/ |
| D | Dominators.java | 68 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/ |
| D | dexanalyze_strings.cc | 188 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/compiler/utils/ |
| D | swap_space.cc | 130 auto node = free_by_size_.extract(it); in Alloc() local
|
| D | intrusive_forward_list.h | 383 bool ContainsNode(const_reference node) const { in ContainsNode()
|
| /art/libartbase/base/ |
| D | mem_map.cc | 800 auto node = gMaps->extract(it); in ReleaseReservedMemory() local
1270 auto node = gMaps->extract(it); in AlignBy() local
|