| /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...] |
| ResourcePriorityQueue.h | 39 /// SUnits - The SUnits for the current graph.
40 std::vector<SUnit> *SUnits;
86 void initNodes(std::vector<SUnit> &sunits);
89 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
95 SUnits = 0;
99 assert(NodeNum < (*SUnits).size());
100 return (*SUnits)[NodeNum].getHeight();
|
| ScheduleDAGInstrs.h | 186 /// buildSchedGraph - Build SUnits from the MachineBasicBlock that we are
229 const SUnit *Addr = SUnits.empty() ? 0 : &SUnits[0];
231 SUnits.push_back(SUnit(MI, (unsigned)SUnits.size()));
232 assert((Addr == 0 || Addr == &SUnits[0]) &&
233 "SUnits std::vector reallocated on the fly!");
234 SUnits.back().OrigNode = &SUnits.back();
235 return &SUnits.back()
[all...] |
| ScheduleDAG.h | 101 /// classes which require default constructors. SUnits may not
207 /// as "must alias", meaning that the SUnits at either end of the edge
281 // Preds/Succs - The SUnits before/after us in the graph.
510 virtual void initNodes(std::vector<SUnit> &SUnits) = 0;
563 std::vector<SUnit> SUnits; // The scheduling units.
607 /// VerifyScheduledDAG - Verify that all SUnits were scheduled and that
608 /// their state is consistent. Return the number of scheduled SUnits.
682 return G->SUnits.begin();
685 return G->SUnits.end();
690 /// ordering for SUnits and provides methods for dynamically updatin
[all...] |
| ScheduleDFS.h | 144 void compute(ArrayRef<SUnit> SUnits);
|
| MachineScheduler.h | 138 /// ReadyQueue encapsulates vector of "ready" SUnits with basic convenience
216 /// Topo - A topological ordering for SUnits which permits fast IsReachable
258 Topo(SUnits, &ExitSU), RPTracker(RegPressure), CurrentTop(),
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGVLIW.cpp | 52 /// AvailableQueue - The priority queue to use for the available SUnits.
102 AvailableQueue->initNodes(SUnits);
175 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
177 if (SUnits[i].Preds.empty()) {
178 AvailableQueue->push(&SUnits[i]);
179 SUnits[i].isAvailable = true;
186 Sequence.reserve(SUnits.size());
|
| ScheduleDAGSDNodes.cpp | 71 if (!SUnits.empty())
72 Addr = &SUnits[0];
74 SUnits.push_back(SUnit(N, (unsigned)SUnits.size()));
75 assert((Addr == 0 || Addr == &SUnits[0]) &&
76 "SUnits std::vector reallocated on the fly!");
77 SUnits.back().OrigNode = &SUnits.back();
78 SUnit *SU = &SUnits.back();
301 // Cluster loads from "near" addresses into combined SUnits
[all...] |
| ResourcePriorityQueue.cpp | 169 void ResourcePriorityQueue::initNodes(std::vector<SUnit> &sunits) {
170 SUnits = &sunits;
171 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
173 for (unsigned i = 0, e = SUnits->size(); i != e; ++i) {
174 SUnit *SU = &(*SUnits)[i];
|
| ScheduleDAGFast.cpp | 69 /// AvailableQueue - The priority queue to use for the available SUnits.
126 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
127 SUnits[su].dumpAll(this));
273 LoadSU = &SUnits[LoadNode->getNodeId()];
533 if (!SUnits.empty()) {
534 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()];
544 Sequence.reserve(SUnits.size());
|
| ScheduleDAGRRList.cpp | 117 /// AvailableQueue - The priority queue to use for the available SUnits.
152 /// Topo - A topological ordering for SUnits which permits fast IsReachable
166 Topo(SUnits, NULL) {
243 unsigned NumSUnits = SUnits.size();
254 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);
557 SUnit *Def = &SUnits[N->getNodeId()];
[all...] |
| SelectionDAGPrinter.cpp | 296 GW.emitEdge(0, -1, &SUnits[N->getNodeId()], -1,
|
| /external/llvm/lib/CodeGen/ |
| AntiDepBreaker.h | 45 virtual unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| ScheduleDAG.cpp | 51 SUnits.clear();
380 /// VerifyScheduledDAG - Verify that all SUnits were scheduled and that
386 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
387 if (!SUnits[i].isScheduled) {
388 if (SUnits[i].NumPreds == 0 && SUnits[i].NumSuccs == 0) {
394 SUnits[i].dump(this);
398 if (SUnits[i].isScheduled &&
399 (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth())
[all...] |
| CriticalAntiDepBreaker.h | 81 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| PostRASchedulerList.cpp | 105 /// AvailableQueue - The priority queue to use for the available SUnits.
371 AntiDepBreak->BreakAntiDependencies(SUnits, RegionBegin, RegionEnd,
389 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
390 SUnits[su].dumpAll(this));
392 AvailableQueue.initNodes(SUnits);
639 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
641 if (!SUnits[i].NumPredsLeft && !SUnits[i].isAvailable) {
642 AvailableQueue.push(&SUnits[i]);
643 SUnits[i].isAvailable = true
[all...] |
| DFAPacketizer.cpp | 168 for (unsigned i = 0, e = VLIWScheduler->SUnits.size(); i != e; ++i) {
169 SUnit *SU = &VLIWScheduler->SUnits[i];
|
| AggressiveAntiDepBreaker.h | 145 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| CriticalAntiDepBreaker.cpp | 406 BreakAntiDependencies(const std::vector<SUnit>& SUnits,
413 if (SUnits.empty()) return 0;
423 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
424 const SUnit *SU = &SUnits[i];
537 // Also, if there are dependencies on other SUnits with the
|
| AggressiveAntiDepBreaker.cpp | 698 const std::vector<SUnit>& SUnits,
711 if (SUnits.empty()) return 0;
718 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
719 const SUnit *SU = &SUnits[i];
730 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
731 const SUnit *SU = &SUnits[i];
835 // Also, if there are dependencies on other SUnits with the
[all...] |
| MachineScheduler.cpp | 534 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
535 SUnits[su].dumpAll(this));
591 DFSResult->resize(SUnits.size());
592 DFSResult->compute(SUnits);
599 I = SUnits.begin(), E = SUnits.end(); I != E; ++I) {
601 assert(!SU->isBoundaryNode() && "Boundary node should not be in SUnits");
837 for (unsigned Idx = 0, End = DAG->SUnits.size(); Idx != End; ++Idx) {
838 SUnit *SU = &DAG->SUnits[Idx];
841 unsigned ChainPredID = DAG->SUnits.size()
[all...] |
| ScheduleDAGInstrs.cpp | 321 // Either insert a new Reg2SUnits entry with an empty SUnits list, or
322 // retrieve the existing SUnits list for this register's uses.
661 /// After initSUnits, the SUnits vector cannot be resized and the scheduler may
670 SUnits.reserve(BB->size());
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonMachineScheduler.cpp | 28 for (unsigned su = 0, e = SUnits.size(); su != e; ++su) {
30 if (SUnits[su].getInstr()->isCall())
31 LastSequentialCall = &(SUnits[su]);
33 else if (SUnits[su].getInstr()->isCompare() && LastSequentialCall)
34 SUnits[su].addPred(SDep(LastSequentialCall, SDep::Barrier));
167 for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
168 if (SUnits[su].getHeight() > maxH)
169 maxH = SUnits[su].getHeight();
172 for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
173 if (SUnits[su].getDepth() > maxD
[all...] |
| /external/llvm/lib/Target/R600/ |
| R600MachineScheduler.cpp | 110 for (unsigned i = 0; i < DAG->SUnits.size(); i++) {
111 const SUnit &S = DAG->SUnits[i];
|
