Searched refs:isTop (Results 1 – 7 of 7) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCMachineScheduler.cpp | 35 SchedCandidate &FirstCand = Zone.isTop() ? TryCand : Cand; in biasAddiLoadCandidate()
36 SchedCandidate &SecondCand = Zone.isTop() ? Cand : TryCand; in biasAddiLoadCandidate()
142 if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum) || in tryCandidate()
143 (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) { in tryCandidate()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | VLIWMachineScheduler.h | 180 MaxPath = std::max(MaxPath, isTop() ? SU.getHeight() : SU.getDepth()); in init()
185 bool isTop() const { in isTop()
206 unsigned PathLength = isTop() ? SU->getHeight() : SU->getDepth(); in isLatencyBound()
184 bool isTop() const { isTop() function
|
| H A D | MachineScheduler.h | 956 bool isTop() const { in isTop() function
977 return isTop() ? SU->getHeight() : SU->getDepth(); in getUnscheduledLatency()
1205 unsigned getWeakLeft(const SUnit *SU, bool isTop);
1206 int biasPhysReg(const SUnit *SU, bool isTop);
1284 void reschedulePhysReg(SUnit *SU, bool isTop);
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | MachineScheduler.cpp | 2342 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles()
2354 if (isTop()) in getNextResourceCycleByInstance()
2367 if (!isTop()) in getNextResourceCycleByInstance()
2471 ((isTop() && SchedModel->mustBeginGroup(SU->getInstr())) || in checkHazard()
2472 (!isTop() && SchedModel->mustEndGroup(SU->getInstr())))) { in checkHazard()
2474 << (isTop() ? "begin" : "end") << " group\n"); in checkHazard()
2610 if (isTop()) in bumpCycle()
2681 if (!isTop() && SU->isCall) { in bumpNode()
2698 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode()
2767 if (isTop()) { in bumpNode()
[all …]
|
| H A D | VLIWMachineScheduler.cpp | 401 if (isTop()) in bumpCycle()
419 if (!isTop() && SU->isCall) { in bumpNode()
428 startNewCycle = ResourceModel->reserveResources(SU, isTop()); in bumpNode()
452 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending()
492 return !ResourceModel->isResourceAvailable(*Available.begin(), isTop()) || in pickOnlyChoice()
493 getWeakLeft(*Available.begin(), isTop()) != 0; in pickOnlyChoice()
500 ResourceModel->reserveResources(nullptr, isTop()); in pickOnlyChoice()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonConstPropagation.cpp | 163 bool isTop() const { return Kind == Top; } in isTop() function in __anonfe19b4d40111::LatticeCell
214 assert(Top.isTop()); in CellMap()
467 uint32_t Ps = !isTop() ? properties() in convertToProperty()
504 } else if (isTop()) { in print()
524 if (isBottom() || L.isTop()) in meet()
526 if (isTop()) { in meet()
605 assert(!isTop() && "Should not call this for a top cell"); in properties()
2214 assert(!Input.isTop()); in evaluate()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | GCNSchedStrategy.cpp | 304 initCandidate(TryCand, SU, Zone.isTop(), RPTracker, SRI, SGPRPressure, in pickNodeFromQueue()
561 if ((Zone->isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum) || in tryCandidate()
562 (!Zone->isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) { in tryCandidate()
|