Home
last modified time | relevance | path

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

/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.h261 const SUnit *Addr = SUnits.empty() ? nullptr : &SUnits[0]; in newSUnit()
263 SUnits.push_back(SUnit(MI, (unsigned)SUnits.size())); in newSUnit()
264 assert((Addr == nullptr || Addr == &SUnits[0]) && in newSUnit()
266 SUnits.back().OrigNode = &SUnits.back(); in newSUnit()
267 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()
DScheduleDAG.h512 virtual void initNodes(std::vector<SUnit> &SUnits) = 0;
565 std::vector<SUnit> SUnits; // The scheduling units.
678 return G->SUnits.begin();
681 return G->SUnits.end();
693 std::vector<SUnit> &SUnits;
716 ScheduleDAGTopologicalSort(std::vector<SUnit> &SUnits, SUnit *ExitSU);
DScheduleDFS.h142 void compute(ArrayRef<SUnit> SUnits);
DMachineScheduler.h254 AA(C->AA), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU), CurrentTop(), in ScheduleDAGMI()
/external/llvm/lib/CodeGen/
DScheduleDAG.cpp51 SUnits.clear(); in clearDAG()
386 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in VerifyScheduledDAG()
387 if (!SUnits[i].isScheduled) { in VerifyScheduledDAG()
388 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) { in VerifyScheduledDAG()
394 SUnits[i].dump(this); in VerifyScheduledDAG()
398 if (SUnits[i].isScheduled && in VerifyScheduledDAG()
399 (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth()) > in VerifyScheduledDAG()
403 SUnits[i].dump(this); in VerifyScheduledDAG()
409 if (SUnits[i].NumSuccsLeft != 0) { in VerifyScheduledDAG()
412 SUnits[i].dump(this); in VerifyScheduledDAG()
[all …]
DPostRASchedulerList.cpp385 AntiDepBreak->BreakAntiDependencies(SUnits, RegionBegin, RegionEnd, in schedule()
403 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in schedule()
404 SUnits[su].dumpAll(this)); in schedule()
406 AvailableQueue.initNodes(SUnits); in schedule()
517 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in ListScheduleTopDown()
519 if (!SUnits[i].NumPredsLeft && !SUnits[i].isAvailable) { in ListScheduleTopDown()
520 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()
521 SUnits[i].isAvailable = true; in ListScheduleTopDown()
532 Sequence.reserve(SUnits.size()); in ListScheduleTopDown()
DDFAPacketizer.cpp168 for (unsigned i = 0, e = VLIWScheduler->SUnits.size(); i != e; ++i) { in PacketizeMIs()
169 SUnit *SU = &VLIWScheduler->SUnits[i]; in PacketizeMIs()
DAntiDepBreaker.h42 virtual unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
DCriticalAntiDepBreaker.cpp423 BreakAntiDependencies(const std::vector<SUnit>& SUnits, in BreakAntiDependencies() argument
430 if (SUnits.empty()) return 0; in BreakAntiDependencies()
440 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in BreakAntiDependencies()
441 const SUnit *SU = &SUnits[i]; in BreakAntiDependencies()
DMachineScheduler.cpp677 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in schedule()
678 SUnits[su].dumpAll(this)); in schedule()
742 I = SUnits.begin(), E = SUnits.end(); I != E; ++I) { in findRootsAndBiasEdges()
1019 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in schedule()
1020 SUnits[su].dumpAll(this)); in schedule()
1094 DFSResult->resize(SUnits.size()); in computeDFSResult()
1095 DFSResult->compute(SUnits); in computeDFSResult()
1317 for (unsigned Idx = 0, End = DAG->SUnits.size(); Idx != End; ++Idx) { in apply()
1318 SUnit *SU = &DAG->SUnits[Idx]; in apply()
1321 unsigned ChainPredID = DAG->SUnits.size(); in apply()
[all …]
DAggressiveAntiDepBreaker.cpp726 const std::vector<SUnit>& SUnits, in BreakAntiDependencies() argument
739 if (SUnits.empty()) return 0; in BreakAntiDependencies()
746 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in BreakAntiDependencies()
747 const SUnit *SU = &SUnits[i]; in BreakAntiDependencies()
758 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in BreakAntiDependencies()
759 const SUnit *SU = &SUnits[i]; in BreakAntiDependencies()
DCriticalAntiDepBreaker.h79 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
DAggressiveAntiDepBreaker.h138 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
DScheduleDAGInstrs.cpp699 SUnits.reserve(NumRegionInstrs); in initSUnits()
761 PDiffs->init(SUnits.size()); in buildSchedGraph()
1470 void SchedDFSResult::compute(ArrayRef<SUnit> SUnits) { in compute() argument
1476 SI = SUnits.begin(), SE = SUnits.end(); SI != SE; ++SI) { in compute()
/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()
DScheduleDAGSDNodes.cpp71 if (!SUnits.empty()) in newSUnit()
72 Addr = &SUnits[0]; in newSUnit()
74 SUnits.push_back(SUnit(N, (unsigned)SUnits.size())); in newSUnit()
75 assert((Addr == nullptr || Addr == &SUnits[0]) && in newSUnit()
77 SUnits.back().OrigNode = &SUnits.back(); in newSUnit()
78 SUnit *SU = &SUnits.back(); in newSUnit()
322 SUnits.reserve(NumNodes * 2); in BuildSchedUnits()
415 SUnit *SrcSU = &SUnits[SrcN->getNodeId()]; in BuildSchedUnits()
428 for (unsigned su = 0, e = SUnits.size(); su != e; ++su) { in AddSchedEdges()
429 SUnit *SU = &SUnits[su]; in AddSchedEdges()
[all …]
DScheduleDAGRRList.cpp167 Topo(SUnits, nullptr) { in ScheduleDAGRRList()
244 unsigned NumSUnits = SUnits.size(); in CreateNewSUnit()
255 unsigned NumSUnits = SUnits.size(); in CreateClone()
339 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in Schedule()
340 SUnits[su].dumpAll(this)); in Schedule()
343 AvailableQueue->initNodes(SUnits); in Schedule()
558 SUnit *Def = &SUnits[N->getNodeId()]; in ReleasePredecessors()
989 LoadSU = &SUnits[LoadNode->getNodeId()]; in CopyAndMoveSuccessors()
1495 if (!SUnits.empty()) { in ListScheduleBottomUp()
1496 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; in ListScheduleBottomUp()
[all …]
DScheduleDAGFast.cpp127 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in Schedule()
128 SUnits[su].dumpAll(this)); in Schedule()
274 LoadSU = &SUnits[LoadNode->getNodeId()]; in CopyAndMoveSuccessors()
540 if (!SUnits.empty()) { in ListScheduleBottomUp()
541 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; in ListScheduleBottomUp()
551 Sequence.reserve(SUnits.size()); in ListScheduleBottomUp()
DResourcePriorityQueue.cpp169 SUnits = &sunits; in initNodes()
170 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in initNodes()
172 for (unsigned i = 0, e = SUnits->size(); i != e; ++i) { in initNodes()
173 SUnit *SU = &(*SUnits)[i]; in initNodes()
DSelectionDAGPrinter.cpp297 GW.emitEdge(nullptr, -1, &SUnits[N->getNodeId()], -1, in getCustomGraphFeatures()
/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/llvm/lib/Target/R600/
DR600MachineScheduler.cpp133 for (unsigned i = 0; i < DAG->SUnits.size(); i++) { in pickNode()
134 const SUnit &S = DAG->SUnits[i]; in pickNode()