Home
last modified time | relevance | path

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

12

/art/compiler/optimizing/
Dnodes_test.cc61 std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
65 std::any_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
75 std::none_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
79 std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
117 std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
121 std::any_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
131 std::none_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
135 std::all_of(graph_->GetBlocks().begin(), graph_->GetBlocks().end(), [&](HBasicBlock* b) { in TEST_F()
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 …]
Dexecution_subgraph.cc34 allowed_successors_(graph_->GetBlocks().size(), in ExecutionSubgraph()
38 allocator_, graph_->GetBlocks().size(), /*expandable=*/ false, kArenaAllocLSA),
43 DCHECK(std::all_of(graph->GetBlocks().begin(), graph->GetBlocks().end(), [](HBasicBlock* it) { in __anon8468d4a20102()
87 graph_->GetBlocks().size(), temporaries.Adapter(kArenaAllocLSA)); in Prune()
100 const size_t num_blocks = graph_->GetBlocks().size(); in Prune()
146 const HBasicBlock* last = graph_->GetBlocks()[current_path.back()]; in Prune()
226 for (const HBasicBlock* blk : graph_->GetBlocks()) { in Prune()
248 for (const HBasicBlock* blk : graph_->GetBlocks()) { in RemoveConcavity()
270 ArenaBitVector unreachable(allocator_, graph_->GetBlocks().size(), false, kArenaAllocLSA); in RecalculateExcludedCohort()
280 const HBasicBlock* first = graph_->GetBlocks()[unreachable.GetHighestBitSet()]; in RecalculateExcludedCohort()
Dexecution_subgraph.h63 DCHECK_LT(id, graph_->GetBlocks().size()) << graph_->PrettyMethod(); in GetBlock()
64 HBasicBlock* blk = graph_->GetBlocks()[id]; in GetBlock()
131 entry_blocks_(allocator, graph_->GetBlocks().size(), false, kArenaAllocLSA), in ExcludedCohort()
132 exit_blocks_(allocator, graph_->GetBlocks().size(), false, kArenaAllocLSA), in ExcludedCohort()
133 blocks_(allocator, graph_->GetBlocks().size(), false, kArenaAllocLSA) {} in ExcludedCohort()
294 return Filter(MakeIterationRange(graph_->GetBlocks()), ContainsFunctor(this)); in ReachableBlocks()
302 return std::all_of(graph->GetBlocks().begin(), graph->GetBlocks().end(), [](HBasicBlock* blk) { in CanAnalyse()
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()
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()
Dside_effects_analysis.h31 block_effects_(graph->GetBlocks().size(), in HOptimization()
33 loop_effects_(graph->GetBlocks().size(), in HOptimization()
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.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()
Dside_effects_analysis.cc24 block_effects_.resize(graph_->GetBlocks().size()); in Run()
25 loop_effects_.resize(graph_->GetBlocks().size()); in Run()
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.cc265 ArenaBitVector post_dominated(&allocator, graph_->GetBlocks().size(), /* expandable= */ false); in SinkCodeToUncommonBranch()
306 for (size_t i = 0, e = graph_->GetBlocks().size(); i < e; ++i) { in SinkCodeToUncommonBranch()
308 finder.Update(graph_->GetBlocks()[i]); in SinkCodeToUncommonBranch()
309 AddInputs(graph_->GetBlocks()[i], processed_instructions, post_dominated, &worklist); in SinkCodeToUncommonBranch()
Dbuilder.cc102 DCHECK(graph_->GetBlocks().empty()); in BuildGraph()
157 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()
Dload_store_elimination.cc554 return graph->GetBlocks()[GetMergeBlockId()]; in GetMergeBlock()
609 << res << "blks: " << GetGraph()->GetBlocks().size() in PhiPlaceholderIndex()
645 DCHECK(GetGraph()->GetBlocks()[block_id] != nullptr) << block_id; in GetPhiPlaceholder()
1455 num_phi_placeholders_(GetGraph()->GetBlocks().size() * in LSEVisitor()
1457 heap_values_for_(graph->GetBlocks().size(), in LSEVisitor()
1629 CHECK(GetGraph()->GetBlocks()[block_id]->Dominates(block)); in MergePredecessorRecords()
1685 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in MaterializeNonLoopPhis()
1914 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in TryReplacingLoopPhiPlaceholderWithDefault()
1999 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in TryReplacingLoopPhiPlaceholderWithSingleInput()
2054 const ArenaVector<HBasicBlock*>& blocks = GetGraph()->GetBlocks(); in FindLoopPhisToMaterialize()
[all …]
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()
Dload_store_analysis.cc104 allocator_, graph->GetBlocks().size(), false, kArenaAllocLSA); in PrunePartialEscapeWrites()
126 subgraph_->RemoveBlock(graph->GetBlocks()[exc]); in PrunePartialEscapeWrites()
Dlive_ranges_test.cc76 HBasicBlock* block = graph->GetBlocks()[1]; in TEST_F()
120 HBasicBlock* block = graph->GetBlocks()[3]; in TEST_F()
Dlicm.cc89 graph_->GetBlocks().size(), in Run()
Dnodes.cc316 block_size_(RoundUp(graph_->GetBlocks().size(), BitVector::kWordBits)), in ReachabilityAnalysisHelper()
318 &temporaries_, graph_->GetBlocks().size(), false, kArenaAllocReachabilityGraph), in ReachabilityAnalysisHelper()
320 &temporaries_, graph_->GetBlocks().size(), false, kArenaAllocReachabilityGraph) { in ReachabilityAnalysisHelper()
323 CHECK_GE(reachability_graph_->NumRows(), graph_->GetBlocks().size()); in ReachabilityAnalysisHelper()
324 CHECK_GE(reachability_graph_->NumColumns(), graph_->GetBlocks().size()); in ReachabilityAnalysisHelper()
325 not_post_order_visited_.SetInitialBits(graph_->GetBlocks().size()); in ReachabilityAnalysisHelper()
343 const HBasicBlock* blk = graph_->GetBlocks()[idx]; in CalculateReachability()
371 &connectedness_temps, graph_->GetBlocks().size(), false, kArenaAllocReachabilityGraph); in CalculateConnectednessOn()
377 work_stack.reserve(graph_->GetBlocks().size()); in CalculateConnectednessOn()
1003 graph->GetBlocks().size(), in Populate()
[all …]
Dcha_guard_optimization.cc37 block_has_cha_guard_(GetGraph()->GetBlocks().size(), in CHAGuardVisitor()
Dliveness_test.cc58 for (HBasicBlock* block : graph->GetBlocks()) { in TestCode()
/art/runtime/
Dimage.h399 IterationRange<const Block*> GetBlocks() const { in GetBlocks() function
400 return GetBlocks(GetImageBegin()); in GetBlocks()
403 IterationRange<const Block*> GetBlocks(const uint8_t* image_begin) const { in GetBlocks() function

12