Searched defs:SUnits (Results 1 - 6 of 6) sorted by relevance

/external/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 DDFAPacketizer.h103 std::vector<SUnit> SUnits; member in class:llvm::VLIWPacketizerList
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.h121 std::vector<std::vector<SUnit*> > SUnits; member in class:llvm::Reg2SUnitsMap
126 // can provide an iterator over SUnits (values) as well.
143 /// If this register is mapped, return its existing SUnits vector.
144 /// Otherwise map the register and return an empty SUnits vector.
147 assert((!New || SUnits[Reg].empty()) && "stale SUnits vector");
149 return SUnits[Reg];
155 SUnits[Reg].clear();
276 /// buildSchedGraph - Build SUnits from the MachineBasicBlock that we are
333 const SUnit *Addr = SUnits
[all...]
H A DScheduleDAG.h91 /// classes which require default constructors. SUnits may not
181 /// as "must alias", meaning that the SUnits at either end of the edge
237 // Preds/Succs - The SUnits before/after us in the graph.
448 virtual void initNodes(std::vector<SUnit> &SUnits) = 0;
501 std::vector<SUnit> SUnits; // The scheduling units. member in class:llvm::ScheduleDAG
545 /// VerifyScheduledDAG - Verify that all SUnits were scheduled and that
546 /// their state is consistent. Return the number of scheduled SUnits.
636 return G->SUnits.begin();
639 return G->SUnits.end();
644 /// ordering for SUnits an
651 std::vector<SUnit> &SUnits; member in class:llvm::ScheduleDAGTopologicalSort
[all...]
/external/llvm/lib/CodeGen/
H A DCriticalAntiDepBreaker.cpp435 BreakAntiDependencies(const std::vector<SUnit>& SUnits, argument
442 if (SUnits.empty()) return 0;
452 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
453 const SUnit *SU = &SUnits[i];
566 // Also, if there are dependencies on other SUnits with the

Completed in 76 milliseconds