Searched refs:NodeNum (Results 1 - 17 of 17) sorted by relevance
/external/llvm/include/llvm/CodeGen/ |
H A D | LatencyPriorityQueue.h | 68 unsigned getLatency(unsigned NodeNum) const { 69 assert(NodeNum < (*SUnits).size()); 70 return (*SUnits)[NodeNum].getHeight(); 73 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { 74 assert(NodeNum < NumNodesSolelyBlocking.size()); 75 return NumNodesSolelyBlocking[NodeNum];
|
H A D | ResourcePriorityQueue.h | 98 unsigned getLatency(unsigned NodeNum) const { 99 assert(NodeNum < (*SUnits).size()); 100 return (*SUnits)[NodeNum].getHeight(); 103 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { 104 assert(NodeNum < NumNodesSolelyBlocking.size()); 105 return NumNodesSolelyBlocking[NodeNum];
|
H A D | ScheduleDFS.h | 147 return DFSNodeData[SU->NodeNum].InstrCount; 160 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); 173 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); 174 return DFSNodeData[SU->NodeNum].SubtreeID;
|
H A D | ScheduleDAG.h | 277 unsigned NodeNum; // Entry # of node in the node vector. variable 321 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0), 337 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0), 352 NodeNum(BoundaryID), NodeQueueId(0), NumPreds(0), NumSuccs(0), 371 bool isBoundaryNode() const { return NodeNum == BoundaryID; };
|
H A D | MachineScheduler.h | 413 return SUPressureDiffs[SU->NodeNum];
|
/external/llvm/lib/CodeGen/ |
H A D | ScheduleDAG.cpp | 318 dbgs() << "SU(" << NodeNum << "): "; 347 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")"; 367 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")"; 474 int NodeNum = SU->NodeNum; 477 Node2Index[NodeNum] = Degree; 491 if (SU->NodeNum < DAGSize) 492 Allocate(SU->NodeNum, --Id); 496 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) [all...] |
H A D | LatencyPriorityQueue.cpp | 32 unsigned LHSNum = LHS->NodeNum; 33 unsigned RHSNum = RHS->NodeNum; 82 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
|
H A D | ScheduleDAGInstrs.cpp | 668 << SUa->NodeNum << ") and SU(" 669 << SUb->NodeNum << ")\n"); 802 PressureDiff *PDiff = PDiffs ? &(*PDiffs)[SU->NodeNum] : nullptr; 1255 return R.DFSNodeData[SU->NodeNum].SubtreeID 1262 R.DFSNodeData[SU->NodeNum].InstrCount = 1272 R.DFSNodeData[SU->NodeNum].SubtreeID = SU->NodeNum; 1273 RootData RData(SU->NodeNum); 1281 unsigned InstrCount = R.DFSNodeData[SU->NodeNum].InstrCount; 1286 unsigned PredNum = PI->getSUnit()->NodeNum; [all...] |
H A D | MachineScheduler.cpp | 485 dbgs() << Queue[i]->NodeNum << " "; 962 DEBUG(dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") " 1158 DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU(" 1159 << UI->SU->NodeNum << ") = " << CyclicLatency << "c\n"); 1272 DEBUG(dbgs() << "Cluster loads SU(" << SUa->NodeNum << ") - SU(" 1273 << SUb->NodeNum << ")\n"); 1282 DEBUG(dbgs() << " Copy Succ SU(" << SI->getSUnit()->NodeNum << ")\n"); 1294 // Map DAG NodeNum to store chain ID. 1306 ChainPredID = PI->getSUnit()->NodeNum; 1363 DEBUG(dbgs() << "Macro Fuse SU(" << SU->NodeNum << ")\ [all...] |
H A D | ScoreboardHazardRecognizer.cpp | 166 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): ");
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGRRList.cpp | 248 if (NewNode->NodeNum >= NumSUnits) 259 if (NewNode->NodeNum >= NumSUnits) 972 DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); 994 LoadNode->setNodeId(LoadSU->NodeNum); 1002 N->setNodeId(NewSU->NodeNum); 1100 DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); 1345 DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n'); 1368 << " SU #" << CurSU->NodeNum << '\n'); 1414 DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum << ") to SU(" 1415 << TrySU->NodeNum << ")\ [all...] |
H A D | ScheduleDAGFast.cpp | 242 DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n"); 256 N->setNodeId(NewSU->NodeNum); 278 LoadNode->setNodeId(LoadSU->NodeNum); 354 DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n"); 598 DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum 599 << " to SU #" << Copies.front()->NodeNum << "\n"); 604 DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum 605 << " to SU #" << TrySU->NodeNum << "\n");
|
H A D | ResourcePriorityQueue.cpp | 193 unsigned LHSNum = LHS->NodeNum; 194 unsigned RHSNum = RHS->NodeNum; 242 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; 436 ResCount += (NumNodesSolelyBlocking[SU->NodeNum] * ScaleTwo);
|
H A D | SelectionDAGPrinter.cpp | 273 O << "SU(" << SU->NodeNum << "): ";
|
H A D | ScheduleDAGSDNodes.cpp | 363 N->setNodeId(NodeSUnit->NodeNum); 380 N->setNodeId(NodeSUnit->NodeNum); 403 N->setNodeId(NodeSUnit->NodeNum);
|
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCHazardRecognizers.cpp | 183 SU->NodeNum << "): ");
|
/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonMachineScheduler.cpp | 123 DEBUG(dbgs() << Packet[i]->NodeNum << ")\t");
|
Completed in 126 milliseconds