HomeSort by relevance Sort by last modified time
    Searched refs:NodeNum (Results 1 - 17 of 17) sorted by null

  /external/llvm/include/llvm/CodeGen/
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];
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];
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;
ScheduleDAG.h 277 unsigned NodeNum; // Entry # of node in the node vector.
319 SUnit(SDNode *node, unsigned nodenum)
321 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
335 SUnit(MachineInstr *instr, unsigned nodenum)
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; };
MachineScheduler.h 413 return SUPressureDiffs[SU->NodeNum];
  /external/llvm/lib/CodeGen/
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...]
LatencyPriorityQueue.cpp 32 unsigned LHSNum = LHS->NodeNum;
33 unsigned RHSNum = RHS->NodeNum;
82 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
ScheduleDAGInstrs.cpp 668 << SUa->NodeNum << ") and SU("
669 << SUb->NodeNum << ")\n");
802 PressureDiff *PDiff = PDiffs ? &(*PDiffs)[SU->NodeNum] : nullptr;
    [all...]
MachineScheduler.cpp 485 dbgs() << Queue[i]->NodeNum << " ";
    [all...]
ScoreboardHazardRecognizer.cpp 166 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): ");
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp 248 if (NewNode->NodeNum >= NumSUnits)
259 if (NewNode->NodeNum >= NumSUnits)
    [all...]
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");
ResourcePriorityQueue.cpp 193 unsigned LHSNum = LHS->NodeNum;
194 unsigned RHSNum = RHS->NodeNum;
242 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
436 ResCount += (NumNodesSolelyBlocking[SU->NodeNum] * ScaleTwo);
SelectionDAGPrinter.cpp 273 O << "SU(" << SU->NodeNum << "): ";
ScheduleDAGSDNodes.cpp 363 N->setNodeId(NodeSUnit->NodeNum);
380 N->setNodeId(NodeSUnit->NodeNum);
403 N->setNodeId(NodeSUnit->NodeNum);
    [all...]
  /external/llvm/lib/Target/PowerPC/
PPCHazardRecognizers.cpp 183 SU->NodeNum << "): ");
  /external/llvm/lib/Target/Hexagon/
HexagonMachineScheduler.cpp 123 DEBUG(dbgs() << Packet[i]->NodeNum << ")\t");

Completed in 140 milliseconds