Home
last modified time | relevance | path

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

12

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.cpp198 NodeNum2Index[SU->NodeNum] = SUnits.size(); in addUnit()
205 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
257 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) { in tryCandidateTopDown()
274 TryCand.IsLowLatency = DAG->IsLowLatencySU[SU->NodeNum]; in pickNode()
275 TryCand.LowLatencyOffset = DAG->LowLatencyOffset[SU->NodeNum]; in pickNode()
277 HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]; in pickNode()
487 if (SuccSU->NodeNum >= DAG->SUnits.size()) in releaseSuccessors()
512 if (HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]) in nodeScheduled()
515 if (DAG->IsLowLatencySU[SU->NodeNum]) { in nodeScheduled()
518 NodeNum2Index.find(Succ.getSUnit()->NodeNum); in nodeScheduled()
[all …]
DGCNMinRegStrategy.cpp46 return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max(); in isScheduled()
51 NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max(); in setIsScheduled()
56 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in getNumPreds()
57 return NumPreds[SU->NodeNum]; in getNumPreds()
62 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in decNumPreds()
63 return --NumPreds[SU->NodeNum]; in decNumPreds()
154 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would left non-ready " in pickCandidate()
165 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would make ready " << Res in pickCandidate()
176 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
207 LLVM_DEBUG(dbgs() << "Make the predecessors of SU(" << SchedSU->NodeNum in bumpPredsPriority()
[all …]
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()
DAMDGPUSubtarget.cpp822 if (Pred->NodeNum < Succ->NodeNum) in canAddEdge()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
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 …]
DScheduleDAGInstrs.cpp102 dbgs() << "SU(" << su->NodeNum << ")"; in dumpSUList()
703 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum) in insertBarrierChain()
824 PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI); in buildSchedGraph()
896 << BarrierChain->NodeNum << ").\n";); in buildSchedGraph()
1055 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1058 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1071 if (newBarrierChain->NodeNum < BarrierChain->NodeNum) { in reduceHugeMemNodeMaps()
1075 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1079 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1252 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
[all …]
DMachineScheduler.cpp602 dbgs() << SU->NodeNum << " "; in dump()
1121 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU.NodeNum << ") " in updatePressureDiffs()
1156 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") " in updatePressureDiffs()
1367 LLVM_DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU(" in computeCyclicCriticalPath()
1368 << SU->NodeNum << ") = " << CyclicLatency << "c\n"); in computeCyclicCriticalPath()
1485 return std::make_tuple(BaseOp->getReg(), Offset, SU->NodeNum) < in operator <()
1487 RHS.SU->NodeNum); in operator <()
1503 return SU->NodeNum < RHS.SU->NodeNum; in operator <()
1576 if (SUa->NodeNum > SUb->NodeNum) in clusterNeighboringMemOps()
1582 LLVM_DEBUG(dbgs() << "Cluster ld/st SU(" << SUa->NodeNum << ") - SU(" in clusterNeighboringMemOps()
[all …]
DLatencyPriorityQueue.cpp32 unsigned LHSNum = LHS->NodeNum; in operator ()()
33 unsigned RHSNum = RHS->NodeNum; in operator ()()
82 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
DMachinePipeliner.cpp790 if (SU->NodeNum < I.NodeNum && !I.isPred(SU)) in updatePhiDependences()
811 if (SU->NodeNum < I.NodeNum && !I.isPred(SU)) in updatePhiDependences()
1152 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1166 int N = SI.getSUnit()->NodeNum; in createAdjacencyStructure()
1179 int N = PI.getSUnit()->NodeNum; in createAdjacencyStructure()
1245 if (Blocked.test(W->NodeNum)) in unblock()
1246 unblock(W->NodeNum); in unblock()
1598 return A->NodeNum > B->NodeNum; in registerPressureFilter()
1616 dbgs() << "Excess register pressure: SU(" << SU->NodeNum << ") " in registerPressureFilter()
1775 if (NI.getNode(0)->NodeNum == NJ.getNode(0)->NodeNum) { in fuseRecs()
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
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()
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()
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()
DMachinePipeliner.h176 for (const auto &NodeNum : Topo) in Circuits() local
177 Node2Idx->at(NodeNum) = Idx++; in Circuits()
216 int getASAP(SUnit *Node) { return ScheduleInfo[Node->NodeNum].ASAP; } in getASAP()
219 int getALAP(SUnit *Node) { return ScheduleInfo[Node->NodeNum].ALAP; } in getALAP()
231 return ScheduleInfo[Node->NodeNum].ZeroLatencyDepth; in getZeroLatencyDepth()
240 return ScheduleInfo[Node->NodeNum].ZeroLatencyHeight; in getZeroLatencyHeight()
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()
DMachineScheduler.h454 return SUPressureDiffs[SU->NodeNum]; in getPressureDiff()
457 return SUPressureDiffs[SU->NodeNum]; in getPressureDiff()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/
DScheduleDAGRRList.cpp281 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
291 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
1013 LoadNode->setNodeId(LoadSU->NodeNum); in TryUnfoldSU()
1032 N->setNodeId(NewSU->NodeNum); in TryUnfoldSU()
1048 LLVM_DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); in TryUnfoldSU()
1183 LLVM_DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1449 LLVM_DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n'); in releaseInterferences()
1473 dbgs() << " SU #" << CurSU->NodeNum << '\n'); in PickNodeToScheduleBottomUp()
1524 LLVM_DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum in PickNodeToScheduleBottomUp()
1525 << ") to SU(" << TrySU->NodeNum << ")\n"); in PickNodeToScheduleBottomUp()
[all …]
DScheduleDAGFast.cpp238 LLVM_DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
252 N->setNodeId(NewSU->NodeNum); in CopyAndMoveSuccessors()
274 LoadNode->setNodeId(LoadSU->NodeNum); in CopyAndMoveSuccessors()
348 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()
DResourcePriorityQueue.cpp186 unsigned LHSNum = LHS->NodeNum; in operator ()()
187 unsigned RHSNum = RHS->NodeNum; in operator ()()
233 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
422 ResCount += (NumNodesSolelyBlocking[SU->NodeNum] * ScaleTwo); in SUSchedulingCost()
DScheduleDAGSDNodes.cpp372 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
389 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
412 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
DSelectionDAGPrinter.cpp277 O << "SU(" << SU->NodeNum << "): "; in getGraphNodeLabel()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.cpp180 LLVM_DEBUG(dbgs() << Packet[i]->NodeNum << ")\t"); in reserveResources()
509 dbgstr << "SU(" << std::setw(3) << (*I)->NodeNum << ")"; in readyQueueVerboseDump()
798 if ((Q.getID() == TopQID && (*I)->NodeNum < Candidate.SU->NodeNum) in pickNodeFromQueue()
799 || (Q.getID() == BotQID && (*I)->NodeNum > Candidate.SU->NodeNum)) { in pickNodeFromQueue()
859 if ((Q.getID() == TopQID && (*I)->NodeNum < Candidate.SU->NodeNum) in pickNodeFromQueue()
860 || (Q.getID() == BotQID && (*I)->NodeNum > Candidate.SU->NodeNum)) { in pickNodeFromQueue()
DHexagonSubtarget.cpp513 if (SrcBest == nullptr || Src->NodeNum >= SrcBest->NodeNum) { in isBestZeroLatency()
516 if (DstBest == nullptr || Dst->NodeNum <= DstBest->NodeNum) in isBestZeroLatency()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/
DSystemZMachineScheduler.h85 return (lhs->NodeNum < rhs->NodeNum); in operator()
DSystemZMachineScheduler.cpp235 if (SU->NodeNum < other.SU->NodeNum) in operator <()
242 LLVM_DEBUG(dbgs() << "** Scheduling SU(" << SU->NodeNum << ") "; in schedNode()
DSystemZHazardRecognizer.cpp168 OS << "SU(" << SU->NodeNum << "):"; in dumpSU()

12