Home
last modified time | relevance | path

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

12

/art/compiler/optimizing/
Dnodes_test.cc62 std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
66 std::any_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
76 std::none_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
80 std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
118 std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
122 std::any_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
132 std::none_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
136 std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
Dfind_loops_test.cc40 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
51 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
65 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
80 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
93 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
104 HBasicBlock* block = graph->GetBlocks()[block_id]; in TestBlock()
114 const BitVector& blocks = info->GetBlocks(); in TestBlock()
270 ASSERT_TRUE(graph->GetBlocks()[3]->GetLoopInformation()->IsIn( in TEST_F()
271 *graph->GetBlocks()[2]->GetLoopInformation())); in TEST_F()
272 ASSERT_FALSE(graph->GetBlocks()[2]->GetLoopInformation()->IsIn( in TEST_F()
[all …]
Ddominator_test.cc37 ASSERT_EQ(graph->GetBlocks().size(), blocks_length); in TestCode()
40 if (graph->GetBlocks()[i] == nullptr) { in TestCode()
44 ASSERT_EQ(nullptr, graph->GetBlocks()[i]->GetDominator()); in TestCode()
45 ASSERT_TRUE(graph->GetBlocks()[i]->IsEntryBlock()); in TestCode()
48 ASSERT_NE(nullptr, graph->GetBlocks()[i]->GetDominator()); in TestCode()
49 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId()); in TestCode()
Dsuperblock_cloner.h76 if (from >= graph->GetBlocks().size() || to >= graph->GetBlocks().size()) { in IsEdgeValid()
80 HBasicBlock* block_from = graph->GetBlocks()[from]; in IsEdgeValid()
81 HBasicBlock* block_to = graph->GetBlocks()[to]; in IsEdgeValid()
343 DCHECK(block_id < graph_->GetBlocks().size()); in GetBlockById()
344 HBasicBlock* block = graph_->GetBlocks()[block_id]; in GetBlockById()
390 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()
Dconstant_folding_test.cc127 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
188 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
249 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
328 HInstruction* inst1 = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
399 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
462 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
526 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
626 HInstruction* inst1 = graph->GetBlocks()[4]->GetFirstInstruction()->InputAt(0); in TEST_F()
711 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
Dside_effects_analysis.cc24 block_effects_.resize(graph_->GetBlocks().size()); in Run()
25 loop_effects_.resize(graph_->GetBlocks().size()); in Run()
Dblock_builder.cc274 for (HBasicBlock* block : graph_->GetBlocks()) { in InsertTryBoundaryBlocks()
347 HBasicBlock* try_block = graph_->GetBlocks()[block_id]; in InsertTryBoundaryBlocks()
366 HBasicBlock* try_block = graph_->GetBlocks()[block_id]; in InsertTryBoundaryBlocks()
416 HBasicBlock* block = graph_->GetBlocks()[block_id]; in InsertSynthesizedLoopsForOsr()
432 DCHECK(graph_->GetBlocks().empty()); in Build()
454 DCHECK(graph_->GetBlocks().empty()); in BuildIntrinsic()
Dbuilder.cc92 DCHECK(graph_->GetBlocks().empty()); in BuildGraph()
146 DCHECK(graph_->GetBlocks().empty()); in BuildIntrinsicGraph()
Dsuperblock_cloner.cc274 ArenaBitVector visited(arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in FindBackEdgesLocal()
277 ArenaBitVector visiting(arena_, graph_->GetBlocks().size(), false, kArenaAllocGraphBuilder); in FindBackEdgesLocal()
279 ArenaVector<size_t> successors_visited(graph_->GetBlocks().size(), in FindBackEdgesLocal()
320 for (auto block : graph_->GetBlocks()) { in RecalculateBackEdgesInfo()
402 arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in CleanUpControlFlow()
482 outer_loop_bb_set_.Copy(&outer_loop_->GetBlocks()); in FindAndSetLocalAreaForAdjustments()
533 arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in AdjustControlFlowInfo()
683 for (HBasicBlock* bb : graph->GetBlocks()) { in DumpBB()
906 if (common_loop_info == nullptr || !orig_bb_set_.SameBitsSet(&common_loop_info->GetBlocks())) { in IsFastCase()
1107 HBasicBlock* block = graph->GetBlocks()[orig_block_id]; in IsSubgraphConnected()
Dcode_sinking.cc338 ArenaBitVector post_dominated(&allocator, graph_->GetBlocks().size(), /* expandable= */ false); in SinkCodeToUncommonBranch()
402 for (size_t i = 0, e = graph_->GetBlocks().size(); i < e; ++i) { in SinkCodeToUncommonBranch()
404 finder.Update(graph_->GetBlocks()[i]); in SinkCodeToUncommonBranch()
405 AddInputs(graph_->GetBlocks()[i], processed_instructions, post_dominated, &worklist); in SinkCodeToUncommonBranch()
414 graph_->GetBlocks().size(), in SinkCodeToUncommonBranch()
Dsuperblock_cloner_test.cc160 arena, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in TEST_F()
165 orig_bb_set.Union(&loop_info->GetBlocks()); in TEST_F()
241 arena, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in TEST_F()
244 orig_bb_set.Union(&loop_info->GetBlocks()); in TEST_F()
279 arena, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in TEST_F()
637 arena, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in TEST_F()
638 orig_bb_set.Union(&loop_info->GetBlocks()); in TEST_F()
Ddead_code_elimination.cc593 : blocks_in_try(allocator, graph->GetBlocks().size(), /*expandable=*/false, kArenaAllocDCE), in TryBelongingInformation()
595 allocator, graph->GetBlocks().size(), /*expandable=*/false, kArenaAllocDCE) {} in TryBelongingInformation()
604 const ArenaVector<HBasicBlock*>& blocks = graph_->GetBlocks(); in CanPerformTryRemoval()
649 const ArenaVector<HBasicBlock*>& blocks = graph_->GetBlocks(); in RemoveTry()
802 &allocator, graph_->GetBlocks().size(), /*expandable=*/ false, kArenaAllocDCE); in RemoveEmptyIfs()
876 ArenaBitVector live_blocks(&allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE); in RemoveDeadBlocks()
Dssa_test.cc74 for (HBasicBlock* block : graph->GetBlocks()) { in ReNumberInstructions()
92 for (HBasicBlock* block : graph->GetBlocks()) { in TestCode()
Dgvn.cc360 sets_(graph->GetBlocks().size(), nullptr, allocator_.Adapter(kArenaAllocGvn)), in GlobalValueNumberer()
362 &allocator_, graph->GetBlocks().size(), /* expandable= */ false, kArenaAllocGvn) {} in GlobalValueNumberer()
553 HBasicBlock* current_block = block->GetGraph()->GetBlocks()[block_id]; in FindVisitedBlockWithRecyclableSet()
Dload_store_elimination.cc475 return graph->GetBlocks()[GetMergeBlockId()]; in GetMergeBlock()
530 << res << "blks: " << GetGraph()->GetBlocks().size() in PhiPlaceholderIndex()
551 DCHECK(GetGraph()->GetBlocks()[block_id] != nullptr) << block_id; in GetPhiPlaceholder()
1422 num_phi_placeholders_(GetGraph()->GetBlocks().size() * in LSEVisitor()
1424 heap_values_for_(graph->GetBlocks().size(), in LSEVisitor()
1588 CHECK(GetGraph()->GetBlocks()[block_id]->Dominates(block)); in MergePredecessorRecords()
1643 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in MaterializeNonLoopPhis()
1876 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in TryReplacingLoopPhiPlaceholderWithDefault()
1966 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in TryReplacingLoopPhiPlaceholderWithSingleInput()
2027 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in FindLoopPhisToMaterialize()
[all …]
Dlive_ranges_test.cc77 HBasicBlock* block = graph->GetBlocks()[1]; in TEST_F()
121 HBasicBlock* block = graph->GetBlocks()[3]; in TEST_F()
Dlicm.cc89 graph_->GetBlocks().size(), in Run()
Dcha_guard_optimization.cc37 block_has_cha_guard_(GetGraph()->GetBlocks().size(), in CHAGuardVisitor()
Dregister_allocator_test.cc312 HBasicBlock* loop_header = graph->GetBlocks()[2]; in TEST_F()
321 HBasicBlock* return_block = graph->GetBlocks()[3]; in TEST_F()
339 HXor* first_xor = graph->GetBlocks()[1]->GetFirstInstruction()->AsXor(); in TEST_F()
340 HXor* last_xor = graph->GetBlocks()[1]->GetLastInstruction()->GetPrevious()->AsXor(); in TEST_F()
Dliveness_test.cc59 for (HBasicBlock* block : graph->GetBlocks()) { in TestCode()
Dnodes.cc888 graph->GetBlocks().size(), in Populate()
1420 graph->GetBlocks().size(), in ReplaceUsesDominatedBy()
2343 DCHECK_EQ(loop_info->GetBlocks().NumSetBits(), 1u); in DisconnectAndDelete()
2344 DCHECK_EQ(static_cast<uint32_t>(loop_info->GetBlocks().GetHighestBitSet()), GetBlockId()); in DisconnectAndDelete()
2707 if (GetBlocks().size() == 3) { in InlineInto()
2709 DCHECK(!GetBlocks()[1]->GetLastInstruction()->IsThrow()); in InlineInto()
2712 HBasicBlock* body = GetBlocks()[1]; in InlineInto()
2713 DCHECK(GetBlocks()[0]->IsEntryBlock()); in InlineInto()
2714 DCHECK(GetBlocks()[2]->IsExitBlock()); in InlineInto()
Dgraph_checker.cc952 const ArenaBitVector& loop_blocks = loop_information->GetBlocks(); in HandleLoop()
981 if (!loop_blocks.IsSubsetOf(&outer_info->GetBlocks())) { in HandleLoop()
1000 HBasicBlock* loop_block = GetGraph()->GetBlocks()[i]; in HandleLoop()
Dloop_optimization.cc495 DCHECK_EQ(loop_info->GetBlocks().NumSetBits(), 5u); in HasLoopDiamondStructure()
500 size_t num_of_blocks = loop_info->GetBlocks().NumSetBits(); in IsPredicatedLoopControlFlowSupported()
906 size_t num_of_blocks = header->GetLoopInformation()->GetBlocks().NumSetBits(); in TryOptimizeInnerLoopFinite()
962 node->loop_info->GetBlocks().NumSetBits() != 2) { in TryVectorizePredicated()
978 size_t num_of_blocks = header->GetLoopInformation()->GetBlocks().NumSetBits(); in TryVectorizedTraditional()
3133 size_t blocks_in_loop = header->GetLoopInformation()->GetBlocks().NumSetBits(); in InitPredicateInfoMap()
/art/runtime/oat/
Dimage.h412 IterationRange<const Block*> GetBlocks() const { in GetBlocks() function
413 return GetBlocks(GetImageBegin()); in GetBlocks()
416 IterationRange<const Block*> GetBlocks(const uint8_t* image_begin) const { in GetBlocks() function

12