Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dscheduler.cc28 void SchedulingGraph::AddDependency(SchedulingNode* node, in AddDependency()
46 static bool MayHaveReorderingDependency(SideEffects node, SideEffects other) { in MayHaveReorderingDependency()
68 static bool HasSideEffectDependency(const HInstruction* node, const HInstruction* other) { in HasSideEffectDependency()
168 bool SchedulingGraph::HasImmediateDataDependency(const SchedulingNode* node, in HasImmediateDataDependency()
175 const SchedulingNode* node = GetNode(instruction); in HasImmediateDataDependency() local
187 bool SchedulingGraph::HasImmediateOtherDependency(const SchedulingNode* node, in HasImmediateOtherDependency()
194 const SchedulingNode* node = GetNode(instruction); in HasImmediateOtherDependency() local
222 static void DumpAsDotNode(std::ostream& output, const SchedulingNode* node) { in DumpAsDotNode()
270 for (auto node : initial_candidates) { in DumpAsDotGraph() local
375 SchedulingNode* node = scheduling_graph_.AddNode(instruction, IsSchedulingBarrier(instruction)); in Schedule() local
Dgvn.cc103 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Lookup() local
119 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) { in Contains() local
129 DeleteAllImpureWhich([side_effects](Node* node) { in Kill()
151 DeleteAllImpureWhich([predecessor](Node* node) { in IntersectWith()
190 for (Node* node = other.buckets_[i]; node != nullptr; node = node->GetNext()) { in PopulateFromInternal() local
209 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
Dloop_optimization.cc271 LoopNode* node = new (loop_allocator_) LoopNode(loop_info); in AddLoop() local
293 void HLoopOptimization::RemoveLoop(LoopNode* node) { in RemoveLoop()
316 void HLoopOptimization::TraverseLoopsInnerToOuter(LoopNode* node) { in TraverseLoopsInnerToOuter()
364 void HLoopOptimization::SimplifyInduction(LoopNode* node) { in SimplifyInduction()
390 void HLoopOptimization::SimplifyBlocks(LoopNode* node) { in SimplifyBlocks()
427 void HLoopOptimization::OptimizeInnerLoop(LoopNode* node) { in OptimizeInnerLoop()
504 bool HLoopOptimization::CanVectorize(LoopNode* node, HBasicBlock* block, int64_t trip_count) { in CanVectorize()
573 void HLoopOptimization::Vectorize(LoopNode* node, in Vectorize()
652 void HLoopOptimization::GenerateNewLoop(LoopNode* node, in GenerateNewLoop()
698 bool HLoopOptimization::VectorizeDef(LoopNode* node, in VectorizeDef()
[all …]
Dscheduler.h251 SchedulingNode* node = new (arena_) SchedulingNode(instr, arena_, is_scheduling_barrier); variable
290 void AddDataDependency(SchedulingNode* node, SchedulingNode* dependency) { in AddDataDependency()
293 void AddOtherDependency(SchedulingNode* node, SchedulingNode* dependency) { in AddOtherDependency()
334 void CalculateLatency(SchedulingNode* node) { in CalculateLatency()
442 void CalculateLatency(SchedulingNode* node) { in CalculateLatency()
Dregister_allocator_graph_color.cc1185 InterferenceNode* node = new (allocator_) InterferenceNode( in BuildInterferenceGraph() local
1229 InterferenceNode* node; in BuildInterferenceGraph() local
1428 static bool IsLowDegreeNode(InterferenceNode* node, size_t num_regs) { in IsLowDegreeNode()
1432 static bool IsHighDegreeNode(InterferenceNode* node, size_t num_regs) { in IsHighDegreeNode()
1474 InterferenceNode* node = simplify_worklist_.front(); in PruneInterferenceGraph() local
1489 InterferenceNode* node = freeze_worklist_.front(); in PruneInterferenceGraph() local
1500 InterferenceNode* node = spill_worklist_.top(); in PruneInterferenceGraph() local
1515 void ColoringIteration::EnableCoalesceOpportunities(InterferenceNode* node) { in EnableCoalesceOpportunities()
1524 void ColoringIteration::PruneNode(InterferenceNode* node) { in PruneNode()
1562 void ColoringIteration::CheckTransitionFromFreezeWorklist(InterferenceNode* node) { in CheckTransitionFromFreezeWorklist()
[all …]
Dloop_optimization_test.cc93 std::string LoopStructureRecurse(HLoopOptimization::LoopNode* node) { in LoopStructureRecurse()
/art/compiler/utils/
Dintrusive_forward_list.h372 bool ContainsNode(const_reference node) const { in ContainsNode()