Home
last modified time | relevance | path

Searched refs:SUnit (Results 1 – 25 of 69) sorted by relevance

123

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h41 class SUnit; variable
242 class SUnit {
329 SUnit() in SUnit() function
618 SUnit *Node;
697 SUnit *ExitSU;
703 SmallVector<std::pair<SUnit *, SUnit *>, 16> Updates;
748 bool IsReachable(const SUnit *SU, const SUnit *TargetSU);
751 bool WillCreateCycle(SUnit *TargetSU, SUnit *SU);
755 void AddPred(SUnit *Y, SUnit *X);
759 void AddPredQueued(SUnit *Y, SUnit *X);
[all …]
H A DResourcePriorityQueue.h34 bool operator()(const SUnit* LHS, const SUnit* RHS) const;
39 std::vector<SUnit> *SUnits;
48 std::vector<SUnit*> Queue;
70 std::vector<SUnit*> Packet;
105 int SUSchedulingCost (SUnit *SU);
109 void initNumRegDefsLeft(SUnit *SU);
115 void push(SUnit *U) override;
117 SUnit *pop() override;
119 void remove(SUnit *SU) override;
124 void reserveResources(SUnit *SU);
[all …]
H A DScheduleDAGInstrs.h55 SUnit *SU;
77 SUnit *SU;
158 DenseMap<MachineInstr*, SUnit*> MISUnitMap;
182 SUnit *BarrierChain = nullptr;
190 using SUList = std::list<SUnit *>;
206 void addChainDependency(SUnit *SUa, SUnit *SUb,
211 for (SUnit *Entry : SUs) in addChainDependencies()
272 bool IsReachable(SUnit *SU, SUnit *TargetSU) { in IsReachable()
283 SUnit *newSUnit(MachineInstr *MI);
286 SUnit *getSUnit(MachineInstr *MI) const;
[all …]
H A DMachinePipeliner.h136 SetVector<SUnit *> NodeOrder;
155 std::vector<SUnit> &SUnits;
156 SetVector<SUnit *> Stack;
224 int getZeroLatencyDepth(SUnit *Node) { in getZeroLatencyDepth()
250 unsigned getDistance(SUnit *U, SUnit *V, const SDep &Dep) { in getDistance()
264 unsigned getInstrBaseReg(SUnit *SU) { in getInstrBaseReg()
312 SetVector<SUnit *> Nodes;
318 SUnit *ExceedPressure = nullptr;
377 for (SUnit *SU : *this) { in computeNodeSetInfo()
494 std::map<SUnit *, int> InstrToCycle;
[all …]
H A DLatencyPriorityQueue.h29 bool operator()(const SUnit* LHS, const SUnit* RHS) const;
34 std::vector<SUnit> *SUnits;
43 std::vector<SUnit*> Queue;
57 void addNode(const SUnit *SU) override { in addNode()
61 void updateNode(const SUnit *SU) override { in updateNode()
80 void push(SUnit *U) override;
82 SUnit *pop() override;
84 void remove(SUnit *SU) override;
94 void scheduledNode(SUnit *SU) override;
97 void AdjustPriorityOfUnscheduledPreds(SUnit *SU);
[all …]
H A DMachineScheduler.h360 void initQueues(ArrayRef<SUnit*> TopRoots, ArrayRef<SUnit*> BotRoots);
501 void initQueues(ArrayRef<SUnit*> TopRoots, ArrayRef<SUnit*> BotRoots);
515 void collectVRegUses(SUnit &SU);
534 std::vector<SUnit*> Queue;
562 void push(SUnit *SU) { in push()
767 bool checkHazard(SUnit *SU);
791 void bumpNode(SUnit *SU);
795 void removeReady(SUnit *SU);
800 SUnit *pickOnlyChoice();
864 SUnit *SU;
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAG.cpp66 EntrySU = SUnit(); in clearDAG()
67 ExitSU = SUnit(); in clearDAG()
393 for (const SUnit &SUnit : SUnits) { in VerifyScheduledDAG() local
395 if (SUnit.NumPreds == 0 && SUnit.NumSuccs == 0) { in VerifyScheduledDAG()
401 dumpNode(SUnit); in VerifyScheduledDAG()
406 (isBottomUp ? SUnit.getHeight() : SUnit.getDepth()) > in VerifyScheduledDAG()
410 dumpNode(SUnit); in VerifyScheduledDAG()
536 void ScheduleDAGTopologicalSort::AddPredQueued(SUnit *Y, SUnit *X) { in AddPredQueued()
548 void ScheduleDAGTopologicalSort::AddPred(SUnit *Y, SUnit *X) { in AddPred()
566 void ScheduleDAGTopologicalSort::RemovePred(SUnit *M, SUnit *N) { in RemovePred()
[all …]
H A DLatencyPriorityQueue.cpp23 bool latency_sort::operator()(const SUnit *LHS, const SUnit *RHS) const { in operator ()()
56 SUnit *LatencyPriorityQueue::getSingleUnscheduledPred(SUnit *SU) { in getSingleUnscheduledPred()
57 SUnit *OnlyAvailablePred = nullptr; in getSingleUnscheduledPred()
59 SUnit &Pred = *P.getSUnit(); in getSingleUnscheduledPred()
72 void LatencyPriorityQueue::push(SUnit *SU) { in push()
91 void LatencyPriorityQueue::scheduledNode(SUnit *SU) { in scheduledNode()
117 SUnit *LatencyPriorityQueue::pop() { in pop()
124 SUnit *V = *Best; in pop()
131 void LatencyPriorityQueue::remove(SUnit *SU) { in remove()
133 std::vector<SUnit *>::iterator I = find(Queue, SU); in remove()
[all …]
H A DMacroFusion.cpp39 static SUnit *getPredClusterSU(const SUnit &SU) { in getPredClusterSU()
47 static bool hasLessThanNumFused(const SUnit &SU, unsigned FuseLimit) { in hasLessThanNumFused()
49 const SUnit *CurrentSU = &SU; in hasLessThanNumFused()
54 static bool fuseInstructionPair(ScheduleDAGInstrs &DAG, SUnit &FirstSU, in fuseInstructionPair()
55 SUnit &SecondSU) { in fuseInstructionPair()
101 SUnit *SU = SI.getSUnit(); in fuseInstructionPair()
114 SUnit *SU = SI.getSUnit(); in fuseInstructionPair()
125 for (SUnit &SU : DAG.SUnits) { in fuseInstructionPair()
143 bool scheduleAdjacentImpl(ScheduleDAGInstrs &DAG, SUnit &AnchorSU);
158 for (SUnit &ISU : DAG->SUnits) in apply()
[all …]
H A DMachinePipeliner.cpp686 static bool isSuccOrder(SUnit *SUa, SUnit *SUb) { in isSuccOrder()
1322 SUnit *W = *SI; in unblock()
1579 static bool computePath(SUnit *Cur, SetVector<SUnit *> &Path, in computePath()
1627 for (SUnit *SU : NS) in computeLiveOuts()
1660 llvm::sort(SUnits, [](const SUnit *A, const SUnit *B) { in registerPressureFilter()
1773 for (SUnit *I : N) in groupRemainingNodes()
1782 for (SUnit *I : N) in groupRemainingNodes()
2038 SUnit *SU = *NI; in schedulePipeline()
2465 static SUnit *multipleIterations(SUnit *SU, SwingSchedulerDAG *DAG) { in multipleIterations()
2775 SUnit *Succ; in checkValidNodeOrder()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DR600MachineScheduler.h54 std::vector<SUnit *> AvailableAlus[AluLast];
55 std::vector<SUnit *> PhysicalRegCopy;
73 SUnit *pickNode(bool &IsTopNode) override;
75 void releaseTopNode(SUnit *SU) override;
76 void releaseBottomNode(SUnit *SU) override;
82 int getInstKind(SUnit *SU);
84 AluKind getAluKind(SUnit *SU) const;
89 SUnit *PopInst(std::vector<SUnit*> &Q, bool AnyALU);
92 SUnit* pickAlu();
93 SUnit* pickOther(int QID);
[all …]
H A DGCNILPSched.cpp23 SUnit *SU;
25 Candidate(SUnit *SU_) in Candidate()
42 const SUnit *pickBest(const SUnit *left, const SUnit *right);
50 std::vector<const SUnit*> schedule(ArrayRef<const SUnit*> TopRoots,
66 SUnit *PredSU = Pred.getSUnit(); in CalcNodeSethiUllmanNumber()
132 static int BUCompareLatency(const SUnit *left, const SUnit *right) { in BUCompareLatency()
162 const SUnit *GCNILPScheduler::pickBest(const SUnit *left, const SUnit *right) in pickBest()
289 std::vector<const SUnit*>
299 for (const SUnit &SU : SUnits) in schedule()
303 for (const SUnit &SU : SUnits) in schedule()
[all …]
H A DAMDGPUExportClustering.cpp29 static bool isExport(const SUnit &SU) { in isExport()
48 SmallVector<SUnit *, 8> Copy(Chain); in sortChain()
51 for (SUnit *SU : Copy) { in sortChain()
60 SUnit *ChainHead = Exports.front(); in buildCluster()
64 SUnit *SUa = Exports[Idx]; in buildCluster()
65 SUnit *SUb = Exports[Idx + 1]; in buildCluster()
70 SUnit *PredSU = Pred.getSUnit(); in buildCluster()
86 SUnit *PredSU = Pred.getSUnit(); in removeExportDependencies()
95 SUnit *ExportPredSU = ExportPred.getSUnit(); in removeExportDependencies()
111 SmallVector<SUnit *, 8> Chain; in apply()
[all …]
H A DGCNMinRegStrategy.cpp25 const SUnit *SU;
28 Candidate(const SUnit *SU_, int Priority_ = 0) in Candidate()
38 bool isScheduled(const SUnit *SU) const { in isScheduled()
43 void setIsScheduled(const SUnit *SU) { in setIsScheduled()
48 unsigned getNumPreds(const SUnit *SU) const { in getNumPreds()
54 unsigned decNumPreds(const SUnit *SU) { in decNumPreds()
74 std::vector<const SUnit*> schedule(ArrayRef<const SUnit*> TopRoots,
178 SmallPtrSet<const SUnit*, 32> Set; in bumpPredsPriority()
224 std::vector<const SUnit*>
228 std::vector<const SUnit*> Schedule; in schedule()
[all …]
H A DR600MachineScheduler.cpp53 SUnit *SU = nullptr; in pickNode()
128 const SUnit &S = DAG->SUnits[i]; in pickNode()
288 int R600SchedStrategy::getInstKind(SUnit* SU) { in getInstKind()
312 SUnit *R600SchedStrategy::PopInst(std::vector<SUnit *> &Q, bool AnyALU) { in PopInst()
317 SUnit *SU = *It; in PopInst()
332 std::vector<SUnit *> &QSrc = Pending[IDAlu]; in LoadAlu()
401 SUnit* R600SchedStrategy::pickAlu() { in pickAlu()
426 SUnit *SU = AttemptFillSlot(3, true); in pickAlu()
448 SUnit* R600SchedStrategy::pickOther(int QID) { in pickOther()
449 SUnit *SU = nullptr; in pickOther()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.h33 class SUnit; variable
45 std::vector<SUnit *> Packet;
82 bool reserveResources(SUnit *SU, bool IsTop);
115 SUnit *SU = nullptr;
195 bool checkHazard(SUnit *SU);
201 void bumpNode(SUnit *SU);
205 void removeReady(SUnit *SU);
207 SUnit *pickOnlyChoice();
209 bool isLatencyBound(SUnit *SU) { in isLatencyBound()
239 SUnit *pickNode(bool &IsTopNode) override;
[all …]
H A DHexagonSubtarget.h39 class SUnit; variable
84 const SUnit &Inst1, const SUnit &Inst2) const;
271 void adjustSchedDependency(SUnit *Def, int DefOpIdx, SUnit *Use, int UseOpIdx,
305 void restoreLatency(SUnit *Src, SUnit *Dst) const;
306 void changeLatency(SUnit *Src, SUnit *Dst, unsigned Lat) const;
307 bool isBestZeroLatency(SUnit *Src, SUnit *Dst, const HexagonInstrInfo *TII,
308 SmallSet<SUnit*, 4> &ExclSrc, SmallSet<SUnit*, 4> &ExclDst) const;
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp186 DenseMap<SUnit*, SUnit*> CallSeqEndForStart;
218 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) { in WillCreateCycle()
262 void BacktrackBottomUp(SUnit*, SUnit*);
263 SUnit *TryUnfoldSU(SUnit *);
264 SUnit *CopyAndMoveSuccessors(SUnit*);
287 SUnit *CreateClone(SUnit *N) { in CreateClone()
980 SUnit *ScheduleDAGRRList::TryUnfoldSU(SUnit *SU) { in TryUnfoldSU()
1675 bool operator()(SUnit* left, SUnit* right) const;
1689 bool operator()(SUnit* left, SUnit* right) const;
1705 bool operator()(SUnit* left, SUnit* right) const;
[all …]
H A DScheduleDAGFast.cpp49 SmallVector<SUnit *, 16> Queue;
53 void push(SUnit *U) { in push()
57 SUnit *pop() { in pop()
59 SUnit *V = Queue.back(); in pop()
77 std::vector<SUnit*> LiveRegDefs;
102 SUnit *CopyAndMoveSuccessors(SUnit*);
210 SUnit *ScheduleDAGFast::CopyAndMoveSuccessors(SUnit *SU) { in CopyAndMoveSuccessors()
218 SUnit *NewSU; in CopyAndMoveSuccessors()
250 SUnit *NewSU = newSUnit(N); in CopyAndMoveSuccessors()
268 SUnit *LoadSU; in CopyAndMoveSuccessors()
[all …]
H A DScheduleDAGSDNodes.h53 std::vector<SUnit*> Sequence;
86 SUnit *newSUnit(SDNode *N);
91 SUnit *Clone(SUnit *Old);
101 void InitNumRegDefsLeft(SUnit *SU);
105 virtual void computeLatency(SUnit *SU);
125 void dumpNode(const SUnit &SU) const override;
129 std::string getGraphNodeLabel(const SUnit *SU) const override;
146 RegDefIter(const SUnit *SU, const ScheduleDAGSDNodes *SD);
187 void EmitPhysRegCopy(SUnit *SU, DenseMap<SUnit*, Register> &VRBaseMap,
H A DResourcePriorityQueue.cpp77 SUnit *PredSU = Pred.getSUnit(); in numberRCValPredInSU()
115 SUnit *SuccSU = Succ.getSUnit(); in numberRCValSuccInSU()
146 static unsigned numberCtrlDepsInSU(SUnit *SU) { in numberCtrlDepsInSU()
172 SUnit *SU = &(*SUnits)[i]; in initNodes()
180 bool resource_sort::operator()(const SUnit *LHS, const SUnit *RHS) const { in operator ()()
214 SUnit *ResourcePriorityQueue::getSingleUnscheduledPred(SUnit *SU) { in getSingleUnscheduledPred()
215 SUnit *OnlyAvailablePred = nullptr; in getSingleUnscheduledPred()
217 SUnit &PredSU = *Pred.getSUnit(); in getSingleUnscheduledPred()
229 void ResourcePriorityQueue::push(SUnit *SU) { in push()
590 SUnit *ResourcePriorityQueue::pop() { in pop()
[all …]
H A DScheduleDAGVLIW.cpp61 std::vector<SUnit*> PendingQueue;
85 void releaseSucc(SUnit *SU, const SDep &D);
86 void releaseSuccessors(SUnit *SU);
87 void scheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
113 void ScheduleDAGVLIW::releaseSucc(SUnit *SU, const SDep &D) { in releaseSucc()
114 SUnit *SuccSU = D.getSUnit(); in releaseSucc()
137 void ScheduleDAGVLIW::releaseSuccessors(SUnit *SU) { in releaseSuccessors()
150 void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigned CurCycle) { in scheduleNodeTopDown()
182 std::vector<SUnit*> NotReady; in listScheduleTopDown()
209 SUnit *FoundSUnit = nullptr; in listScheduleTopDown()
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZHazardRecognizer.h72 inline unsigned getNumDecoderSlots(SUnit *SU) const;
75 bool fitsIntoCurrentGroup(SUnit *SU) const;
85 unsigned getCurrCycleIdx(SUnit *SU = nullptr) const;
104 bool isFPdOpPreferred_distance(SUnit *SU) const;
116 HazardType getHazardType(SUnit *SU, int Stalls = 0) override;
118 void EmitInstruction(SUnit *SU) override;
121 const MCSchedClassDesc *getSchedClass(SUnit *SU) const { in getSchedClass()
137 int groupingCost(SUnit *SU) const;
142 int resourcesCost(SUnit *SU);
147 void dumpSU(SUnit *SU, raw_ostream &OS) const;
H A DSystemZMachineScheduler.h42 SUnit *SU = nullptr;
51 Candidate(SUnit *SU_, SystemZHazardRecognizer &HazardRec);
74 bool operator() (SUnit *lhs, SUnit *rhs) const { in operator()
89 struct SUSet : std::set<SUnit*, SUSorter> {
139 SUnit *pickNode(bool &IsTopNode) override;
143 void schedNode(SUnit *SU, bool IsTopNode) override;
147 void releaseTopNode(SUnit *SU) override;
150 void releaseBottomNode(SUnit *SU) override {}; in releaseBottomNode()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCHazardRecognizers.h27 SmallVector<SUnit *, 7> CurGroup;
30 bool isLoadAfterStore(SUnit *SU);
31 bool isBCTRAfterSet(SUnit *SU);
39 HazardType getHazardType(SUnit *SU, int Stalls) override;
40 bool ShouldPreferAnother(SUnit* SU) override;
41 unsigned PreEmitNoops(SUnit *SU) override;
42 void EmitInstruction(SUnit *SU) override;
78 HazardType getHazardType(SUnit *SU, int Stalls) override;
79 void EmitInstruction(SUnit *SU) override;

123