Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dscheduler.cc414 for (const SchedulingNode* predecessor : node->GetDataPredecessors()) { in DumpAsDotNode() local
415 const HInstruction* predecessor_instruction = predecessor->GetInstruction(); in DumpAsDotNode()
417 << "[label=\"" << predecessor->GetLatency() << "\",dir=back]\n"; in DumpAsDotNode()
419 for (const SchedulingNode* predecessor : node->GetOtherPredecessors()) { in DumpAsDotNode() local
420 const HInstruction* predecessor_instruction = predecessor->GetInstruction(); in DumpAsDotNode()
602 for (SchedulingNode* predecessor : scheduling_node->GetDataPredecessors()) { in Schedule()
603 predecessor->MaybeUpdateCriticalPath( in Schedule()
604 path_to_node + predecessor->GetInternalLatency() + predecessor->GetLatency()); in Schedule()
605 predecessor->DecrementNumberOfUnscheduledSuccessors(); in Schedule()
606 if (!predecessor->HasUnscheduledSuccessors()) { in Schedule()
[all …]
Dscheduler.h172 void AddDataPredecessor(SchedulingNode* predecessor) { in AddDataPredecessor() argument
174 if (HasDataDependency(predecessor)) { in AddDataPredecessor()
177 data_predecessors_.push_back(predecessor); in AddDataPredecessor()
178 predecessor->num_unscheduled_successors_++; in AddDataPredecessor()
185 void AddOtherPredecessor(SchedulingNode* predecessor) { in AddOtherPredecessor() argument
189 if (HasOtherDependency(predecessor) || HasDataDependency(predecessor)) { in AddOtherPredecessor()
192 other_predecessors_.push_back(predecessor); in AddOtherPredecessor()
193 predecessor->num_unscheduled_successors_++; in AddOtherPredecessor()
Dnodes.cc444 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in OrderLoopHeaderPredecessors() local
445 if (!info->IsBackEdge(*predecessor)) { in OrderLoopHeaderPredecessors()
447 header->predecessors_[0] = predecessor; in OrderLoopHeaderPredecessors()
461 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in FixControlForNewSinglePreheader() local
462 if (!loop_info->IsBackEdge(*predecessor) && predecessor != new_preheader) { in FixControlForNewSinglePreheader()
463 predecessor->ReplaceSuccessor(header, new_preheader); in FixControlForNewSinglePreheader()
516 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in TransformLoopToSinglePreheaderFormat() local
517 if (!loop_info->IsBackEdge(*predecessor)) { in TransformLoopToSinglePreheaderFormat()
817 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PopulateRecursive()
818 PopulateRecursive(predecessor); in PopulateRecursive()
[all …]
Dgvn.cc142 void IntersectWith(ValueSet* predecessor) { in IntersectWith() argument
145 } else if (predecessor->IsEmpty()) { in IntersectWith()
150 DeleteAllImpureWhich([predecessor](Node* node) { in IntersectWith()
151 return !predecessor->Contains(node->GetInstruction()); in IntersectWith()
473 for (HBasicBlock* predecessor : predecessors) { in VisitBasicBlock()
474 set->IntersectWith(FindSetFor(predecessor)); in VisitBasicBlock()
Dgraph_checker.cc251 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
252 HInstruction* last_instruction = IsExitTryBoundaryIntoExitBlock(predecessor) ? in VisitBasicBlock()
253 predecessor->GetSinglePredecessor()->GetLastInstruction() : in VisitBasicBlock()
254 predecessor->GetLastInstruction(); in VisitBasicBlock()
382 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
383 const HTryBoundary* incoming_try_entry = predecessor->ComputeTryEntryOfSuccessors(); in VisitBasicBlock()
392 predecessor->GetBlockId())); in VisitBasicBlock()
401 predecessor->GetBlockId())); in VisitBasicBlock()
409 predecessor->GetBlockId())); in VisitBasicBlock()
942 HBasicBlock* predecessor = loop_header->GetPredecessors()[i]; in HandleLoop() local
[all …]
Dblock_builder.cc239 for (HBasicBlock* predecessor : catch_block->GetPredecessors()) { in MightHaveLiveNormalPredecessors()
240 DCHECK(!predecessor->IsSingleTryBoundary()) in MightHaveLiveNormalPredecessors()
348 for (HBasicBlock* predecessor : try_block->GetPredecessors()) { in InsertTryBoundaryBlocks()
349 if (GetTryItem(predecessor, try_block_info) != try_item) { in InsertTryBoundaryBlocks()
Dregister_allocation_resolver.cc174 for (HBasicBlock* predecessor : block->GetPredecessors()) { in Resolve()
175 ConnectSplitSiblings(interval, predecessor, block); in Resolve()
189 HBasicBlock* predecessor = block->GetPredecessors()[i]; in Resolve() local
190 DCHECK_EQ(predecessor->GetNormalSuccessors().size(), 1u); in Resolve()
193 predecessor->GetLifetimeEnd() - 1); in Resolve()
195 InsertParallelMoveAtExitOf(predecessor, phi, source, destination); in Resolve()
Dload_store_elimination.cc1675 for (HBasicBlock* predecessor : current_block->GetPredecessors()) { in MaterializeNonLoopPhis()
1676 Value pred_value = ReplacementOrValue(heap_values_for_[predecessor->GetBlockId()][idx].value); in MaterializeNonLoopPhis()
1678 << " pred: " << predecessor->GetBlockId(); in MaterializeNonLoopPhis()
1686 << " pred: " << predecessor->GetBlockId(); in MaterializeNonLoopPhis()
1886 for (HBasicBlock* predecessor : block->GetPredecessors()) { in TryReplacingLoopPhiPlaceholderWithDefault()
1887 Value value = ReplacementOrValue(heap_values_for_[predecessor->GetBlockId()][idx].value); in TryReplacingLoopPhiPlaceholderWithDefault()
1908 for (HBasicBlock* predecessor : block->GetPredecessors()) { in TryReplacingLoopPhiPlaceholderWithDefault()
1915 ValueRecord record = heap_values_for_[predecessor->GetBlockId()][i]; in TryReplacingLoopPhiPlaceholderWithDefault()
1975 for (HBasicBlock* predecessor : current_block->GetPredecessors()) { in TryReplacingLoopPhiPlaceholderWithSingleInput()
1976 Value value = ReplacementOrValue(heap_values_for_[predecessor->GetBlockId()][idx].value); in TryReplacingLoopPhiPlaceholderWithSingleInput()
[all …]
Ddead_code_elimination.cc677 HBasicBlock* predecessor = block->GetSinglePredecessor(); in RemoveTry() local
678 predecessor->ReplaceSuccessor(block, graph_->GetExitBlock()); in RemoveTry()
684 predecessor->AddDominatedBlock(graph_->GetExitBlock()); in RemoveTry()
685 graph_->GetExitBlock()->SetDominator(predecessor); in RemoveTry()
Dssa_liveness_analysis.cc361 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindFirstRegisterHint()
362 size_t position = predecessor->GetLifetimeEnd() - 1; in FindFirstRegisterHint()
Dinliner.cc1991 for (HBasicBlock* predecessor : exit_block->GetPredecessors()) { in CanInlineBody()
1992 const HInstruction* last_instruction = predecessor->GetLastInstruction(); in CanInlineBody()
1996 predecessor = predecessor->GetSinglePredecessor(); in CanInlineBody()
1997 last_instruction = predecessor->GetLastInstruction(); in CanInlineBody()
Dgraph_visualizer.cc279 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PrintPredecessors()
280 output_ << " \"" << namer_.GetName(predecessor) << "\" "; in PrintPredecessors()
Dnodes.h1244 void InsertBetween(HBasicBlock* predecessor, HBasicBlock* successor) { in InsertBetween() argument
1245 size_t predecessor_index = successor->GetPredecessorIndexOf(predecessor); in InsertBetween()
1246 size_t successor_index = predecessor->GetSuccessorIndexOf(successor); in InsertBetween()
1248 predecessor->successors_[successor_index] = this; in InsertBetween()
1250 predecessors_.push_back(predecessor); in InsertBetween()
1280 size_t GetPredecessorIndexOf(HBasicBlock* predecessor) const { in GetPredecessorIndexOf() argument
1281 return IndexOfElement(predecessors_, predecessor); in GetPredecessorIndexOf()
1300 bool IsFirstIndexOfPredecessor(HBasicBlock* predecessor, size_t idx) const { in IsFirstIndexOfPredecessor() argument
1301 DCHECK_EQ(GetPredecessors()[idx], predecessor); in IsFirstIndexOfPredecessor()
1302 return GetPredecessorIndexOf(predecessor) == idx; in IsFirstIndexOfPredecessor()
Dinstruction_builder.cc219 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) { in InitializeBlockLocals()
220 HInstruction* current = ValueOfLocalAt(predecessor, local); in InitializeBlockLocals()
327 for (HBasicBlock* predecessor : block->GetPredecessors()) { in SetLoopHeaderPhiInputs()
328 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/2248-checker-smali-remove-try-until-the-end/smali/
Db_260387991.smali22 # predecessor instead. If this TryBoundary-turned-into-Goto instruction
/art/test/546-regression-simplify-catch/smali/
DTestCase.smali94 # Trivially dead predecessor block.
/art/build/boot/hiddenapi/
Dhiddenapi-max-target-o-low-priority.txt7850 Ljava/util/concurrent/locks/AbstractQueuedSynchronizer$Node;->predecessor()Ljava/util/concurrent/lo…
10459 Ljava/util/TreeMap;->predecessor(Ljava/util/TreeMap$TreeMapEntry;)Ljava/util/TreeMap$TreeMapEntry;
/art/build/boot/
Dboot-image-profile.txt6469 HSPLjava/util/TreeMap;->predecessor(Ljava/util/TreeMap$TreeMapEntry;)Ljava/util/TreeMap$TreeMapEntr…