Home
last modified time | relevance | path

Searched refs:GetBlocks (Results 1 – 25 of 34) sorted by relevance

12

/art/compiler/optimizing/
Dfind_loops_test.cc39 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
50 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
64 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
79 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
92 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
103 HBasicBlock* block = graph->GetBlocks()[block_id]; in TestBlock()
113 const BitVector& blocks = info->GetBlocks(); in TestBlock()
269 ASSERT_TRUE(graph->GetBlocks()[3]->GetLoopInformation()->IsIn( in TEST_F()
270 *graph->GetBlocks()[2]->GetLoopInformation())); in TEST_F()
271 ASSERT_FALSE(graph->GetBlocks()[2]->GetLoopInformation()->IsIn( in TEST_F()
[all …]
Ddominator_test.cc36 ASSERT_EQ(graph->GetBlocks().size(), blocks_length); in TestCode()
39 if (graph->GetBlocks()[i] == nullptr) { in TestCode()
43 ASSERT_EQ(nullptr, graph->GetBlocks()[i]->GetDominator()); in TestCode()
44 ASSERT_TRUE(graph->GetBlocks()[i]->IsEntryBlock()); in TestCode()
47 ASSERT_NE(nullptr, graph->GetBlocks()[i]->GetDominator()); in TestCode()
48 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId()); in TestCode()
Dside_effects_analysis.h31 block_effects_(graph->GetBlocks().size(), in HOptimization()
33 loop_effects_(graph->GetBlocks().size(), in HOptimization()
Dsuperblock_cloner.h75 if (from >= graph->GetBlocks().size() || to >= graph->GetBlocks().size()) { in IsEdgeValid()
79 HBasicBlock* block_from = graph->GetBlocks()[from]; in IsEdgeValid()
80 HBasicBlock* block_to = graph->GetBlocks()[to]; in IsEdgeValid()
342 DCHECK(block_id < graph_->GetBlocks().size()); in GetBlockById()
343 HBasicBlock* block = graph_->GetBlocks()[block_id]; in GetBlockById()
389 cloner_(info->GetHeader()->GetGraph(), &info->GetBlocks(), bb_map, hir_map, induction_range) { in LoopClonerHelper()
Dlinear_order.cc59 for (HBasicBlock* header : graph->GetBlocks()) { in IsLinearOrderWellFormed()
64 size_t num_blocks = loop->GetBlocks().NumSetBits(); in IsLinearOrderWellFormed()
98 ScopedArenaVector<uint32_t> forward_predecessors(graph->GetBlocks().size(), in LinearizeGraphInternal()
Dside_effects_analysis.cc24 block_effects_.resize(graph_->GetBlocks().size()); in Run()
25 loop_effects_.resize(graph_->GetBlocks().size()); in Run()
Dconstant_folding_test.cc125 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
186 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
247 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
326 HInstruction* inst1 = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
397 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
460 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
524 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
624 HInstruction* inst1 = graph->GetBlocks()[4]->GetFirstInstruction()->InputAt(0); in TEST_F()
709 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
Dblock_builder.cc287 for (HBasicBlock* block : graph_->GetBlocks()) { in InsertTryBoundaryBlocks()
360 HBasicBlock* try_block = graph_->GetBlocks()[block_id]; in InsertTryBoundaryBlocks()
379 HBasicBlock* try_block = graph_->GetBlocks()[block_id]; in InsertTryBoundaryBlocks()
429 HBasicBlock* block = graph_->GetBlocks()[block_id]; in InsertSynthesizedLoopsForOsr()
445 DCHECK(graph_->GetBlocks().empty()); in Build()
467 DCHECK(graph_->GetBlocks().empty()); in BuildIntrinsic()
Dcode_sinking.cc264 ArenaBitVector post_dominated(&allocator, graph_->GetBlocks().size(), /* expandable= */ false); in SinkCodeToUncommonBranch()
305 for (size_t i = 0, e = graph_->GetBlocks().size(); i < e; ++i) { in SinkCodeToUncommonBranch()
307 finder.Update(graph_->GetBlocks()[i]); in SinkCodeToUncommonBranch()
308 AddInputs(graph_->GetBlocks()[i], processed_instructions, post_dominated, &worklist); in SinkCodeToUncommonBranch()
Dbuilder.cc105 DCHECK(graph_->GetBlocks().empty()); in BuildGraph()
161 DCHECK(graph_->GetBlocks().empty()); in BuildIntrinsicGraph()
Dsuperblock_cloner.cc274 ArenaBitVector visited(arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in FindBackEdgesLocal()
279 ArenaBitVector visiting(arena_, graph_->GetBlocks().size(), false, kArenaAllocGraphBuilder); in FindBackEdgesLocal()
281 ArenaVector<size_t> successors_visited(graph_->GetBlocks().size(), in FindBackEdgesLocal()
322 for (auto block : graph_->GetBlocks()) { in RecalculateBackEdgesInfo()
404 arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in CleanUpControlFlow()
484 outer_loop_bb_set_.Copy(&outer_loop_->GetBlocks()); in FindAndSetLocalAreaForAdjustments()
535 arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in AdjustControlFlowInfo()
685 for (HBasicBlock* bb : graph->GetBlocks()) { in DumpBB()
899 if (common_loop_info == nullptr || !orig_bb_set_.SameBitsSet(&common_loop_info->GetBlocks())) { in IsFastCase()
1100 HBasicBlock* block = graph->GetBlocks()[orig_block_id]; in IsSubgraphConnected()
Dsuperblock_cloner_test.cc159 arena, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in TEST_F()
164 orig_bb_set.Union(&loop_info->GetBlocks()); in TEST_F()
240 arena, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in TEST_F()
243 orig_bb_set.Union(&loop_info->GetBlocks()); in TEST_F()
278 arena, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in TEST_F()
636 arena, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in TEST_F()
637 orig_bb_set.Union(&loop_info->GetBlocks()); in TEST_F()
Dssa_test.cc73 for (HBasicBlock* block : graph->GetBlocks()) { in ReNumberInstructions()
91 for (HBasicBlock* block : graph->GetBlocks()) { in TestCode()
Dgvn.cc361 sets_(graph->GetBlocks().size(), nullptr, allocator_.Adapter(kArenaAllocGvn)), in GlobalValueNumberer()
363 &allocator_, graph->GetBlocks().size(), /* expandable= */ false, kArenaAllocGvn) { in GlobalValueNumberer()
556 HBasicBlock* current_block = block->GetGraph()->GetBlocks()[block_id]; in FindVisitedBlockWithRecyclableSet()
Dlicm.cc89 graph_->GetBlocks().size(), in Run()
Dlive_ranges_test.cc76 HBasicBlock* block = graph->GetBlocks()[1]; in TEST_F()
120 HBasicBlock* block = graph->GetBlocks()[3]; in TEST_F()
Dcha_guard_optimization.cc37 block_has_cha_guard_(GetGraph()->GetBlocks().size(), in CHAGuardVisitor()
Dliveness_test.cc58 for (HBasicBlock* block : graph->GetBlocks()) { in TestCode()
Dregister_allocator_test.cc339 HBasicBlock* loop_header = graph->GetBlocks()[2]; in Loop3()
348 HBasicBlock* return_block = graph->GetBlocks()[3]; in Loop3()
368 HXor* first_xor = graph->GetBlocks()[1]->GetFirstInstruction()->AsXor(); in TEST_F()
369 HXor* last_xor = graph->GetBlocks()[1]->GetLastInstruction()->GetPrevious()->AsXor(); in TEST_F()
Doptimizing_unit_test.h77 for (HBasicBlock* block : graph->GetBlocks()) { in RemoveSuspendChecks()
Dnodes.cc829 graph->GetBlocks().size(), in Populate()
1525 const ArenaVector<HBasicBlock*>& blocks = graph_->GetBlocks(); in FOR_EACH_CONCRETE_INSTRUCTION()
2141 DCHECK_EQ(loop_info->GetBlocks().NumSetBits(), 1u); in DisconnectAndDelete()
2142 DCHECK_EQ(static_cast<uint32_t>(loop_info->GetBlocks().GetHighestBitSet()), GetBlockId()); in DisconnectAndDelete()
2461 if (GetBlocks().size() == 3) { in InlineInto()
2463 DCHECK(!GetBlocks()[1]->GetLastInstruction()->IsThrow()); in InlineInto()
2466 HBasicBlock* body = GetBlocks()[1]; in InlineInto()
2467 DCHECK(GetBlocks()[0]->IsEntryBlock()); in InlineInto()
2468 DCHECK(GetBlocks()[2]->IsExitBlock()); in InlineInto()
Dgraph_checker.cc710 const ArenaBitVector& loop_blocks = loop_information->GetBlocks(); in HandleLoop()
739 if (!loop_blocks.IsSubsetOf(&outer_info->GetBlocks())) { in HandleLoop()
758 HBasicBlock* loop_block = GetGraph()->GetBlocks()[i]; in HandleLoop()
Ddead_code_elimination.cc452 ArenaBitVector live_blocks(&allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE); in RemoveDeadBlocks()
Dgraph_visualizer.cc926 if (!graph_->GetBlocks().empty()) { in DumpGraph()
939 if (!graph_->GetBlocks().empty()) { in DumpGraphWithDisassembly()
/art/runtime/
Dimage.h402 IterationRange<const Block*> GetBlocks() const { in GetBlocks() function
403 return GetBlocks(GetImageBegin()); in GetBlocks()
406 IterationRange<const Block*> GetBlocks(const uint8_t* image_begin) const { in GetBlocks() function

12