Searched refs:SU (Results 1 - 25 of 45) sorted by relevance

12

/macosx-10.10/llvmCore-3425.0.34/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp39 /// Check if scheduling of this SU is possible
44 bool VLIWResourceModel::isResourceAvailable(SUnit *SU) { argument
45 if (!SU || !SU->getInstr())
50 switch (SU->getInstr()->getOpcode()) {
52 if (!ResourcesModel->canReserveResources(SU->getInstr()))
76 if (I->getSUnit() == SU)
84 bool VLIWResourceModel::reserveResources(SUnit *SU) { argument
87 if (!SU) {
93 // If this SU doe
208 releaseTopNode(SUnit *SU) argument
225 releaseBottomNode(SUnit *SU) argument
257 checkHazard(SUnit *SU) argument
268 releaseNode(SUnit *SU, unsigned ReadyCycle) argument
309 bumpNode(SUnit *SU) argument
347 SUnit *SU = *(Pending.begin()+i); local
367 removeReady(SUnit *SU) argument
396 traceCandidate(const char *Label, const ReadyQueue &Q, SUnit *SU, PressureElement P) argument
411 getSingleUnscheduledPred(SUnit *SU) argument
429 getSingleUnscheduledSucc(SUnit *SU) argument
456 SchedulingCost(ReadyQueue &Q, SUnit *SU, SchedCandidate &Candidate, RegPressureDelta &Delta, bool verbose) argument
631 SUnit *SU; local
673 schedNode(SUnit *SU, bool IsTopNode) argument
[all...]
H A DHexagonMachineScheduler.h88 bool isResourceAvailable(SUnit *SU);
89 bool reserveResources(SUnit *SU);
115 SUnit *SU; member in struct:llvm::ConvergingVLIWScheduler::SchedCandidate
123 SchedCandidate(): SU(NULL), SCost(0) {}
176 bool checkHazard(SUnit *SU);
178 void releaseNode(SUnit *SU, unsigned ReadyCycle);
182 void bumpNode(SUnit *SU);
186 void removeReady(SUnit *SU);
214 virtual void schedNode(SUnit *SU, bool IsTopNode);
216 virtual void releaseTopNode(SUnit *SU);
[all...]
/macosx-10.10/llvmCore-3425.0.34/include/llvm/CodeGen/
H A DResourcePriorityQueue.h88 void addNode(const SUnit *SU) { argument
92 void updateNode(const SUnit *SU) {} argument
108 /// Single cost function reflecting benefit of scheduling SU
110 signed SUSchedulingCost (SUnit *SU);
114 void initNumRegDefsLeft(SUnit *SU);
115 void updateNumRegDefsLeft(SUnit *SU);
116 signed regPressureDelta(SUnit *SU, bool RawPressure = false);
117 signed rawRegPressureDelta (SUnit *SU, unsigned RCId);
125 virtual void remove(SUnit *SU);
131 bool isResourceAvailable(SUnit *SU);
[all...]
H A DLatencyPriorityQueue.h57 void addNode(const SUnit *SU) { argument
61 void updateNode(const SUnit *SU) { argument
84 virtual void remove(SUnit *SU);
95 void AdjustPriorityOfUnscheduledPreds(SUnit *SU);
96 SUnit *getSingleUnscheduledPred(SUnit *SU);
H A DMachineScheduler.h124 virtual void schedNode(SUnit *SU, bool IsTopNode) = 0;
128 virtual void releaseTopNode(SUnit *SU) = 0;
131 virtual void releaseBottomNode(SUnit *SU) = 0;
152 // SU is in this queue if it's NodeQueueID is a superset of this ID.
153 bool isInQueue(SUnit *SU) const { return (SU->NodeQueueId & ID); }
165 iterator find(SUnit *SU) { argument
166 return std::find(Queue.begin(), Queue.end(), SU);
169 void push(SUnit *SU) { argument
170 Queue.push_back(SU);
[all...]
H A DScheduleDAGInstrs.h37 SUnit *SU; member in struct:llvm::VReg2SUnit
39 VReg2SUnit(unsigned reg, SUnit *su): VirtReg(reg), SU(su) {}
49 SUnit *SU; member in struct:llvm::PhysRegSUOper
52 PhysRegSUOper(SUnit *su, int op): SU(su), OpIdx(op) {}
243 virtual void dumpNode(const SUnit *SU) const;
246 virtual std::string getGraphNodeLabel(const SUnit *SU) const;
253 void addPhysRegDataDeps(SUnit *SU, unsigned OperIdx);
254 void addPhysRegDeps(SUnit *SU, unsigned OperIdx);
255 void addVRegDefDeps(SUnit *SU, unsigned OperIdx);
256 void addVRegUseDeps(SUnit *SU, unsigne
[all...]
H A DScoreboardHazardRecognizer.h116 // Stalls provides an cycle offset at which SU will be scheduled. It will be
118 virtual HazardType getHazardType(SUnit *SU, int Stalls);
120 virtual void EmitInstruction(SUnit *SU);
/macosx-10.10/llvmCore-3425.0.34/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp71 ResourcePriorityQueue::numberRCValPredInSU(SUnit *SU, unsigned RCId) { argument
73 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
108 unsigned ResourcePriorityQueue::numberRCValSuccInSU(SUnit *SU, argument
111 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
146 static unsigned numberCtrlDepsInSU(SUnit *SU) { argument
148 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
156 static unsigned numberCtrlPredInSU(SUnit *SU) { argument
174 SUnit *SU = &(*SUnits)[i]; local
216 getSingleUnscheduledPred(SUnit *SU) argument
232 push(SUnit *SU) argument
247 isResourceAvailable(SUnit *SU) argument
290 reserveResources(SUnit *SU) argument
327 rawRegPressureDelta(SUnit *SU, unsigned RCId) argument
361 regPressureDelta(SUnit *SU, bool RawPressure) argument
403 SUSchedulingCost(SUnit *SU) argument
473 scheduledNode(SUnit *SU) argument
549 initNumRegDefsLeft(SUnit *SU) argument
581 adjustPriorityOfUnscheduledPreds(SUnit *SU) argument
636 remove(SUnit *SU) argument
[all...]
H A DScheduleDAGRRList.cpp177 /// IsReachable - Checks if SU is reachable from TargetSU.
178 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { argument
179 return Topo.IsReachable(SU, TargetSU);
182 /// WillCreateCycle - Returns true if adding an edge from SU to TargetSU will
184 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) { argument
185 return Topo.WillCreateCycle(SU, TargetSU);
188 /// AddPred - adds a predecessor edge to SUnit SU.
191 void AddPred(SUnit *SU, const SDep &D) { argument
192 Topo.AddPred(SU, D.getSUnit());
193 SU
199 RemovePred(SUnit *SU, const SDep &D) argument
205 isReady(SUnit *SU) argument
345 ReleasePred(SUnit *SU, const SDep *PredEdge) argument
505 ReleasePredecessors(SUnit *SU) argument
602 AdvancePastStalls(SUnit *SU) argument
644 EmitNode(SUnit *SU) argument
686 ScheduleNodeBottomUp(SUnit *SU) argument
783 UnscheduleNodeBottomUp(SUnit *SU) argument
870 SUnit *SU = *I; local
880 BacktrackBottomUp(SUnit *SU, SUnit *BtSU) argument
905 isOperandOf(const SUnit *SU, SDNode *N) argument
916 CopyAndMoveSuccessors(SUnit *SU) argument
1113 InsertCopiesAndMoveSuccs(SUnit *SU, unsigned Reg, const TargetRegisterClass *DestRC, const TargetRegisterClass *SrcRC, SmallVector<SUnit*, 2> &Copies) argument
1182 CheckForLiveRegDef(SUnit *SU, unsigned Reg, std::vector<SUnit*> &LiveRegDefs, SmallSet<unsigned, 4> &RegAdded, SmallVector<unsigned, 4> &LRegs, const TargetRegisterInfo *TRI) argument
1204 CheckForLiveRegDefMasked(SUnit *SU, const uint32_t *RegMask, std::vector<SUnit*> &LiveRegDefs, SmallSet<unsigned, 4> &RegAdded, SmallVector<unsigned, 4> &LRegs) argument
1232 DelayForLiveRegsBottomUp(SUnit *SU, SmallVector<unsigned, 4> &LRegs) argument
1470 SUnit *SU = PickNodeToScheduleBottomUp(); local
1674 remove(SUnit *SU) argument
1767 SUnit *SU = popFromQueue(DumpQueue, DumpPicker, scheduleDAG); local
[all...]
H A DScheduleDAGVLIW.cpp86 void releaseSucc(SUnit *SU, const SDep &D);
87 void releaseSuccessors(SUnit *SU);
88 void scheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
115 void ScheduleDAGVLIW::releaseSucc(SUnit *SU, const SDep &D) { argument
128 SuccSU->setDepthToAtLeast(SU->getDepth() + D.getLatency());
137 void ScheduleDAGVLIW::releaseSuccessors(SUnit *SU) { argument
139 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
144 releaseSucc(SU, *I);
151 void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigne argument
[all...]
H A DScheduleDAGFast.cpp80 /// AddPred - adds a predecessor edge to SUnit SU.
82 void AddPred(SUnit *SU, const SDep &D) { argument
83 SU->addPred(D);
86 /// RemovePred - removes a predecessor edge from SUnit SU.
88 void RemovePred(SUnit *SU, const SDep &D) { argument
89 SU->removePred(D);
93 void ReleasePred(SUnit *SU, SDep *PredEdge);
94 void ReleasePredecessors(SUnit *SU, unsigned CurCycle);
134 void ScheduleDAGFast::ReleasePred(SUnit *SU, SDep *PredEdge) { argument
155 void ScheduleDAGFast::ReleasePredecessors(SUnit *SU, unsigne argument
177 ScheduleNodeBottomUp(SUnit *SU, unsigned CurCycle) argument
207 CopyAndMoveSuccessors(SUnit *SU) argument
380 InsertCopiesAndMoveSuccs(SUnit *SU, unsigned Reg, const TargetRegisterClass *DestRC, const TargetRegisterClass *SrcRC, SmallVector<SUnit*, 2> &Copies) argument
438 CheckForLiveRegDef(SUnit *SU, unsigned Reg, std::vector<SUnit*> &LiveRegDefs, SmallSet<unsigned, 4> &RegAdded, SmallVector<unsigned, 4> &LRegs, const TargetRegisterInfo *TRI) argument
459 DelayForLiveRegsBottomUp(SUnit *SU, SmallVector<unsigned, 4> &LRegs) argument
[all...]
H A DScheduleDAGSDNodes.cpp78 SUnit *SU = &SUnits.back(); local
83 SU->SchedulingPref = Sched::None;
85 SU->SchedulingPref = TLI.getSchedulingPreference(N);
86 return SU;
90 SUnit *SU = newSUnit(Old->getNode()); local
91 SU->OrigNode = Old->OrigNode;
92 SU->Latency = Old->Latency;
93 SU->isVRegCycle = Old->isVRegCycle;
94 SU->isCall = Old->isCall;
95 SU
[all...]
H A DScheduleDAGSDNodes.h92 void InitVRegCycleFlag(SUnit *SU);
96 void InitNumRegDefsLeft(SUnit *SU);
100 virtual void computeLatency(SUnit *SU);
119 virtual void dumpNode(const SUnit *SU) const;
123 virtual std::string getGraphNodeLabel(const SUnit *SU) const;
139 RegDefIter(const SUnit *SU, const ScheduleDAGSDNodes *SD);
179 void EmitPhysRegCopy(SUnit *SU, DenseMap<SUnit*, unsigned> &VRBaseMap,
/macosx-10.10/llvmCore-3425.0.34/lib/Target/CellSPU/
H A DSPUHazardRecognizers.h29 virtual HazardType getHazardType(SUnit *SU, int Stalls);
30 virtual void EmitInstruction(SUnit *SU);
H A DSPUHazardRecognizers.cpp38 SPUHazardRecognizer::getHazardType(SUnit *SU, int Stalls) argument
46 const SDNode *Node = SU->getNode()->getFlaggedMachineNode();
123 void SPUHazardRecognizer::EmitInstruction(SUnit *SU) argument
/macosx-10.10/llvmCore-3425.0.34/lib/CodeGen/
H A DLatencyPriorityQueue.cpp54 /// of SU, return it, otherwise return null.
55 SUnit *LatencyPriorityQueue::getSingleUnscheduledPred(SUnit *SU) { argument
57 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
72 void LatencyPriorityQueue::push(SUnit *SU) { argument
76 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
78 if (getSingleUnscheduledPred(I->getSUnit()) == SU)
81 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
83 Queue.push_back(SU);
91 scheduledNode(SUnit *SU) argument
104 AdjustPriorityOfUnscheduledPreds(SUnit *SU) argument
133 remove(SUnit *SU) argument
[all...]
H A DMachineScheduler.cpp301 void ScheduleDAGMI::releaseSucc(SUnit *SU, SDep *SuccEdge) { argument
317 /// releaseSuccessors - Call releaseSucc on each of SU's successors.
318 void ScheduleDAGMI::releaseSuccessors(SUnit *SU) { argument
319 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
321 releaseSucc(SU, &*I);
329 void ScheduleDAGMI::releasePred(SUnit *SU, SDep *PredEdge) { argument
345 /// releasePredecessors - Call releasePred on each of SU's predecessors.
346 void ScheduleDAGMI::releasePredecessors(SUnit *SU) { argument
347 for (SUnit::pred_iterator I = SU
556 scheduleMI(SUnit *SU, bool IsTopNode) argument
596 updateQueues(SUnit *SU, bool IsTopNode) argument
643 SUnit *SU; member in struct:__anon10236::ConvergingScheduler::SchedCandidate
770 releaseTopNode(SUnit *SU) argument
787 releaseBottomNode(SUnit *SU) argument
819 checkHazard(SUnit *SU) argument
830 releaseNode(SUnit *SU, unsigned ReadyCycle) argument
871 bumpNode(SUnit *SU) argument
900 SUnit *SU = *(Pending.begin()+i); local
920 removeReady(SUnit *SU) argument
948 traceCandidate(const char *Label, const ReadyQueue &Q, SUnit *SU, PressureElement P) argument
1136 SUnit *SU; local
1182 schedNode(SUnit *SU, bool IsTopNode) argument
1254 SUnit *SU = ReadyQ.back(); local
1266 releaseBottomNode(SUnit *SU) argument
1328 SUnit *SU; local
1350 schedNode(SUnit *SU, bool IsTopNode) argument
1352 releaseTopNode(SUnit *SU) argument
1355 releaseBottomNode(SUnit *SU) argument
[all...]
H A DScheduleDAGInstrs.cpp187 /// the exit SU to the register defs and use list. This is because we want to
229 /// MO is an operand of SU's instruction that defines a physical register. Add
230 /// data dependencies from SU to any uses of the physical register.
231 void ScheduleDAGInstrs::addPhysRegDataDeps(SUnit *SU, unsigned OperIdx) { argument
232 const MachineOperand &MO = SU->getInstr()->getOperand(OperIdx);
244 SUnit *UseSU = UseList[i].SU;
245 if (UseSU == SU)
248 SDep dep(SU, SDep::Data, 1, *Alias);
255 SchedModel.computeOperandLatency(SU->getInstr(), OperIdx,
258 SchedModel.computeOperandLatency(SU
270 addPhysRegDeps(SUnit *SU, unsigned OperIdx) argument
344 addVRegDefDeps(SUnit *SU, unsigned OperIdx) argument
381 addVRegUseDeps(SUnit *SU, unsigned OperIdx) argument
575 adjustChainDeps(AliasAnalysis *AA, const MachineFrameInfo *MFI, SUnit *SU, SUnit *ExitSU, std::set<SUnit *> &CheckList, unsigned LatencyToLoad) argument
647 SUnit *SU = newSUnit(MI); local
722 SUnit *SU = MISUnitMap[MI]; local
946 follow(const SUnit *SU) argument
967 getILP(const SUnit *SU) argument
972 initILP(const SUnit *SU) argument
[all...]
H A DScheduleDAG.cpp167 SUnit *SU = WorkList.pop_back_val();
168 SU->isDepthCurrent = false;
169 for (SUnit::const_succ_iterator I = SU->Succs.begin(),
170 E = SU->Succs.end(); I != E; ++I) {
183 SUnit *SU = WorkList.pop_back_val();
184 SU->isHeightCurrent = false;
185 for (SUnit::const_pred_iterator I = SU->Preds.begin(),
186 E = SU->Preds.end(); I != E; ++I) {
286 dbgs() << "SU(" << NodeNum << "): ";
311 dbgs() << "SU(" <<
[all...]
H A DScoreboardHazardRecognizer.cpp118 ScoreboardHazardRecognizer::getHazardType(SUnit *SU, int Stalls) { argument
128 const MCInstrDesc *MCID = DAG->getInstrDesc(SU);
165 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): ");
166 DEBUG(DAG->dumpNode(SU));
178 void ScoreboardHazardRecognizer::EmitInstruction(SUnit *SU) { argument
184 const MCInstrDesc *MCID = DAG->getInstrDesc(SU);
/macosx-10.10/llvmCore-3425.0.34/lib/Target/ARM/
H A DARMHazardRecognizer.cpp35 ARMHazardRecognizer::getHazardType(SUnit *SU, int Stalls) { argument
38 MachineInstr *MI = SU->getInstr();
70 return ScoreboardHazardRecognizer::getHazardType(SU, Stalls);
79 void ARMHazardRecognizer::EmitInstruction(SUnit *SU) { argument
80 MachineInstr *MI = SU->getInstr();
86 ScoreboardHazardRecognizer::EmitInstruction(SU);
H A DARMHazardRecognizer.h47 virtual HazardType getHazardType(SUnit *SU, int Stalls);
49 virtual void EmitInstruction(SUnit *SU);
/macosx-10.10/vim-55/runtime/keymap/
H A Dlithuanian-baltic.vim17 $ �� LITHUANIAN CAPITAL E SU TASKU
21 * �� LITHUANIAN CAPITAL U SU BRUKSNIU
26 4 �� LITHUANIAN LOWERCASE E SU TASKU
30 8 �� LITHUANIAN LOWERCASE U SU BRUKSNIU
/macosx-10.10/llvmCore-3425.0.34/lib/Target/PowerPC/
H A DPPCHazardRecognizers.h33 virtual HazardType getHazardType(SUnit *SU, int Stalls);
34 virtual void EmitInstruction(SUnit *SU);
68 virtual HazardType getHazardType(SUnit *SU, int Stalls);
69 virtual void EmitInstruction(SUnit *SU);
H A DPPCHazardRecognizers.cpp26 void PPCScoreboardHazardRecognizer::EmitInstruction(SUnit *SU) { argument
27 const MCInstrDesc *MCID = DAG->getInstrDesc(SU);
32 ScoreboardHazardRecognizer::EmitInstruction(SU);
36 PPCScoreboardHazardRecognizer::getHazardType(SUnit *SU, int Stalls) { argument
37 return ScoreboardHazardRecognizer::getHazardType(SU, Stalls);
137 getHazardType(SUnit *SU, int Stalls) { argument
140 MachineInstr *MI = SU->getInstr();
197 void PPCHazardRecognizer970::EmitInstruction(SUnit *SU) { argument
198 MachineInstr *MI = SU->getInstr();

Completed in 299 milliseconds

12