Searched refs:BotCand (Results 1 – 7 of 7) sorted by relevance
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AMDGPU/ |
| D | GCNSchedStrategy.cpp | 192 if (!BotCand.isValid() || BotCand.SU->isScheduled || in pickNodeBidirectional()
193 BotCand.Policy != BotPolicy) { in pickNodeBidirectional()
194 BotCand.reset(CandPolicy()); in pickNodeBidirectional()
195 pickNodeFromQueue(Bot, BotPolicy, DAG->getBotRPTracker(), BotCand); in pickNodeBidirectional()
196 assert(BotCand.Reason != NoCand && "failed to find the first candidate"); in pickNodeBidirectional()
198 LLVM_DEBUG(traceCandidate(BotCand)); in pickNodeBidirectional()
214 dbgs() << "Bot Cand: "; traceCandidate(BotCand);); in pickNodeBidirectional()
216 if (TopCand.Reason == BotCand.Reason) { in pickNodeBidirectional()
217 Cand = BotCand; in pickNodeBidirectional()
229 } else if (BotCand.Reason == RegExcess && BotCand.RPDelta.Excess.getUnitInc() <= 0) { in pickNodeBidirectional()
[all …]
|
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 596 SchedCandidate BotCand; in pickNodeBidrectional() local
599 DAG->getBotRPTracker(), BotCand); in pickNodeBidrectional()
611 return BotCand.SU; in pickNodeBidrectional()
627 return BotCand.SU; in pickNodeBidrectional()
633 if (TopCand.SCost > BotCand.SCost) { in pickNodeBidrectional()
639 return BotCand.SU; in pickNodeBidrectional()
664 SchedCandidate BotCand; in pickNode() local
666 pickNodeFromQueue(Bot.Available, DAG->getBotRPTracker(), BotCand); in pickNode()
669 SU = BotCand.SU; in pickNode()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.cpp | 892 SchedCandidate BotCand; in pickNodeBidrectional() local
895 DAG->getBotRPTracker(), BotCand); in pickNodeBidrectional()
908 return BotCand.SU; in pickNodeBidrectional()
926 return BotCand.SU; in pickNodeBidrectional()
933 if (TopCand.SCost > BotCand.SCost) { in pickNodeBidrectional()
941 return BotCand.SU; in pickNodeBidrectional()
966 SchedCandidate BotCand; in pickNode() local
968 pickNodeFromQueue(Bot, DAG->getBotRPTracker(), BotCand); in pickNode()
971 SU = BotCand.SU; in pickNode()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 2644 BotCand.SU = nullptr; in initialize()
3039 if (!BotCand.isValid() || BotCand.SU->isScheduled || in pickNodeBidirectional()
3040 BotCand.Policy != BotPolicy) { in pickNodeBidirectional()
3041 BotCand.reset(CandPolicy()); in pickNodeBidirectional()
3042 pickNodeFromQueue(Bot, BotPolicy, DAG->getBotRPTracker(), BotCand); in pickNodeBidirectional()
3043 assert(BotCand.Reason != NoCand && "failed to find the first candidate"); in pickNodeBidirectional()
3045 LLVM_DEBUG(traceCandidate(BotCand)); in pickNodeBidirectional()
3051 assert(TCand.SU == BotCand.SU && in pickNodeBidirectional()
3078 assert(BotCand.isValid()); in pickNodeBidirectional()
3080 SchedCandidate Cand = BotCand; in pickNodeBidirectional()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 2562 BotCand.SU = nullptr; in initialize()
2961 if (!BotCand.isValid() || BotCand.SU->isScheduled || in pickNodeBidirectional()
2962 BotCand.Policy != BotPolicy) { in pickNodeBidirectional()
2963 BotCand.reset(CandPolicy()); in pickNodeBidirectional()
2964 pickNodeFromQueue(Bot, BotPolicy, DAG->getBotRPTracker(), BotCand); in pickNodeBidirectional()
2965 assert(BotCand.Reason != NoCand && "failed to find the first candidate"); in pickNodeBidirectional()
2967 DEBUG(traceCandidate(BotCand)); in pickNodeBidirectional()
2973 assert(TCand.SU == BotCand.SU && in pickNodeBidirectional()
3000 assert(BotCand.isValid()); in pickNodeBidirectional()
3002 SchedCandidate Cand = BotCand; in pickNodeBidirectional()
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 888 SchedCandidate BotCand; variable
923 BotCand.SU = nullptr; in releaseBottomNode()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 963 BotCand.SU = nullptr; in releaseBottomNode()
980 SchedCandidate BotCand; variable
|