| /art/tools/ahat/src/test/com/android/ahat/ |
| D | DominatorsTest.java | 38 public void setDominatorsComputationState(String node, Object state) { in setDominatorsComputationState() argument
39 states.put(node, state); in setDominatorsComputationState()
42 @Override public Object getDominatorsComputationState(String node) { in getDominatorsComputationState() argument
43 return states.get(node); in getDominatorsComputationState()
47 public Collection<String> getReferencesForDominators(String node) { in getReferencesForDominators() argument
48 return depends.get(node); in getReferencesForDominators()
52 public void setDominator(String node, String dominator) { in setDominator() argument
53 dominators.put(node, 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() argument
[all …]
|
| /art/compiler/optimizing/ |
| D | gvn.cc | 102 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Lookup() local
103 if (node->GetHashCode() == hash_code) { in Lookup()
104 HInstruction* existing = node->GetInstruction(); in Lookup()
118 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Contains() local
119 if (node->GetInstruction() == instruction) { in Contains()
128 DeleteAllImpureWhich([side_effects](Node* node) { in Kill() argument
129 return node->GetSideEffects().MayDependOn(side_effects); in Kill()
150 DeleteAllImpureWhich([predecessor](Node* node) { in IntersectWith() argument
151 return !predecessor->Contains(node->GetInstruction()); in IntersectWith()
175 for (Node* node = other.buckets_[i]; node != nullptr; node = node->GetNext()) { in PopulateFromInternal() local
[all …]
|
| D | scheduler.h | 219 bool HasDataDependency(const SchedulingNode* node) const { in HasDataDependency() argument
220 return ContainsElement(data_predecessors_, node); in HasDataDependency()
223 bool HasOtherDependency(const SchedulingNode* node) const { in HasOtherDependency() argument
224 return ContainsElement(other_predecessors_, node); in HasOtherDependency()
331 std::unique_ptr<SchedulingNode> node(
333 SchedulingNode* result = node.get();
334 nodes_map_.insert(std::make_pair(instr, std::move(node)));
359 void AddDependency(SchedulingNode* node, SchedulingNode* dependency, bool is_data_dependency);
360 void AddDataDependency(SchedulingNode* node, SchedulingNode* dependency) { in AddDataDependency() argument
361 AddDependency(node, dependency, /*is_data_dependency*/true); in AddDataDependency()
[all …]
|
| D | loop_optimization.h | 127 void RemoveLoop(LoopNode* node);
131 bool TraverseLoopsInnerToOuter(LoopNode* node);
137 void SimplifyInduction(LoopNode* node);
138 void SimplifyBlocks(LoopNode* node);
142 bool TryOptimizeInnerLoopFinite(LoopNode* node);
145 bool OptimizeInnerLoop(LoopNode* node);
166 bool TryPeelingAndUnrolling(LoopNode* node);
172 bool ShouldVectorize(LoopNode* node, HBasicBlock* block, int64_t trip_count);
173 void Vectorize(LoopNode* node, HBasicBlock* block, HBasicBlock* exit, int64_t trip_count);
174 void GenerateNewLoop(LoopNode* node,
[all …]
|
| D | register_allocator_graph_color.cc | 497 void FreezeMoves(InterferenceNode* node);
500 void PruneNode(InterferenceNode* node);
503 void EnableCoalesceOpportunities(InterferenceNode* node);
506 void CheckTransitionFromFreezeWorklist(InterferenceNode* node);
676 for (InterferenceNode* node : physical_core_nodes_) { in AllocateRegisters()
677 node->ClearCoalesceOpportunities(); in AllocateRegisters()
679 for (InterferenceNode* node : physical_fp_nodes_) { in AllocateRegisters()
680 node->ClearCoalesceOpportunities(); in AllocateRegisters()
691 for (InterferenceNode* node : iteration.GetPrunableNodes()) { in AllocateRegisters()
692 LiveInterval* interval = node->GetInterval(); in AllocateRegisters()
[all …]
|
| D | scheduler.cc | 36 void SchedulingGraph::AddDependency(SchedulingNode* node, in AddDependency() argument
39 if (node == nullptr || dependency == nullptr) { in AddDependency()
46 node->AddDataPredecessor(dependency); in AddDependency()
48 node->AddOtherPredecessor(dependency); in AddDependency()
285 void SchedulingGraph::AddCrossIterationDependencies(SchedulingNode* node) { in AddCrossIterationDependencies() argument
286 for (HInstruction* instruction : node->GetInstruction()->GetInputs()) { in AddCrossIterationDependencies()
305 if (def_node != nullptr && def_node != node && phi_input->GetUses().HasExactlyOneElement()) { in AddCrossIterationDependencies()
309 AddOtherDependency(def_node, node); in AddCrossIterationDependencies()
419 static void DumpAsDotNode(std::ostream& output, const SchedulingNode* node) { in DumpAsDotNode() argument
420 const HInstruction* instruction = node->GetInstruction(); in DumpAsDotNode()
[all …]
|
| D | loop_optimization.cc | 569 LoopNode* node = new (loop_allocator_) LoopNode(loop_info); in AddLoop() local
573 last_loop_ = top_loop_ = node; in AddLoop()
576 node->outer = last_loop_; in AddLoop()
578 last_loop_ = last_loop_->inner = node; in AddLoop()
584 node->outer = last_loop_->outer; in AddLoop()
585 node->previous = last_loop_; in AddLoop()
587 last_loop_ = last_loop_->next = node; in AddLoop()
591 void HLoopOptimization::RemoveLoop(LoopNode* node) { in RemoveLoop() argument
592 DCHECK(node != nullptr); in RemoveLoop()
593 DCHECK(node->inner == nullptr); in RemoveLoop()
[all …]
|
| D | loop_optimization_test.cc | 109 std::string LoopStructureRecurse(HLoopOptimization::LoopNode* node) { in LoopStructureRecurse() argument
111 for ( ; node != nullptr; node = node->next) { in LoopStructureRecurse()
113 s.append(LoopStructureRecurse(node->inner)); in LoopStructureRecurse()
|
| D | scheduler_test.cc | 361 const SchedulingNode* node = GetNode(instruction); in HasImmediateDataDependency() local
363 if (node == nullptr || other == nullptr) { in HasImmediateDataDependency()
370 return node->HasDataDependency(other); in HasImmediateDataDependency()
375 const SchedulingNode* node = GetNode(instruction); in HasImmediateOtherDependency() local
377 if (node == nullptr || other == nullptr) { in HasImmediateOtherDependency()
384 return node->HasOtherDependency(other); in HasImmediateOtherDependency()
|
| /art/tools/ahat/src/main/com/android/ahat/dominators/ |
| D | DominatorsComputation.java | 125 public void setDominatorsComputationState(Node node, Object state) { in computeDominators()
126 node.setDominatorsComputationState(state); in computeDominators()
130 public Object getDominatorsComputationState(Node node) { in computeDominators()
131 return node.getDominatorsComputationState(); in computeDominators()
135 public Iterable<? extends Node> getReferencesForDominators(Node node) { in computeDominators()
136 return node.getReferencesForDominators(); in computeDominators()
140 public void setDominator(Node node, Node dominator) { in computeDominators()
141 node.setDominator(dominator); in computeDominators()
|
| D | Dominators.java | 68 void setDominatorsComputationState(Node node, Object state); in setDominatorsComputationState() argument
80 Object getDominatorsComputationState(Node node); in getDominatorsComputationState() argument
92 Iterable<? extends Node> getReferencesForDominators(Node node); in getReferencesForDominators() argument
101 void setDominator(Node node, Node dominator); in setDominator() argument
131 public Object node; field in Dominators.NodeS
292 rootS.node = root; in computeDominators()
327 dstS.node = link.dst; in computeDominators()
453 graph.setDominatorsComputationState((Node)nodeS.node, null); in computeDominators()
456 graph.setDominator((Node)xS.node, (Node)nodeS.node); in computeDominators()
|
| /art/tools/dexanalyze/ |
| D | dexanalyze_strings.cc | 188 MatchTrie* node = this; in Add() local
192 if (node->nodes_[c] == nullptr) { in Add()
194 node->nodes_[c].reset(new_node); in Add()
195 new_node->parent_ = node; in Add()
198 node = new_node; in Add()
200 node = node->nodes_[c].get(); in Add()
202 ++node->count_; in Add()
204 return node; in Add()
209 MatchTrie* node = this; in LongestPrefix() local
211 if (node->nodes_[c] == nullptr) { in LongestPrefix()
[all …]
|
| /art/tools/ahat/src/main/com/android/ahat/heapdump/ |
| D | AhatSnapshot.java | 70 public void setDominatorsComputationState(AhatInstance node, Object state) { in AhatSnapshot()
71 node.setTemporaryUserData(state); in AhatSnapshot()
75 public Object getDominatorsComputationState(AhatInstance node) { in AhatSnapshot()
76 return node.getTemporaryUserData(); in AhatSnapshot()
80 public Iterable<AhatInstance> getReferencesForDominators(AhatInstance node) { in AhatSnapshot()
81 return node.getReferencesForDominators(retained); in AhatSnapshot()
85 public void setDominator(AhatInstance node, AhatInstance dominator) { in AhatSnapshot()
86 node.setDominator(dominator); in AhatSnapshot()
|
| /art/compiler/utils/ |
| D | swap_space.cc | 130 auto node = free_by_size_.extract(it); in Alloc() local
131 node.value().size -= size; in Alloc()
132 free_by_size_.insert(std::move(node)); in Alloc()
|
| /art/libartbase/base/ |
| D | mem_map.cc | 809 auto node = gMaps->extract(it); in ReleaseReservedMemory() local
814 node.key() = base_begin_; in ReleaseReservedMemory()
815 gMaps->insert(std::move(node)); in ReleaseReservedMemory()
1288 auto node = gMaps->extract(it); in AlignBy() local
1289 node.key() = aligned_base_begin; in AlignBy()
1290 gMaps->insert(std::move(node)); in AlignBy()
|
| D | intrusive_forward_list.h | 383 bool ContainsNode(const_reference node) const { in ContainsNode() argument
385 if (std::addressof(n) == std::addressof(node)) { in ContainsNode()
|