Home
last modified time | relevance | path

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

/NextBSD/contrib/llvm/include/llvm/CodeGen/
HDLatencyPriorityQueue.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()
HDResourcePriorityQueue.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()
HDScheduleDFS.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()
HDScheduleDAG.h283 unsigned NodeNum; // Entry # of node in the node vector.
327 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
343 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
358 NodeNum(BoundaryID), NodeQueueId(0), NumPreds(0), NumSuccs(0),
377 bool isBoundaryNode() const { return NodeNum == BoundaryID; };
HDMachineScheduler.h412 return SUPressureDiffs[SU->NodeNum]; in getPressureDiff()
/NextBSD/contrib/llvm/lib/CodeGen/
HDScheduleDAG.cpp317 dbgs() << "SU(" << NodeNum << "): "; in dump()
346 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")"; in dumpAll()
366 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")"; in dumpAll()
473 int NodeNum = SU->NodeNum; in InitDAGTopologicalSorting() local
476 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
490 if (SU->NodeNum < DAGSize) in InitDAGTopologicalSorting()
491 Allocate(SU->NodeNum, --Id); in InitDAGTopologicalSorting()
495 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
510 assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
521 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
[all …]
HDMachineScheduler.cpp504 dbgs() << Queue[i]->NodeNum << " "; in dump()
982 DEBUG(dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") " in updatePressureDiffs()
1178 DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU(" in computeCyclicCriticalPath()
1179 << UI->SU->NodeNum << ") = " << CyclicLatency << "c\n"); in computeCyclicCriticalPath()
1292 DEBUG(dbgs() << "Cluster loads SU(" << SUa->NodeNum << ") - SU(" in clusterNeighboringLoads()
1293 << SUb->NodeNum << ")\n"); in clusterNeighboringLoads()
1302 DEBUG(dbgs() << " Copy Succ SU(" << SI->getSUnit()->NodeNum << ")\n"); in clusterNeighboringLoads()
1326 ChainPredID = PI->getSUnit()->NodeNum; in apply()
1383 DEBUG(dbgs() << "Macro Fuse SU(" << SU->NodeNum << ")\n"); in apply()
1540 DEBUG(dbgs() << "Constraining copy SU(" << CopySU->NodeNum << ")\n"); in constrainLocalCopy()
[all …]
HDScheduleDAGInstrs.cpp683 << SUa->NodeNum << ") and SU(" in addChainDependency()
684 << SUb->NodeNum << ")\n"); in addChainDependency()
817 PressureDiff *PDiff = PDiffs ? &(*PDiffs)[SU->NodeNum] : nullptr; in buildSchedGraph()
1327 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
1334 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1344 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1345 RootData RData(SU->NodeNum); in visitPostorderNode()
1353 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()
1358 unsigned PredNum = PI->getSUnit()->NodeNum; in visitPostorderNode()
1367 RootSet[PredNum].ParentNodeID = SU->NodeNum; in visitPostorderNode()
[all …]
HDLatencyPriorityQueue.cpp32 unsigned LHSNum = LHS->NodeNum; in operator ()()
33 unsigned RHSNum = RHS->NodeNum; in operator ()()
82 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
HDScoreboardHazardRecognizer.cpp166 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): "); in getHazardType()
/NextBSD/contrib/llvm/lib/CodeGen/SelectionDAG/
HDScheduleDAGRRList.cpp247 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
258 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
979 DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1001 LoadNode->setNodeId(LoadSU->NodeNum); in CopyAndMoveSuccessors()
1009 N->setNodeId(NewSU->NodeNum); in CopyAndMoveSuccessors()
1107 DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1358 DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n'); in releaseInterferences()
1381 << " SU #" << CurSU->NodeNum << '\n'); in PickNodeToScheduleBottomUp()
1427 DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum << ") to SU(" in PickNodeToScheduleBottomUp()
1428 << TrySU->NodeNum << ")\n"); in PickNodeToScheduleBottomUp()
[all …]
HDScheduleDAGFast.cpp241 DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
255 N->setNodeId(NewSU->NodeNum); in CopyAndMoveSuccessors()
277 LoadNode->setNodeId(LoadSU->NodeNum); in CopyAndMoveSuccessors()
353 DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
603 DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum in ListScheduleBottomUp()
604 << " to SU #" << Copies.front()->NodeNum << "\n"); in ListScheduleBottomUp()
609 DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum in ListScheduleBottomUp()
610 << " to SU #" << TrySU->NodeNum << "\n"); in ListScheduleBottomUp()
HDResourcePriorityQueue.cpp191 unsigned LHSNum = LHS->NodeNum; in operator ()()
192 unsigned RHSNum = RHS->NodeNum; in operator ()()
240 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
434 ResCount += (NumNodesSolelyBlocking[SU->NodeNum] * ScaleTwo); in SUSchedulingCost()
HDScheduleDAGSDNodes.cpp355 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
372 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
395 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
HDSelectionDAGPrinter.cpp273 O << "SU(" << SU->NodeNum << "): "; in getGraphNodeLabel()
/NextBSD/contrib/llvm/lib/Target/PowerPC/
HDPPCHazardRecognizers.cpp183 SU->NodeNum << "): "); in EmitInstruction()
/NextBSD/contrib/llvm/lib/Target/Hexagon/
HDHexagonMachineScheduler.cpp123 DEBUG(dbgs() << Packet[i]->NodeNum << ")\t"); in reserveResources()