| /art/compiler/optimizing/ |
| D | induction_var_analysis.h | 148 void VisitLoop(HLoopInformation* loop);
149 void VisitNode(HLoopInformation* loop, HInstruction* instruction);
150 uint32_t VisitDescendant(HLoopInformation* loop, HInstruction* instruction);
151 void ClassifyTrivial(HLoopInformation* loop, HInstruction* instruction);
152 void ClassifyNonTrivial(HLoopInformation* loop);
156 InductionInfo* TransferPhi(HLoopInformation* loop, HInstruction* phi, size_t input_index);
165 InductionInfo* SolvePhiAllInputs(HLoopInformation* loop,
168 InductionInfo* SolveAddSub(HLoopInformation* loop,
178 void VisitControl(HLoopInformation* loop);
179 void VisitCondition(HLoopInformation* loop,
[all …]
|
| D | licm.cc | 32 HLoopInformation* info = instruction->GetBlock()->GetLoopInformation(); in InputsAreDefinedBeforeLoop()
34 HLoopInformation* input_loop = it.Current()->GetBlock()->GetLoopInformation(); in InputsAreDefinedBeforeLoop()
48 HLoopInformation* input_loop = input->GetBlock()->GetLoopInformation(); in InputsAreDefinedBeforeLoop()
66 static void UpdateLoopPhisIn(HEnvironment* environment, HLoopInformation* info) { in UpdateLoopPhisIn()
100 HLoopInformation* loop_info = block->GetLoopInformation(); in Run()
|
| D | induction_var_analysis.cc | 28 static void RotateEntryPhiFirst(HLoopInformation* loop, in RotateEntryPhiFirst()
95 induction_(std::less<HLoopInformation*>(), in HInductionVarAnalysis()
113 void HInductionVarAnalysis::VisitLoop(HLoopInformation* loop) { in VisitLoop()
148 void HInductionVarAnalysis::VisitNode(HLoopInformation* loop, HInstruction* instruction) { in VisitNode()
192 uint32_t HInductionVarAnalysis::VisitDescendant(HLoopInformation* loop, HInstruction* instruction) { in VisitDescendant()
195 HLoopInformation* otherLoop = instruction->GetBlock()->GetLoopInformation(); in VisitDescendant()
210 void HInductionVarAnalysis::ClassifyTrivial(HLoopInformation* loop, HInstruction* instruction) { in ClassifyTrivial()
244 void HInductionVarAnalysis::ClassifyNonTrivial(HLoopInformation* loop) { in ClassifyNonTrivial()
340 HInductionVarAnalysis::InductionInfo* HInductionVarAnalysis::TransferPhi(HLoopInformation* loop, in TransferPhi()
484 HLoopInformation* loop, in SolvePhiAllInputs()
[all …]
|
| D | ssa_liveness_analysis.cc | 31 static bool IsLoop(HLoopInformation* info) { in IsLoop()
35 static bool InSameLoop(HLoopInformation* first_loop, HLoopInformation* second_loop) { in InSameLoop()
39 static bool IsInnerLoop(HLoopInformation* outer, HLoopInformation* inner) { in IsInnerLoop()
47 HLoopInformation* block_loop = block->GetLoopInformation(); in AddToListForLinearization()
51 HLoopInformation* current_loop = current->GetLoopInformation(); in AddToListForLinearization()
|
| D | side_effects_analysis.h | 47 void UpdateLoopEffects(HLoopInformation* info, SideEffects effects);
|
| D | nodes.cc | 327 HLoopInformation* info = successor->GetLoopInformation(); in SplitCriticalEdge()
336 HLoopInformation* info = header->GetLoopInformation(); in SimplifyLoop()
466 void HLoopInformation::Dump(std::ostream& os) { in Dump()
570 void HLoopInformation::Add(HBasicBlock* block) { in Add()
574 void HLoopInformation::Remove(HBasicBlock* block) { in Remove()
578 void HLoopInformation::PopulateRecursive(HBasicBlock* block) { in PopulateRecursive()
598 void HLoopInformation::PopulateIrreducibleRecursive(HBasicBlock* block, ArenaBitVector* finalized) { in PopulateIrreducibleRecursive()
622 HLoopInformation* info = block->GetLoopInformation(); in PopulateIrreducibleRecursive()
647 void HLoopInformation::Populate() { in Populate()
701 HBasicBlock* HLoopInformation::GetPreHeader() const { in GetPreHeader()
[all …]
|
| D | side_effects_analysis.cc | 86 void SideEffectsAnalysis::UpdateLoopEffects(HLoopInformation* info, SideEffects effects) { in UpdateLoopEffects()
|
| D | bounds_check_elimination.cc | 1152 HLoopInformation* loop = array_get->GetBlock()->GetLoopInformation(); in VisitArrayGet()
1325 HLoopInformation* loop = instruction->GetBlock()->GetLoopInformation(); in TryDynamicBCE()
1362 bool DynamicBCESeemsProfitable(HLoopInformation* loop, HBasicBlock* block) { in DynamicBCESeemsProfitable()
1395 bool IsEarlyExitLoop(HLoopInformation* loop) { in IsEarlyExitLoop()
1421 bool CanHandleLength(HLoopInformation* loop, HInstruction* length, bool needs_taken_test) { in CanHandleLength()
1437 bool CanHandleNullCheck(HLoopInformation* loop, HInstruction* check, bool needs_taken_test) { in CanHandleNullCheck()
1465 HLoopInformation* loop, HBoundsCheck* check, HInstruction* index, bool needs_infinite_test) { in CanHandleInfiniteLoop()
1501 HBasicBlock* GetPreHeader(HLoopInformation* loop, HInstruction* instruction) { in GetPreHeader()
1520 void InsertDeoptInLoop(HLoopInformation* loop, HBasicBlock* block, HInstruction* condition) { in InsertDeoptInLoop()
1543 void HoistToPreHeaderOrDeoptBlock(HLoopInformation* loop, HInstruction* instruction) { in HoistToPreHeaderOrDeoptBlock()
[all …]
|
| D | find_loops_test.cc | 122 HLoopInformation* info = block->GetLoopInformation(); in TestBlock()
340 HLoopInformation* info = graph->GetBlocks()[3]->GetLoopInformation(); in TEST_F()
|
| D | induction_var_range.cc | 131 HLoopInformation* loop = context->GetBlock()->GetLoopInformation(); // closest enveloping loop in GetInductionRange()
587 HLoopInformation* loop = in RefineOuter()
614 HLoopInformation* loop = context->GetBlock()->GetLoopInformation(); // closest enveloping loop in GenerateCode()
|
| D | ssa_liveness_analysis.h | 139 HLoopInformation* GetLoopInformation() const { in GetLoopInformation()
978 HLoopInformation* loop = header->GetLoopInformation(); in IsLinearOrderWellFormed()
1025 HLoopInformation* current = it.Current(); in AddBackEdgeUses()
|
| D | graph_visualizer.cc | 552 HLoopInformation* loop_info = instruction->GetBlock()->GetLoopInformation(); in PrintInstruction()
557 HLoopInformation* outer = loop_info->GetPreHeader()->GetLoopInformation(); in PrintInstruction()
|
| D | nodes.h | 647 class HLoopInformation : public ArenaObject<kArenaAllocLoopInfo> {
649 HLoopInformation(HBasicBlock* header, HGraph* graph) in HLoopInformation() function
716 bool IsIn(const HLoopInformation& other) const;
750 DISALLOW_COPY_AND_ASSIGN(HLoopInformation);
864 HLoopInformation* loop_info = GetLoopInformation(); in IsSingleJump()
872 loop_information_ = new (graph_->GetArena()) HLoopInformation(this, graph_); in AddBackEdge()
1075 HLoopInformation* GetLoopInformation() const { in GetLoopInformation()
1082 void SetInLoop(HLoopInformation* info) { in SetInLoop()
1100 void SetLoopInformation(HLoopInformation* info) { in SetLoopInformation()
1147 HLoopInformation* loop_information_;
[all …]
|
| D | graph_checker.cc | 559 HLoopInformation* loop_information = loop_header->GetLoopInformation(); in HandleLoop()
635 HLoopInformation* outer_info = it.Current(); in HandleLoop()
|
| D | load_store_elimination.cc | 808 HLoopInformation* loop_info = instruction->GetBlock()->GetLoopInformation(); in VisitSetLocation()
|
| D | code_generator.cc | 773 HLoopInformation* info = instruction->GetBlock()->GetLoopInformation(); in RecordPcInfo()
|
| D | code_generator_mips64.cc | 2207 HLoopInformation* info = block->GetLoopInformation(); in HandleGoto()
|
| D | code_generator_arm64.cc | 2772 HLoopInformation* info = block->GetLoopInformation(); in HandleGoto()
|
| D | code_generator_mips.cc | 2588 HLoopInformation* info = block->GetLoopInformation(); in HandleGoto()
|
| D | code_generator_x86_64.cc | 1232 HLoopInformation* info = block->GetLoopInformation(); in HandleGoto()
|
| D | code_generator_arm.cc | 1215 HLoopInformation* info = block->GetLoopInformation(); in HandleGoto()
|
| D | code_generator_x86.cc | 1131 HLoopInformation* info = block->GetLoopInformation(); in HandleGoto()
|