Home
last modified time | relevance | path

Searched refs:getSUnit (Results 1 – 25 of 27) sorted by relevance

12

/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp108 if (!Required && PredDep.getSUnit() == D.getSUnit()) in addPred()
114 SUnit *PredSU = PredDep.getSUnit(); in addPred()
132 SUnit *N = D.getSUnit(); in addPred()
179 SUnit *N = D.getSUnit(); in removePred()
221 SUnit *SuccSU = SuccDep.getSUnit(); in setDepthDirty()
236 SUnit *PredSU = PredDep.getSUnit(); in setHeightDirty()
269 SUnit *PredSU = PredDep.getSUnit(); in ComputeDepth()
300 SUnit *SuccSU = SuccDep.getSUnit(); in ComputeHeight()
366 dumpNodeName(*Dep.getSUnit()); in dumpNodeAll()
376 dumpNodeName(*Dep.getSUnit()); in dumpNodeAll()
[all …]
H A DMachinePipeliner.cpp453 SUnit *SuccSU = SI.getSUnit(); in isSuccOrder()
640 SUnit *SU = getSUnit(DefMI); in updatePhiDependences()
695 SUnit *DefSU = getSUnit(DefMI); in changeDependences()
713 if (P->getSUnit() == DefSU) in changeDependences()
913 SUnit *TargetSU = D.getSUnit(); in swapAntiDependences()
1169 SUnit *pred = IP->getSUnit(); in computeNodeFunctions()
1193 SUnit *succ = IS->getSUnit(); in computeNodeFunctions()
3006 SUnit *SU = getSUnit(MI); in applyInstrChange()
3221 return P.getSUnit(); in multipleIterations()
3356 if (S.getSUnit() != *I) in orderDependence()
[all …]
H A DMacroFusion.cpp62 if (SI.getSUnit() == &SecondSU) in fuseInstructionPair()
66 if (SI.getSUnit() == &FirstSU) in fuseInstructionPair()
79 SUnit *SU = SI.getSUnit(); in fuseInstructionPair()
92 SUnit *SU = SI.getSUnit(); in fuseInstructionPair()
163 SUnit &DepSU = *Dep.getSUnit(); in scheduleAdjacentImpl()
H A DLatencyPriorityQueue.cpp61 SUnit &Pred = *I->getSUnit(); in getSingleUnscheduledPred()
80 if (getSingleUnscheduledPred(I->getSUnit()) == SU) in push()
96 AdjustPriorityOfUnscheduledPreds(I->getSUnit()); in scheduledNode()
H A DMachineScheduler.cpp618 Topo.AddPred(SuccSU, PredDep.getSUnit()); in addEdge()
630 SUnit *SuccSU = SuccEdge->getSUnit(); in releaseSucc()
667 SUnit *PredSU = PredEdge->getSUnit(); in releasePred()
925 if (SUnit *SU = getSUnit(&(*MI))) in dumpSchedule()
1348 const SUnit *DefSU = getSUnit(DefMI); in computeCyclicCriticalPath()
1600 if (Succ.getSUnit() == SUb) in clusterNeighboringMemOps()
1791 if (Succ.getSUnit() == GlobalSU) in constrainLocalCopy()
1795 LocalUses.push_back(Succ.getSUnit()); in constrainLocalCopy()
1806 if (Pred.getSUnit() == FirstLocalSU) in constrainLocalCopy()
1810 GlobalUses.push_back(Pred.getSUnit()); in constrainLocalCopy()
[all …]
H A DScheduleDAGInstrs.cpp1218 unsigned PredNum = PredDep.getSUnit()->NodeNum; in visitPostorderNode()
1246 += R.DFSNodeData[PredDep.getSUnit()->NodeNum].InstrCount; in visitPostorderEdge()
1252 ConnectionPairs.push_back(std::make_pair(PredDep.getSUnit(), Succ)); in visitCrossEdge()
1299 const SUnit *PredSU = PredDep.getSUnit(); in joinPredSubtree()
1375 !SuccDep.getSUnit()->isBoundaryNode()) in hasDataSucc()
1402 || PredDep.getSUnit()->isBoundaryNode()) { in compute()
1406 if (Impl.isVisited(PredDep.getSUnit())) { in compute()
1410 Impl.visitPreorder(PredDep.getSUnit()); in compute()
1411 DFS.follow(PredDep.getSUnit()); in compute()
H A DAggressiveAntiDepBreaker.cpp286 const SUnit *PredSU = P->getSUnit(); in CriticalPathStep()
299 return (Next) ? Next->getSUnit() : nullptr; in CriticalPathStep()
853 SUnit *NextSU = Edge->getSUnit(); in BreakAntiDependencies()
897 if (P->getSUnit() == NextSU ? in BreakAntiDependencies()
906 if ((P->getSUnit() == NextSU) && (P->getKind() != SDep::Anti) && in BreakAntiDependencies()
911 } else if ((P->getSUnit() != NextSU) && in BreakAntiDependencies()
H A DCriticalAntiDepBreaker.cpp152 const SUnit *PredSU = P->getSUnit(); in CriticalPathStep()
556 const SUnit *NextSU = Edge->getSUnit(); in BreakAntiDependencies()
580 if (P->getSUnit() == NextSU ? in BreakAntiDependencies()
/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DGCNMinRegStrategy.cpp97 for (auto PDep : SDep.getSUnit()->Preds) { in getReadySuccessors()
98 auto PSU = PDep.getSUnit(); in getReadySuccessors()
187 if (S.getSUnit()->isBoundaryNode() || isScheduled(S.getSUnit()) || in bumpPredsPriority()
190 for (const auto &P : S.getSUnit()->Preds) { in bumpPredsPriority()
191 auto PSU = P.getSUnit(); in bumpPredsPriority()
203 if (!P.getSUnit()->isBoundaryNode() && !isScheduled(P.getSUnit()) && in bumpPredsPriority()
204 Set.insert(P.getSUnit()).second) in bumpPredsPriority()
205 Worklist.push_back(P.getSUnit()); in bumpPredsPriority()
223 auto SuccSU = S.getSUnit(); in releaseSuccessors()
H A DSIMachineScheduler.cpp455 SUnit *SuccSU = SuccEdge->getSUnit(); in undoReleaseSucc()
465 SUnit *SuccSU = SuccEdge->getSUnit(); in releaseSucc()
486 SUnit *SuccSU = Succ.getSUnit(); in releaseSuccessors()
673 if (PredDep.getSUnit() == &FromSU && in hasDataDependencyPred()
829 SUnit *Pred = PredDep.getSUnit(); in colorComputeReservedDependencies()
871 SUnit *Succ = SuccDep.getSUnit(); in colorComputeReservedDependencies()
955 SUnit *Succ = SuccDep.getSUnit(); in colorEndsAccordingToDependencies()
1025 SUnit *Succ = SuccDep.getSUnit(); in colorMergeConstantLoadsNextGroup()
1046 SUnit *Succ = SuccDep.getSUnit(); in colorMergeIfPossibleNextGroup()
1253 SUnit *Pred = PredDep.getSUnit(); in createBlocksForVariant()
[all …]
H A DGCNILPSched.cpp67 SUnit *PredSU = Pred.getSUnit(); in CalcNodeSethiUllmanNumber()
111 unsigned Height = Succ.getSUnit()->getHeight(); in closestSucc()
278 auto PredSU = PredEdge.getSUnit(); in releasePredecessors()
H A DAMDGPUSubtarget.cpp661 if (SI.getSUnit() != SUa) in apply()
662 SUa->addPred(SDep(SI.getSUnit(), SDep::Artificial)); in apply()
667 if (SI.getSUnit() != &SU) in apply()
668 SI.getSUnit()->addPred(SDep(&SU, SDep::Artificial)); in apply()
H A DR600Packetizer.cpp197 if (Dep.getSUnit() != SUI) in isLegalToPacketizeTogether()
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp156 MachineInstr &MI2 = *SI.getSUnit()->getInstr(); in apply()
163 for (SDep &PI : SI.getSUnit()->Preds) { in apply()
167 SI.getSUnit()->setDepthDirty(); in apply()
423 if (!I.isAssignedRegDep() || I.getSUnit() != Dst) in restoreLatency()
462 if (!I.isAssignedRegDep() || I.getSUnit() != Dst) in changeLatency()
479 !I.getSUnit()->getInstr()->isPseudo()) in getZeroLatency()
480 return I.getSUnit(); in getZeroLatency()
557 if (ExclSrc.count(I.getSUnit()) == 0 && in isBestZeroLatency()
559 changeLatency(I.getSUnit(), DstBest, 0); in isBestZeroLatency()
565 if (ExclDst.count(I.getSUnit()) == 0 && in isBestZeroLatency()
[all …]
H A DHexagonHazardRecognizer.cpp146 S.getSUnit()->NumPredsLeft == 1) { in EmitInstruction()
147 UsesDotCur = S.getSUnit(); in EmitInstruction()
161 TII->mayBeNewStore(*S.getSUnit()->getInstr()) && in EmitInstruction()
162 Resources->canReserveResources(*S.getSUnit()->getInstr())) { in EmitInstruction()
163 PrefVectorStoreNew = S.getSUnit(); in EmitInstruction()
H A DHexagonMachineScheduler.cpp87 if (S.getSUnit() == SUu && S.getLatency() > 0) in hasDependence()
292 unsigned PredReadyCycle = PI.getSUnit()->TopReadyCycle; in releaseTopNode()
311 unsigned SuccReadyCycle = I->getSUnit()->BotReadyCycle; in releaseBottomNode()
526 if (!Pred.getSUnit()->isScheduled && (Pred.getSUnit() != SU2)) in isSingleUnscheduledPred()
541 if (!Succ.getSUnit()->isScheduled && (Succ.getSUnit() != SU2)) in isSingleUnscheduledSucc()
646 if (isSingleUnscheduledPred(SI.getSUnit(), SU)) in SchedulingCost()
652 if (isSingleUnscheduledSucc(PI.getSUnit(), SU)) in SchedulingCost()
708 Top.ResourceModel->isInPacket(PI.getSUnit())) { in SchedulingCost()
717 Bot.ResourceModel->isInPacket(SI.getSUnit())) { in SchedulingCost()
733 Top.ResourceModel->isInPacket(PI.getSUnit())) { in SchedulingCost()
[all …]
H A DHexagonVLIWPacketizer.cpp929 if (Dep.getSUnit() == PacketSUDep && Dep.getKind() == SDep::Anti && in restrictingDepExistInPacket()
997 if (Dep.getSUnit() == SU && Dep.getKind() == SDep::Data && in arePredicatesComplements()
1399 if (SUJ->Succs[i].getSUnit() != SUI) in isLegalToPacketizeTogether()
1851 if (Pred.getSUnit() == SUJ) in producesStall()
1862 if (Pred.getSUnit() == SUJ && Pred.getLatency() > 1) in producesStall()
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp227 Topo.AddPred(SU, D.getSUnit()); in AddPred()
235 Topo.RemovePred(SU, D.getSUnit()); in RemovePred()
1086 SUnit *SuccDep = D.getSUnit(); in TryUnfoldSU()
1097 SUnit *SuccDep = D.getSUnit(); in TryUnfoldSU()
1190 SUnit *SuccSU = Succ.getSUnit(); in CopyAndMoveSuccessors()
1229 SUnit *SuccSU = Succ.getSUnit(); in InsertCopiesAndMoveSuccs()
2073 SUnit *PredSU = Pred.getSUnit(); in HighRegPressure()
2122 SUnit *PredSU = Pred.getSUnit(); in RegPressureDiff()
2165 SUnit *PredSU = Pred.getSUnit(); in scheduledNode()
2247 SUnit *PredSU = Pred.getSUnit(); in unscheduledNode()
[all …]
H A DScheduleDAGFast.cpp141 SUnit *PredSU = PredEdge->getSUnit(); in ReleasePred()
172 LiveRegDefs[Pred.getReg()] = Pred.getSUnit(); in ReleasePredecessors()
195 if (LiveRegCycles[Succ.getReg()] == Succ.getSUnit()->getHeight()) { in ScheduleNodeBottomUp()
286 else if (Pred.getSUnit()->getNode() && in CopyAndMoveSuccessors()
287 Pred.getSUnit()->getNode()->isOperandOf(LoadNode)) in CopyAndMoveSuccessors()
299 if (ChainPred.getSUnit()) { in CopyAndMoveSuccessors()
318 SUnit *SuccDep = D.getSUnit(); in CopyAndMoveSuccessors()
326 SUnit *SuccDep = D.getSUnit(); in CopyAndMoveSuccessors()
363 SUnit *SuccSU = Succ.getSUnit(); in CopyAndMoveSuccessors()
399 SUnit *SuccSU = Succ.getSUnit(); in InsertCopiesAndMoveSuccs()
[all …]
H A DResourcePriorityQueue.cpp74 SUnit *PredSU = Pred.getSUnit(); in numberRCValPredInSU()
111 SUnit *SuccSU = Succ.getSUnit(); in numberRCValSuccInSU()
212 SUnit &PredSU = *Pred.getSUnit(); in getSingleUnscheduledPred()
229 if (getSingleUnscheduledPred(Succ.getSUnit()) == SU) in push()
273 if (Succ.getSUnit() == SU) in isResourceAvailable()
497 if (Pred.isCtrl() || (Pred.getSUnit()->NumRegDefsLeft == 0)) in scheduledNode()
499 --Pred.getSUnit()->NumRegDefsLeft; in scheduledNode()
512 adjustPriorityOfUnscheduledPreds(Succ.getSUnit()); in scheduledNode()
H A DScheduleDAGVLIW.cpp116 SUnit *SuccSU = D.getSUnit(); in releaseSucc()
/freebsd-12.1/contrib/llvm/lib/Target/PowerPC/
H A DPPCHazardRecognizers.cpp41 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit()); in isLoadAfterStore()
49 if (SU->Preds[i].getSUnit() == CurGroup[j]) in isLoadAfterStore()
67 const MCInstrDesc *PredMCID = DAG->getInstrDesc(SU->Preds[i].getSUnit()); in isBCTRAfterSet()
75 if (SU->Preds[i].getSUnit() == CurGroup[j]) in isBCTRAfterSet()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h153 SUnit *getSUnit() const;
437 if (Pred.getSUnit() == N)
445 if (Succ.getSUnit() == N)
484 inline SUnit *SDep::getSUnit() const { return Dep.getPointer(); }
635 return Node->Preds[Operand].getSUnit();
H A DScheduleDAGInstrs.h276 SUnit *getSUnit(MachineInstr *MI) const;
376 inline SUnit *ScheduleDAGInstrs::getSUnit(MachineInstr *MI) const { in getSUnit() function
H A DMachinePipeliner.h241 return Source->getInstr()->isPHI() || Dep.getSUnit()->getInstr()->isPHI(); in isBackedge()
371 if (Nodes.count(Succ.getSUnit())) in NodeSet()

12