Searched refs:GetEntryBlock (Results 1 – 18 of 18) sorted by relevance
38 HBasicBlock* first_block = graph->GetEntryBlock()->GetSingleSuccessor(); in TestCode()
56 HBasicBlock* entry_block = GetGraph()->GetEntryBlock(); in InitializePCRelativeBasePointer()
105 graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock()); in TEST_F()
112 worklist.push_back(graph->GetEntryBlock()); in LinearizeGraphInternal()
147 HBasicBlock* block = graph_->GetEntryBlock(); in ConnectBasicBlocks()250 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty()) in MightHaveLiveNormalPredecessors()
35 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); in MarkReachableBlocks()36 worklist.push_back(graph->GetEntryBlock()); in MarkReachableBlocks()
177 HBasicBlock* entry_block = GetGraph()->GetEntryBlock(); in GetPCRelativeBasePointer()
460 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()507 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()575 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors()[0]; in TEST_F()
48 if (instruction->GetBlock() == instruction->GetBlock()->GetGraph()->GetEntryBlock()) { in IsInterestingInstruction()
399 sets_[graph_->GetEntryBlock()->GetBlockId()] = new (&allocator_) ValueSet(&allocator_); in Run()
443 LiveInterval* unhandled = graph->GetEntryBlock()->GetFirstInstruction()->GetLiveInterval(); in TEST_F()449 graph->GetEntryBlock()->GetFirstInstruction()); in TEST_F()
775 GetGraph()->GetEntryBlock()->GetBlockId()); in DumpDisassemblyBlockForFrameEntry()
297 block_entry = graph_->GetEntryBlock(); in RecalculateBackEdgesInfo()
476 DCHECK(block_order[0] == GetGraph()->GetEntryBlock()); in InitializeCodeGeneration()
1860 for (HInstructionIterator instructions(callee_graph->GetEntryBlock()->GetInstructions()); in TryBuildAndInlineHelper()
522 if (number_of_incomings != 1 || (GetEntryBlock()->GetSingleSuccessor() == header)) { in SimplifyLoop()
417 current_block_ = graph_->GetEntryBlock(); in BuildIntrinsic()
372 HBasicBlock* GetEntryBlock() const { return entry_block_; } in GetEntryBlock() function1008 return graph_->GetEntryBlock() == this; in IsEntryBlock()