| /external/llvm/include/llvm/CodeGen/ |
| D | LatencyPriorityQueue.h | 68 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()
|
| D | ResourcePriorityQueue.h | 94 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()
|
| D | ScheduleDFS.h | 147 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()
|
| D | ScheduleDAG.h | 283 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; };
|
| D | MachineScheduler.h | 412 return SUPressureDiffs[SU->NodeNum]; in getPressureDiff()
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 317 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 …]
|
| D | LatencyPriorityQueue.cpp | 32 unsigned LHSNum = LHS->NodeNum; in operator ()()
33 unsigned RHSNum = RHS->NodeNum; in operator ()()
82 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
|
| D | MachineScheduler.cpp | 504 dbgs() << Queue[i]->NodeNum << " "; in dump()
981 DEBUG(dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") " in updatePressureDiffs()
1177 DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU(" in computeCyclicCriticalPath()
1178 << UI->SU->NodeNum << ") = " << CyclicLatency << "c\n"); in computeCyclicCriticalPath()
1291 DEBUG(dbgs() << "Cluster loads SU(" << SUa->NodeNum << ") - SU(" in clusterNeighboringLoads()
1292 << SUb->NodeNum << ")\n"); in clusterNeighboringLoads()
1301 DEBUG(dbgs() << " Copy Succ SU(" << SI->getSUnit()->NodeNum << ")\n"); in clusterNeighboringLoads()
1325 ChainPredID = PI->getSUnit()->NodeNum; in apply()
1382 DEBUG(dbgs() << "Macro Fuse SU(" << SU->NodeNum << ")\n"); in apply()
1539 DEBUG(dbgs() << "Constraining copy SU(" << CopySU->NodeNum << ")\n"); in constrainLocalCopy()
[all …]
|
| D | ScheduleDAGInstrs.cpp | 680 << SUa->NodeNum << ") and SU(" in addChainDependency()
681 << SUb->NodeNum << ")\n"); in addChainDependency()
814 PressureDiff *PDiff = PDiffs ? &(*PDiffs)[SU->NodeNum] : nullptr; in buildSchedGraph()
1273 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
1280 R.DFSNodeData[SU->NodeNum].InstrCount = in visitPreorder()
1290 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; in visitPostorderNode()
1291 RootData RData(SU->NodeNum); in visitPostorderNode()
1299 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; in visitPostorderNode()
1304 unsigned PredNum = PI->getSUnit()->NodeNum; in visitPostorderNode()
1313 RootSet[PredNum].ParentNodeID = SU->NodeNum; in visitPostorderNode()
[all …]
|
| D | ScoreboardHazardRecognizer.cpp | 166 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): "); in getHazardType()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 247 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
258 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
971 DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
993 LoadNode->setNodeId(LoadSU->NodeNum); in CopyAndMoveSuccessors()
1001 N->setNodeId(NewSU->NodeNum); in CopyAndMoveSuccessors()
1099 DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1351 DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n'); in releaseInterferences()
1374 << " SU #" << CurSU->NodeNum << '\n'); in PickNodeToScheduleBottomUp()
1420 DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum << ") to SU(" in PickNodeToScheduleBottomUp()
1421 << TrySU->NodeNum << ")\n"); in PickNodeToScheduleBottomUp()
[all …]
|
| D | ScheduleDAGFast.cpp | 242 DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
256 N->setNodeId(NewSU->NodeNum); in CopyAndMoveSuccessors()
278 LoadNode->setNodeId(LoadSU->NodeNum); in CopyAndMoveSuccessors()
354 DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
604 DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum in ListScheduleBottomUp()
605 << " to SU #" << Copies.front()->NodeNum << "\n"); in ListScheduleBottomUp()
610 DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum in ListScheduleBottomUp()
611 << " to SU #" << TrySU->NodeNum << "\n"); in ListScheduleBottomUp()
|
| D | ResourcePriorityQueue.cpp | 191 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()
|
| D | ScheduleDAGSDNodes.cpp | 357 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
374 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
397 N->setNodeId(NodeSUnit->NodeNum); in BuildSchedUnits()
|
| D | SelectionDAGPrinter.cpp | 273 O << "SU(" << SU->NodeNum << "): "; in getGraphNodeLabel()
|
| /external/llvm/lib/Target/PowerPC/ |
| D | PPCHazardRecognizers.cpp | 183 SU->NodeNum << "): "); in EmitInstruction()
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 123 DEBUG(dbgs() << Packet[i]->NodeNum << ")\t"); in reserveResources()
|