Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dfind_loops_test.cc41 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
54 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
70 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
87 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
102 for (HBasicBlock* block : graph->GetBlocks()) { in TEST_F()
113 HBasicBlock* block = graph->GetBlocks()[block_id]; in TestBlock()
123 const BitVector& blocks = info->GetBlocks(); in TestBlock()
291 ASSERT_TRUE(graph->GetBlocks()[3]->GetLoopInformation()->IsIn( in TEST_F()
292 *graph->GetBlocks()[2]->GetLoopInformation())); in TEST_F()
293 ASSERT_FALSE(graph->GetBlocks()[2]->GetLoopInformation()->IsIn( in TEST_F()
[all …]
Ddominator_test.cc33 ASSERT_EQ(graph->GetBlocks().size(), blocks_length); in TestCode()
36 if (graph->GetBlocks()[i] == nullptr) { in TestCode()
40 ASSERT_EQ(nullptr, graph->GetBlocks()[i]->GetDominator()); in TestCode()
41 ASSERT_TRUE(graph->GetBlocks()[i]->IsEntryBlock()); in TestCode()
44 ASSERT_NE(nullptr, graph->GetBlocks()[i]->GetDominator()); in TestCode()
45 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId()); in TestCode()
Dside_effects_analysis.h31 block_effects_(graph->GetBlocks().size(), in SideEffectsAnalysis()
33 loop_effects_(graph->GetBlocks().size(), in SideEffectsAnalysis()
Dconstant_folding_test.cc134 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
195 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
256 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
335 HInstruction* inst1 = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
406 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
469 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
533 HInstruction* inst = graph->GetBlocks()[1]->GetFirstInstruction()->InputAt(0); in TEST_F()
633 HInstruction* inst1 = graph->GetBlocks()[4]->GetFirstInstruction()->InputAt(0); in TEST_F()
718 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.cc251 for (HBasicBlock* block : graph_->GetBlocks()) { in InsertTryBoundaryBlocks()
314 HBasicBlock* try_block = graph_->GetBlocks()[entry.first]; in InsertTryBoundaryBlocks()
331 HBasicBlock* try_block = graph_->GetBlocks()[entry.first]; in InsertTryBoundaryBlocks()
354 DCHECK(graph_->GetBlocks().empty()); in Build()
Dbuilder.cc74 DCHECK(graph_->GetBlocks().empty()); in BuildGraph()
Dssa_test.cc69 for (HBasicBlock* block : graph->GetBlocks()) { in ReNumberInstructions()
89 for (HBasicBlock* block : graph->GetBlocks()) { in TestCode()
Dgvn.cc359 sets_(graph->GetBlocks().size(), nullptr, allocator->Adapter(kArenaAllocGvn)), in GlobalValueNumberer()
361 allocator, graph->GetBlocks().size(), /* expandable */ false, kArenaAllocGvn) {} in GlobalValueNumberer()
545 HBasicBlock* current_block = block->GetGraph()->GetBlocks()[block_id]; in FindVisitedBlockWithRecyclableSet()
Doptimizing_unit_test.h65 for (HBasicBlock* block : graph->GetBlocks()) { in RemoveSuspendChecks()
Dlicm.cc87 graph_->GetBlocks().size(), in Run()
Dlive_ranges_test.cc76 HBasicBlock* block = graph->GetBlocks()[1]; in TEST_F()
124 HBasicBlock* block = graph->GetBlocks()[3]; in TEST_F()
Ddead_code_elimination.cc100 ArenaBitVector live_blocks(allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE); in RemoveDeadBlocks()
Dregister_allocator_test.cc302 HBasicBlock* loop_header = graph->GetBlocks()[2]; in TEST_F()
311 HBasicBlock* return_block = graph->GetBlocks()[3]; in TEST_F()
333 HXor* first_xor = graph->GetBlocks()[1]->GetFirstInstruction()->AsXor(); in TEST_F()
334 HXor* last_xor = graph->GetBlocks()[1]->GetLastInstruction()->GetPrevious()->AsXor(); in TEST_F()
Dnodes.cc662 graph->GetBlocks().size(), in Populate()
1145 const ArenaVector<HBasicBlock*>& blocks = graph_->GetBlocks(); in FOR_EACH_CONCRETE_INSTRUCTION()
1720 DCHECK_EQ(loop_info->GetBlocks().NumSetBits(), 1u); in DisconnectAndDelete()
1721 DCHECK_EQ(static_cast<uint32_t>(loop_info->GetBlocks().GetHighestBitSet()), GetBlockId()); in DisconnectAndDelete()
2021 if (GetBlocks().size() == 3) { in InlineInto()
2024 HBasicBlock* body = GetBlocks()[1]; in InlineInto()
2025 DCHECK(GetBlocks()[0]->IsEntryBlock()); in InlineInto()
2026 DCHECK(GetBlocks()[2]->IsExitBlock()); in InlineInto()
Dgraph_checker.cc607 const ArenaBitVector& loop_blocks = loop_information->GetBlocks(); in HandleLoop()
636 if (!loop_blocks.IsSubsetOf(&outer_info->GetBlocks())) { in HandleLoop()
655 HBasicBlock* loop_block = GetGraph()->GetBlocks()[i]; in HandleLoop()
Dssa_liveness_analysis.h973 for (HBasicBlock* header : graph.GetBlocks()) { in IsLinearOrderWellFormed()
979 size_t num_blocks = loop->GetBlocks().NumSetBits(); in IsLinearOrderWellFormed()
1152 block_infos_(graph->GetBlocks().size(), in SsaLivenessAnalysis()
Dgraph_visualizer.cc789 if (!graph_->GetBlocks().empty()) { in DumpGraph()
802 if (!graph_->GetBlocks().empty()) { in DumpGraphWithDisassembly()
Dssa_liveness_analysis.cc72 ArenaVector<uint32_t> forward_predecessors(graph_->GetBlocks().size(), in LinearizeGraph()
Dcode_generator_arm64.h417 block_labels_.resize(GetGraph()->GetBlocks().size()); in Initialize()
Dcode_generator.h563 size_t size = GetGraph()->GetBlocks().size(); in CommonInitializeLabels()
Dnodes.h323 const ArenaVector<HBasicBlock*>& GetBlocks() const { return blocks_; } in GetBlocks() function
656 blocks_(graph->GetArena(), graph->GetBlocks().size(), true, kArenaAllocLoopInfoBackEdges) { in HLoopInformation()
721 const ArenaBitVector& GetBlocks() const { return blocks_; } in GetBlocks() function
6404 bool Done() const { return index_ == graph_.GetBlocks().size(); } in Done()
6405 HBasicBlock* Current() const { return graph_.GetBlocks()[index_]; } in Current()
6495 : blocks_in_loop_(info.GetBlocks()), in HBlocksInLoopIterator()
6496 blocks_(info.GetHeader()->GetGraph()->GetBlocks()), in HBlocksInLoopIterator()
6528 : blocks_in_loop_(info.GetBlocks()), in HBlocksInLoopReversePostOrderIterator()
Dbounds_check_elimination.cc528 maps_(graph->GetBlocks().size(), in BCEVisitor()
547 initial_block_size_(graph->GetBlocks().size()), in BCEVisitor()
Dload_store_elimination.cc516 heap_values_for_(graph->GetBlocks().size(), in LSEVisitor()
Dinstruction_builder.cc261 locals_for_.resize(graph_->GetBlocks().size(), in Build()