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

/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/
H A DLatencyPriorityQueue.h33 // SUnits - The SUnits for the current graph.
34 std::vector<SUnit> *SUnits; member in class:llvm::LatencyPriorityQueue
53 SUnits = &sunits;
54 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
58 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
65 SUnits = 0;
69 assert(NodeNum < (*SUnits).size());
70 return (*SUnits)[NodeNum].getHeight();
H A DResourcePriorityQueue.h39 /// SUnits - The SUnits for the current graph.
40 std::vector<SUnit> *SUnits; member in class:llvm::ResourcePriorityQueue
89 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
95 SUnits = 0;
99 assert(NodeNum < (*SUnits).size());
100 return (*SUnits)[NodeNum].getHeight();
H A DScheduleDAGInstrs.h118 /// is mapped to a set of SUnits. These include all local vreg uses, not
197 /// buildSchedGraph - Build SUnits from the MachineBasicBlock that we are
241 const SUnit *Addr = SUnits.empty() ? 0 : &SUnits[0];
243 SUnits.push_back(SUnit(MI, (unsigned)SUnits.size()));
244 assert((Addr == 0 || Addr == &SUnits[0]) &&
245 "SUnits std::vector reallocated on the fly!");
246 SUnits.back().OrigNode = &SUnits
[all...]
H A DScheduleDAG.h96 /// classes which require default constructors. SUnits may not
188 /// as "must alias", meaning that the SUnits at either end of the edge
262 // Preds/Succs - The SUnits before/after us in the graph.
492 virtual void initNodes(std::vector<SUnit> &SUnits) = 0;
545 std::vector<SUnit> SUnits; // The scheduling units. member in class:llvm::SUnit::ScheduleDAG
589 /// VerifyScheduledDAG - Verify that all SUnits were scheduled and that
590 /// their state is consistent. Return the number of scheduled SUnits.
664 return G->SUnits.begin();
667 return G->SUnits.end();
672 /// ordering for SUnits an
679 std::vector<SUnit> &SUnits; member in class:llvm::SUnit::ScheduleDAGTopologicalSort
[all...]
H A DScheduleDFS.h144 void compute(ArrayRef<SUnit> SUnits);
H A DMachineScheduler.h207 /// ReadyQueue encapsulates vector of "ready" SUnits with basic convenience
286 /// Topo - A topological ordering for SUnits which permits fast IsReachable
334 Topo(SUnits, &ExitSU), ShouldTrackPressure(false),
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGVLIW.cpp52 /// 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());
H A DScheduleDAGSDNodes.cpp71 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();
306 // Cluster loads from "near" addresses into combined SUnits
[all...]
H A DResourcePriorityQueue.cpp170 SUnits = &sunits;
171 NumNodesSolelyBlocking.resize(SUnits->size(), 0);
173 for (unsigned i = 0, e = SUnits->size(); i != e; ++i) {
174 SUnit *SU = &(*SUnits)[i];
H A DScheduleDAGFast.cpp69 /// 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());
H A DScheduleDAGRRList.cpp117 /// 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()];
988 LoadSU = &SUnits[LoadNod
[all...]
H A DSelectionDAGPrinter.cpp296 GW.emitEdge(0, -1, &SUnits[N->getNodeId()], -1,
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp51 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[
[all...]
H A DAntiDepBreaker.h45 virtual unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
H A DCriticalAntiDepBreaker.h81 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
H A DPostRASchedulerList.cpp105 /// AvailableQueue - The priority queue to use for the available SUnits.
382 AntiDepBreak->BreakAntiDependencies(SUnits, RegionBegin, RegionEnd,
400 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
401 SUnits[su].dumpAll(this));
403 AvailableQueue.initNodes(SUnits);
648 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
650 if (!SUnits[i].NumPredsLeft && !SUnits[i].isAvailable) {
651 AvailableQueue.push(&SUnits[i]);
652 SUnits[
[all...]
H A DDFAPacketizer.cpp169 for (unsigned i = 0, e = VLIWScheduler->SUnits.size(); i != e; ++i) {
170 SUnit *SU = &VLIWScheduler->SUnits[i];
H A DAggressiveAntiDepBreaker.h145 unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
H A DCriticalAntiDepBreaker.cpp406 BreakAntiDependencies(const std::vector<SUnit>& SUnits, argument
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
H A DAggressiveAntiDepBreaker.cpp698 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
H A DMachineScheduler.cpp663 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
664 SUnits[su].dumpAll(this));
728 DFSResult->resize(SUnits.size());
729 DFSResult->compute(SUnits);
736 I = SUnits.begin(), E = SUnits.end(); I != E; ++I) {
738 assert(!SU->isBoundaryNode() && "Boundary node should not be in SUnits");
1067 for (unsigned Idx = 0, End = DAG->SUnits.size(); Idx != End; ++Idx) {
1068 SUnit *SU = &DAG->SUnits[Idx];
1071 unsigned ChainPredID = DAG->SUnits
[all...]
H A DScheduleDAGInstrs.cpp322 // Either insert a new Reg2SUnits entry with an empty SUnits list, or
323 // retrieve the existing SUnits list for this register's uses.
666 /// After initSUnits, the SUnits vector cannot be resized and the scheduler may
675 SUnits.reserve(NumRegionInstrs);
711 PDiffs->init(SUnits.size());
1261 void SchedDFSResult::compute(ArrayRef<SUnit> SUnits) { argument
1267 SI = SUnits.begin(), SE = SUnits.end(); SI != SE; ++SI) {
/freebsd-9.3-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp28 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[s
[all...]
/freebsd-9.3-release/contrib/llvm/lib/Target/R600/
H A DR600MachineScheduler.cpp130 for (unsigned i = 0; i < DAG->SUnits.size(); i++) {
131 const SUnit &S = DAG->SUnits[i];

Completed in 119 milliseconds