Home
last modified time | relevance | path

Searched refs:SUnits (Results 1 – 21 of 21) 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 = 0; in releaseState()
69 assert(NodeNum < (*SUnits).size()); in getLatency()
70 return (*SUnits)[NodeNum].getHeight(); in getLatency()
DScheduleDAGInstrs.h121 std::vector<std::vector<SUnit*> > SUnits; variable
147 assert((!New || SUnits[Reg].empty()) && "stale SUnits vector");
149 return SUnits[Reg];
155 SUnits[Reg].clear(); in erase()
333 const SUnit *Addr = SUnits.empty() ? 0 : &SUnits[0]; in newSUnit()
335 SUnits.push_back(SUnit(MI, (unsigned)SUnits.size())); in newSUnit()
336 assert((Addr == 0 || Addr == &SUnits[0]) && in newSUnit()
338 SUnits.back().OrigNode = &SUnits.back(); in newSUnit()
339 return &SUnits.back(); in newSUnit()
DResourcePriorityQueue.h40 std::vector<SUnit> *SUnits; variable
89 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in addNode()
95 SUnits = 0; in releaseState()
99 assert(NodeNum < (*SUnits).size()); in getLatency()
100 return (*SUnits)[NodeNum].getHeight(); in getLatency()
DScheduleDAG.h448 virtual void initNodes(std::vector<SUnit> &SUnits) = 0;
501 std::vector<SUnit> SUnits; // The scheduling units.
636 return G->SUnits.begin();
639 return G->SUnits.end();
651 std::vector<SUnit> &SUnits;
673 explicit ScheduleDAGTopologicalSort(std::vector<SUnit> &SUnits);
DDFAPacketizer.h103 std::vector<SUnit> SUnits; variable
/external/llvm/lib/CodeGen/
DScheduleDAG.cpp51 SUnits.clear(); in clearDAG()
330 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in VerifyScheduledDAG()
331 if (!SUnits[i].isScheduled) { in VerifyScheduledDAG()
332 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) { in VerifyScheduledDAG()
338 SUnits[i].dump(this); in VerifyScheduledDAG()
342 if (SUnits[i].isScheduled && in VerifyScheduledDAG()
343 (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth()) > in VerifyScheduledDAG()
347 SUnits[i].dump(this); in VerifyScheduledDAG()
353 if (SUnits[i].NumSuccsLeft != 0) { in VerifyScheduledDAG()
356 SUnits[i].dump(this); in VerifyScheduledDAG()
[all …]
DPostRASchedulerList.cpp202 : ScheduleDAGInstrs(MF, MLI, MDT, /*IsPostRA=*/true), Topo(SUnits), AA(AA), in SchedulePostRATDList()
368 AntiDepBreak->BreakAntiDependencies(SUnits, RegionBegin, RegionEnd, in schedule()
386 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in schedule()
387 SUnits[su].dumpAll(this)); in schedule()
389 AvailableQueue.initNodes(SUnits); in schedule()
656 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in ListScheduleTopDown()
658 bool available = SUnits[i].Preds.empty(); in ListScheduleTopDown()
660 AvailableQueue.push(&SUnits[i]); in ListScheduleTopDown()
661 SUnits[i].isAvailable = true; in ListScheduleTopDown()
672 Sequence.reserve(SUnits.size()); in ListScheduleTopDown()
DMachineScheduler.cpp401 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in schedule()
402 SUnits[su].dumpAll(this)); in schedule()
413 for (std::vector<SUnit>::iterator I = SUnits.begin(), E = SUnits.end(); in schedule()
DDFAPacketizer.cpp192 SUnits = SchedulerImpl->SUnits; in PacketizeMIs()
DAntiDepBreaker.h45 virtual unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
DCriticalAntiDepBreaker.cpp435 BreakAntiDependencies(const std::vector<SUnit>& SUnits, in BreakAntiDependencies() argument
442 if (SUnits.empty()) return 0; in BreakAntiDependencies()
452 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in BreakAntiDependencies()
453 const SUnit *SU = &SUnits[i]; in BreakAntiDependencies()
DCriticalAntiDepBreaker.h81 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
DAggressiveAntiDepBreaker.cpp720 const std::vector<SUnit>& SUnits, in BreakAntiDependencies() argument
733 if (SUnits.empty()) return 0; in BreakAntiDependencies()
740 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in BreakAntiDependencies()
741 const SUnit *SU = &SUnits[i]; in BreakAntiDependencies()
752 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in BreakAntiDependencies()
753 const SUnit *SU = &SUnits[i]; in BreakAntiDependencies()
DAggressiveAntiDepBreaker.h145 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
DScheduleDAGInstrs.cpp143 SUnits.resize(Limit); in setRegLimit()
149 SUnits[*I].clear(); in clear()
484 SUnits.reserve(BB->size()); in initSUnits()
/external/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGVLIW.cpp102 AvailableQueue->initNodes(SUnits); in Schedule()
173 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { in listScheduleTopDown()
175 if (SUnits[i].Preds.empty()) { in listScheduleTopDown()
176 AvailableQueue->push(&SUnits[i]); in listScheduleTopDown()
177 SUnits[i].isAvailable = true; in listScheduleTopDown()
184 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 == 0 || Addr == &SUnits[0]) && in newSUnit()
77 SUnits.back().OrigNode = &SUnits.back(); in newSUnit()
78 SUnit *SU = &SUnits.back(); in newSUnit()
290 SUnits.reserve(NumNodes * 2); in BuildSchedUnits()
383 SUnit *SrcSU = &SUnits[SrcN->getNodeId()]; in BuildSchedUnits()
396 for (unsigned su = 0, e = SUnits.size(); su != e; ++su) { in AddSchedEdges()
397 SUnit *SU = &SUnits[su]; in AddSchedEdges()
[all …]
DScheduleDAGRRList.cpp159 Topo(SUnits) { in ScheduleDAGRRList()
234 unsigned NumSUnits = SUnits.size(); in CreateNewSUnit()
245 unsigned NumSUnits = SUnits.size(); in CreateClone()
318 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in Schedule()
319 SUnits[su].dumpAll(this)); in Schedule()
322 AvailableQueue->initNodes(SUnits); in Schedule()
537 SUnit *Def = &SUnits[N->getNodeId()]; in ReleasePredecessors()
965 LoadSU = &SUnits[LoadNode->getNodeId()]; in CopyAndMoveSuccessors()
1451 if (!SUnits.empty()) { in ListScheduleBottomUp()
1452 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; in ListScheduleBottomUp()
[all …]
DScheduleDAGFast.cpp121 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) in Schedule()
122 SUnits[su].dumpAll(this)); in Schedule()
268 LoadSU = &SUnits[LoadNode->getNodeId()]; in CopyAndMoveSuccessors()
528 if (!SUnits.empty()) { in ListScheduleBottomUp()
529 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; in ListScheduleBottomUp()
539 Sequence.reserve(SUnits.size()); in ListScheduleBottomUp()
DResourcePriorityQueue.cpp170 SUnits = &sunits; in initNodes()
171 NumNodesSolelyBlocking.resize(SUnits->size(), 0); in initNodes()
173 for (unsigned i = 0, e = SUnits->size(); i != e; ++i) { in initNodes()
174 SUnit *SU = &(*SUnits)[i]; in initNodes()
DSelectionDAGPrinter.cpp297 GW.emitEdge(0, -1, &SUnits[N->getNodeId()], -1, in getCustomGraphFeatures()