Home
last modified time | relevance | path

Searched refs:entry_block (Results 1 – 8 of 8) sorted by relevance

/art/compiler/optimizing/
Dgraph_test.cc82 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F() local
88 entry_block->AddSuccessor(if_block); in TEST_F()
114 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F() local
120 entry_block->AddSuccessor(if_block); in TEST_F()
146 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F() local
151 entry_block->AddSuccessor(if_block); in TEST_F()
166 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST_F()
178 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F() local
183 entry_block->AddSuccessor(if_block); in TEST_F()
198 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST_F()
[all …]
Dgraph_checker_test.cc38 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in CreateSimpleCFG() local
39 entry_block->AddInstruction(new (GetAllocator()) HReturnVoid()); in CreateSimpleCFG()
40 graph->AddBlock(entry_block); in CreateSimpleCFG()
41 graph->SetEntryBlock(entry_block); in CreateSimpleCFG()
46 entry_block->AddSuccessor(exit_block); in CreateSimpleCFG()
Dcodegen_test.cc479 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F() local
480 graph->AddBlock(entry_block); in TEST_F()
481 graph->SetEntryBlock(entry_block); in TEST_F()
482 entry_block->AddInstruction(new (GetAllocator()) HGoto()); in TEST_F()
489 entry_block->AddSuccessor(code_block); in TEST_F()
528 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in TEST_F() local
529 graph->AddBlock(entry_block); in TEST_F()
530 graph->SetEntryBlock(entry_block); in TEST_F()
531 entry_block->AddInstruction(new (GetAllocator()) HGoto()); in TEST_F()
543 graph->SetEntryBlock(entry_block); in TEST_F()
[all …]
Dpc_relative_fixups_x86.cc177 HBasicBlock* entry_block = GetGraph()->GetEntryBlock(); in GetPCRelativeBasePointer() local
178 entry_block->InsertInstructionBefore(method_address, entry_block->GetFirstInstruction()); in GetPCRelativeBasePointer()
Dconstant_folding_test.cc737 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph_); in TEST_F() local
738 graph_->AddBlock(entry_block); in TEST_F()
739 graph_->SetEntryBlock(entry_block); in TEST_F()
745 entry_block->AddSuccessor(block); in TEST_F()
751 entry_block->AddInstruction(parameter); in TEST_F()
752 entry_block->AddInstruction(new (GetAllocator()) HGoto()); in TEST_F()
Dblock_builder.cc470 HBasicBlock* entry_block = new (allocator_) HBasicBlock(graph_, kNoDexPc); in BuildIntrinsic() local
475 graph_->AddBlock(entry_block); in BuildIntrinsic()
478 graph_->SetEntryBlock(entry_block); in BuildIntrinsic()
482 entry_block->AddSuccessor(body); in BuildIntrinsic()
Dsuperblock_cloner.cc273 void SuperblockCloner::FindBackEdgesLocal(HBasicBlock* entry_block, ArenaBitVector* local_set) { in FindBackEdgesLocal() argument
289 visited.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
290 visiting.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
291 worklist.push_back(entry_block); in FindBackEdgesLocal()
1109 for (HBasicBlock* entry_block : entry_blocks) { in IsSubgraphConnected()
1110 if (work_set->IsBitSet(entry_block->GetBlockId())) { in IsSubgraphConnected()
1111 TraverseSubgraphForConnectivity(entry_block, work_set); in IsSubgraphConnected()
Dsuperblock_cloner.h317 void FindBackEdgesLocal(HBasicBlock* entry_block, ArenaBitVector* local_set);