| /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-10.0/llvm/lib/Target/AMDGPU/ |
| D | SIMachineScheduler.cpp | 198 NodeNum2Index[SU->NodeNum] = SUnits.size(); in addUnit()
205 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
257 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) { in tryCandidateTopDown()
274 TryCand.IsLowLatency = DAG->IsLowLatencySU[SU->NodeNum]; in pickNode()
275 TryCand.LowLatencyOffset = DAG->LowLatencyOffset[SU->NodeNum]; in pickNode()
277 HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]; in pickNode()
487 if (SuccSU->NodeNum >= DAG->SUnits.size()) in releaseSuccessors()
512 if (HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]) in nodeScheduled()
515 if (DAG->IsLowLatencySU[SU->NodeNum]) { in nodeScheduled()
518 NodeNum2Index.find(Succ.getSUnit()->NodeNum); in nodeScheduled()
[all …]
|
| D | GCNMinRegStrategy.cpp | 46 return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max(); in isScheduled()
51 NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max(); in setIsScheduled()
56 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in getNumPreds()
57 return NumPreds[SU->NodeNum]; in getNumPreds()
62 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in decNumPreds()
63 return --NumPreds[SU->NodeNum]; in decNumPreds()
154 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would left non-ready " in pickCandidate()
165 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would make ready " << Res in pickCandidate()
176 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
207 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/llvm-project/llvm/lib/Target/AMDGPU/ |
| D | SIMachineScheduler.cpp | 198 NodeNum2Index[SU->NodeNum] = SUnits.size(); in addUnit()
205 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason); in traceCandidate()
257 if (TryCand.SU->NodeNum < Cand.SU->NodeNum) { in tryCandidateTopDown()
274 TryCand.IsLowLatency = DAG->IsLowLatencySU[SU->NodeNum]; in pickNode()
275 TryCand.LowLatencyOffset = DAG->LowLatencyOffset[SU->NodeNum]; in pickNode()
277 HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]; in pickNode()
487 if (SuccSU->NodeNum >= DAG->SUnits.size()) in releaseSuccessors()
512 if (HasLowLatencyNonWaitedParent[NodeNum2Index[SU->NodeNum]]) in nodeScheduled()
515 if (DAG->IsLowLatencySU[SU->NodeNum]) { in nodeScheduled()
518 NodeNum2Index.find(Succ.getSUnit()->NodeNum); in nodeScheduled()
[all …]
|
| D | GCNMinRegStrategy.cpp | 53 return NumPreds[SU->NodeNum] == std::numeric_limits<unsigned>::max(); in isScheduled()
58 NumPreds[SU->NodeNum] = std::numeric_limits<unsigned>::max(); in setIsScheduled()
63 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in getNumPreds()
64 return NumPreds[SU->NodeNum]; in getNumPreds()
69 assert(NumPreds[SU->NodeNum] != std::numeric_limits<unsigned>::max()); in decNumPreds()
70 return --NumPreds[SU->NodeNum]; in decNumPreds()
161 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would left non-ready " in pickCandidate()
172 LLVM_DEBUG(dbgs() << "SU(" << SU->NodeNum << ") would make ready " << Res in pickCandidate()
183 Num = findMax(Num, [=](const Candidate &C) { return -(int64_t)C.SU->NodeNum; }); in pickCandidate()
214 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/llvm-project/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 360 dbgs() << "SU(" << SU.NodeNum << ")"; in dumpNodeName()
481 int NodeNum = SU.NodeNum; in InitDAGTopologicalSorting() local
484 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
498 if (SU->NodeNum < DAGSize) in InitDAGTopologicalSorting()
499 Allocate(SU->NodeNum, --Id); in InitDAGTopologicalSorting()
502 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
516 assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
550 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
551 UpperBound = Node2Index[X->NodeNum]; in AddPred()
579 Visited.set(SU->NodeNum); in DFS()
[all …]
|
| D | ScheduleDAGInstrs.cpp | 103 dbgs() << "SU(" << su->NodeNum << ")"; in dumpSUList()
707 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum) in insertBarrierChain()
828 PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI); in buildSchedGraph()
900 << BarrierChain->NodeNum << ").\n";); in buildSchedGraph()
1059 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1062 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1075 if (newBarrierChain->NodeNum < BarrierChain->NodeNum) { in reduceHugeMemNodeMaps()
1079 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1083 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1256 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
[all …]
|
| /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-project/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 | 93 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
94 assert(NodeNum < (*SUnits).size()); in getLatency()
95 return (*SUnits)[NodeNum].getHeight(); in getLatency()
98 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
99 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
100 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
|
| D | ScheduleDFS.h | 146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
|
| /external/swiftshader/third_party/llvm-10.0/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 | 93 unsigned getLatency(unsigned NodeNum) const { in getLatency() argument
94 assert(NodeNum < (*SUnits).size()); in getLatency()
95 return (*SUnits)[NodeNum].getHeight(); in getLatency()
98 unsigned getNumSolelyBlockNodes(unsigned NodeNum) const { in getNumSolelyBlockNodes() argument
99 assert(NodeNum < NumNodesSolelyBlocking.size()); in getNumSolelyBlockNodes()
100 return NumNodesSolelyBlocking[NodeNum]; in getNumSolelyBlockNodes()
|
| D | ScheduleDFS.h | 146 return DFSNodeData[SU->NodeNum].InstrCount; in getNumInstrs()
159 return ILPValue(DFSNodeData[SU->NodeNum].InstrCount, 1 + SU->getDepth()); in getILP()
172 assert(SU->NodeNum < DFSNodeData.size() && "New Node"); in getSubtreeID()
173 return DFSNodeData[SU->NodeNum].SubtreeID; in getSubtreeID()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | ScheduleDAG.cpp | 360 dbgs() << "SU(" << SU.NodeNum << ")"; in dumpNodeName()
481 int NodeNum = SU.NodeNum; in InitDAGTopologicalSorting() local
484 Node2Index[NodeNum] = Degree; in InitDAGTopologicalSorting()
498 if (SU->NodeNum < DAGSize) in InitDAGTopologicalSorting()
499 Allocate(SU->NodeNum, --Id); in InitDAGTopologicalSorting()
502 if (SU->NodeNum < DAGSize && !--Node2Index[SU->NodeNum]) in InitDAGTopologicalSorting()
516 assert(Node2Index[SU.NodeNum] > Node2Index[PD.getSUnit()->NodeNum] && in InitDAGTopologicalSorting()
550 LowerBound = Node2Index[Y->NodeNum]; in AddPred()
551 UpperBound = Node2Index[X->NodeNum]; in AddPred()
579 Visited.set(SU->NodeNum); in DFS()
[all …]
|
| D | ScheduleDAGInstrs.cpp | 102 dbgs() << "SU(" << su->NodeNum << ")"; in dumpSUList()
703 if ((*SUItr)->NodeNum <= BarrierChain->NodeNum) in insertBarrierChain()
824 PDiffs->addInstruction(SU->NodeNum, RegOpers, MRI); in buildSchedGraph()
896 << BarrierChain->NodeNum << ").\n";); in buildSchedGraph()
1055 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1058 NodeNums.push_back(SU->NodeNum); in reduceHugeMemNodeMaps()
1071 if (newBarrierChain->NodeNum < BarrierChain->NodeNum) { in reduceHugeMemNodeMaps()
1075 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1079 << BarrierChain->NodeNum << ").\n";); in reduceHugeMemNodeMaps()
1252 return R.DFSNodeData[SU->NodeNum].SubtreeID in isVisited()
[all …]
|
| /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 …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 281 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
291 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
1013 LoadNode->setNodeId(LoadSU->NodeNum); in TryUnfoldSU()
1032 N->setNodeId(NewSU->NodeNum); in TryUnfoldSU()
1048 LLVM_DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); in TryUnfoldSU()
1183 LLVM_DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1449 LLVM_DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n'); in releaseInterferences()
1473 dbgs() << " SU #" << CurSU->NodeNum << '\n'); in PickNodeToScheduleBottomUp()
1524 LLVM_DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum in PickNodeToScheduleBottomUp()
1525 << ") to SU(" << TrySU->NodeNum << ")\n"); in PickNodeToScheduleBottomUp()
[all …]
|
| /external/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| D | ScheduleDAGRRList.cpp | 281 if (NewNode->NodeNum >= NumSUnits) in CreateNewSUnit()
291 if (NewNode->NodeNum >= NumSUnits) in CreateClone()
1013 LoadNode->setNodeId(LoadSU->NodeNum); in TryUnfoldSU()
1032 N->setNodeId(NewSU->NodeNum); in TryUnfoldSU()
1048 LLVM_DEBUG(dbgs() << "Unfolding SU #" << SU->NodeNum << "\n"); in TryUnfoldSU()
1183 LLVM_DEBUG(dbgs() << " Duplicating SU #" << SU->NodeNum << "\n"); in CopyAndMoveSuccessors()
1449 LLVM_DEBUG(dbgs() << " Repushing SU #" << SU->NodeNum << '\n'); in releaseInterferences()
1473 dbgs() << " SU #" << CurSU->NodeNum << '\n'); in PickNodeToScheduleBottomUp()
1524 LLVM_DEBUG(dbgs() << "ARTIFICIAL edge from SU(" << BtSU->NodeNum in PickNodeToScheduleBottomUp()
1525 << ") 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 …]
|