Searched refs:successor (Results 1 – 11 of 11) sorted by relevance
59 HBasicBlock* successor = block->GetSuccessors().Get(i); in VisitBlockForBackEdges() local60 if (visiting->IsBitSet(successor->GetBlockId())) { in VisitBlockForBackEdges()61 successor->AddBackEdge(block); in VisitBlockForBackEdges()63 VisitBlockForBackEdges(successor, visited, visiting); in VisitBlockForBackEdges()140 void HGraph::SplitCriticalEdge(HBasicBlock* block, HBasicBlock* successor) { in SplitCriticalEdge() argument146 block->ReplaceSuccessor(successor, new_block); in SplitCriticalEdge()147 new_block->AddSuccessor(successor); in SplitCriticalEdge()148 if (successor->IsLoopHeader()) { in SplitCriticalEdge()150 HLoopInformation* info = successor->GetLoopInformation(); in SplitCriticalEdge()207 HBasicBlock* successor = block->GetSuccessors().Get(j); in SimplifyCFG() local[all …]
176 HBasicBlock* successor = block->GetSuccessors().Get(i); in ComputeLiveRanges() local177 live_in->Union(GetLiveInSet(*successor)); in ComputeLiveRanges()178 size_t phi_input_index = successor->GetPredecessorIndexOf(block); in ComputeLiveRanges()179 for (HInstructionIterator it(successor->GetPhis()); !it.Done(); it.Advance()) { in ComputeLiveRanges()278 HBasicBlock* successor = block.GetSuccessors().Get(i); in UpdateLiveOut() local279 if (live_out->Union(GetLiveInSet(*successor))) { in UpdateLiveOut()
98 HBasicBlock* successor = block->GetSuccessors().Get(i); in PrintSuccessors() local99 output_ << " \"B" << successor->GetBlockId() << "\" "; in PrintSuccessors()
367 HBasicBlock* successor = got->GetSuccessor(); in VisitGoto() local368 if (GetGraph()->GetExitBlock() == successor) { in VisitGoto()370 } else if (!codegen_->GoesToNextBlock(got->GetBlock(), successor)) { in VisitGoto()371 __ jmp(codegen_->GetLabelOf(successor)); in VisitGoto()
103 void SplitCriticalEdge(HBasicBlock* block, HBasicBlock* successor);343 size_t GetSuccessorIndexOf(HBasicBlock* successor) { in GetSuccessorIndexOf() argument345 if (successors_.Get(i) == successor) { in GetSuccessorIndexOf()
528 HBasicBlock* successor = got->GetSuccessor(); in VisitGoto() local529 if (GetGraph()->GetExitBlock() == successor) { in VisitGoto()531 } else if (!codegen_->GoesToNextBlock(got->GetBlock(), successor)) { in VisitGoto()532 __ b(codegen_->GetLabelOf(successor)); in VisitGoto()
486 HBasicBlock* successor = got->GetSuccessor(); in VisitGoto() local487 if (GetGraph()->GetExitBlock() == successor) { in VisitGoto()489 } else if (!codegen_->GoesToNextBlock(got->GetBlock(), successor)) { in VisitGoto()490 __ jmp(codegen_->GetLabelOf(successor)); in VisitGoto()
47 void AddSuccessor(Region* successor);
221 void AddSuccessor(Region* successor) { in AddSuccessor() argument222 DCHECK(successor) << "Tried to add NULL successor to SEA node."; in AddSuccessor()223 successors_.push_back(successor); in AddSuccessor()
383 Region* successor = (*successors_it); in RenameAsSSA() local384 successor->SetPhiDefinitionsForUses(scoped_table, crt_region); in RenameAsSSA()
1756 BasicBlock* successor = succIter.Next(); in ComputeTopologicalSortOrder() local1757 for ( ; successor != nullptr; successor = succIter.Next()) { in ComputeTopologicalSortOrder()1758 if (successor->hidden) { in ComputeTopologicalSortOrder()1763 visited_cnt_values[successor->id] += 1u; in ComputeTopologicalSortOrder()1764 if (visited_cnt_values[successor->id] == successor->predecessors->Size()) { in ComputeTopologicalSortOrder()1766 loop_head_reachable_from[loop_head_stack.back()]->IsBitSet(successor->id)) { in ComputeTopologicalSortOrder()1767 q.push(successor); in ComputeTopologicalSortOrder()1769 DCHECK(!loop_exit_blocks.IsBitSet(successor->id)); in ComputeTopologicalSortOrder()1770 loop_exit_blocks.SetBit(successor->id); in ComputeTopologicalSortOrder()