Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp258 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) { in tryCandidateTopDown()
654 if (SU->NodeNum >= DAG->SUnits.size()) in isSUInBlock()
778 FormingGroup.insert(SU.NodeNum); in colorHighLatenciesGroups()
822 if (CurrentColoring[SU->NodeNum]) { in colorComputeReservedDependencies()
824 CurrentColoring[SU->NodeNum]; in colorComputeReservedDependencies()
864 if (CurrentColoring[SU->NodeNum]) { in colorComputeReservedDependencies()
866 CurrentColoring[SU->NodeNum]; in colorComputeReservedDependencies()
910 if (CurrentColoring[SU->NodeNum]) in colorAccordingToReservedDependencies()
990 assert(i == SU->NodeNum); in colorForceConsecutiveOrderInGroup()
1794 Res.SUs.push_back(SU->NodeNum); in scheduleVariant()
[all …]
H A DGCNMinRegStrategy.cpp47 return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max(); in isScheduled()
52 NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max(); in setIsScheduled()
57 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in getNumPreds()
58 return NumPreds[SU->NodeNum]; in getNumPreds()
63 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in decNumPreds()
64 return --NumPreds[SU->NodeNum]; in decNumPreds()
155 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would left non-ready " in pickCandidate()
166 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would make ready " << Res in pickCandidate()
208 LLVM_DEBUG(dbgs() << "Make the predecessors of SU(" << SchedSU->NodeNum in bumpPredsPriority()
215 LLVM_DEBUG(dbgs() << " SU(" << C.SU->NodeNum << ')'); in bumpPredsPriority()
[all …]
H A DGCNILPSched.cpp60 unsigned &SethiUllmanNumber = SUNumbers[SU->NodeNum]; in CalcNodeSethiUllmanNumber()
88 assert(SU->NodeNum < SUNumbers.size()); in getNodePriority()
102 return SUNumbers[SU->NodeNum]; in getNodePriority()
152 LLVM_DEBUG(dbgs() << " Comparing latency of SU (" << left->NodeNum in BUCompareLatency()
153 << ") depth " << LDepth << " vs SU (" << right->NodeNum in BUCompareLatency()
172 LLVM_DEBUG(dbgs() << "Depth of SU(" << left->NodeNum << "): " in pickBest()
173 << left->getDepth() << " != SU(" << right->NodeNum in pickBest()
301 SUSavedCopy[SU.NodeNum] = SU; in schedule()
331 << ' ' << C.SU->NodeNum; in schedule()
352 SU = SUSavedCopy[SU.NodeNum]; in schedule()
H A DGCNSchedStrategy.cpp289 LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") " in pickNode()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DScheduleDAG.cpp472 int NodeNum = SU.NodeNum; in InitDAGTopologicalSorting() local
475 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
489 if (SU->NodeNum < DAGSize) in InitDAGTopologicalSorting()
490 Allocate(SU->NodeNum, --Id); in InitDAGTopologicalSorting()
493 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
506 assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
515 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
516 UpperBound = Node2Index[X->NodeNum]; in AddPred()
542 Visited.set(SU->NodeNum); in DFS()
587 unsigned s = Succ->NodeNum; in GetSubGraph()
[all …]
H A DScheduleDAGInstrs.cpp104 dbgs() << "SU(" << su->NodeNum << ")"; in dumpSUList()
681 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum) in insertBarrierChain()
1007 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1010 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1023 if (newBarrierChain->NodeNum < BarrierChain->NodeNum) { in reduceHugeMemNodeMaps()
1195 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1205 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1206 RootData RData(SU->NodeNum); in visitPostorderNode()
1238 RootSet[SU->NodeNum] = RData; in visitPostorderNode()
1245 R.DFSNodeData[Succ->NodeNum].InstrCount in visitPostorderEdge()
[all …]
H A DMachineScheduler.cpp594 dbgs() << SU->NodeNum << " "; in dump()
1500 RHS.SU->NodeNum); in operator <()
1516 return SU->NodeNum < RHS.SU->NodeNum; in operator <()
1594 << SUb->NodeNum << ")\n"); in clusterNeighboringMemOps()
1628 ChainPredID = Pred.getSUnit()->NodeNum; in apply()
3063 if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum) in tryCandidate()
3064 || (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) { in tryCandidate()
3366 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) in tryCandidate()
3560 return A->NodeNum > B->NodeNum; in operator ()()
3562 return A->NodeNum < B->NodeNum; in operator ()()
[all …]
H A DLatencyPriorityQueue.cpp33 unsigned LHSNum = LHS->NodeNum; in operator ()()
34 unsigned RHSNum = RHS->NodeNum; in operator ()()
83 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
H A DMachinePipeliner.cpp630 if (SU->NodeNum < I.NodeNum && !I.isPred(SU)) in updatePhiDependences()
651 if (SU->NodeNum < I.NodeNum && !I.isPred(SU)) in updatePhiDependences()
935 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
949 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
962 int N = PI.getSUnit()->NodeNum; in createAdjacencyStructure()
1028 if (Blocked.test(W->NodeNum)) in unblock()
1029 unblock(W->NodeNum); in unblock()
1380 return A->NodeNum > B->NodeNum; in registerPressureFilter()
1557 if (NI.getNode(0)->NodeNum == NJ.getNode(0)->NodeNum) { in fuseRecs()
1624 (getASAP(SU) == getASAP(maxASAP) && SU->NodeNum > maxASAP->NodeNum)) in computeNodeOrder()
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DLatencyPriorityQueue.h69 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
70 assert(NodeNum < (*SUnits).size()); in getLatency()
71 return (*SUnits)[NodeNum].getHeight(); in getLatency()
74 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
75 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
76 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
H A DResourcePriorityQueue.h94 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
95 assert(NodeNum < (*SUnits).size()); in getLatency()
96 return (*SUnits)[NodeNum].getHeight(); in getLatency()
99 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
100 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
101 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
H A DScheduleDFS.h147 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
160 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
173 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
174 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
H A DMachinePipeliner.h168 for (const auto &NodeNum : Topo) in Circuits() local
169 Node2Idx->at(NodeNum) = Idx++; in Circuits()
208 int getASAP(SUnit *Node) { return ScheduleInfo[Node->NodeNum].ASAP; } in getASAP()
211 int getALAP(SUnit *Node) { return ScheduleInfo[Node->NodeNum].ALAP; } in getALAP()
223 return ScheduleInfo[Node->NodeNum].ZeroLatencyDepth; in getZeroLatencyDepth()
232 return ScheduleInfo[Node->NodeNum].ZeroLatencyHeight; in getZeroLatencyHeight()
H A DScheduleDAG.h268 unsigned NodeNum = BoundaryID; ///< Entry # of node in the node vector.
313 : Node(node), NodeNum(nodenum), isVRegCycle(false), isCall(false),
324 : Instr(instr), NodeNum(nodenum), isVRegCycle(false), isCall(false),
348 bool isBoundaryNode() const { return NodeNum == BoundaryID; }
H A DMachineScheduler.h469 return SUPressureDiffs[SU->NodeNum]; in getPressureDiff()
472 return SUPressureDiffs[SU->NodeNum]; in getPressureDiff()
/freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp275 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
286 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
1007 LoadNode->setNodeId(LoadSU->NodeNum); in TryUnfoldSU()
1025 N->setNodeId(NewSU->NodeNum); in TryUnfoldSU()
1926 if (SUNumbers[SU->NodeNum] != 0) in CalcNodeSethiUllmanNumber()
1927 return SUNumbers[SU->NodeNum]; in CalcNodeSethiUllmanNumber()
1987 return SUNumbers[SU->NodeNum]; in CalcNodeSethiUllmanNumber()
2007 SethiUllmanNumbers[SU->NodeNum] = 0; in updateNode()
2038 return SethiUllmanNumbers[SU->NodeNum]; in getNodePriority()
2987 << PredSU->NodeNum in PrescheduleNodesWithMultipleUses()
[all …]
H A DScheduleDAGFast.cpp239 LLVM_DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
253 N->setNodeId(NewSU->NodeNum); in CopyAndMoveSuccessors()
275 LoadNode->setNodeId(LoadSU->NodeNum); in CopyAndMoveSuccessors()
349 LLVM_DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
595 LLVM_DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum in ListScheduleBottomUp()
596 << " to SU #" << Copies.front()->NodeNum << "\n"); in ListScheduleBottomUp()
601 LLVM_DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum in ListScheduleBottomUp()
602 << " 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.cpp278 O << "SU(" << SU->NodeNum << "): "; in getGraphNodeLabel()
H A DScheduleDAGSDNodes.cpp354 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
371 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
394 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp179 LLVM_DEBUG(dbgs() << Packet[i]->NodeNum << ")\t"); in reserveResources()
508 dbgstr << "SU(" << std::setw(3) << (*I)->NodeNum << ")"; in readyQueueVerboseDump()
797 if ((Q.getID() == TopQID && (*I)->NodeNum < Candidate.SU->NodeNum) in pickNodeFromQueue()
798 || (Q.getID() == BotQID && (*I)->NodeNum > Candidate.SU->NodeNum)) { in pickNodeFromQueue()
858 if ((Q.getID() == TopQID && (*I)->NodeNum < Candidate.SU->NodeNum) in pickNodeFromQueue()
859 || (Q.getID() == BotQID && (*I)->NodeNum > Candidate.SU->NodeNum)) { in pickNodeFromQueue()
H A DHexagonSubtarget.cpp515 if (SrcBest == nullptr || Src->NodeNum >= SrcBest->NodeNum) { in isBestZeroLatency()
518 if (DstBest == nullptr || Dst->NodeNum <= DstBest->NodeNum) in isBestZeroLatency()
/freebsd-12.1/contrib/llvm/lib/Target/SystemZ/
H A DSystemZMachineScheduler.h86 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()
H A DSystemZHazardRecognizer.cpp169 OS << "SU(" << SU->NodeNum << "):"; in dumpSU()