HomeSort by relevance Sort by last modified time
    Searched refs:NodeNum (Results 1 - 9 of 9) 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];
ScheduleDAG.h 245 unsigned NodeNum; // Entry # of node in the node vector.
279 SUnit(SDNode *node, unsigned nodenum)
280 : Node(node), Instr(0), OrigNode(0), NodeNum(nodenum),
293 SUnit(MachineInstr *instr, unsigned nodenum)
294 : Node(0), Instr(instr), OrigNode(0), NodeNum(nodenum),
307 : Node(0), Instr(0), OrigNode(0), NodeNum(~0u),
  /external/llvm/lib/CodeGen/
ScheduleDAG.cpp 291 dbgs() << "SU(" << NodeNum << "): ";
317 dbgs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";
338 dbgs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";
445 int NodeNum = SU->NodeNum;
448 Node2Index[NodeNum] = Degree;
462 Allocate(SU->NodeNum, --Id);
466 if (!--Node2Index[SU->NodeNum])
481 assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum] &
    [all...]
LatencyPriorityQueue.cpp 31 unsigned LHSNum = LHS->NodeNum;
32 unsigned RHSNum = RHS->NodeNum;
81 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
ScoreboardHazardRecognizer.cpp 157 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): ");
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGRRList.cpp 255 if (NewNode->NodeNum >= NumSUnits)
266 if (NewNode->NodeNum >= NumSUnits)
808 DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n");
830 LoadNode->setNodeId(LoadSU->NodeNum);
838 N->setNodeId(NewSU->NodeNum);
934 DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n");
    [all...]
ScheduleDAGFast.cpp 236 DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n");
250 N->setNodeId(NewSU->NodeNum);
272 LoadNode->setNodeId(LoadSU->NodeNum);
346 DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n");
592 DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum
593 << " to SU #" << Copies.front()->NodeNum << "\n");
600 DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum
601 << " to SU #" << TrySU->NodeNum << "\n");
SelectionDAGPrinter.cpp 275 O << "SU(" << SU->NodeNum << "): ";
ScheduleDAGSDNodes.cpp 317 N->setNodeId(NodeSUnit->NodeNum);
334 N->setNodeId(NodeSUnit->NodeNum);
357 N->setNodeId(NodeSUnit->NodeNum);

Completed in 393 milliseconds