| /external/llvm/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 33 // SUnits - The SUnits for the current graph.
34 std::vector<SUnit> *SUnits;
52 void initNodes(std::vector<SUnit> &sunits) {
53 SUnits = &sunits;
54 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
58 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
65 SUnits = 0;
69 assert(NodeNum < (*SUnits).size())
[all...] |
| ScheduleDAG.h | 90 /// classes which require default constructors. SUnits may not
181 /// as "must alias", meaning that the SUnits at either end of the edge
236 // Preds/Succs - The SUnits before/after us in the graph.
439 virtual void initNodes(std::vector<SUnit> &SUnits) = 0;
496 std::vector<SUnit> SUnits; // The scheduling units.
540 /// VerifySchedule - Verify that all SUnits were scheduled and that
550 /// BuildSchedGraph - Build SUnits and set up their Preds and Succs
651 return G->SUnits.begin();
654 return G->SUnits.end();
659 /// ordering for SUnits and provides methods for dynamically updatin
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGInstrs.h | 152 const SUnit *Addr = SUnits.empty() ? 0 : &SUnits[0];
154 SUnits.push_back(SUnit(MI, (unsigned)SUnits.size()));
155 assert((Addr == 0 || Addr == &SUnits[0]) &&
156 "SUnits std::vector reallocated on the fly!");
157 SUnits.back().OrigNode = &SUnits.back();
158 return &SUnits.back();
168 /// BuildSchedGraph - Build SUnits from the MachineBasicBlock that we ar
[all...] |
| AntiDepBreaker.h | 45 virtual unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| ScheduleDAG.cpp | 71 SUnits.clear();
349 /// VerifySchedule - Verify that all SUnits were scheduled and that
356 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
357 if (!SUnits[i].isScheduled) {
358 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) {
364 SUnits[i].dump(this);
368 if (SUnits[i].isScheduled &&
369 (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth())
[all...] |
| PostRASchedulerList.cpp | 111 /// AvailableQueue - The priority queue to use for the available SUnits.
121 /// Topo - A topological ordering for SUnits.
188 : ScheduleDAGInstrs(MF, MLI, MDT), Topo(SUnits), AA(AA),
312 AntiDepBreak->BreakAntiDependencies(SUnits, Begin, InsertPos,
322 SUnits.clear();
333 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
334 SUnits[su].dumpAll(this));
336 AvailableQueue.initNodes(SUnits);
606 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
608 bool available = SUnits[i].Preds.empty()
[all...] |
| CriticalAntiDepBreaker.h | 82 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| AggressiveAntiDepBreaker.h | 145 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| CriticalAntiDepBreaker.cpp | 419 BreakAntiDependencies(const std::vector<SUnit>& SUnits,
426 if (SUnits.empty()) return 0;
434 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
435 const SUnit *SU = &SUnits[i];
548 // Also, if there are dependencies on other SUnits with the
|
| AggressiveAntiDepBreaker.cpp | 720 const std::vector<SUnit>& SUnits,
733 if (SUnits.empty()) return 0;
740 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
741 const SUnit *SU = &SUnits[i];
752 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
753 const SUnit *SU = &SUnits[i];
854 // Also, if there are dependencies on other SUnits with the
[all...] |
| ScheduleDAGInstrs.cpp | 191 SUnits.reserve(BB->size());
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGList.cpp | 51 /// AvailableQueue - The priority queue to use for the available SUnits.
95 AvailableQueue->initNodes(SUnits);
165 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
167 if (SUnits[i].Preds.empty()) {
168 AvailableQueue->push(&SUnits[i]);
169 SUnits[i].isAvailable = true;
176 Sequence.reserve(SUnits.size());
|
| ScheduleDAGSDNodes.cpp | 63 if (!SUnits.empty())
64 Addr = &SUnits[0];
66 SUnits.push_back(SUnit(N, (unsigned)SUnits.size()));
67 assert((Addr == 0 || Addr == &SUnits[0]) &&
68 "SUnits std::vector reallocated on the fly!");
69 SUnits.back().OrigNode = &SUnits.back();
70 SUnit *SU = &SUnits.back();
261 // Cluster loads from "near" addresses into combined SUnits
[all...] |
| ScheduleDAGRRList.cpp | 132 /// AvailableQueue - The priority queue to use for the available SUnits.
161 /// Topo - A topological ordering for SUnits which permits fast IsReachable
171 Topo(SUnits) {
252 unsigned NumSUnits = SUnits.size();
263 unsigned NumSUnits = SUnits.size();
338 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
339 SUnits[su].dumpAll(this));
342 AvailableQueue->initNodes(SUnits);
826 LoadSU = &SUnits[LoadNode->getNodeId()];
[all...] |
| ScheduleDAGFast.cpp | 64 /// AvailableQueue - The priority queue to use for the available SUnits.
121 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
122 SUnits[su].dumpAll(this));
268 LoadSU = &SUnits[LoadNode->getNodeId()];
528 if (!SUnits.empty()) {
529 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()];
539 Sequence.reserve(SUnits.size());
|
| SelectionDAGPrinter.cpp | 299 GW.emitEdge(0, -1, &SUnits[N->getNodeId()], -1,
|
