| /external/llvm/lib/Target/AMDGPU/ |
| D | SIMachineScheduler.cpp | 179 NodeNum2Index[SU->NodeNum] = SUnits.size(); in addUnit()
187 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
237 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) { in tryCandidateTopDown()
254 TryCand.IsLowLatency = DAG->IsLowLatencySU[SU->NodeNum]; in pickNode()
255 TryCand.LowLatencyOffset = DAG->LowLatencyOffset[SU->NodeNum]; in pickNode()
257 HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]; in pickNode()
490 if (HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]) in nodeScheduled()
493 if (DAG->IsLowLatencySU[SU->NodeNum]) { in nodeScheduled()
496 NodeNum2Index.find(Succ.getSUnit()->NodeNum); in nodeScheduled()
508 if (DAG->IsHighLatencySU[SU->NodeNum]) in finalizeUnits()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/ |
| D | SIMachineScheduler.cpp | 199 NodeNum2Index[SU->NodeNum] = SUnits.size(); in addUnit()
206 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
258 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) { in tryCandidateTopDown()
275 TryCand.IsLowLatency = DAG->IsLowLatencySU[SU->NodeNum]; in pickNode()
276 TryCand.LowLatencyOffset = DAG->LowLatencyOffset[SU->NodeNum]; in pickNode()
278 HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]; in pickNode()
488 if (SuccSU->NodeNum >= DAG->SUnits.size()) in releaseSuccessors()
513 if (HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]) in nodeScheduled()
516 if (DAG->IsLowLatencySU[SU->NodeNum]) { in nodeScheduled()
519 NodeNum2Index.find(Succ.getSUnit()->NodeNum); in nodeScheduled()
[all …]
|
| D | GCNMinRegStrategy.cpp | 47 return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max(); in isScheduled()
52 NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max(); in setIsScheduled()
57 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in getNumPreds()
58 return NumPreds[SU->NodeNum]; in getNumPreds()
63 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in decNumPreds()
64 return --NumPreds[SU->NodeNum]; in decNumPreds()
155 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would left non-ready " in pickCandidate()
166 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would make ready " << Res in pickCandidate()
177 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
208 LLVM_DEBUG(dbgs() << "Make the predecessors of SU(" << SchedSU->NodeNum in bumpPredsPriority()
[all …]
|
| D | GCNILPSched.cpp | 60 unsigned &SethiUllmanNumber = SUNumbers[SU->NodeNum]; in CalcNodeSethiUllmanNumber()
88 assert(SU->NodeNum < SUNumbers.size()); in getNodePriority()
102 return SUNumbers[SU->NodeNum]; in getNodePriority()
152 LLVM_DEBUG(dbgs() << " Comparing latency of SU (" << left->NodeNum in BUCompareLatency()
153 << ") depth " << LDepth << " vs SU (" << right->NodeNum in BUCompareLatency()
172 LLVM_DEBUG(dbgs() << "Depth of SU(" << left->NodeNum << "): " in pickBest()
173 << left->getDepth() << " != SU(" << right->NodeNum in pickBest()
301 SUSavedCopy[SU.NodeNum] = SU; in schedule()
331 << ' ' << C.SU->NodeNum; in schedule()
352 SU = SUSavedCopy[SU.NodeNum]; in schedule()
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| D | LatencyPriorityQueue.h | 68 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
69 assert(NodeNum < (*SUnits).size()); in getLatency()
70 return (*SUnits)[NodeNum].getHeight(); in getLatency()
73 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
74 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
75 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 348 OS << "SU(" << NodeNum << ")"; in print()
484 int NodeNum = SU.NodeNum; in InitDAGTopologicalSorting() local
487 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
501 if (SU->NodeNum < DAGSize) in InitDAGTopologicalSorting()
502 Allocate(SU->NodeNum, --Id); in InitDAGTopologicalSorting()
505 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
518 assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
527 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
528 UpperBound = Node2Index[X->NodeNum]; in AddPred()
554 Visited.set(SU->NodeNum); in DFS()
[all …]
|
| D | ScheduleDAGInstrs.cpp | 104 dbgs() << "SU(" << su->NodeNum << ")"; in dumpSUList()
669 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum) in insertBarrierChain()
782 PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI); in buildSchedGraph()
854 << BarrierChain->NodeNum << ").\n";); in buildSchedGraph()
995 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
998 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1011 if (newBarrierChain->NodeNum < BarrierChain->NodeNum) { in reduceHugeMemNodeMaps()
1015 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1019 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1164 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
[all …]
|
| D | MachineScheduler.cpp | 589 dbgs() << SU->NodeNum << " "; in dump()
1129 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU.NodeNum << ") " in updatePressureDiffs()
1164 LLVM_DEBUG(dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") " in updatePressureDiffs()
1368 LLVM_DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU(" in computeCyclicCriticalPath()
1369 << SU->NodeNum << ") = " << CyclicLatency << "c\n"); in computeCyclicCriticalPath()
1482 return std::tie(BaseReg, Offset, SU->NodeNum) < in operator <()
1483 std::tie(RHS.BaseReg, RHS.Offset, RHS.SU->NodeNum); in operator <()
1556 LLVM_DEBUG(dbgs() << "Cluster ld/st SU(" << SUa->NodeNum << ") - SU(" in clusterNeighboringMemOps()
1557 << SUb->NodeNum << ")\n"); in clusterNeighboringMemOps()
1565 LLVM_DEBUG(dbgs() << " Copy Succ SU(" << Succ.getSUnit()->NodeNum in clusterNeighboringMemOps()
[all …]
|
| D | LatencyPriorityQueue.cpp | 33 unsigned LHSNum = LHS->NodeNum; in operator ()()
34 unsigned RHSNum = RHS->NodeNum; in operator ()()
83 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| D | LatencyPriorityQueue.h | 69 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
70 assert(NodeNum < (*SUnits).size()); in getLatency()
71 return (*SUnits)[NodeNum].getHeight(); in getLatency()
74 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
75 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
76 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
|
| D | ResourcePriorityQueue.h | 94 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
95 assert(NodeNum < (*SUnits).size()); in getLatency()
96 return (*SUnits)[NodeNum].getHeight(); in getLatency()
99 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
100 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
101 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
|
| D | ScheduleDFS.h | 147 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
160 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
173 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
174 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | LatencyPriorityQueue.h | 68 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
69 assert(NodeNum < (*SUnits).size()); in getLatency()
70 return (*SUnits)[NodeNum].getHeight(); in getLatency()
73 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
74 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
75 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
|
| D | ResourcePriorityQueue.h | 94 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
95 assert(NodeNum < (*SUnits).size()); in getLatency()
96 return (*SUnits)[NodeNum].getHeight(); in getLatency()
99 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
100 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
101 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
|
| D | ScheduleDFS.h | 147 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
160 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
173 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
174 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
|
| /external/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 317 dbgs() << "SU(" << NodeNum << "): "; in dump()
346 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")"; in dumpAll()
366 dbgs() << "SU(" << I->getSUnit()->NodeNum << ")"; in dumpAll()
472 int NodeNum = SU->NodeNum; in InitDAGTopologicalSorting() local
475 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
489 if (SU->NodeNum < DAGSize) in InitDAGTopologicalSorting()
490 Allocate(SU->NodeNum, --Id); in InitDAGTopologicalSorting()
494 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
509 assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
520 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
[all …]
|
| D | ScheduleDAGInstrs.cpp | 81 dbgs() << "SU(" << su->NodeNum << ")"; in dumpSUList()
820 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum) in insertBarrierChain()
938 PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI); in buildSchedGraph()
1014 << BarrierChain->NodeNum << ").\n";); in buildSchedGraph()
1159 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1162 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1175 if (newBarrierChain->NodeNum < BarrierChain->NodeNum) { in reduceHugeMemNodeMaps()
1179 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1183 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1433 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
[all …]
|
| D | MachineScheduler.cpp | 519 dbgs() << Queue[i]->NodeNum << " "; in dump()
1013 dbgs() << " UpdateRegP: SU(" << SU.NodeNum << ") " in updatePressureDiffs()
1051 dbgs() << " UpdateRegP: SU(" << SU->NodeNum << ") " in updatePressureDiffs()
1251 DEBUG(dbgs() << "Cyclic Path: SU(" << DefSU->NodeNum << ") -> SU(" in computeCyclicCriticalPath()
1252 << SU->NodeNum << ") = " << CyclicLatency << "c\n"); in computeCyclicCriticalPath()
1424 DEBUG(dbgs() << "Cluster ld/st SU(" << SUa->NodeNum << ") - SU(" in clusterNeighboringMemOps()
1425 << SUb->NodeNum << ")\n"); in clusterNeighboringMemOps()
1434 DEBUG(dbgs() << " Copy Succ SU(" << SI->getSUnit()->NodeNum << ")\n"); in clusterNeighboringMemOps()
1462 ChainPredID = PI->getSUnit()->NodeNum; in apply()
1546 DEBUG(dbgs() << "Macro Fuse SU(" << SU.NodeNum << ")\n"); in apply()
[all …]
|
| D | LatencyPriorityQueue.cpp | 32 unsigned LHSNum = LHS->NodeNum; in operator ()()
33 unsigned RHSNum = RHS->NodeNum; in operator ()()
82 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 291 dbgs() << "SU(" << NodeNum << "): "; in dump()
317 dbgs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")"; in dumpAll()
338 dbgs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")"; in dumpAll()
445 int NodeNum = SU->NodeNum; in InitDAGTopologicalSorting() local
448 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
462 Allocate(SU->NodeNum, --Id); in InitDAGTopologicalSorting()
466 if (!--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
481 assert(Node2Index[SU->NodeNum] > Node2Index[I->getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
492 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
493 UpperBound = Node2Index[X->NodeNum]; in AddPred()
[all …]
|
| D | LatencyPriorityQueue.cpp | 31 unsigned LHSNum = LHS->NodeNum; in operator ()()
32 unsigned RHSNum = RHS->NodeNum; in operator ()()
81 NumNodesSolelyBlocking[SU->NodeNum] = NumNodesBlocking; in push()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 275 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
286 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
1007 LoadNode->setNodeId(LoadSU->NodeNum); in TryUnfoldSU()
1025 N->setNodeId(NewSU->NodeNum); in TryUnfoldSU()
1041 LLVM_DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); in TryUnfoldSU()
1176 LLVM_DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1437 LLVM_DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n'); in releaseInterferences()
1461 dbgs() << " SU #" << CurSU->NodeNum << '\n'); in PickNodeToScheduleBottomUp()
1507 LLVM_DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum in PickNodeToScheduleBottomUp()
1508 << ") to SU(" << TrySU->NodeNum << ")\n"); in PickNodeToScheduleBottomUp()
[all …]
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 247 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
258 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
979 DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1001 LoadNode->setNodeId(LoadSU->NodeNum); in CopyAndMoveSuccessors()
1009 N->setNodeId(NewSU->NodeNum); in CopyAndMoveSuccessors()
1100 DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1350 DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n'); in releaseInterferences()
1373 << " SU #" << CurSU->NodeNum << '\n'); in PickNodeToScheduleBottomUp()
1417 DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum << ") to SU(" in PickNodeToScheduleBottomUp()
1418 << TrySU->NodeNum << ")\n"); in PickNodeToScheduleBottomUp()
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 255 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
266 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
808 DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
830 LoadNode->setNodeId(LoadSU->NodeNum); in CopyAndMoveSuccessors()
838 N->setNodeId(NewSU->NodeNum); in CopyAndMoveSuccessors()
934 DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1230 DEBUG(dbgs() << " Adding an edge from SU #" << TrySU->NodeNum in PickNodeToScheduleBottomUp()
1231 << " to SU #" << Copies.front()->NodeNum << "\n"); in PickNodeToScheduleBottomUp()
1239 DEBUG(dbgs() << " Adding an edge from SU #" << NewDef->NodeNum in PickNodeToScheduleBottomUp()
1240 << " to SU #" << TrySU->NodeNum << "\n"); in PickNodeToScheduleBottomUp()
[all …]
|
| D | ScheduleDAGFast.cpp | 236 DEBUG(dbgs() << "Unfolding SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
250 N->setNodeId(NewSU->NodeNum); in CopyAndMoveSuccessors()
272 LoadNode->setNodeId(LoadSU->NodeNum); in CopyAndMoveSuccessors()
346 DEBUG(dbgs() << "Duplicating SU # " << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
592 DEBUG(dbgs() << "Adding an edge from SU # " << TrySU->NodeNum in ListScheduleBottomUp()
593 << " to SU #" << Copies.front()->NodeNum << "\n"); in ListScheduleBottomUp()
600 DEBUG(dbgs() << "Adding an edge from SU # " << NewDef->NodeNum in ListScheduleBottomUp()
601 << " to SU #" << TrySU->NodeNum << "\n"); in ListScheduleBottomUp()
|