Home
last modified time | relevance | path

Searched defs:SU (Results 1 – 25 of 57) sorted by relevance

123

/llvm-project/llvm/lib/CodeGen/
H A DVLIWMachineScheduler.cpp108 bool VLIWResourceModel::isResourceAvailable(SUnit *SU, bool IsTop) { in isResourceAvailable() argument
145 bool VLIWResourceModel::reserveResources(SUnit *SU, bool IsTop) { in reserveResources() argument
244 SUnit *SU = SchedImpl->pickNode(IsTopNode); schedule() local
310 releaseTopNode(SUnit * SU) releaseTopNode() argument
325 releaseBottomNode(SUnit * SU) releaseBottomNode() argument
361 checkHazard(SUnit * SU) checkHazard() argument
373 releaseNode(SUnit * SU,unsigned ReadyCycle) releaseNode() argument
414 bumpNode(SUnit * SU) bumpNode() argument
451 SUnit *SU = *(Pending.begin() + i); releasePending() local
472 removeReady(SUnit * SU) removeReady() argument
511 traceCandidate(const char * Label,const ReadyQueue & Q,SUnit * SU,int Cost,PressureChange P) traceCandidate() argument
548 isSingleUnscheduledPred(SUnit * SU,SUnit * SU2) isSingleUnscheduledPred() argument
563 isSingleUnscheduledSucc(SUnit * SU,SUnit * SU2) isSingleUnscheduledSucc() argument
580 pressureChange(const SUnit * SU,bool isBotUp) pressureChange() argument
596 SchedulingCost(ReadyQueue & Q,SUnit * SU,SchedCandidate & Candidate,RegPressureDelta & Delta,bool verbose) SchedulingCost() argument
887 if (SUnit *SU = Bot.pickOnlyChoice()) { pickNodeBidrectional() local
892 if (SUnit *SU = Top.pickOnlyChoice()) { pickNodeBidrectional() local
956 SUnit *SU; pickNode() local
999 schedNode(SUnit * SU,bool IsTopNode) schedNode() argument
[all...]
H A DLatencyPriorityQueue.cpp56 SUnit *LatencyPriorityQueue::getSingleUnscheduledPred(SUnit *SU) { in getSingleUnscheduledPred()
72 void LatencyPriorityQueue::push(SUnit *SU) { in push()
89 void LatencyPriorityQueue::scheduledNode(SUnit *SU) { in scheduledNode()
100 void LatencyPriorityQueue::AdjustPriorityOfUnscheduledPreds(SUnit *SU) { in AdjustPriorityOfUnscheduledPreds()
129 void LatencyPriorityQueue::remove(SUnit *SU) { in remove()
142 for (const SUnit *SU : Queue) { in dump() local
H A DMultiHazardRecognizer.cpp34 MultiHazardRecognizer::getHazardType(SUnit *SU, int Stalls) { in getHazardType()
48 void MultiHazardRecognizer::EmitInstruction(SUnit *SU) { in EmitInstruction()
58 unsigned MultiHazardRecognizer::PreEmitNoops(SUnit *SU) { in PreEmitNoops()
72 bool MultiHazardRecognizer::ShouldPreferAnother(SUnit *SU) { in ShouldPreferAnother()
H A DScheduleDAG.cpp223 SU->isDepthCurrent = false; in setDepthDirty() local
238 SU->isHeightCurrent = false; in setHeightDirty() local
499 SUnit *SU = WorkList.back(); InitDAGTopologicalSorting() local
504 SUnit *SU = PredDep.getSUnit(); InitDAGTopologicalSorting() local
573 DFS(const SUnit * SU,int UpperBound,bool & HasLoop) DFS() argument
622 const SUnit *SU = WorkList.back(); GetSubGraph() local
656 const SUnit *SU = WorkList.back(); GetSubGraph() local
706 WillCreateCycle(SUnit * TargetSU,SUnit * SU) WillCreateCycle() argument
718 AddSUnitWithoutPredecessors(const SUnit * SU) AddSUnitWithoutPredecessors() argument
726 IsReachable(const SUnit * SU,const SUnit * TargetSU) IsReachable() argument
[all...]
H A DMacroFusion.cpp38 static SUnit *getPredClusterSU(const SUnit &SU) { in getPredClusterSU()
46 bool llvm::hasLessThanNumFused(const SUnit &SU, unsigned FuseLimit) { in hasLessThanNumFused()
100 SUnit *SU = SI.getSUnit(); in fuseInstructionPair() local
113 SUnit *SU = SI.getSUnit(); in fuseInstructionPair() local
H A DMachineScheduler.cpp687 for (const SUnit *SU : Queue) dump() local
706 releaseSucc(SUnit * SU,SDep * SuccEdge) releaseSucc() argument
734 releaseSuccessors(SUnit * SU) releaseSuccessors() argument
743 releasePred(SUnit * SU,SDep * PredEdge) releasePred() argument
771 releasePredecessors(SUnit * SU) releasePredecessors() argument
861 SUnit *SU = SchedImpl->pickNode(IsTopNode); schedule() local
964 updateQueues(SUnit * SU,bool IsTopNode) updateQueues() argument
1012 SUnit *SU = getSUnit(&MI); dumpScheduleTraceTopDown() local
1030 SUnit *SU = getSUnit(&MI); dumpScheduleTraceTopDown() local
1094 SUnit *SU = getSUnit(&MI); dumpScheduleTraceBottomUp() local
1112 SUnit *SU = getSUnit(&MI); dumpScheduleTraceBottomUp() local
1176 if (SUnit *SU = getSUnit(&MI)) dumpSchedule() local
1193 collectVRegUses(SUnit & SU) collectVRegUses() argument
1332 updateScheduledPressure(const SUnit * SU,const std::vector<unsigned> & NewMaxPressure) updateScheduledPressure() argument
1377 SUnit &SU = *V2SU.SU; updatePressureDiffs() local
1409 SUnit *SU = V2SU.SU; updatePressureDiffs() local
1432 for (const SUnit &SU : SUnits) { dump() local
1485 SUnit *SU = SchedImpl->pickNode(IsTopNode); schedule() local
1606 SUnit *SU = V2SU.SU; computeCyclicCriticalPath() local
1651 scheduleMI(SUnit * SU,bool IsTopNode) scheduleMI() argument
1737 SUnit *SU; global() member
1943 for (auto &SU : SUnits) { collectMemOpRecords() local
2338 getLatencyStallCycles(SUnit * SU) getLatencyStallCycles() argument
2457 checkHazard(SUnit * SU) checkHazard() argument
2553 releaseNode(SUnit * SU,unsigned ReadyCycle,bool InPQueue,unsigned Idx) releaseNode() argument
2678 bumpNode(SUnit * SU) bumpNode() argument
2851 SUnit *SU = *(Pending.begin() + I); releasePending() local
2870 removeReady(SUnit * SU) removeReady() argument
3380 for (const SUnit *SU : Bot.Available) { registerRoots() local
3435 getWeakLeft(const SUnit * SU,bool isTop) getWeakLeft() argument
3446 biasPhysReg(const SUnit * SU,bool isTop) biasPhysReg() argument
3483 initCandidate(SchedCandidate & Cand,SUnit * SU,bool AtTop,const RegPressureTracker & RPTracker,RegPressureTracker & TempTracker) initCandidate() argument
3670 if (SUnit *SU = Bot.pickOnlyChoice()) { pickNodeBidirectional() local
3675 if (SUnit *SU = Top.pickOnlyChoice()) { pickNodeBidirectional() local
3751 SUnit *SU; pickNode() local
3805 reschedulePhysReg(SUnit * SU,bool isTop) reschedulePhysReg() argument
3836 schedNode(SUnit * SU,bool IsTopNode) schedNode() argument
3921 for (const SUnit *SU : Bot.Available) { registerRoots() local
4000 if (SUnit *SU = Bot.pickOnlyChoice()) { pickNodeBidirectional() local
4005 if (SUnit *SU = Top.pickOnlyChoice()) { pickNodeBidirectional() local
4081 SUnit *SU; pickNode() local
4132 schedNode(SUnit * SU,bool IsTopNode) schedNode() argument
4224 SUnit *SU = ReadyQ.back(); pickNode() local
4246 schedNode(SUnit * SU,bool IsTopNode) schedNode() argument
4252 releaseBottomNode(SUnit * SU) releaseBottomNode() argument
4319 SUnit *SU; pickNode() local
4340 schedNode(SUnit * SU,bool IsTopNode) schedNode() argument
4342 releaseTopNode(SUnit * SU) releaseTopNode() argument
4345 releaseBottomNode(SUnit * SU) releaseBottomNode() argument
[all...]
H A DScheduleDAGInstrs.cpp238 /// data dependencies from SU to any uses of the physical register. in addPhysRegDataDeps() argument
104 for (const SUnit *SU : L) { dumpSUList() local
294 addPhysRegDeps(SUnit * SU,unsigned OperIdx) addPhysRegDeps() argument
404 addVRegDefDeps(SUnit * SU,unsigned OperIdx) addVRegDefDeps() argument
524 addVRegUseDeps(SUnit * SU,unsigned OperIdx) addVRegUseDeps() argument
587 SUnit *SU = newSUnit(&MI); initSUnits() local
641 insert(SUnit * SU,ValueType V) insert() argument
679 addChainDependencies(SUnit * SU,Value2SUsMap & Val2SUsMap) addChainDependencies() argument
686 addChainDependencies(SUnit * SU,Value2SUsMap & Val2SUsMap,ValueType V) addChainDependencies() argument
700 for (auto *SU : SUs) addBarrierChain() local
827 SUnit *SU = MISUnitMap[&MI]; buildSchedGraph() local
1068 for (const auto *SU : SUs) reduceHugeMemNodeMaps() local
1073 for (const auto *SU : SUs) reduceHugeMemNodeMaps() local
1193 for (const SUnit &SU : SUnits) dump() local
1280 visitPreorder(const SUnit * SU) visitPreorder() argument
1288 visitPostorderNode(const SUnit * SU) visitPostorderNode() argument
1437 follow(const SUnit * SU) follow() argument
1458 hasDataSucc(const SUnit * SU) hasDataSucc() argument
1474 for (const SUnit &SU : SUnits) { compute() local
[all...]
/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DResourcePriorityQueue.cpp67 ResourcePriorityQueue::numberRCValPredInSU(SUnit *SU, unsigned RCId) { in numberRCValPredInSU()
104 unsigned ResourcePriorityQueue::numberRCValSuccInSU(SUnit *SU, in numberRCValSuccInSU()
142 static unsigned numberCtrlDepsInSU(SUnit *SU) { in numberCtrlDepsInSU()
151 static unsigned numberCtrlPredInSU(SUnit *SU) { in numberCtrlPredInSU()
209 SUnit *ResourcePriorityQueue::getSingleUnscheduledPred(SUnit *SU) { in getSingleUnscheduledPred()
224 void ResourcePriorityQueue::push(SUnit *SU) { in push()
238 bool ResourcePriorityQueue::isResourceAvailable(SUnit *SU) { in isResourceAvailable()
281 void ResourcePriorityQueue::reserveResources(SUnit *SU) { in reserveResources()
318 int ResourcePriorityQueue::rawRegPressureDelta(SUnit *SU, unsigned RCId) { in rawRegPressureDelta()
352 int ResourcePriorityQueue::regPressureDelta(SUnit *SU, bool RawPressure) { in regPressureDelta()
[all …]
H A DScheduleDAGRRList.cpp211 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) { in IsReachable() argument
217 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) { in WillCreateCycle() argument
224 void AddPredQueued(SUnit *SU, const SDep &D) { in AddPredQueued() argument
232 AddPred(SUnit * SU,const SDep & D) AddPred() argument
240 RemovePred(SUnit * SU,const SDep & D) RemovePred() argument
246 isReady(SUnit * SU) isReady() argument
400 ReleasePred(SUnit * SU,const SDep * PredEdge) ReleasePred() argument
556 ReleasePredecessors(SUnit * SU) ReleasePredecessors() argument
653 AdvancePastStalls(SUnit * SU) AdvancePastStalls() argument
695 EmitNode(SUnit * SU) EmitNode() argument
738 ScheduleNodeBottomUp(SUnit * SU) ScheduleNodeBottomUp() argument
837 UnscheduleNodeBottomUp(SUnit * SU) UnscheduleNodeBottomUp() argument
940 SUnit *SU = *I; RestoreHazardCheckerBottomUp() local
950 BacktrackBottomUp(SUnit * SU,SUnit * BtSU) BacktrackBottomUp() argument
972 isOperandOf(const SUnit * SU,SDNode * N) isOperandOf() argument
982 TryUnfoldSU(SUnit * SU) TryUnfoldSU() argument
1131 CopyAndMoveSuccessors(SUnit * SU) CopyAndMoveSuccessors() argument
1219 InsertCopiesAndMoveSuccs(SUnit * SU,unsigned Reg,const TargetRegisterClass * DestRC,const TargetRegisterClass * SrcRC,SmallVectorImpl<SUnit * > & Copies) InsertCopiesAndMoveSuccs() argument
1295 CheckForLiveRegDef(SUnit * SU,unsigned Reg,SUnit ** LiveRegDefs,SmallSet<unsigned,4> & RegAdded,SmallVectorImpl<unsigned> & LRegs,const TargetRegisterInfo * TRI,const SDNode * Node=nullptr) CheckForLiveRegDef() argument
1321 CheckForLiveRegDefMasked(SUnit * SU,const uint32_t * RegMask,ArrayRef<SUnit * > LiveRegDefs,SmallSet<unsigned,4> & RegAdded,SmallVectorImpl<unsigned> & LRegs) CheckForLiveRegDefMasked() argument
1348 DelayForLiveRegsBottomUp(SUnit * SU,SmallVectorImpl<unsigned> & LRegs) DelayForLiveRegsBottomUp() argument
1445 SUnit *SU = Interferences[i-1]; releaseInterferences() local
1625 SUnit *SU = PickNodeToScheduleBottomUp(); ListScheduleBottomUp() local
1815 remove(SUnit * SU) remove() argument
1916 SUnit *SU = popFromQueue(DumpQueue, DumpPicker, scheduleDAG); dump() local
1952 CalcNodeSethiUllmanNumber(const SUnit * SU,std::vector<unsigned> & SUNumbers) CalcNodeSethiUllmanNumber() argument
1959 const SUnit *SU; CalcNodeSethiUllmanNumber() member
2026 addNode(const SUnit * SU) addNode() argument
2033 updateNode(const SUnit * SU) updateNode() argument
2143 RegPressureDiff(SUnit * SU,unsigned & LiveUses) const RegPressureDiff() argument
2182 scheduledNode(SUnit * SU) scheduledNode() argument
2251 unscheduledNode(SUnit * SU) unscheduledNode() argument
2346 closestSucc(const SUnit * SU) closestSucc() argument
2364 calcMaxScratches(const SUnit * SU) calcMaxScratches() argument
2375 hasOnlyLiveInOpers(const SUnit * SU) hasOnlyLiveInOpers() argument
2397 hasOnlyLiveOutUses(const SUnit * SU) hasOnlyLiveOutUses() argument
2425 initVRegCycle(SUnit * SU) initVRegCycle() argument
2444 resetVRegCycle(SUnit * SU) resetVRegCycle() argument
2461 hasVRegCycleUse(const SUnit * SU) hasVRegCycleUse() argument
2480 BUHasStall(SUnit * SU,int Height,RegReductionPQBase * SPQ) BUHasStall() argument
2672 isReady(SUnit * SU,unsigned CurCycle) const isReady() argument
2719 isReady(SUnit * SU,unsigned CurCycle) const isReady() argument
2729 canEnableCoalescing(SUnit * SU) canEnableCoalescing() argument
2835 canClobber(const SUnit * SU,const SUnit * Op) canClobber() argument
2856 canClobberReachingPhysRegUse(const SUnit * DepSU,const SUnit * SU,ScheduleDAGRRList * scheduleDAG,const TargetInstrInfo * TII,const TargetRegisterInfo * TRI) canClobberReachingPhysRegUse() argument
2892 canClobberPhysRegDefs(const SUnit * SuccSU,const SUnit * SU,const TargetInstrInfo * TII,const TargetRegisterInfo * TRI) canClobberPhysRegDefs() argument
[all...]
H A DScheduleDAGVLIW.cpp109 releaseSucc(SUnit * SU,const SDep & D) releaseSucc() argument
133 releaseSuccessors(SUnit * SU) releaseSuccessors() argument
146 scheduleNodeTopDown(SUnit * SU,unsigned CurCycle) scheduleNodeTopDown() argument
[all...]
H A DScheduleDAGFast.cpp84 void AddPred(SUnit *SU, const SDep &D) { in AddPred() argument
90 void RemovePred(SUnit *SU, const SDep &D) { in RemovePred() argument
135 void ScheduleDAGFast::ReleasePred(SUnit *SU, SDep *PredEdge) { in ReleasePred() argument
156 void ScheduleDAGFast::ReleasePredecessors(SUnit *SU, unsigne argument
177 ScheduleNodeBottomUp(SUnit * SU,unsigned CurCycle) ScheduleNodeBottomUp() argument
206 CopyAndMoveSuccessors(SUnit * SU) CopyAndMoveSuccessors() argument
372 InsertCopiesAndMoveSuccs(SUnit * SU,unsigned Reg,const TargetRegisterClass * DestRC,const TargetRegisterClass * SrcRC,SmallVectorImpl<SUnit * > & Copies) InsertCopiesAndMoveSuccs() argument
439 CheckForLiveRegDef(SUnit * SU,unsigned Reg,std::vector<SUnit * > & LiveRegDefs,SmallSet<unsigned,4> & RegAdded,SmallVectorImpl<unsigned> & LRegs,const TargetRegisterInfo * TRI,const SDNode * Node=nullptr) CheckForLiveRegDef() argument
472 DelayForLiveRegsBottomUp(SUnit * SU,SmallVectorImpl<unsigned> & LRegs) DelayForLiveRegsBottomUp() argument
[all...]
/llvm-project/llvm/lib/Target/AMDGPU/
H A DR600MachineScheduler.cpp53 SUnit *SU = nullptr; in pickNode() local
135 schedNode(SUnit * SU,bool IsTopNode) schedNode() argument
182 releaseTopNode(SUnit * SU) releaseTopNode() argument
186 releaseBottomNode(SUnit * SU) releaseBottomNode() argument
286 getInstKind(SUnit * SU) getInstKind() argument
315 SUnit *SU = *It; PopInst() local
424 SUnit *SU = AttemptFillSlot(3, true); pickAlu() local
433 SUnit *SU = AttemptFillSlot(Chan, false); pickAlu() local
447 SUnit *SU = nullptr; pickOther() local
[all...]
H A DGCNILPSched.cpp23 SUnit *SU; member
58 CalcNodeSethiUllmanNumber(const SUnit *SU, std::vector<unsigned> &SUNumbers) { in CalcNodeSethiUllmanNumber() argument
106 closestSucc(const SUnit * SU) closestSucc() argument
121 calcMaxScratches(const SUnit * SU) calcMaxScratches() argument
275 releasePredecessors(const SUnit * SU) releasePredecessors() argument
299 for (const SUnit &SU : SUnits) schedule() local
303 for (const SUnit &SU : SUnits) schedule() local
306 for (const auto *SU : BotRoots) { schedule() local
336 auto SU = C->SU; schedule() local
350 for (auto &SU : SUnits) schedule() local
[all...]
H A DGCNMinRegStrategy.cpp25 const SUnit *SU; member
43 void setIsScheduled(const SUnit *SU) { in setIsScheduled() argument
54 decNumPreds(const SUnit * SU) decNumPreds() argument
146 auto SU = C.SU; pickCandidate() local
157 auto SU = C.SU; pickCandidate() local
193 auto SU = Worklist.pop_back_val(); bumpPredsPriority() local
213 releaseSuccessors(const SUnit * SU,int Priority) releaseSuccessors() argument
235 for (const auto *SU : TopRoots) { schedule() local
252 auto SU = C->SU; schedule() local
[all...]
H A DSIMachineScheduler.cpp178 SUnits.push_back(SU); in addUnit() argument
280 SUnit *SU = TopReadySUs[0]; fastSchedule() local
398 SUnit *SU = pickNode(); schedule() local
434 undoReleaseSucc(SUnit * SU,SDep * SuccEdge) undoReleaseSucc() argument
444 releaseSucc(SUnit * SU,SDep * SuccEdge) releaseSucc() argument
464 releaseSuccessors(SUnit * SU,bool InOrOutBlock) releaseSuccessors() argument
480 nodeScheduled(SUnit * SU) nodeScheduled() argument
595 for (const SUnit* SU : SUnits) printDebug() local
627 isSUInBlock(SUnit * SU,unsigned ID) isSUInBlock() argument
637 SUnit *SU = &DAG->SUnits[i]; colorHighLatenciesAlone() local
645 hasDataDependencyPred(const SUnit & SU,const SUnit & FromSU) hasDataDependencyPred() argument
663 SUnit *SU = &DAG->SUnits[i]; colorHighLatenciesGroups() local
679 const SUnit &SU = DAG->SUnits[SUNum]; colorHighLatenciesGroups() local
791 SUnit *SU = &DAG->SUnits[SUNum]; colorComputeReservedDependencies() local
833 SUnit *SU = &DAG->SUnits[SUNum]; colorComputeReservedDependencies() local
877 for (const SUnit &SU : DAG->SUnits) { colorAccordingToReservedDependencies() local
912 SUnit *SU = &DAG->SUnits[SUNum]; colorEndsAccordingToDependencies() local
956 SUnit *SU = &DAG->SUnits[i]; colorForceConsecutiveOrderInGroup() local
982 SUnit *SU = &DAG->SUnits[SUNum]; colorMergeConstantLoadsNextGroup() local
1008 SUnit *SU = &DAG->SUnits[SUNum]; colorMergeIfPossibleNextGroup() local
1029 SUnit *SU = &DAG->SUnits[SUNum]; colorMergeIfPossibleNextGroupOnlyForReserved() local
1051 SUnit *SU = &DAG->SUnits[SUNum]; colorMergeIfPossibleSmallGroupsToNextGroup() local
1057 SUnit *SU = &DAG->SUnits[SUNum]; colorMergeIfPossibleSmallGroupsToNextGroup() local
1090 SUnit *SU = &DAG->SUnits[SUNum]; regroupNoUserInstructions() local
1122 const SUnit &SU = DAG->SUnits[SUNum]; colorExports() local
1187 SUnit *SU = &DAG->SUnits[i]; createBlocksForVariant() local
1201 SUnit *SU = &DAG->SUnits[i]; createBlocksForVariant() local
1785 SUnit *SU = &SUnits[ScheduledSUnits[i]]; moveLowLatencies() local
1913 SUnit *SU = &SUnits[i]; schedule() local
1988 SUnit *SU = &SUnits[I]; schedule() local
[all...]
H A DAMDGPUIGroupLP.cpp191 allowedByRules(const SUnit * SU,SmallVectorImpl<SchedGroup> & SyncPipe) const allowedByRules() argument
205 add(SUnit & SU) add() argument
248 resetEdges(SUnit & SU,ScheduleDAGInstrs * DAG) resetEdges() argument
401 __anonc429d1160202(SUnit *SU) reset() argument
459 for (auto &SU : SG.Collection) { makePipeline() local
480 linkSUnit(SUnit * SU,int SGID,std::vector<std::pair<SUnit *,SUnit * >> & AddedEdges,T I,T E) linkSUnit() argument
497 addEdges(SmallVectorImpl<SchedGroup> & SyncPipeline,SUnit * SU,int SGID,std::vector<std::pair<SUnit *,SUnit * >> & AddedEdges) addEdges() argument
946 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
980 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1022 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1071 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1112 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1147 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1160 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1172 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1187 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1224 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1259 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1277 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1319 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1325 for (auto &SU : DAG->SUnits) apply() local
1863 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1896 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1934 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
1966 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
2007 apply(const SUnit * SU,const ArrayRef<SUnit * > Collection,SmallVectorImpl<SchedGroup> & SyncPipe) apply() argument
2085 for (auto &SU : DAG->SUnits) { applyIGLPStrategy() local
2452 link(SUnit & SU,bool MakePred,std::vector<std::pair<SUnit *,SUnit * >> & AddedEdges) link() argument
2477 link(SUnit & SU,bool MakePred) link() argument
2489 link(SUnit & SU,function_ref<bool (const SUnit * A,const SUnit * B)> P) link() argument
2521 for (auto &SU : DAG->SUnits) { initSchedGroup() local
2534 auto &SU = *RIter; initSchedGroup() local
2551 auto &SU = *I; initSchedGroup() local
2676 initIGLPOpt(SUnit & SU) initIGLPOpt() argument
[all...]
H A DAMDGPUExportClustering.cpp29 static bool isExport(const SUnit &SU) { in isExport()
33 static bool isPositionExport(const SIInstrInfo *TII, SUnit *SU) { in isPositionExport()
82 static void removeExportDependencies(ScheduleDAGInstrs *DAG, SUnit &SU) { in removeExportDependencies()
/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCHazardRecognizers.cpp24 bool PPCDispatchGroupSBHazardRecognizer::isLoadAfterStore(SUnit *SU) { in isLoadAfterStore()
54 bool PPCDispatchGroupSBHazardRecognizer::isBCTRAfterSet(SUnit *SU) { in isBCTRAfterSet()
139 PPCDispatchGroupSBHazardRecognizer::getHazardType(SUnit *SU, int Stalls) { in getHazardType()
146 bool PPCDispatchGroupSBHazardRecognizer::ShouldPreferAnother(SUnit *SU) { in ShouldPreferAnother()
155 unsigned PPCDispatchGroupSBHazardRecognizer::PreEmitNoops(SUnit *SU) { in PreEmitNoops()
174 void PPCDispatchGroupSBHazardRecognizer::EmitInstruction(SUnit *SU) { in EmitInstruction()
325 getHazardType(SUnit *SU, int Stalls) { in getHazardType()
386 void PPCHazardRecognizer970::EmitInstruction(SUnit *SU) { in EmitInstruction()
/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonHazardRecognizer.cpp39 HexagonHazardRecognizer::getHazardType(SUnit *SU, int stalls) { in getHazardType()
95 bool HexagonHazardRecognizer::ShouldPreferAnother(SUnit *SU) { in ShouldPreferAnother()
112 void HexagonHazardRecognizer::EmitInstruction(SUnit *SU) { in EmitInstruction()
/llvm-project/clang/test/AST/
H A Dast-dump-constant-expr.cpp28 struct SU { struct
41 // FIXME: consteval SU test_SU() { return SU(); } argument
/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZHazardRecognizer.cpp77 getHazardType(SUnit *SU, int Stalls) { in getHazardType()
167 void SystemZHazardRecognizer::dumpSU(SUnit *SU, raw_ostream &OS) const { in dumpSU()
271 EmitInstruction(SUnit *SU) { in EmitInstruction()
387 resourcesCost(SUnit *SU) { in resourcesCost()
413 SUnit SU(MI, 0); in emitInstruction() local
H A DSystemZMachineScheduler.cpp176 for (auto *SU : Available) { in pickNode() local
241 void SystemZPostRASchedStrategy::schedNode(SUnit *SU, bool IsTopNode) { in schedNode()
251 void SystemZPostRASchedStrategy::releaseTopNode(SUnit *SU) { in releaseTopNode()
/llvm-project/llvm/lib/Target/ARM/
H A DARMHazardRecognizer.cpp44 getHazardType(SUnit * SU,int Stalls) getHazardType() argument
89 EmitInstruction(SUnit * SU) EmitInstruction() argument
184 getHazardType(SUnit * SU,int Stalls) getHazardType() argument
256 EmitInstruction(SUnit * SU) EmitInstruction() argument
/llvm-project/llvm/include/llvm/CodeGen/
H A DLatencyPriorityQueue.h57 void addNode(const SUnit *SU) override { in addNode()
61 void updateNode(const SUnit *SU) override { in updateNode()
H A DScheduleDAGInstrs.h55 SUnit *SU; global() member
77 SUnit *SU; global() member
217 addChainDependencies(SUnit * SU,SUList & SUs,unsigned Latency) addChainDependencies() argument
272 getSchedClass(SUnit * SU) getSchedClass() argument
279 IsReachable(SUnit * SU,SUnit * TargetSU) IsReachable() argument
[all...]

123