/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) override { 53 SUnits = &sunits; 54 NumNodesSolelyBlocking.resize(SUnits->size(), 0); 58 NumNodesSolelyBlocking.resize(SUnits->size(), 0); 65 SUnits = nullptr; 69 assert(NodeNum < (*SUnits).size()) [all...] |
ResourcePriorityQueue.h | 39 /// SUnits - The SUnits for the current graph. 40 std::vector<SUnit> *SUnits; 82 void initNodes(std::vector<SUnit> &sunits) override; 85 NumNodesSolelyBlocking.resize(SUnits->size(), 0); 91 SUnits = nullptr; 95 assert(NodeNum < (*SUnits).size()); 96 return (*SUnits)[NodeNum].getHeight();
|
ScheduleDAGInstrs.h | 121 /// is mapped to a set of SUnits. These include all local vreg uses, not 205 /// buildSchedGraph - Build SUnits from the MachineBasicBlock that we are 261 const SUnit *Addr = SUnits.empty() ? nullptr : &SUnits[0]; 263 SUnits.push_back(SUnit(MI, (unsigned)SUnits.size())); 264 assert((Addr == nullptr || Addr == &SUnits[0]) && 265 "SUnits std::vector reallocated on the fly!"); 266 SUnits.back().OrigNode = &SUnits.back() [all...] |
ScheduleDAG.h | 96 /// classes which require default constructors. SUnits may not 200 /// as "must alias", meaning that the SUnits at either end of the edge 274 // Preds/Succs - The SUnits before/after us in the graph. 512 virtual void initNodes(std::vector<SUnit> &SUnits) = 0; 565 std::vector<SUnit> SUnits; // The scheduling units. 609 /// VerifyScheduledDAG - Verify that all SUnits were scheduled and that 610 /// their state is consistent. Return the number of scheduled SUnits. 678 return G->SUnits.begin(); 681 return G->SUnits.end(); 686 /// ordering for SUnits and provides methods for dynamically updatin [all...] |
ScheduleDFS.h | 142 void compute(ArrayRef<SUnit> SUnits);
|
MachineScheduler.h | 227 /// Topo - A topological ordering for SUnits which permits fast IsReachable 254 AA(C->AA), SchedImpl(std::move(S)), Topo(SUnits, &ExitSU), CurrentTop(), 468 /// ReadyQueue encapsulates vector of "ready" SUnits with basic convenience
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
ScheduleDAGVLIW.cpp | 54 /// AvailableQueue - The priority queue to use for the available SUnits. 103 AvailableQueue->initNodes(SUnits); 176 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { 178 if (SUnits[i].Preds.empty()) { 179 AvailableQueue->push(&SUnits[i]); 180 SUnits[i].isAvailable = true; 187 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 == nullptr || 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 | 168 void ResourcePriorityQueue::initNodes(std::vector<SUnit> &sunits) { 169 SUnits = &sunits; 170 NumNodesSolelyBlocking.resize(SUnits->size(), 0); 172 for (unsigned i = 0, e = SUnits->size(); i != e; ++i) { 173 SUnit *SU = &(*SUnits)[i];
|
ScheduleDAGFast.cpp | 70 /// AvailableQueue - The priority queue to use for the available SUnits. 127 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) 128 SUnits[su].dumpAll(this)); 274 LoadSU = &SUnits[LoadNode->getNodeId()]; 540 if (!SUnits.empty()) { 541 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()]; 551 Sequence.reserve(SUnits.size());
|
ScheduleDAGRRList.cpp | 118 /// AvailableQueue - The priority queue to use for the available SUnits. 153 /// Topo - A topological ordering for SUnits which permits fast IsReachable 167 Topo(SUnits, nullptr) { 244 unsigned NumSUnits = SUnits.size(); 255 unsigned NumSUnits = SUnits.size(); 339 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) 340 SUnits[su].dumpAll(this)); 343 AvailableQueue->initNodes(SUnits); 558 SUnit *Def = &SUnits[N->getNodeId()]; [all...] |
SelectionDAGPrinter.cpp | 297 GW.emitEdge(nullptr, -1, &SUnits[N->getNodeId()], -1,
|
/external/llvm/lib/CodeGen/ |
AntiDepBreaker.h | 42 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 | 79 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
PostRASchedulerList.cpp | 109 /// AvailableQueue - The priority queue to use for the available SUnits. 385 AntiDepBreak->BreakAntiDependencies(SUnits, RegionBegin, RegionEnd, 403 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) 404 SUnits[su].dumpAll(this)); 406 AvailableQueue.initNodes(SUnits); 517 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { 519 if (!SUnits[i].NumPredsLeft && !SUnits[i].isAvailable) { 520 AvailableQueue.push(&SUnits[i]); 521 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 | 138 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
CriticalAntiDepBreaker.cpp | 423 BreakAntiDependencies(const std::vector<SUnit>& SUnits, 430 if (SUnits.empty()) return 0; 440 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { 441 const SUnit *SU = &SUnits[i]; 560 // Also, if there are dependencies on other SUnits with the
|
AggressiveAntiDepBreaker.cpp | 726 const std::vector<SUnit>& SUnits, 739 if (SUnits.empty()) return 0; 746 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { 747 const SUnit *SU = &SUnits[i]; 758 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) { 759 const SUnit *SU = &SUnits[i]; 862 // Also, if there are dependencies on other SUnits with the [all...] |
MachineScheduler.cpp | 677 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su) 678 SUnits[su].dumpAll(this)); 742 I = SUnits.begin(), E = SUnits.end(); I != E; ++I) { 744 assert(!SU->isBoundaryNode() && "Boundary node should not be in SUnits"); [all...] |
ScheduleDAGInstrs.cpp | 331 // Either insert a new Reg2SUnits entry with an empty SUnits list, or 332 // retrieve the existing SUnits list for this register's uses. 690 /// After initSUnits, the SUnits vector cannot be resized and the scheduler may 699 SUnits.reserve(NumRegionInstrs); 761 PDiffs->init(SUnits.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 | 133 for (unsigned i = 0; i < DAG->SUnits.size(); i++) { 134 const SUnit &S = DAG->SUnits[i];
|