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

1 2

  /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 94 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];
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 266 unsigned NodeNum; // Entry # of node in the node vector.
308 SUnit(SDNode *node, unsigned nodenum)
310 NodeNum(nodenum), NodeQueueId(0), NumPreds(0), NumSuccs(0),
324 SUnit(MachineInstr *instr, unsigned nodenum)
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/
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/Target/AMDGPU/
SIMachineScheduler.cpp 179 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/
ScheduleDAG.cpp 317 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...]
LatencyPriorityQueue.cpp 32 unsigned LHSNum = LHS->NodeNum;
33 unsigned RHSNum = RHS->NodeNum;
82 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
ScheduleDAGInstrs.cpp 81 dbgs() << "SU(" << su->NodeNum << ")";
820 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum)
    [all...]
MachineScheduler.cpp 519 dbgs() << Queue[i]->NodeNum << " ";
    [all...]
ScoreboardHazardRecognizer.cpp 157 DEBUG(dbgs() << "SU(" << SU->NodeNum << "): ");
MachinePipeliner.cpp 274 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());
    [all...]
  /external/swiftshader/third_party/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 247 if (NewNode->NodeNum >= NumSUnits)
258 if (NewNode->NodeNum >= NumSUnits)
    [all...]
ScheduleDAGFast.cpp 241 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");
ResourcePriorityQueue.cpp 191 unsigned LHSNum = LHS->NodeNum;
192 unsigned RHSNum = RHS->NodeNum;
240 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking;
434 ResCount += (NumNodesSolelyBlocking[SU->NodeNum] * ScaleTwo);
SelectionDAGPrinter.cpp 280 O << "SU(" << SU->NodeNum << "): ";
ScheduleDAGSDNodes.cpp 355 N->setNodeId(NodeSUnit->NodeNum);
372 N->setNodeId(NodeSUnit->NodeNum);
395 N->setNodeId(NodeSUnit->NodeNum);
    [all...]
  /external/swiftshader/third_party/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 << "): ";
  /external/llvm/lib/Target/PowerPC/
PPCHazardRecognizers.cpp 184 SU->NodeNum << "): ");

Completed in 2564 milliseconds

1 2