Searched refs:NodeNum (Results 1 - 12 of 12) sorted by relevance

/external/llvm/include/llvm/CodeGen/
H A DLatencyPriorityQueue.h68 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 DResourcePriorityQueue.h98 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 DScheduleDAG.h246 unsigned NodeNum; // Entry # of node in the node vector. member in class:llvm::SUnit
281 : Node(node), Instr(0), OrigNode(0), NodeNum(nodenum),
295 : Node(0), Instr(instr), OrigNode(0), NodeNum(nodenum),
308 : Node(0), Instr(0), OrigNode(0), NodeNum(~0u),
/external/llvm/lib/CodeGen/
H A DScheduleDAG.cpp268 dbgs() << "SU(" << NodeNum << "): ";
293 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")";
313 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")";
415 int NodeNum = SU->NodeNum;
418 Node2Index[NodeNum] = Degree;
432 Allocate(SU->NodeNum, --Id);
436 if (!--Node2Index[SU->NodeNum])
451 assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum]
[all...]
H A DLatencyPriorityQueue.cpp31 unsigned LHSNum = LHS->NodeNum;
32 unsigned RHSNum = RHS->NodeNum;
81 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
H A DMachineScheduler.cpp541 return A->NodeNum > B->NodeNum;
543 return A->NodeNum < B->NodeNum;
H A DScoreboardHazardRecognizer.cpp155 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): ");
/external/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp237 if (NewNode->NodeNum >= NumSUnits)
248 if (NewNode->NodeNum >= NumSUnits)
947 DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n");
969 LoadNode->setNodeId(LoadSU->NodeNum);
977 N->setNodeId(NewSU->NodeNum);
1073 DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n");
1411 DEBUG(dbgs() << " Adding an edge from SU #" << TrySU->NodeNum
1412 << " to SU #" << Copies.front()->NodeNum << "\n");
1420 DEBUG(dbgs() << " Adding an edge from SU #" << NewDef->NodeNum
1421 << " to SU #" << TrySU->NodeNum << "\
[all...]
H A DScheduleDAGFast.cpp236 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");
H A DResourcePriorityQueue.cpp192 unsigned LHSNum = LHS->NodeNum;
193 unsigned RHSNum = RHS->NodeNum;
241 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
436 ResCount += (NumNodesSolelyBlocking[SU->NodeNum] * ScaleTwo);
H A DSelectionDAGPrinter.cpp273 O << "SU(" << SU->NodeNum << "): ";
H A DScheduleDAGSDNodes.cpp325 N->setNodeId(NodeSUnit->NodeNum);
342 N->setNodeId(NodeSUnit->NodeNum);
365 N->setNodeId(NodeSUnit->NodeNum);

Completed in 102 milliseconds