Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dscheduler.cc440 for (const SchedulingNode* predecessor : node->GetDataPredecessors()) { in DumpAsDotNode() local
441 const HInstruction* predecessor_instruction = predecessor->GetInstruction(); in DumpAsDotNode()
443 << "[label=\"" << predecessor->GetLatency() << "\",dir=back]\n"; in DumpAsDotNode()
445 for (const SchedulingNode* predecessor : node->GetOtherPredecessors()) { in DumpAsDotNode() local
446 const HInstruction* predecessor_instruction = predecessor->GetInstruction(); in DumpAsDotNode()
629 for (SchedulingNode* predecessor : scheduling_node->GetDataPredecessors()) { in Schedule()
630 predecessor->MaybeUpdateCriticalPath( in Schedule()
631 path_to_node + predecessor->GetInternalLatency() + predecessor->GetLatency()); in Schedule()
632 predecessor->DecrementNumberOfUnscheduledSuccessors(); in Schedule()
633 if (!predecessor->HasUnscheduledSuccessors()) { in Schedule()
[all …]
Dscheduler.h169 void AddDataPredecessor(SchedulingNode* predecessor) { in AddDataPredecessor() argument
170 data_predecessors_.push_back(predecessor); in AddDataPredecessor()
171 predecessor->num_unscheduled_successors_++; in AddDataPredecessor()
174 void AddOtherPredecessor(SchedulingNode* predecessor) { in AddOtherPredecessor() argument
175 other_predecessors_.push_back(predecessor); in AddOtherPredecessor()
176 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()
603 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()
596 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PopulateRecursive()
597 PopulateRecursive(predecessor); in PopulateRecursive()
633 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PopulateIrreducibleRecursive()
634 PopulateIrreducibleRecursive(predecessor, finalized); in PopulateIrreducibleRecursive()
[all …]
Dblock_builder.cc226 for (HBasicBlock* predecessor : catch_block->GetPredecessors()) { in MightHaveLiveNormalPredecessors()
227 DCHECK(!predecessor->IsSingleTryBoundary()) in MightHaveLiveNormalPredecessors()
327 for (HBasicBlock* predecessor : try_block->GetPredecessors()) { in InsertTryBoundaryBlocks()
328 if (GetTryItem(predecessor, try_block_info) != try_item) { in InsertTryBoundaryBlocks()
Dload_store_elimination.cc205 for (HBasicBlock* predecessor : predecessors) { in MergePredecessorValues()
206 HInstruction* pred_value = heap_values_for_[predecessor->GetBlockId()][i]; in MergePredecessorValues()
208 !singleton_ref->GetBlock()->Dominates(predecessor)) { in MergePredecessorValues()
229 for (HBasicBlock* predecessor : predecessors) { in MergePredecessorValues()
230 ArenaVector<HInstruction*>& pred_values = heap_values_for_[predecessor->GetBlockId()]; in MergePredecessorValues()
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()
Dssa_liveness_analysis.cc343 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindFirstRegisterHint()
344 size_t position = predecessor->GetLifetimeEnd() - 1; in FindFirstRegisterHint()
Dgraph_visualizer.cc268 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PrintPredecessors()
269 output_ << " \"B" << predecessor->GetBlockId() << "\" "; in PrintPredecessors()
Dnodes.h1035 void InsertBetween(HBasicBlock* predecessor, HBasicBlock* successor) { in InsertBetween() argument
1036 size_t predecessor_index = successor->GetPredecessorIndexOf(predecessor); in InsertBetween()
1037 size_t successor_index = predecessor->GetSuccessorIndexOf(successor); in InsertBetween()
1039 predecessor->successors_[successor_index] = this; in InsertBetween()
1041 predecessors_.push_back(predecessor); in InsertBetween()
1071 size_t GetPredecessorIndexOf(HBasicBlock* predecessor) const { in GetPredecessorIndexOf() argument
1072 return IndexOfElement(predecessors_, predecessor); in GetPredecessorIndexOf()
1091 bool IsFirstIndexOfPredecessor(HBasicBlock* predecessor, size_t idx) const { in IsFirstIndexOfPredecessor() argument
1092 DCHECK_EQ(GetPredecessors()[idx], predecessor); in IsFirstIndexOfPredecessor()
1093 return GetPredecessorIndexOf(predecessor) == idx; in IsFirstIndexOfPredecessor()
Dinstruction_builder.cc137 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) { in InitializeBlockLocals()
138 HInstruction* current = ValueOfLocalAt(predecessor, local); in InitializeBlockLocals()
245 for (HBasicBlock* predecessor : block->GetPredecessors()) { in SetLoopHeaderPhiInputs()
246 HInstruction* value = ValueOfLocalAt(predecessor, vreg); in SetLoopHeaderPhiInputs()
Dinliner.cc1748 for (HBasicBlock* predecessor : exit_block->GetPredecessors()) { in TryBuildAndInlineHelper()
1749 if (predecessor->GetLastInstruction()->IsThrow()) { in TryBuildAndInlineHelper()
Dregister_allocator_graph_color.cc1315 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindCoalesceOpportunities()
1316 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.