Home
last modified time | relevance | path

Searched refs:predecessor (Results 1 – 13 of 13) sorted by relevance

/art/compiler/optimizing/
Dnodes.cc349 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in SimplifyLoop() local
350 if (!info->IsBackEdge(*predecessor)) { in SimplifyLoop()
351 predecessor->ReplaceSuccessor(header, pre_header); in SimplifyLoop()
362 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in SimplifyLoop() local
363 if (!info->IsBackEdge(*predecessor)) { in SimplifyLoop()
365 header->predecessors_[0] = predecessor; in SimplifyLoop()
593 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PopulateRecursive()
594 PopulateRecursive(predecessor); in PopulateRecursive()
630 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PopulateIrreducibleRecursive()
631 PopulateIrreducibleRecursive(predecessor, finalized); in PopulateIrreducibleRecursive()
[all …]
Dgraph_checker.cc106 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
107 HInstruction* last_instruction = IsExitTryBoundaryIntoExitBlock(predecessor) ? in VisitBasicBlock()
108 predecessor->GetSinglePredecessor()->GetLastInstruction() : in VisitBasicBlock()
109 predecessor->GetLastInstruction(); in VisitBasicBlock()
212 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
213 const HTryBoundary* incoming_try_entry = predecessor->ComputeTryEntryOfSuccessors(); in VisitBasicBlock()
222 predecessor->GetBlockId())); in VisitBasicBlock()
231 predecessor->GetBlockId())); in VisitBasicBlock()
239 predecessor->GetBlockId())); in VisitBasicBlock()
597 HBasicBlock* predecessor = loop_header->GetPredecessors()[i]; in HandleLoop() local
[all …]
Dgvn.cc143 void IntersectWith(ValueSet* predecessor) { in IntersectWith() argument
146 } else if (predecessor->IsEmpty()) { in IntersectWith()
151 DeleteAllImpureWhich([predecessor](Node* node) { in IntersectWith()
152 return !predecessor->Contains(node->GetInstruction()); in IntersectWith()
471 for (HBasicBlock* predecessor : predecessors) { in VisitBasicBlock()
472 set->IntersectWith(FindSetFor(predecessor)); in VisitBasicBlock()
Dblock_builder.cc216 for (HBasicBlock* predecessor : catch_block->GetPredecessors()) { in MightHaveLiveNormalPredecessors()
217 DCHECK(!predecessor->IsSingleTryBoundary()) in MightHaveLiveNormalPredecessors()
315 for (HBasicBlock* predecessor : try_block->GetPredecessors()) { in InsertTryBoundaryBlocks()
316 if (GetTryItem(predecessor, try_block_info) != entry.second) { in InsertTryBoundaryBlocks()
Dssa_liveness_analysis.cc396 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindFirstRegisterHint()
397 size_t position = predecessor->GetLifetimeEnd() - 1; in FindFirstRegisterHint()
Dregister_allocator.cc1945 for (HBasicBlock* predecessor : block->GetPredecessors()) { in Resolve()
1946 ConnectSplitSiblings(interval, predecessor, block); in Resolve()
1961 HBasicBlock* predecessor = current->GetPredecessors()[i]; in Resolve() local
1962 DCHECK_EQ(predecessor->GetNormalSuccessors().size(), 1u); in Resolve()
1965 predecessor->GetLifetimeEnd() - 1); in Resolve()
1967 InsertParallelMoveAtExitOf(predecessor, phi, source, destination); in Resolve()
Dgraph_visualizer.cc257 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PrintPredecessors()
258 output_ << " \"B" << predecessor->GetBlockId() << "\" "; in PrintPredecessors()
Dnodes.h934 void InsertBetween(HBasicBlock* predecessor, HBasicBlock* successor) { in InsertBetween() argument
935 size_t predecessor_index = successor->GetPredecessorIndexOf(predecessor); in InsertBetween()
936 size_t successor_index = predecessor->GetSuccessorIndexOf(successor); in InsertBetween()
938 predecessor->successors_[successor_index] = this; in InsertBetween()
940 predecessors_.push_back(predecessor); in InsertBetween()
970 size_t GetPredecessorIndexOf(HBasicBlock* predecessor) const { in GetPredecessorIndexOf() argument
971 return IndexOfElement(predecessors_, predecessor); in GetPredecessorIndexOf()
990 bool IsFirstIndexOfPredecessor(HBasicBlock* predecessor, size_t idx) const { in IsFirstIndexOfPredecessor() argument
991 DCHECK_EQ(GetPredecessors()[idx], predecessor); in IsFirstIndexOfPredecessor()
992 return GetPredecessorIndexOf(predecessor) == idx; in IsFirstIndexOfPredecessor()
Dinliner.cc1160 for (HBasicBlock* predecessor : exit_block->GetPredecessors()) { in TryBuildAndInlineHelper()
1161 if (predecessor->GetLastInstruction()->IsThrow()) { in TryBuildAndInlineHelper()
Dinstruction_builder.cc125 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) { in InitializeBlockLocals()
126 HInstruction* current = ValueOfLocalAt(predecessor, local); in InitializeBlockLocals()
235 for (HBasicBlock* predecessor : block->GetPredecessors()) { in SetLoopHeaderPhiInputs()
236 HInstruction* value = ValueOfLocalAt(predecessor, vreg); in SetLoopHeaderPhiInputs()
/art/test/509-pre-header/
Dinfo.txt3 first predecessor was not preserved.
/art/test/509-pre-header/smali/
DPreHeader.smali22 # is the first predecessor of the loop header.
/art/test/546-regression-simplify-catch/smali/
DTestCase.smali94 # Trivially dead predecessor block.