Home
last modified time | relevance | path

Searched refs:isTop (Results 1 – 7 of 7) sorted by relevance

/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/
DPPCMachineScheduler.cpp35 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-12-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
DHexagonMachineScheduler.h186 MaxPath = std::max(MaxPath, isTop() ? SU.getHeight() : SU.getDepth()); in init()
191 bool isTop() const { in isTop() function
212 unsigned PathLength = isTop() ? SU->getHeight() : SU->getDepth(); in isLatencyBound()
DHexagonMachineScheduler.cpp376 if (isTop()) in bumpCycle()
394 if (!isTop() && SU->isCall) { in bumpNode()
403 startNewCycle = ResourceModel->reserveResources(SU, isTop()); in bumpNode()
428 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle; in releasePending()
467 return !ResourceModel->isResourceAvailable(*Available.begin(), isTop()) || in pickOnlyChoice()
468 getWeakLeft(*Available.begin(), isTop()) != 0; in pickOnlyChoice()
474 ResourceModel->reserveResources(nullptr, isTop()); in pickOnlyChoice()
DHexagonConstPropagation.cpp163 bool isTop() const { return Kind == Top; } in isTop() function in __anon034c86ec0111::LatticeCell
214 assert(Top.isTop()); in CellMap()
468 uint32_t Ps = !isTop() ? properties() in convertToProperty()
505 } else if (isTop()) { in print()
525 if (isBottom() || L.isTop()) in meet()
527 if (isTop()) { in meet()
606 assert(!isTop() && "Should not call this for a top cell"); in properties()
2221 assert(!Input.isTop()); in evaluate()
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
DMachineScheduler.cpp2078 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in getLatencyStallCycles()
2093 if (!isTop()) in getNextResourceCycleByInstance()
2179 ((isTop() && SchedModel->mustBeginGroup(SU->getInstr())) || in checkHazard()
2180 (!isTop() && SchedModel->mustEndGroup(SU->getInstr())))) { in checkHazard()
2182 << (isTop() ? "begin" : "end") << " group\n"); in checkHazard()
2316 if (isTop()) in bumpCycle()
2381 if (!isTop() && SU->isCall) { in bumpNode()
2398 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle); in bumpNode()
2464 if (isTop()) { in bumpNode()
2474 unsigned &TopLatency = isTop() ? ExpectedLatency : DependentLatency; in bumpNode()
[all …]
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
DMachineScheduler.h702 bool isTop() const { in isTop() function
723 return isTop() ? SU->getHeight() : SU->getDepth(); in getUnscheduledLatency()
946 unsigned getWeakLeft(const SUnit *SU, bool isTop);
947 int biasPhysReg(const SUnit *SU, bool isTop);
1025 void reschedulePhysReg(SUnit *SU, bool isTop);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
DGCNSchedStrategy.cpp154 initCandidate(TryCand, SU, Zone.isTop(), RPTracker, SRI, in pickNodeFromQueue()