Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dscheduler.cc245 for (const SchedulingNode* predecessor : node->GetDataPredecessors()) { in DumpAsDotNode() local
246 const HInstruction* predecessor_instruction = predecessor->GetInstruction(); in DumpAsDotNode()
248 << "[label=\"" << predecessor->GetLatency() << "\",dir=back]\n"; in DumpAsDotNode()
250 for (const SchedulingNode* predecessor : node->GetOtherPredecessors()) { in DumpAsDotNode() local
251 const HInstruction* predecessor_instruction = predecessor->GetInstruction(); in DumpAsDotNode()
421 for (SchedulingNode* predecessor : scheduling_node->GetDataPredecessors()) { in Schedule()
422 predecessor->MaybeUpdateCriticalPath( in Schedule()
423 path_to_node + predecessor->GetInternalLatency() + predecessor->GetLatency()); in Schedule()
424 predecessor->DecrementNumberOfUnscheduledSuccessors(); in Schedule()
425 if (!predecessor->HasUnscheduledSuccessors()) { in Schedule()
[all …]
Dscheduler.h167 void AddDataPredecessor(SchedulingNode* predecessor) { in AddDataPredecessor() argument
168 data_predecessors_.push_back(predecessor); in AddDataPredecessor()
169 predecessor->num_unscheduled_successors_++; in AddDataPredecessor()
172 void AddOtherPredecessor(SchedulingNode* predecessor) { in AddOtherPredecessor() argument
173 other_predecessors_.push_back(predecessor); in AddOtherPredecessor()
174 predecessor->num_unscheduled_successors_++; in AddOtherPredecessor()
Dgraph_checker.cc108 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
109 HInstruction* last_instruction = IsExitTryBoundaryIntoExitBlock(predecessor) ? in VisitBasicBlock()
110 predecessor->GetSinglePredecessor()->GetLastInstruction() : in VisitBasicBlock()
111 predecessor->GetLastInstruction(); in VisitBasicBlock()
214 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
215 const HTryBoundary* incoming_try_entry = predecessor->ComputeTryEntryOfSuccessors(); in VisitBasicBlock()
224 predecessor->GetBlockId())); in VisitBasicBlock()
233 predecessor->GetBlockId())); in VisitBasicBlock()
241 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()
Dnodes.cc345 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in SimplifyLoop() local
346 if (!info->IsBackEdge(*predecessor)) { in SimplifyLoop()
347 predecessor->ReplaceSuccessor(header, pre_header); in SimplifyLoop()
358 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in SimplifyLoop() local
359 if (!info->IsBackEdge(*predecessor)) { in SimplifyLoop()
361 header->predecessors_[0] = predecessor; in SimplifyLoop()
587 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PopulateRecursive()
588 PopulateRecursive(predecessor); in PopulateRecursive()
624 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PopulateIrreducibleRecursive()
625 PopulateIrreducibleRecursive(predecessor, finalized); in PopulateIrreducibleRecursive()
[all …]
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()
Dregister_allocation_resolver.cc171 for (HBasicBlock* predecessor : block->GetPredecessors()) { in Resolve()
172 ConnectSplitSiblings(interval, predecessor, block); in Resolve()
186 HBasicBlock* predecessor = block->GetPredecessors()[i]; in Resolve() local
187 DCHECK_EQ(predecessor->GetNormalSuccessors().size(), 1u); in Resolve()
190 predecessor->GetLifetimeEnd() - 1); in Resolve()
192 InsertParallelMoveAtExitOf(predecessor, phi, source, destination); in Resolve()
Dload_store_elimination.cc669 for (HBasicBlock* predecessor : predecessors) { in MergePredecessorValues()
670 HInstruction* pred_value = heap_values_for_[predecessor->GetBlockId()][i]; in MergePredecessorValues()
672 !singleton_ref->GetBlock()->Dominates(predecessor)) { in MergePredecessorValues()
693 for (HBasicBlock* predecessor : predecessors) { in MergePredecessorValues()
694 ArenaVector<HInstruction*>& pred_values = heap_values_for_[predecessor->GetBlockId()]; in MergePredecessorValues()
Dssa_liveness_analysis.cc343 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindFirstRegisterHint()
344 size_t position = predecessor->GetLifetimeEnd() - 1; in FindFirstRegisterHint()
Dgraph_visualizer.cc260 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PrintPredecessors()
261 output_ << " \"B" << predecessor->GetBlockId() << "\" "; in PrintPredecessors()
Dnodes.h1027 void InsertBetween(HBasicBlock* predecessor, HBasicBlock* successor) { in InsertBetween() argument
1028 size_t predecessor_index = successor->GetPredecessorIndexOf(predecessor); in InsertBetween()
1029 size_t successor_index = predecessor->GetSuccessorIndexOf(successor); in InsertBetween()
1031 predecessor->successors_[successor_index] = this; in InsertBetween()
1033 predecessors_.push_back(predecessor); in InsertBetween()
1063 size_t GetPredecessorIndexOf(HBasicBlock* predecessor) const { in GetPredecessorIndexOf() argument
1064 return IndexOfElement(predecessors_, predecessor); in GetPredecessorIndexOf()
1083 bool IsFirstIndexOfPredecessor(HBasicBlock* predecessor, size_t idx) const { in IsFirstIndexOfPredecessor() argument
1084 DCHECK_EQ(GetPredecessors()[idx], predecessor); in IsFirstIndexOfPredecessor()
1085 return GetPredecessorIndexOf(predecessor) == idx; in IsFirstIndexOfPredecessor()
Dinstruction_builder.cc136 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) { in InitializeBlockLocals()
137 HInstruction* current = ValueOfLocalAt(predecessor, local); in InitializeBlockLocals()
244 for (HBasicBlock* predecessor : block->GetPredecessors()) { in SetLoopHeaderPhiInputs()
245 HInstruction* value = ValueOfLocalAt(predecessor, vreg); in SetLoopHeaderPhiInputs()
Dinliner.cc1732 for (HBasicBlock* predecessor : exit_block->GetPredecessors()) { in TryBuildAndInlineHelper()
1733 if (predecessor->GetLastInstruction()->IsThrow()) { in TryBuildAndInlineHelper()
Dregister_allocator_graph_color.cc1317 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindCoalesceOpportunities()
1318 size_t position = predecessor->GetLifetimeEnd() - 1; in FindCoalesceOpportunities()
/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.