Home
last modified time | relevance | path

Searched refs:GetEntryBlock (Results 1 – 17 of 17) sorted by relevance

/art/compiler/optimizing/
Dsuspend_check_test.cc38 HBasicBlock* first_block = graph->GetEntryBlock()->GetSingleSuccessor(); in TestCode()
Dlinear_order.cc112 worklist.push_back(graph->GetEntryBlock()); in LinearizeGraphInternal()
Dgraph_checker_test.cc105 graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock()); in TEST_F()
Dblock_builder.cc147 HBasicBlock* block = graph_->GetEntryBlock(); in ConnectBasicBlocks()
250 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty()) in MightHaveLiveNormalPredecessors()
Ddead_code_elimination.cc35 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); in MarkReachableBlocks()
36 worklist.push_back(graph->GetEntryBlock()); in MarkReachableBlocks()
Dpc_relative_fixups_x86.cc177 HBasicBlock* entry_block = GetGraph()->GetEntryBlock(); in GetPCRelativeBasePointer()
Dcodegen_test.cc456 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
502 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
571 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
Dcode_sinking.cc48 if (instruction->GetBlock() == instruction->GetBlock()->GetGraph()->GetEntryBlock()) { in IsInterestingInstruction()
Dgvn.cc414 sets_[graph_->GetEntryBlock()->GetBlockId()] = new (&allocator_) ValueSet(&allocator_); in Run()
Dregister_allocator_test.cc445 LiveInterval* unhandled = graph->GetEntryBlock()->GetFirstInstruction()->GetLiveInterval(); in TEST_F()
451 graph->GetEntryBlock()->GetFirstInstruction()); in TEST_F()
Dgraph_visualizer.cc778 GetGraph()->GetEntryBlock()->GetBlockId()); in DumpDisassemblyBlockForFrameEntry()
Dsuperblock_cloner.cc331 block_entry = graph_->GetEntryBlock(); in RecalculateBackEdgesInfo()
Dcode_generator.cc471 DCHECK(block_order[0] == GetGraph()->GetEntryBlock()); in InitializeCodeGeneration()
Dinliner.cc1808 for (HInstructionIterator instructions(callee_graph->GetEntryBlock()->GetInstructions()); in SubstituteArguments()
Dnodes.cc521 if (number_of_incomings != 1 || (GetEntryBlock()->GetSingleSuccessor() == header)) { in SimplifyLoop()
Dinstruction_builder.cc424 current_block_ = graph_->GetEntryBlock(); in BuildIntrinsic()
Dnodes.h433 HBasicBlock* GetEntryBlock() const { return entry_block_; } in GetEntryBlock() function
1081 return graph_->GetEntryBlock() == this; in IsEntryBlock()