Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dgraph_test.cc83 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F() local
89 entry_block->AddSuccessor(if_block); in TEST_F()
115 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F() local
121 entry_block->AddSuccessor(if_block); in TEST_F()
147 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F() local
152 entry_block->AddSuccessor(if_block); in TEST_F()
167 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST_F()
179 HBasicBlock* entry_block = CreateEntryBlock(graph); in TEST_F() local
184 entry_block->AddSuccessor(if_block); in TEST_F()
199 ASSERT_EQ(if_block->GetPredecessors()[0], entry_block->GetSingleSuccessor()); in TEST_F()
[all …]
Dgraph_checker_test.cc39 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph); in CreateSimpleCFG() local
40 entry_block->AddInstruction(new (GetAllocator()) HReturnVoid()); in CreateSimpleCFG()
41 graph->AddBlock(entry_block); in CreateSimpleCFG()
42 graph->SetEntryBlock(entry_block); in CreateSimpleCFG()
47 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 …]
Dconstant_folding_test.cc739 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph_); in TEST_F() local
740 graph_->AddBlock(entry_block); in TEST_F()
741 graph_->SetEntryBlock(entry_block); in TEST_F()
747 entry_block->AddSuccessor(block); in TEST_F()
753 entry_block->AddInstruction(parameter); in TEST_F()
754 entry_block->AddInstruction(new (GetAllocator()) HGoto()); in TEST_F()
Dpc_relative_fixups_x86.cc177 HBasicBlock* entry_block = GetGraph()->GetEntryBlock(); in GetPCRelativeBasePointer() local
178 entry_block->InsertInstructionBefore(method_address, entry_block->GetFirstInstruction()); in GetPCRelativeBasePointer()
Dblock_builder.cc457 HBasicBlock* entry_block = new (allocator_) HBasicBlock(graph_, kNoDexPc); in BuildIntrinsic() local
462 graph_->AddBlock(entry_block); in BuildIntrinsic()
465 graph_->SetEntryBlock(entry_block); in BuildIntrinsic()
469 entry_block->AddSuccessor(body); in BuildIntrinsic()
Dsuperblock_cloner.cc273 void SuperblockCloner::FindBackEdgesLocal(HBasicBlock* entry_block, ArenaBitVector* local_set) { in FindBackEdgesLocal() argument
287 visited.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
288 visiting.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
289 worklist.push_back(entry_block); in FindBackEdgesLocal()
1116 for (HBasicBlock* entry_block : entry_blocks) { in IsSubgraphConnected()
1117 if (work_set->IsBitSet(entry_block->GetBlockId())) { in IsSubgraphConnected()
1118 TraverseSubgraphForConnectivity(entry_block, work_set); in IsSubgraphConnected()
Dsuperblock_cloner.h318 void FindBackEdgesLocal(HBasicBlock* entry_block, ArenaBitVector* local_set);