Searched refs:GetEntryBlock (Results 1 – 21 of 21) sorted by relevance
120 const HBasicBlock* cur_block = graph_->GetEntryBlock(); in Prune()142 DCHECK_GE(last_succ_seen[graph_->GetEntryBlock()->GetBlockId()], in Prune()143 static_cast<ssize_t>(graph_->GetEntryBlock()->GetSuccessors().size())); in Prune()161 ssize_t num_entry_succ = graph_->GetEntryBlock()->GetSuccessors().size(); in Prune()164 const uint32_t entry_block_id = graph_->GetEntryBlock()->GetBlockId(); in Prune()168 DCHECK((current_path.empty() && cur_block == graph_->GetEntryBlock()) || in Prune()169 current_path.front() == graph_->GetEntryBlock()->GetBlockId()) in Prune()172 << graph_->GetEntryBlock()->GetBlockId(); in Prune()230 blk != graph_->GetEntryBlock()) { in Prune()
38 HBasicBlock* first_block = graph->GetEntryBlock()->GetSingleSuccessor(); in TestCode()
62 return b == graph_->GetEntryBlock() || b == nullptr || b->GetDominator() != nullptr; in TEST_F()118 return b == graph_->GetEntryBlock() || b == nullptr || b->GetDominator() != nullptr; in TEST_F()
105 graph->GetExitBlock()->RemovePredecessor(graph->GetEntryBlock()); in TEST_F()
112 worklist.push_back(graph->GetEntryBlock()); in LinearizeGraphInternal()
35 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); in MarkReachableBlocks()36 worklist.push_back(graph->GetEntryBlock()); in MarkReachableBlocks()
147 HBasicBlock* block = graph_->GetEntryBlock(); in ConnectBasicBlocks()250 DCHECK(!graph_->GetEntryBlock()->GetSuccessors().empty()) in MightHaveLiveNormalPredecessors()
177 HBasicBlock* entry_block = GetGraph()->GetEntryBlock(); in GetPCRelativeBasePointer()
456 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()
48 if (instruction->GetBlock() == instruction->GetBlock()->GetGraph()->GetEntryBlock()) { in IsInterestingInstruction()
414 sets_[graph_->GetEntryBlock()->GetBlockId()] = new (&allocator_) ValueSet(&allocator_); in Run()
445 LiveInterval* unhandled = graph->GetEntryBlock()->GetFirstInstruction()->GetLiveInterval(); in TEST_F()451 graph->GetEntryBlock()->GetFirstInstruction()); in TEST_F()
529 graph_->GetEntryBlock()->AddInstruction(val);
49 worklist.push(graph->GetEntryBlock()); in CalculateValidity()
831 GetGraph()->GetEntryBlock()->GetBlockId()); in DumpDisassemblyBlockForFrameEntry()
331 block_entry = graph_->GetEntryBlock(); in RecalculateBackEdgesInfo()
472 DCHECK(block_order[0] == GetGraph()->GetEntryBlock()); in InitializeCodeGeneration()
1711 for (HInstructionIterator instructions(callee_graph->GetEntryBlock()->GetInstructions()); in SubstituteArguments()
695 if (number_of_incomings != 1 || (GetEntryBlock()->GetSingleSuccessor() == header)) { in SimplifyLoop()
456 current_block_ = graph_->GetEntryBlock(); in BuildIntrinsic()
448 HBasicBlock* GetEntryBlock() const { return entry_block_; } in GetEntryBlock() function1121 return graph_->GetEntryBlock() == this; in IsEntryBlock()