Home
last modified time | relevance | path

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

12

/openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp179 NodeNum2Index[SU->NodeNum] = SUnits.size(); in addUnit()
186 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
238 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) { in tryCandidateTopDown()
255 TryCand.IsLowLatency = DAG->IsLowLatencySU[SU->NodeNum]; in pickNode()
256 TryCand.LowLatencyOffset = DAG->LowLatencyOffset[SU->NodeNum]; in pickNode()
258 HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]; in pickNode()
468 if (SuccSU->NodeNum >= DAG->SUnits.size()) in releaseSuccessors()
493 if (HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]) in nodeScheduled()
496 if (DAG->IsLowLatencySU[SU->NodeNum]) { in nodeScheduled()
499 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()
300 SUSavedCopy[SU.NodeNum] = SU; in schedule()
330 << ' ' << C.SU->NodeNum; in schedule()
351 SU = SUSavedCopy[SU.NodeNum]; in schedule()
H A DAMDGPUIGroupLP.cpp357 SUsToCandSGs.first->NodeNum > SortPosition->first->NodeNum) in convertSyncMapsToArrays()
542 LLVM_DEBUG(dbgs() << "Fitting SU(" << CurrSU.first->NodeNum in solveExact()
607 LLVM_DEBUG(dbgs() << "NOT Assigned (" << CurrSU.first->NodeNum << ")\n"); in solveExact()
634 LLVM_DEBUG(dbgs() << "Fitting SU(" << CurrSU.first->NodeNum in solveGreedy()
1058 const SUnit *A, const SUnit *B) { return A->NodeNum > B->NodeNum; }); in addSchedBarrierEdges()
H A DGCNSchedStrategy.cpp339 LLVM_DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") " in pickNode()
458 if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum) || in tryCandidate()
459 (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) { in tryCandidate()
968 unsigned DefReady = ReadyCycles[DAG.getSUnit(DefMI)->NodeNum]; in computeSUnitReadyCycle()
972 ReadyCycles[SU.NodeNum] = ReadyCycle; in computeSUnitReadyCycle()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DScheduleDAG.cpp360 dbgs() << "SU(" << SU.NodeNum << ")"; in dumpNodeName()
481 int NodeNum = SU.NodeNum; in InitDAGTopologicalSorting() local
484 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
498 if (SU->NodeNum < DAGSize) in InitDAGTopologicalSorting()
499 Allocate(SU->NodeNum, --Id); in InitDAGTopologicalSorting()
502 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
516 assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
550 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
551 UpperBound = Node2Index[X->NodeNum]; in AddPred()
579 Visited.set(SU->NodeNum); in DFS()
[all …]
H A DScheduleDAGInstrs.cpp105 dbgs() << "SU(" << SU->NodeNum << ")"; in dumpSUList()
703 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum) in insertBarrierChain()
825 PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI); in buildSchedGraph()
897 << BarrierChain->NodeNum << ").\n";); in buildSchedGraph()
1057 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1062 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1076 if (newBarrierChain->NodeNum < BarrierChain->NodeNum) { in reduceHugeMemNodeMaps()
1080 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1084 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1260 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
[all …]
H A DMachineScheduler.cpp626 dbgs() << SU->NodeNum << " "; in dump()
1143 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU.NodeNum << ") " in updatePressureDiffs()
1178 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") " in updatePressureDiffs()
1389 LLVM_DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU(" in computeCyclicCriticalPath()
1390 << SU->NodeNum << ") = " << CyclicLatency << "c\n"); in computeCyclicCriticalPath()
1536 return SU->NodeNum < RHS.SU->NodeNum; in operator <()
1615 if (!SUnit2ClusterInfo.count(MemOpRecords[NextIdx].SU->NodeNum) && in clusterNeighboringMemOps()
1626 if (SUnit2ClusterInfo.count(MemOpa.SU->NodeNum)) { in clusterNeighboringMemOps()
1627 ClusterLength = SUnit2ClusterInfo[MemOpa.SU->NodeNum].first + 1; in clusterNeighboringMemOps()
1629 SUnit2ClusterInfo[MemOpa.SU->NodeNum].second + MemOpb.Width; 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.cpp891 if (SU->NodeNum < I.NodeNum && !I.isPred(SU)) in updatePhiDependences()
912 if (SU->NodeNum < I.NodeNum && !I.isPred(SU)) in updatePhiDependences()
1182 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1196 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1209 int N = PI.getSUnit()->NodeNum; in createAdjacencyStructure()
1274 if (Blocked.test(W->NodeNum)) in unblock()
1275 unblock(W->NodeNum); in unblock()
1607 return A->NodeNum > B->NodeNum; in registerPressureFilter()
1625 dbgs() << "Excess register pressure: SU(" << SU->NodeNum << ") " in registerPressureFilter()
1782 if (NI.getNode(0)->NodeNum == NJ.getNode(0)->NodeNum) { in fuseRecs()
[all …]
/openbsd-src/gnu/llvm/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.h179 for (const auto &NodeNum : Topo) in Circuits() local
180 Node2Idx->at(NodeNum) = Idx++; in Circuits()
221 int getASAP(SUnit *Node) { return ScheduleInfo[Node->NodeNum].ASAP; } in getASAP()
224 int getALAP(SUnit *Node) { return ScheduleInfo[Node->NodeNum].ALAP; } in getALAP()
236 return ScheduleInfo[Node->NodeNum].ZeroLatencyDepth; in getZeroLatencyDepth()
245 return ScheduleInfo[Node->NodeNum].ZeroLatencyHeight; in getZeroLatencyHeight()
H A DScheduleDAG.h264 unsigned NodeNum = BoundaryID; ///< Entry # of node in the node vector. variable
309 : Node(node), NodeNum(nodenum), isVRegCycle(false), isCall(false), in SUnit()
320 : Instr(instr), NodeNum(nodenum), isVRegCycle(false), isCall(false), in SUnit()
344 bool isBoundaryNode() const { return NodeNum == BoundaryID; } in isBoundaryNode()
H A DMachineScheduler.h461 return SUPressureDiffs[SU->NodeNum]; in getPressureDiff()
464 return SUPressureDiffs[SU->NodeNum]; in getPressureDiff()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp281 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
291 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
1016 LoadNode->setNodeId(LoadSU->NodeNum); in TryUnfoldSU()
1035 N->setNodeId(NewSU->NodeNum); in TryUnfoldSU()
1051 LLVM_DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); in TryUnfoldSU()
1186 LLVM_DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1464 LLVM_DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n'); in releaseInterferences()
1488 dbgs() << " SU #" << CurSU->NodeNum << '\n'); in PickNodeToScheduleBottomUp()
1538 LLVM_DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum in PickNodeToScheduleBottomUp()
1539 << ") 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()
344 LLVM_DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
610 LLVM_DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum in ListScheduleBottomUp()
611 << " to SU #" << Copies.front()->NodeNum << "\n"); in ListScheduleBottomUp()
616 LLVM_DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum in ListScheduleBottomUp()
617 << " 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()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonSubtarget.cpp661 if (SrcBest == nullptr || Src->NodeNum >= SrcBest->NodeNum) { in isBestZeroLatency()
664 if (DstBest == nullptr || Dst->NodeNum <= DstBest->NodeNum) in isBestZeroLatency()

12