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

12

/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.h94 unsigned getLatency(unsigned NodeNum) const {
95 assert(NodeNum < (*SUnits).size());
96 return (*SUnits)[NodeNum].getHeight();
99 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const {
100 assert(NodeNum < NumNodesSolelyBlocking.size());
101 return NumNodesSolelyBlocking[NodeNum];
H A DScheduleDFS.h147 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 DScheduleDAG.h266 unsigned NodeNum; // Entry # of node in the node vector. variable
310 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
326 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
341 NodeNum(BoundaryID), NodeQueueId(0), NumPreds(0), NumSuccs(0),
360 bool isBoundaryNode() const { return NodeNum == BoundaryID; }
/external/swiftshader/third_party/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 DScheduleDAG.h245 unsigned NodeNum; // Entry # of node in the node vector. member in class:llvm::SUnit
280 : Node(node), Instr(0), OrigNode(0), NodeNum(nodenum),
294 : Node(0), Instr(instr), OrigNode(0), NodeNum(nodenum),
307 : Node(0), Instr(0), OrigNode(0), NodeNum(~0u),
/external/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp179 NodeNum2Index[SU->NodeNum] = SUnits.size();
187 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason);
237 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) {
254 TryCand.IsLowLatency = DAG->IsLowLatencySU[SU->NodeNum];
255 TryCand.LowLatencyOffset = DAG->LowLatencyOffset[SU->NodeNum];
257 HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]];
490 if (HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]])
493 if (DAG->IsLowLatencySU[SU->NodeNum]) {
496 NodeNum2Index.find(Succ.getSUnit()->NodeNum);
[all...]
/external/llvm/lib/CodeGen/
H A DScheduleDAG.cpp317 dbgs() << "SU(" << NodeNum << "): ";
346 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")";
366 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")";
472 int NodeNum = SU->NodeNum;
475 Node2Index[NodeNum] = Degree;
489 if (SU->NodeNum < DAGSize)
490 Allocate(SU->NodeNum, --Id);
494 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum])
[all...]
H A DLatencyPriorityQueue.cpp32 unsigned LHSNum = LHS->NodeNum;
33 unsigned RHSNum = RHS->NodeNum;
82 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
H A DScheduleDAGInstrs.cpp81 dbgs() << "SU(" << su->NodeNum << ")";
820 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)
938 PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI);
1014 << BarrierChain->NodeNum << ").\n";);
1159 NodeNums.push_back(SU->NodeNum);
1162 NodeNums.push_back(SU->NodeNum);
1166 // the lowest NodeNum of them will become the new BarrierChain to
1175 if (newBarrierChain->NodeNum < BarrierChain->NodeNum) {
[all...]
H A DMachineScheduler.cpp519 dbgs() << Queue[i]->NodeNum << " ";
1013 dbgs() << " UpdateRegP: SU(" << SU.NodeNum << ") "
1051 dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") "
1251 DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU("
1252 << SU->NodeNum << ") = " << CyclicLatency << "c\n");
1424 DEBUG(dbgs() << "Cluster ld/st SU(" << SUa->NodeNum << ") - SU("
1425 << SUb->NodeNum << ")\n");
1434 DEBUG(dbgs() << " Copy Succ SU(" << SI->getSUnit()->NodeNum << ")\n");
1448 // Map DAG NodeNum to store chain ID.
1462 ChainPredID = PI->getSUnit()->NodeNum;
[all...]
H A DScoreboardHazardRecognizer.cpp157 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): ");
H A DMachinePipeliner.cpp274 int getASAP(SUnit *Node) { return ScheduleInfo[Node->NodeNum].ASAP; }
277 int getALAP(SUnit *Node) { return ScheduleInfo[Node->NodeNum].ALAP; }
515 os << " SU(" << I->NodeNum << ") " << *(I->getInstr());
1109 if (SU->NodeNum < I.NodeNum && !I.isPred(SU))
1130 if (SU->NodeNum < I.NodeNum && !I.isPred(SU))
1411 int N = SI.getSUnit()->NodeNum;
1424 int N = PI.getSUnit()->NodeNum;
1483 if (Blocked.test(W->NodeNum))
[all...]
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DScheduleDAG.cpp291 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...]
H A DLatencyPriorityQueue.cpp31 unsigned LHSNum = LHS->NodeNum;
32 unsigned RHSNum = RHS->NodeNum;
81 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
H A DScoreboardHazardRecognizer.cpp157 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): ");
/external/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp247 if (NewNode->NodeNum >= NumSUnits)
258 if (NewNode->NodeNum >= NumSUnits)
979 DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n");
1001 LoadNode->setNodeId(LoadSU->NodeNum);
1009 N->setNodeId(NewSU->NodeNum);
1100 DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n");
1350 DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n');
1373 << " SU #" << CurSU->NodeNum << '\n');
1417 DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum << ") to SU("
1418 << TrySU->NodeNum << ")\
[all...]
H A DScheduleDAGFast.cpp241 DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n");
255 N->setNodeId(NewSU->NodeNum);
277 LoadNode->setNodeId(LoadSU->NodeNum);
353 DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n");
603 DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum
604 << " to SU #" << Copies.front()->NodeNum << "\n");
609 DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum
610 << " to SU #" << TrySU->NodeNum << "\n");
H A DResourcePriorityQueue.cpp191 unsigned LHSNum = LHS->NodeNum;
192 unsigned RHSNum = RHS->NodeNum;
240 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
434 ResCount += (NumNodesSolelyBlocking[SU->NodeNum] * ScaleTwo);
H A DSelectionDAGPrinter.cpp280 O << "SU(" << SU->NodeNum << "): ";
H A DScheduleDAGSDNodes.cpp355 N->setNodeId(NodeSUnit->NodeNum);
372 N->setNodeId(NodeSUnit->NodeNum);
395 N->setNodeId(NodeSUnit->NodeNum);
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
H A DScheduleDAGRRList.cpp255 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");
1230 DEBUG(dbgs() << " Adding an edge from SU #" << TrySU->NodeNum
1231 << " to SU #" << Copies.front()->NodeNum << "\n");
1239 DEBUG(dbgs() << " Adding an edge from SU #" << NewDef->NodeNum
1240 << " 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 DSelectionDAGPrinter.cpp275 O << "SU(" << SU->NodeNum << "): ";
/external/llvm/lib/Target/PowerPC/
H A DPPCHazardRecognizers.cpp184 SU->NodeNum << "): ");

Completed in 455 milliseconds

12