| /art/compiler/optimizing/ |
| D | scheduler.h | 171 void AddDataPredecessor(SchedulingNode* predecessor) { in AddDataPredecessor() argument
173 if (HasDataDependency(predecessor)) { in AddDataPredecessor()
176 data_predecessors_.push_back(predecessor); in AddDataPredecessor()
177 predecessor->num_unscheduled_successors_++; in AddDataPredecessor()
184 void AddOtherPredecessor(SchedulingNode* predecessor) { in AddOtherPredecessor() argument
188 if (HasOtherDependency(predecessor) || HasDataDependency(predecessor)) { in AddOtherPredecessor()
191 other_predecessors_.push_back(predecessor); in AddOtherPredecessor()
192 predecessor->num_unscheduled_successors_++; in AddOtherPredecessor()
|
| D | scheduler.cc | 442 for (const SchedulingNode* predecessor : node->GetDataPredecessors()) { in DumpAsDotNode() local
443 const HInstruction* predecessor_instruction = predecessor->GetInstruction(); in DumpAsDotNode()
445 << "[label=\"" << predecessor->GetLatency() << "\",dir=back]\n"; in DumpAsDotNode()
447 for (const SchedulingNode* predecessor : node->GetOtherPredecessors()) { in DumpAsDotNode() local
448 const HInstruction* predecessor_instruction = predecessor->GetInstruction(); in DumpAsDotNode()
639 for (SchedulingNode* predecessor : scheduling_node->GetDataPredecessors()) { in Schedule()
640 predecessor->MaybeUpdateCriticalPath( in Schedule()
641 path_to_node + predecessor->GetInternalLatency() + predecessor->GetLatency()); in Schedule()
642 predecessor->DecrementNumberOfUnscheduledSuccessors(); in Schedule()
643 if (!predecessor->HasUnscheduledSuccessors()) { in Schedule()
[all …]
|
| D | graph_checker.cc | 149 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
150 HInstruction* last_instruction = IsExitTryBoundaryIntoExitBlock(predecessor) ? in VisitBasicBlock()
151 predecessor->GetSinglePredecessor()->GetLastInstruction() : in VisitBasicBlock()
152 predecessor->GetLastInstruction(); in VisitBasicBlock()
255 for (HBasicBlock* predecessor : block->GetPredecessors()) { in VisitBasicBlock()
256 const HTryBoundary* incoming_try_entry = predecessor->ComputeTryEntryOfSuccessors(); in VisitBasicBlock()
265 predecessor->GetBlockId())); in VisitBasicBlock()
274 predecessor->GetBlockId())); in VisitBasicBlock()
282 predecessor->GetBlockId())); in VisitBasicBlock()
699 HBasicBlock* predecessor = loop_header->GetPredecessors()[i]; in HandleLoop() local
[all …]
|
| D | nodes.cc | 392 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in OrderLoopHeaderPredecessors() local
393 if (!info->IsBackEdge(*predecessor)) { in OrderLoopHeaderPredecessors()
395 header->predecessors_[0] = predecessor; in OrderLoopHeaderPredecessors()
409 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in FixControlForNewSinglePreheader() local
410 if (!loop_info->IsBackEdge(*predecessor) && predecessor != new_preheader) { in FixControlForNewSinglePreheader()
411 predecessor->ReplaceSuccessor(header, new_preheader); in FixControlForNewSinglePreheader()
464 HBasicBlock* predecessor = header->GetPredecessors()[pred]; in TransformLoopToSinglePreheaderFormat() local
465 if (!loop_info->IsBackEdge(*predecessor)) { in TransformLoopToSinglePreheaderFormat()
759 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PopulateRecursive()
760 PopulateRecursive(predecessor); in PopulateRecursive()
[all …]
|
| D | gvn.cc | 142 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()
461 for (HBasicBlock* predecessor : predecessors) { in VisitBasicBlock()
462 set->IntersectWith(FindSetFor(predecessor)); in VisitBasicBlock()
|
| D | block_builder.cc | 252 for (HBasicBlock* predecessor : catch_block->GetPredecessors()) { in MightHaveLiveNormalPredecessors()
253 DCHECK(!predecessor->IsSingleTryBoundary()) in MightHaveLiveNormalPredecessors()
361 for (HBasicBlock* predecessor : try_block->GetPredecessors()) { in InsertTryBoundaryBlocks()
362 if (GetTryItem(predecessor, try_block_info) != try_item) { in InsertTryBoundaryBlocks()
|
| D | register_allocation_resolver.cc | 174 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()
|
| D | load_store_elimination.cc | 422 for (HBasicBlock* predecessor : predecessors) { in MergePredecessorValues()
423 HInstruction* pred_value = heap_values_for_[predecessor->GetBlockId()][i]; in MergePredecessorValues()
430 !singleton_ref->GetBlock()->Dominates(predecessor)) { in MergePredecessorValues()
479 for (HBasicBlock* predecessor : predecessors) { in MergePredecessorValues()
481 heap_values_for_[predecessor->GetBlockId()]; in MergePredecessorValues()
|
| D | ssa_liveness_analysis.cc | 361 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindFirstRegisterHint()
362 size_t position = predecessor->GetLifetimeEnd() - 1; in FindFirstRegisterHint()
|
| D | graph_visualizer.cc | 255 for (HBasicBlock* predecessor : block->GetPredecessors()) { in PrintPredecessors()
256 output_ << " \"B" << predecessor->GetBlockId() << "\" "; in PrintPredecessors()
|
| D | nodes.h | 1131 void InsertBetween(HBasicBlock* predecessor, HBasicBlock* successor) { in InsertBetween() argument
1132 size_t predecessor_index = successor->GetPredecessorIndexOf(predecessor); in InsertBetween()
1133 size_t successor_index = predecessor->GetSuccessorIndexOf(successor); in InsertBetween()
1135 predecessor->successors_[successor_index] = this; in InsertBetween()
1137 predecessors_.push_back(predecessor); in InsertBetween()
1167 size_t GetPredecessorIndexOf(HBasicBlock* predecessor) const { in GetPredecessorIndexOf() argument
1168 return IndexOfElement(predecessors_, predecessor); in GetPredecessorIndexOf()
1187 bool IsFirstIndexOfPredecessor(HBasicBlock* predecessor, size_t idx) const { in IsFirstIndexOfPredecessor() argument
1188 DCHECK_EQ(GetPredecessors()[idx], predecessor); in IsFirstIndexOfPredecessor()
1189 return GetPredecessorIndexOf(predecessor) == idx; in IsFirstIndexOfPredecessor()
|
| D | instruction_builder.cc | 181 for (HBasicBlock* predecessor : current_block_->GetPredecessors()) { in InitializeBlockLocals()
182 HInstruction* current = ValueOfLocalAt(predecessor, local); in InitializeBlockLocals()
289 for (HBasicBlock* predecessor : block->GetPredecessors()) { in SetLoopHeaderPhiInputs()
290 HInstruction* value = ValueOfLocalAt(predecessor, vreg); in SetLoopHeaderPhiInputs()
|
| D | register_allocator_graph_color.cc | 1340 for (HBasicBlock* predecessor : block->GetPredecessors()) { in FindCoalesceOpportunities()
1341 size_t position = predecessor->GetLifetimeEnd() - 1; in FindCoalesceOpportunities()
|
| D | inliner.cc | 1873 for (HBasicBlock* predecessor : exit_block->GetPredecessors()) { in CanInlineBody()
1874 if (predecessor->GetLastInstruction()->IsThrow()) { in CanInlineBody()
|
| /art/test/509-pre-header/ |
| D | info.txt | 3 first predecessor was not preserved.
|
| /art/tools/class2greylist/src/com/android/class2greylist/ |
| D | MemberDumpingVisitor.java | 44 (JavaClass) mDescendingVisitor.predecessor(), member, in visitMember()
|
| D | AnnotationVisitor.java | 78 (JavaClass) mDescendingVisitor.predecessor(), member, in visitMember()
|
| /art/test/509-pre-header/smali/ |
| D | PreHeader.smali | 22 # is the first predecessor of the loop header.
|
| /art/test/546-regression-simplify-catch/smali/ |
| D | TestCase.smali | 94 # Trivially dead predecessor block.
|