Home
last modified time | relevance | path

Searched refs:NodeNum (Results 1 – 25 of 30) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp177 NodeNum2Index[SU->NodeNum] = SUnits.size(); in addUnit()
184 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
236 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) { in tryCandidateTopDown()
253 TryCand.IsLowLatency = DAG->IsLowLatencySU[SU->NodeNum]; in pickNode()
254 TryCand.LowLatencyOffset = DAG->LowLatencyOffset[SU->NodeNum]; in pickNode()
256 HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]; in pickNode()
466 if (SuccSU->NodeNum >= DAG->SUnits.size()) in releaseSuccessors()
491 if (HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]) in nodeScheduled()
494 if (DAG->IsLowLatencySU[SU->NodeNum]) { in nodeScheduled()
497 NodeNum2Index.find(Succ.getSUnit()->NodeNum); in nodeScheduled()
[all …]
H A DGCNMinRegStrategy.cpp40 return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max(); in isScheduled()
45 NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max(); in setIsScheduled()
50 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in getNumPreds()
51 return NumPreds[SU->NodeNum]; in getNumPreds()
56 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in decNumPreds()
57 return --NumPreds[SU->NodeNum]; in decNumPreds()
148 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would left non-ready " in pickCandidate()
159 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would make ready " << Res in pickCandidate()
170 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
201 LLVM_DEBUG(dbgs() << "Make the predecessors of SU(" << SchedSU->NodeNum in bumpPredsPriority()
[all …]
H A DGCNILPSched.cpp59 unsigned &SethiUllmanNumber = SUNumbers[SU->NodeNum]; in CalcNodeSethiUllmanNumber()
87 assert(SU->NodeNum < SUNumbers.size()); in getNodePriority()
101 return SUNumbers[SU->NodeNum]; in getNodePriority()
151 LLVM_DEBUG(dbgs() << " Comparing latency of SU (" << left->NodeNum in BUCompareLatency()
152 << ") depth " << LDepth << " vs SU (" << right->NodeNum in BUCompareLatency()
171 LLVM_DEBUG(dbgs() << "Depth of SU(" << left->NodeNum << "): " in pickBest()
172 << left->getDepth() << " != SU(" << right->NodeNum in pickBest()
298 SUSavedCopy[SU.NodeNum] = SU; in schedule()
328 << ' ' << C.SU->NodeNum; in schedule()
349 SU = SUSavedCopy[SU.NodeNum]; in schedule()
H A DAMDGPUIGroupLP.cpp428 SUsToCandSGs.first->NodeNum > SortPosition->first->NodeNum) in convertSyncMapsToArrays()
458 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ")\n"); in makePipeline()
631 LLVM_DEBUG(dbgs() << "Fitting SU(" << CurrSU.first->NodeNum in solveExact()
702 LLVM_DEBUG(dbgs() << "NOT Assigned (" << CurrSU.first->NodeNum << ")\n"); in solveExact()
727 LLVM_DEBUG(dbgs() << "Fitting SU(" << CurrSU.first->NodeNum in greedyFind()
1258 return SU->NodeNum >= Number; in apply()
1330 return SU->NodeNum > (*Cache)[0]->NodeNum; in apply()
1444 return PotentialMatch->NodeNum == SuccSU->NodeNum; in analyzeDAG()
1498 FirstPipeDSR = Pred.getSUnit()->NodeNum; in analyzeDAG()
2613 const SUnit *A, const SUnit *B) { return A->NodeNum > B->NodeNum; }); in addSchedBarrierEdges()
H A DGCNSchedStrategy.cpp442 LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") " in pickNode()
561 if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum) || in tryCandidate()
562 (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) { in tryCandidate()
1100 unsigned DefReady = ReadyCycles[DAG.getSUnit(DefMI)->NodeNum]; in computeSUnitReadyCycle()
1104 ReadyCycles[SU.NodeNum] = ReadyCycle; in computeSUnitReadyCycle()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAG.cpp363 dbgs() << "SU(" << SU.NodeNum << ")"; in dumpNodeName()
484 int NodeNum = SU.NodeNum; in InitDAGTopologicalSorting() local
487 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
501 if (SU->NodeNum < DAGSize) in InitDAGTopologicalSorting()
502 Allocate(SU->NodeNum, --Id); in InitDAGTopologicalSorting()
505 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
519 assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
553 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
554 UpperBound = Node2Index[X->NodeNum]; in AddPred()
582 Visited.set(SU->NodeNum); in DFS()
[all …]
H A DScheduleDAGInstrs.cpp105 dbgs() << "SU(" << SU->NodeNum << ")"; in dumpSUList()
716 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum) in insertBarrierChain()
838 PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI); in buildSchedGraph()
910 << BarrierChain->NodeNum << ").\n";); in buildSchedGraph()
1069 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1074 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1088 if (newBarrierChain->NodeNum < BarrierChain->NodeNum) { in reduceHugeMemNodeMaps()
1092 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1096 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1274 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
[all …]
H A DMachineScheduler.cpp688 dbgs() << SU->NodeNum << " "; in dump()
1036 NodeName += std::to_string(SU->NodeNum) + ")"; in dumpScheduleTraceTopDown()
1118 NodeName += std::to_string(SU->NodeNum) + ")"; in dumpScheduleTraceBottomUp()
1383 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU.NodeNum << ") " in updatePressureDiffs()
1418 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") " in updatePressureDiffs()
1629 LLVM_DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU(" in computeCyclicCriticalPath()
1630 << SU->NodeNum << ") = " << CyclicLatency << "c\n"); in computeCyclicCriticalPath()
1779 return SU->NodeNum < RHS.SU->NodeNum; in operator <()
1867 if (!SUnit2ClusterInfo.count(MemOpRecords[NextIdx].SU->NodeNum) && in clusterNeighboringMemOps()
1879 if (SUnit2ClusterInfo.count(MemOpa.SU->NodeNum)) { in clusterNeighboringMemOps()
[all …]
H A DLatencyPriorityQueue.cpp32 unsigned LHSNum = LHS->NodeNum; in operator ()()
33 unsigned RHSNum = RHS->NodeNum; in operator ()()
79 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
H A DVLIWMachineScheduler.cpp185 LLVM_DEBUG(dbgs() << Packet[i]->NodeNum << ")\t"); in reserveResources()
536 dbgstr << "SU(" << std::setw(3) << (*I)->NodeNum << ")"; in readyQueueVerboseDump()
803 if ((Q.getID() == TopQID && (*I)->NodeNum < Candidate.SU->NodeNum) || in pickNodeFromQueue()
804 (Q.getID() == BotQID && (*I)->NodeNum > Candidate.SU->NodeNum)) { in pickNodeFromQueue()
864 if ((Q.getID() == TopQID && (*I)->NodeNum < Candidate.SU->NodeNum) || in pickNodeFromQueue()
865 (Q.getID() == BotQID && (*I)->NodeNum > Candidate.SU->NodeNum)) { in pickNodeFromQueue()
H A DMachinePipeliner.cpp967 if (SU->NodeNum < I.NodeNum && !I.isPred(SU)) in updatePhiDependences()
989 if (SU->NodeNum < I.NodeNum && !I.isPred(SU)) in updatePhiDependences()
1663 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1677 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1690 int N = PI.getSUnit()->NodeNum; in createAdjacencyStructure()
1755 if (Blocked.test(W->NodeNum)) in unblock()
1756 unblock(W->NodeNum); in unblock()
2085 return A->NodeNum > B->NodeNum; in registerPressureFilter()
2103 dbgs() << "Excess register pressure: SU(" << SU->NodeNum << ") " in registerPressureFilter()
2260 if (NI.getNode(0)->NodeNum == NJ.getNode(0)->NodeNum) { in fuseRecs()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DLatencyPriorityQueue.h68 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
69 assert(NodeNum < (*SUnits).size()); in getLatency()
70 return (*SUnits)[NodeNum].getHeight(); in getLatency()
73 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
74 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
75 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
H A DResourcePriorityQueue.h93 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
94 assert(NodeNum < (*SUnits).size()); in getLatency()
95 return (*SUnits)[NodeNum].getHeight(); in getLatency()
98 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
99 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
100 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
H A DScheduleDFS.h146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
H A DMachinePipeliner.h184 for (const auto &NodeNum : Topo) in Circuits() local
185 Node2Idx->at(NodeNum) = Idx++; in Circuits()
227 int getASAP(SUnit *Node) { return ScheduleInfo[Node->NodeNum].ASAP; } in getASAP()
230 int getALAP(SUnit *Node) { return ScheduleInfo[Node->NodeNum].ALAP; } in getALAP()
242 return ScheduleInfo[Node->NodeNum].ZeroLatencyDepth; in getZeroLatencyDepth()
251 return ScheduleInfo[Node->NodeNum].ZeroLatencyHeight; in getZeroLatencyHeight()
H A DScheduleDAG.h270 unsigned NodeNum = BoundaryID; ///< Entry # of node in the node vector. variable
319 : Node(node), NodeNum(nodenum), isVRegCycle(false), isCall(false), in SUnit()
331 : Instr(instr), NodeNum(nodenum), isVRegCycle(false), isCall(false), in SUnit()
358 bool isBoundaryNode() const { return NodeNum == BoundaryID; } in isBoundaryNode()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp280 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
290 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
1010 LoadNode->setNodeId(LoadSU->NodeNum); in TryUnfoldSU()
1029 N->setNodeId(NewSU->NodeNum); in TryUnfoldSU()
1045 LLVM_DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); in TryUnfoldSU()
1180 LLVM_DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1457 LLVM_DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n'); in releaseInterferences()
1481 dbgs() << " SU #" << CurSU->NodeNum << '\n'); in PickNodeToScheduleBottomUp()
1531 LLVM_DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum in PickNodeToScheduleBottomUp()
1532 << ") to SU(" << TrySU->NodeNum << ")\n"); in PickNodeToScheduleBottomUp()
[all …]
H A DScheduleDAGFast.cpp234 LLVM_DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
248 N->setNodeId(NewSU->NodeNum); in CopyAndMoveSuccessors()
270 LoadNode->setNodeId(LoadSU->NodeNum); in CopyAndMoveSuccessors()
340 LLVM_DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
605 LLVM_DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum in ListScheduleBottomUp()
606 << " to SU #" << Copies.front()->NodeNum << "\n"); in ListScheduleBottomUp()
611 LLVM_DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum in ListScheduleBottomUp()
612 << " to SU #" << TrySU->NodeNum << "\n"); in ListScheduleBottomUp()
H A DResourcePriorityQueue.cpp185 unsigned LHSNum = LHS->NodeNum; in operator ()()
186 unsigned RHSNum = RHS->NodeNum; in operator ()()
232 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
421 ResCount += (NumNodesSolelyBlocking[SU->NodeNum] * ScaleTwo); in SUSchedulingCost()
H A DSelectionDAGPrinter.cpp287 O << "SU(" << SU->NodeNum << "): "; in getGraphNodeLabel()
H A DScheduleDAGSDNodes.cpp379 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
395 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
418 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCMachineScheduler.cpp142 if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum) || in tryCandidate()
143 (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) { in tryCandidate()
212 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) in tryCandidate()
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZMachineScheduler.h85 return (lhs->NodeNum < rhs->NodeNum); in operator()
H A DSystemZMachineScheduler.cpp235 if (SU->NodeNum < other.SU->NodeNum) in operator <()
242 LLVM_DEBUG(dbgs() << "** Scheduling SU(" << SU->NodeNum << ") "; in schedNode()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp659 if (SrcBest == nullptr || Src->NodeNum >= SrcBest->NodeNum) { in isBestZeroLatency()
662 if (DstBest == nullptr || Dst->NodeNum <= DstBest->NodeNum) in isBestZeroLatency()

12