Home
last modified time | relevance | path

Searched refs:SUnits (Results 1 – 25 of 78) sorted by relevance

1234

/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.cpp199 NodeNum2Index[SU->NodeNum] = SUnits.size(); in addUnit()
200 SUnits.push_back(SU); in addUnit()
294 for (SUnit* SU : SUnits) { in fastSchedule()
412 for (SUnit* SU : SUnits) { in schedule()
430 assert(SUnits.size() == ScheduledSUnits.size() && in schedule()
432 for (SUnit* SU : SUnits) { in schedule()
442 for (SUnit* SU : SUnits) { in undoSchedule()
449 HasLowLatencyNonWaitedParent.assign(SUnits.size(), 0); in undoSchedule()
488 if (SuccSU->NodeNum >= DAG->SUnits.size()) in releaseSuccessors()
514 HasLowLatencyNonWaitedParent.assign(SUnits.size(), 0); in nodeScheduled()
[all …]
DGCNMinRegStrategy.cpp67 void initNumPreds(const decltype(ScheduleDAG::SUnits) &SUnits);
87 void GCNMinRegScheduler::initNumPreds(const decltype(ScheduleDAG::SUnits) &SUnits) { in initNumPreds() argument
88 NumPreds.resize(SUnits.size()); in initNumPreds()
89 for (unsigned I = 0; I < SUnits.size(); ++I) in initNumPreds()
90 NumPreds[I] = SUnits[I].NumPredsLeft; in initNumPreds()
235 const auto &SUnits = DAG.SUnits; in schedule() local
237 Schedule.reserve(SUnits.size()); in schedule()
239 initNumPreds(SUnits); in schedule()
272 assert(SUnits.size() == Schedule.size()); in schedule()
DGCNILPSched.cpp293 auto &SUnits = const_cast<ScheduleDAG&>(DAG).SUnits; in schedule() local
296 SUSavedCopy.resize(SUnits.size()); in schedule()
300 for (const SUnit &SU : SUnits) in schedule()
303 SUNumbers.assign(SUnits.size(), 0); in schedule()
304 for (const SUnit &SU : SUnits) in schedule()
314 Schedule.reserve(SUnits.size()); in schedule()
346 assert(SUnits.size() == Schedule.size()); in schedule()
351 for (auto &SU : SUnits) in schedule()
/external/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.cpp179 NodeNum2Index[SU->NodeNum] = SUnits.size(); in addUnit()
180 SUnits.push_back(SU); in addUnit()
273 for (SUnit* SU : SUnits) { in fastSchedule()
391 for (SUnit* SU : SUnits) { in schedule()
409 assert(SUnits.size() == ScheduledSUnits.size() && in schedule()
411 for (SUnit* SU : SUnits) { in schedule()
421 for (SUnit* SU : SUnits) { in undoSchedule()
428 HasLowLatencyNonWaitedParent.assign(SUnits.size(), 0); in undoSchedule()
491 HasLowLatencyNonWaitedParent.assign(SUnits.size(), 0); in nodeScheduled()
506 for (SUnit* SU : SUnits) { in finalizeUnits()
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
DLatencyPriorityQueue.h34 std::vector<SUnit> *SUnits; variable
53 SUnits = &sunits; in initNodes()
54 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in initNodes()
58 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in addNode()
65 SUnits = 0; in releaseState()
69 assert(NodeNum < (*SUnits).size()); in getLatency()
70 return (*SUnits)[NodeNum].getHeight(); in getLatency()
/external/llvm/include/llvm/CodeGen/
DLatencyPriorityQueue.h34 std::vector<SUnit> *SUnits; variable
53 SUnits = &sunits; in initNodes()
54 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in initNodes()
58 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in addNode()
65 SUnits = nullptr; in releaseState()
69 assert(NodeNum < (*SUnits).size()); in getLatency()
70 return (*SUnits)[NodeNum].getHeight(); in getLatency()
DScheduleDAGInstrs.h343 const SUnit *Addr = SUnits.empty() ? nullptr : &SUnits[0]; in newSUnit()
345 SUnits.emplace_back(MI, (unsigned)SUnits.size()); in newSUnit()
346 assert((Addr == nullptr || Addr == &SUnits[0]) && in newSUnit()
348 SUnits.back().OrigNode = &SUnits.back(); in newSUnit()
349 return &SUnits.back(); in newSUnit()
DResourcePriorityQueue.h40 std::vector<SUnit> *SUnits; variable
85 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in addNode()
91 SUnits = nullptr; in releaseState()
95 assert(NodeNum < (*SUnits).size()); in getLatency()
96 return (*SUnits)[NodeNum].getHeight(); in getLatency()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
DLatencyPriorityQueue.h35 std::vector<SUnit> *SUnits; variable
54 SUnits = &sunits; in initNodes()
55 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in initNodes()
59 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in addNode()
66 SUnits = nullptr; in releaseState()
70 assert(NodeNum < (*SUnits).size()); in getLatency()
71 return (*SUnits)[NodeNum].getHeight(); in getLatency()
DResourcePriorityQueue.h40 std::vector<SUnit> *SUnits; variable
85 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in addNode()
91 SUnits = nullptr; in releaseState()
95 assert(NodeNum < (*SUnits).size()); in getLatency()
96 return (*SUnits)[NodeNum].getHeight(); in getLatency()
DScheduleDAGInstrs.h366 const SUnit *Addr = SUnits.empty() ? nullptr : &SUnits[0]; in newSUnit()
368 SUnits.emplace_back(MI, (unsigned)SUnits.size()); in newSUnit()
369 assert((Addr == nullptr || Addr == &SUnits[0]) && in newSUnit()
371 return &SUnits.back(); in newSUnit()
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DScheduleDAG.cpp71 SUnits.clear(); in Run()
356 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in VerifySchedule()
357 if (!SUnits[i].isScheduled) { in VerifySchedule()
358 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) { in VerifySchedule()
364 SUnits[i].dump(this); in VerifySchedule()
368 if (SUnits[i].isScheduled && in VerifySchedule()
369 (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth()) > in VerifySchedule()
373 SUnits[i].dump(this); in VerifySchedule()
379 if (SUnits[i].NumSuccsLeft != 0) { in VerifySchedule()
382 SUnits[i].dump(this); in VerifySchedule()
[all …]
DScheduleDAGInstrs.h152 const SUnit *Addr = SUnits.empty() ? 0 : &SUnits[0]; in NewSUnit()
154 SUnits.push_back(SUnit(MI, (unsigned)SUnits.size())); in NewSUnit()
155 assert((Addr == 0 || Addr == &SUnits[0]) && in NewSUnit()
157 SUnits.back().OrigNode = &SUnits.back(); in NewSUnit()
158 return &SUnits.back(); in NewSUnit()
DPostRASchedulerList.cpp188 : ScheduleDAGInstrs(MF, MLI, MDT), Topo(SUnits), AA(AA), in SchedulePostRATDList()
312 AntiDepBreak->BreakAntiDependencies(SUnits, Begin, InsertPos, in Schedule()
322 SUnits.clear(); in Schedule()
333 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in Schedule()
334 SUnits[su].dumpAll(this)); in Schedule()
336 AvailableQueue.initNodes(SUnits); in Schedule()
606 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in ListScheduleTopDown()
608 bool available = SUnits[i].Preds.empty(); in ListScheduleTopDown()
610 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()
611 SUnits[i].isAvailable = true; in ListScheduleTopDown()
[all …]
/external/llvm/lib/CodeGen/
DScheduleDAG.cpp51 SUnits.clear(); in clearDAG()
385 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in VerifyScheduledDAG()
386 if (!SUnits[i].isScheduled) { in VerifyScheduledDAG()
387 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) { in VerifyScheduledDAG()
393 SUnits[i].dump(this); in VerifyScheduledDAG()
397 if (SUnits[i].isScheduled && in VerifyScheduledDAG()
398 (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth()) > in VerifyScheduledDAG()
402 SUnits[i].dump(this); in VerifyScheduledDAG()
408 if (SUnits[i].NumSuccsLeft != 0) { in VerifyScheduledDAG()
411 SUnits[i].dump(this); in VerifyScheduledDAG()
[all …]
DPostRASchedulerList.cpp397 AntiDepBreak->BreakAntiDependencies(SUnits, RegionBegin, RegionEnd, in schedule()
418 for (const SUnit &SU : SUnits) { in schedule()
424 AvailableQueue.initNodes(SUnits); in schedule()
541 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in ListScheduleTopDown()
543 if (!SUnits[i].NumPredsLeft && !SUnits[i].isAvailable) { in ListScheduleTopDown()
544 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()
545 SUnits[i].isAvailable = true; in ListScheduleTopDown()
556 Sequence.reserve(SUnits.size()); in ListScheduleTopDown()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
DHexagonSubtarget.cpp130 for (SUnit &SU : DAG->SUnits) { in apply()
143 for (SUnit &SU : DAG->SUnits) { in apply()
206 for (unsigned su = 0, e = DAG->SUnits.size(); su != e; ++su) { in apply()
208 if (DAG->SUnits[su].getInstr()->isCall()) in apply()
209 LastSequentialCall = &DAG->SUnits[su]; in apply()
211 else if (DAG->SUnits[su].getInstr()->isCompare() && LastSequentialCall) in apply()
212 DAG->addEdge(&DAG->SUnits[su], SDep(LastSequentialCall, SDep::Barrier)); in apply()
215 shouldTFRICallBind(HII, DAG->SUnits[su], DAG->SUnits[su+1])) in apply()
216 DAG->addEdge(&DAG->SUnits[su], SDep(&DAG->SUnits[su-1], SDep::Barrier)); in apply()
232 const MachineInstr *MI = DAG->SUnits[su].getInstr(); in apply()
[all …]
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
DScheduleDAGList.cpp95 AvailableQueue->initNodes(SUnits); in Schedule()
165 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in ListScheduleTopDown()
167 if (SUnits[i].Preds.empty()) { in ListScheduleTopDown()
168 AvailableQueue->push(&SUnits[i]); in ListScheduleTopDown()
169 SUnits[i].isAvailable = true; in ListScheduleTopDown()
176 Sequence.reserve(SUnits.size()); in ListScheduleTopDown()
DScheduleDAGSDNodes.cpp63 if (!SUnits.empty()) in NewSUnit()
64 Addr = &SUnits[0]; in NewSUnit()
66 SUnits.push_back(SUnit(N, (unsigned)SUnits.size())); in NewSUnit()
67 assert((Addr == 0 || Addr == &SUnits[0]) && in NewSUnit()
69 SUnits.back().OrigNode = &SUnits.back(); in NewSUnit()
70 SUnit *SU = &SUnits.back(); in NewSUnit()
282 SUnits.reserve(NumNodes * 2); in BuildSchedUnits()
375 SUnit *SrcSU = &SUnits[SrcN->getNodeId()]; in BuildSchedUnits()
388 for (unsigned su = 0, e = SUnits.size(); su != e; ++su) { in AddSchedEdges()
389 SUnit *SU = &SUnits[su]; in AddSchedEdges()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGVLIW.cpp102 AvailableQueue->initNodes(SUnits); in Schedule()
175 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in listScheduleTopDown()
177 if (SUnits[i].Preds.empty()) { in listScheduleTopDown()
178 AvailableQueue->push(&SUnits[i]); in listScheduleTopDown()
179 SUnits[i].isAvailable = true; in listScheduleTopDown()
186 Sequence.reserve(SUnits.size()); in listScheduleTopDown()
DScheduleDAGSDNodes.cpp72 if (!SUnits.empty()) in newSUnit()
73 Addr = &SUnits[0]; in newSUnit()
75 SUnits.emplace_back(N, (unsigned)SUnits.size()); in newSUnit()
76 assert((Addr == nullptr || Addr == &SUnits[0]) && in newSUnit()
78 SUnits.back().OrigNode = &SUnits.back(); in newSUnit()
79 SUnit *SU = &SUnits.back(); in newSUnit()
321 SUnits.reserve(NumNodes * 2); in BuildSchedUnits()
414 SUnit *SrcSU = &SUnits[SrcN->getNodeId()]; in BuildSchedUnits()
427 for (unsigned su = 0, e = SUnits.size(); su != e; ++su) { in AddSchedEdges()
428 SUnit *SU = &SUnits[su]; in AddSchedEdges()
[all …]
/external/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGVLIW.cpp103 AvailableQueue->initNodes(SUnits); in Schedule()
176 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in listScheduleTopDown()
178 if (SUnits[i].Preds.empty()) { in listScheduleTopDown()
179 AvailableQueue->push(&SUnits[i]); in listScheduleTopDown()
180 SUnits[i].isAvailable = true; in listScheduleTopDown()
187 Sequence.reserve(SUnits.size()); in listScheduleTopDown()
/external/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp28 for (unsigned su = 0, e = SUnits.size(); su != e; ++su) { in postprocessDAG()
30 if (SUnits[su].getInstr()->isCall()) in postprocessDAG()
31 LastSequentialCall = &(SUnits[su]); in postprocessDAG()
33 else if (SUnits[su].getInstr()->isCompare() && LastSequentialCall) in postprocessDAG()
34 SUnits[su].addPred(SDep(LastSequentialCall, SDep::Barrier)); in postprocessDAG()
167 for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in schedule()
168 if (SUnits[su].getHeight() > maxH) in schedule()
169 maxH = SUnits[su].getHeight(); in schedule()
172 for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in schedule()
173 if (SUnits[su].getDepth() > maxD) in schedule()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
DScheduleDAG.cpp61 SUnits.clear(); in clearDAG()
401 for (const SUnit &SUnit : SUnits) { in VerifyScheduledDAG()
442 return SUnits.size() - DeadNodes; in VerifyScheduledDAG()
473 unsigned DAGSize = SUnits.size(); in InitDAGTopologicalSorting()
483 for (SUnit &SU : SUnits) { in InitDAGTopologicalSorting()
516 for (SUnit &SU : SUnits) { in InitDAGTopologicalSorting()
548 WorkList.reserve(SUnits.size()); in DFS()
588 WorkList.reserve(SUnits.size()); in GetSubGraph()
621 VisitedBack.resize(SUnits.size()); in GetSubGraph()
714 : SUnits(sunits), ExitSU(exitsu) {} in ScheduleDAGTopologicalSort()
DPostRASchedulerList.cpp397 AntiDepBreak->BreakAntiDependencies(SUnits, RegionBegin, RegionEnd, in schedule()
418 : SUnits) { in schedule()
423 AvailableQueue.initNodes(SUnits); in schedule()
540 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in ListScheduleTopDown()
542 if (!SUnits[i].NumPredsLeft && !SUnits[i].isAvailable) { in ListScheduleTopDown()
543 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()
544 SUnits[i].isAvailable = true; in ListScheduleTopDown()
555 Sequence.reserve(SUnits.size()); in ListScheduleTopDown()

1234