| /external/llvm/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 25 struct latency_sort : public std::binary_function<SUnit*, SUnit*, bool> {
29 bool operator()(const SUnit* left, const SUnit* right) const;
34 std::vector<SUnit> *SUnits;
43 std::vector<SUnit*> Queue;
52 void initNodes(std::vector<SUnit> &sunits) {
57 void addNode(const SUnit *SU) {
61 void updateNode(const SUnit *SU) {
80 virtual void push(SUnit *U)
[all...] |
| ScheduleHazardRecognizer.h | 20 class SUnit;
58 virtual HazardType getHazardType(SUnit *m, int Stalls) {
69 virtual void EmitInstruction(SUnit *) {}
|
| ScheduleDAG.h | 28 class SUnit;
55 /// Dep - A pointer to the depending/depended-on SUnit, and an enum
57 PointerIntPair<SUnit *, 2, Kind> Dep;
95 SDep(SUnit *S, Kind kind, unsigned latency = 1, unsigned Reg = 0,
153 //// getSUnit - Return the SUnit to which this edge points.
154 SUnit *getSUnit() const {
158 //// setSUnit - Assign the SUnit to which this edge points.
159 void setSUnit(SUnit *SU) {
227 /// SUnit - Scheduling unit. This is a node in the scheduling DAG.
228 class SUnit {
[all...] |
| ScoreboardHazardRecognizer.h | 29 class SUnit;
118 virtual HazardType getHazardType(SUnit *SU, int Stalls);
120 virtual void EmitInstruction(SUnit *SU);
|
| /external/llvm/include/llvm/Target/ |
| TargetSubtargetInfo.h | 23 class SUnit;
62 virtual void adjustSchedDependency(SUnit *def, SUnit *use,
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.h | 30 /// nodes into a single SUnit so that they are scheduled together.
68 /// NewSUnit - Creates a new SUnit and return a ptr to it.
70 SUnit *NewSUnit(SDNode *N);
72 /// Clone - Creates a clone of the specified SUnit. It does not copy the
75 SUnit *Clone(SUnit *N);
77 /// BuildSchedGraph - Build the SUnit graph from the selection dag that we
78 /// are input. This SUnit graph is similar to the SelectionDAG, but
80 /// flagged together nodes with a single SUnit.
87 void InitVRegCycleFlag(SUnit *SU)
[all...] |
| ScheduleDAGRRList.cpp | 139 std::vector<SUnit*> PendingQueue;
158 std::vector<SUnit*> LiveRegDefs;
159 std::vector<SUnit*> LiveRegGens;
190 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) {
196 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) {
200 /// AddPred - adds a predecessor edge to SUnit SU.
203 void AddPred(SUnit *SU, const SDep &D) {
208 /// RemovePred - removes a predecessor edge from SUnit SU
[all...] |
| ScheduleDAGFast.cpp | 43 SmallVector<SUnit *, 16> Queue;
47 void push(SUnit *U) {
51 SUnit *pop() {
53 SUnit *V = Queue.back();
71 std::vector<SUnit*> LiveRegDefs;
80 /// AddPred - adds a predecessor edge to SUnit SU.
82 void AddPred(SUnit *SU, const SDep &D) {
86 /// RemovePred - removes a predecessor edge from SUnit SU.
88 void RemovePred(SUnit *SU, const SDep &D) {
93 void ReleasePred(SUnit *SU, SDep *PredEdge)
[all...] |
| ScheduleDAGList.cpp | 59 std::vector<SUnit*> PendingQueue;
81 void ReleaseSucc(SUnit *SU, const SDep &D);
82 void ReleaseSuccessors(SUnit *SU);
83 void ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
108 void ScheduleDAGList::ReleaseSucc(SUnit *SU, const SDep &D) {
109 SUnit *SuccSU = D.getSUnit();
129 void ScheduleDAGList::ReleaseSuccessors(SUnit *SU) {
131 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
143 void ScheduleDAGList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
175 std::vector<SUnit*> NotReady
[all...] |
| ScheduleDAGSDNodes.cpp | 58 /// NewSUnit - Creates a new SUnit and return a ptr to it.
60 SUnit *ScheduleDAGSDNodes::NewSUnit(SDNode *N) {
62 const SUnit *Addr = 0;
66 SUnits.push_back(SUnit(N, (unsigned)SUnits.size()));
70 SUnit *SU = &SUnits.back();
81 SUnit *ScheduleDAGSDNodes::Clone(SUnit *Old) {
82 SUnit *SU = NewSUnit(Old->getNode());
269 // of -1 means the SDNode does not yet have an associated SUnit.
278 // ensure that reallocation of the vector won't happen, so SUnit*'s won't ge
[all...] |
| /external/llvm/lib/Target/CellSPU/ |
| SPUHazardRecognizers.h | 33 virtual HazardType getHazardType(SUnit *SU, int Stalls);
34 virtual void EmitInstruction(SUnit *SU);
|
| SPUHazardRecognizers.cpp | 44 SPUHazardRecognizer::getHazardType(SUnit *SU, int Stalls)
129 void SPUHazardRecognizer::EmitInstruction(SUnit *SU)
|
| /external/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 22 bool latency_sort::operator()(const SUnit *LHS, const SUnit *RHS) const {
55 SUnit *LatencyPriorityQueue::getSingleUnscheduledPred(SUnit *SU) {
56 SUnit *OnlyAvailablePred = 0;
57 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
59 SUnit &Pred = *I->getSUnit();
72 void LatencyPriorityQueue::push(SUnit *SU) {
76 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
91 void LatencyPriorityQueue::ScheduledNode(SUnit *SU)
[all...] |
| ScheduleDAG.cpp | 56 if (SUnit *SU = Sequence[i])
73 EntrySU = SUnit();
74 ExitSU = SUnit();
88 bool SUnit::addPred(const SDep &D) {
97 SUnit *N = D.getSUnit();
125 void SUnit::removePred(const SDep &D) {
134 SUnit *N = D.getSUnit();
168 void SUnit::setDepthDirty() {
170 SmallVector<SUnit*, 8> WorkList;
173 SUnit *SU = WorkList.pop_back_val()
[all...] |
| ScheduleDAGEmit.cpp | 35 void ScheduleDAG::EmitPhysRegCopy(SUnit *SU,
36 DenseMap<SUnit*, unsigned> &VRBaseMap) {
37 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
42 DenseMap<SUnit*, unsigned>::iterator VRI = VRBaseMap.find(I->getSUnit());
46 for (SUnit::const_succ_iterator II = SU->Succs.begin(),
|
| ScheduleDAGPrinter.cpp | 46 static bool hasNodeAddressLabel(const SUnit *Node,
53 static std::string getEdgeAttributes(const SUnit *Node,
64 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
65 static std::string getNodeAttributes(const SUnit *N,
77 std::string DOTGraphTraits<ScheduleDAG*>::getNodeLabel(const SUnit *SU,
|
| ScheduleDAGInstrs.h | 111 std::vector<std::vector<SUnit *> > Defs;
112 std::vector<std::vector<SUnit *> > Uses;
117 std::vector<SUnit *> PendingLoads;
148 /// NewSUnit - Creates a new SUnit and return a ptr to it.
150 SUnit *NewSUnit(MachineInstr *MI) {
152 const SUnit *Addr = SUnits.empty() ? 0 : &SUnits[0];
154 SUnits.push_back(SUnit(MI, (unsigned)SUnits.size()));
183 virtual void ComputeLatency(SUnit *SU);
188 virtual void ComputeOperandLatency(SUnit *Def, SUnit *Use
[all...] |
| AntiDepBreaker.h | 45 virtual unsigned BreakAntiDependencies(const std::vector<SUnit>& SUnits,
|
| ScheduleDAGInstrs.cpp | 189 // We'll be allocating one SUnit for each instruction, plus one for
197 SUnit *BarrierChain = 0, *AliasChain = 0;
203 std::map<const Value *, SUnit *> AliasMemDefs, NonAliasMemDefs;
204 std::map<const Value *, std::vector<SUnit *> > AliasMemUses, NonAliasMemUses;
244 // Create the SUnit for this MI.
245 SUnit *SU = NewSUnit(MI);
264 std::vector<SUnit *> &UseList = Uses[Reg];
266 std::vector<SUnit *> &DefList = Defs[Reg];
276 SUnit *DefSU = DefList[i];
285 std::vector<SUnit *> &MemDefList = Defs[*Alias]
[all...] |
| PostRASchedulerList.cpp | 119 std::vector<SUnit*> PendingQueue;
170 void ReleaseSucc(SUnit *SU, SDep *SuccEdge);
171 void ReleaseSuccessors(SUnit *SU);
172 void ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
324 EntrySU = SUnit();
325 ExitSU = SUnit();
536 void SchedulePostRATDList::ReleaseSucc(SUnit *SU, SDep *SuccEdge) {
537 SUnit *SuccSU = SuccEdge->getSUnit();
567 void SchedulePostRATDList::ReleaseSuccessors(SUnit *SU) {
568 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end()
[all...] |
| CriticalAntiDepBreaker.cpp | 157 /// CriticalPathStep - Return the next SUnit after SU on the bottom-up
159 static const SDep *CriticalPathStep(const SUnit *SU) {
163 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
165 const SUnit *PredSU = P->getSUnit();
419 BreakAntiDependencies(const std::vector<SUnit>& SUnits,
428 // Keep a map of the MachineInstr*'s back to the SUnit representing them.
430 DenseMap<MachineInstr*,const SUnit*> MISUnitMap;
433 const SUnit *Max = 0;
435 const SUnit *SU = &SUnits[i];
454 // Track progress along the critical path through the SUnit graph as we wal
[all...] |
| AggressiveAntiDepBreaker.cpp | 278 static void AntiDepEdges(const SUnit *SU, std::vector<const SDep*>& Edges) {
280 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
292 /// CriticalPathStep - Return the next SUnit after SU on the bottom-up
294 static const SUnit *CriticalPathStep(const SUnit *SU) {
299 for (SUnit::const_pred_iterator P = SU->Preds.begin(), PE = SU->Preds.end();
301 const SUnit *PredSU = P->getSUnit();
720 const std::vector<SUnit>& SUnits,
738 // ...need a map from MI to SUnit.
739 std::map<MachineInstr *, const SUnit *> MISUnitMap
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCHazardRecognizers.h | 33 virtual void EmitInstruction(SUnit *SU);
64 virtual HazardType getHazardType(SUnit *SU, int Stalls);
65 virtual void EmitInstruction(SUnit *SU);
|
| /external/llvm/lib/Target/ARM/ |
| ARMHazardRecognizer.h | 45 virtual HazardType getHazardType(SUnit *SU, int Stalls);
47 virtual void EmitInstruction(SUnit *SU);
|
| ARMHazardRecognizer.cpp | 35 ARMHazardRecognizer::getHazardType(SUnit *SU, int Stalls) {
83 void ARMHazardRecognizer::EmitInstruction(SUnit *SU) {
|
