| /art/compiler/optimizing/ |
| D | loop_analysis.cc | 25 void LoopAnalysis::CalculateLoopBasicProperties(HLoopInformation* loop_info, in CalculateLoopBasicProperties() argument
30 for (HBlocksInLoopIterator block_it(*loop_info); in CalculateLoopBasicProperties()
37 if (!loop_info->Contains(*successor)) { in CalculateLoopBasicProperties()
46 if (hif != nullptr && !loop_info->Contains(*hif->InputAt(0)->GetBlock())) { in CalculateLoopBasicProperties()
67 int64_t LoopAnalysis::GetLoopTripCount(HLoopInformation* loop_info, in GetLoopTripCount() argument
70 if (!induction_range->HasKnownTripCount(loop_info, &trip_count)) { in GetLoopTripCount()
316 uint32_t GetUnrollingFactor(HLoopInformation* loop_info, HBasicBlock* header) const;
326 HLoopInformation* loop_info = block->GetLoopInformation(); in GetSIMDUnrollingFactor() local
327 DCHECK(loop_info); in GetSIMDUnrollingFactor()
328 HBasicBlock* header = loop_info->GetHeader(); in GetSIMDUnrollingFactor()
[all …]
|
| D | licm.cc | 101 HLoopInformation* loop_info = block->GetLoopInformation(); in Run() local
103 HBasicBlock* pre_header = loop_info->GetPreHeader(); in Run()
105 for (HBlocksInLoopIterator it_loop(*loop_info); !it_loop.Done(); it_loop.Advance()) { in Run()
108 if (inner->GetLoopInformation() != loop_info) { in Run()
117 if (loop_info->ContainsIrreducibleLoop()) { in Run()
122 DCHECK(!loop_info->IsIrreducible()); in Run()
155 UpdateLoopPhisIn(instruction->GetEnvironment(), loop_info); in Run()
|
| D | cha_guard_optimization.cc | 182 HLoopInformation* loop_info = block->GetLoopInformation(); in HoistGuard() local
183 if (loop_info != nullptr && in HoistGuard()
184 !loop_info->IsIrreducible() && in HoistGuard()
185 loop_info->IsDefinedOutOfTheLoop(receiver)) { in HoistGuard()
197 HBasicBlock* pre_header = loop_info->GetPreHeader(); in HoistGuard()
202 HInstruction* suspend = loop_info->GetSuspendCheck(); in HoistGuard()
209 suspend->GetEnvironment(), loop_info->GetHeader()); in HoistGuard()
|
| D | superblock_cloner_test.cc | 163 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F() local
164 orig_bb_set.Union(&loop_info->GetBlocks()); in TEST_F()
242 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F() local
243 orig_bb_set.Union(&loop_info->GetBlocks()); in TEST_F()
260 EXPECT_EQ(header->GetLoopInformation(), loop_info); in TEST_F()
261 EXPECT_EQ(loop_info->GetHeader(), header); in TEST_F()
262 EXPECT_TRUE(loop_info->Contains(*loop_body)); in TEST_F()
263 EXPECT_TRUE(loop_info->IsBackEdge(*loop_body)); in TEST_F()
306 HLoopInformation* loop_info = header->GetLoopInformation(); in TEST_F() local
307 LoopClonerHelper helper(loop_info, &bb_map, &hir_map, /* induction_range= */ nullptr); in TEST_F()
[all …]
|
| D | loop_analysis.h | 36 explicit LoopAnalysisInfo(HLoopInformation* loop_info) in LoopAnalysisInfo() argument
45 loop_info_(loop_info) {} in LoopAnalysisInfo()
102 static void CalculateLoopBasicProperties(HLoopInformation* loop_info,
107 static int64_t GetLoopTripCount(HLoopInformation* loop_info,
|
| D | loop_optimization.cc | 73 static bool IsEarlyExit(HLoopInformation* loop_info) { in IsEarlyExit() argument
74 HBlocksInLoopReversePostOrderIterator it_loop(*loop_info); in IsEarlyExit()
77 if (!loop_info->Contains(*successor)) { in IsEarlyExit()
429 static void PeelByCount(HLoopInformation* loop_info, in PeelByCount() argument
434 LoopClonerSimpleHelper helper(loop_info, induction_range); in PeelByCount()
565 void HLoopOptimization::AddLoop(HLoopInformation* loop_info) { in AddLoop() argument
566 DCHECK(loop_info != nullptr); in AddLoop()
567 LoopNode* node = new (loop_allocator_) LoopNode(loop_info); in AddLoop()
572 } else if (loop_info->IsIn(*last_loop_->loop_info)) { in AddLoop()
579 while (last_loop_->outer != nullptr && !loop_info->IsIn(*last_loop_->outer->loop_info)) { in AddLoop()
[all …]
|
| D | loop_optimization.h | 56 : loop_info(lp_info), in LoopNode()
61 HLoopInformation* loop_info; member
127 void AddLoop(HLoopInformation* loop_info);
258 bool IsOnlyUsedAfterLoop(HLoopInformation* loop_info,
262 bool IsUsedOutsideLoop(HLoopInformation* loop_info,
264 bool TryReplaceWithLastValue(HLoopInformation* loop_info,
267 bool TryAssignLastValue(HLoopInformation* loop_info,
|
| D | nodes.cc | 580 HLoopInformation* loop_info = header->GetLoopInformation(); in FixControlForNewSinglePreheader() local
583 if (!loop_info->IsBackEdge(*predecessor) && predecessor != new_preheader) { in FixControlForNewSinglePreheader()
620 HLoopInformation* loop_info = header->GetLoopInformation(); in TransformLoopToSinglePreheaderFormat() local
638 if (!loop_info->IsBackEdge(*predecessor)) { in TransformLoopToSinglePreheaderFormat()
670 if (loop_info->Contains(*pred_block)) { in TransformLoopToSinglePreheaderFormat()
671 DCHECK(loop_info->IsBackEdge(*pred_block)); in TransformLoopToSinglePreheaderFormat()
2408 HLoopInformation* loop_info = GetLoopInformation(); in DisconnectAndDelete() local
2412 DCHECK(!loop_info->IsIrreducible()); in DisconnectAndDelete()
2413 DCHECK_EQ(loop_info->GetBlocks().NumSetBits(), 1u); in DisconnectAndDelete()
2414 DCHECK_EQ(static_cast<uint32_t>(loop_info->GetBlocks().GetHighestBitSet()), GetBlockId()); in DisconnectAndDelete()
[all …]
|
| D | superblock_cloner.h | 395 static bool IsLoopClonable(HLoopInformation* loop_info);
530 HLoopInformation* loop_info,
|
| D | superblock_cloner.cc | 1070 HLoopInformation* loop_info, in CollectRemappingInfoForPeelUnroll() argument
1074 DCHECK(loop_info != nullptr); in CollectRemappingInfoForPeelUnroll()
1075 HBasicBlock* loop_header = loop_info->GetHeader(); in CollectRemappingInfoForPeelUnroll()
1078 for (HBasicBlock* back_edge_block : loop_info->GetBackEdges()) { in CollectRemappingInfoForPeelUnroll()
1090 remap_incoming->insert(HEdge(loop_info->GetPreHeader(), loop_header)); in CollectRemappingInfoForPeelUnroll()
1136 bool LoopClonerHelper::IsLoopClonable(HLoopInformation* loop_info) { in IsLoopClonable() argument
1138 loop_info, /* bb_map= */ nullptr, /* hir_map= */ nullptr, /* induction_range= */ nullptr); in IsLoopClonable()
|
| D | graph_visualizer.cc | 714 HLoopInformation* loop_info = (block != nullptr) ? block->GetLoopInformation() : nullptr; in PrintInstruction() local
715 if (loop_info == nullptr) { in PrintInstruction()
718 StartAttributeStream("loop") << namer_.GetName(loop_info->GetHeader()); in PrintInstruction()
719 HLoopInformation* outer = loop_info->GetPreHeader()->GetLoopInformation(); in PrintInstruction()
726 << std::boolalpha << loop_info->IsIrreducible() << std::noboolalpha; in PrintInstruction()
|
| D | register_allocator_graph_color.cc | 66 HLoopInformation* loop_info = block->GetLoopInformation(); in LoopDepthAt() local
68 while (loop_info != nullptr) { in LoopDepthAt()
70 loop_info = loop_info->GetPreHeader()->GetLoopInformation(); in LoopDepthAt()
|
| D | load_store_elimination.cc | 1502 HLoopInformation* loop_info = block->GetLoopInformation(); in PrepareLoopValue() local
1503 uint32_t pre_header_block_id = loop_info->GetPreHeader()->GetBlockId(); in PrepareLoopValue()
1517 if (index != nullptr && loop_info->Contains(*index->GetBlock())) { in PrepareLoopValue()
1889 HLoopInformation* loop_info = loop_header->GetLoopInformation(); in MayAliasOnBackEdge() local
1890 if (loop_info->Contains(*loc1->GetIndex()->GetBlock()) || in MayAliasOnBackEdge()
1891 loop_info->Contains(*loc2->GetIndex()->GetBlock())) { in MayAliasOnBackEdge()
1956 HLoopInformation* loop_info = in TryReplacingLoopPhiPlaceholderWithDefault() local
1958 record = heap_values_for_[loop_info->GetPreHeader()->GetBlockId()][i]; in TryReplacingLoopPhiPlaceholderWithDefault()
|
| D | nodes.h | 1135 HLoopInformation* loop_info = GetLoopInformation(); in IsSingleJump() local
1138 && (loop_info == nullptr || !loop_info->IsBackEdge(*this)); in IsSingleJump()
|