Home
last modified time | relevance | path

Searched refs:NodeOrder (Results 1 – 12 of 12) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCMachineScheduler.cpp56 TryCand.Reason = NodeOrder; in tryCandidate()
143 TryCand.Reason = NodeOrder; in tryCandidate()
151 if (TryCand.Reason != NodeOrder && TryCand.Reason != NoCand) in tryCandidate()
182 TryCand.Reason = NodeOrder; in tryCandidate()
215 TryCand.Reason = NodeOrder; in tryCandidate()
221 if (TryCand.Reason != NodeOrder && TryCand.Reason != NoCand) in tryCandidate()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp2135 static bool pred_L(SetVector<SUnit *> &NodeOrder, in pred_L() argument
2140 for (SUnit *SU : NodeOrder) { in pred_L()
2147 if (NodeOrder.count(PredSU) == 0) in pred_L()
2161 if (NodeOrder.count(SuccSU) == 0) in pred_L()
2171 static bool succ_L(SetVector<SUnit *> &NodeOrder, in succ_L() argument
2176 for (SUnit *SU : NodeOrder) { in succ_L()
2183 if (NodeOrder.count(SuccSU) == 0) in succ_L()
2197 if (NodeOrder.count(PredSU) == 0) in succ_L()
2496 NodeOrder.clear(); in computeNodeOrder()
2502 if (pred_L(NodeOrder, N, DDG.get()) && llvm::set_is_subset(N, Nodes)) { in computeNodeOrder()
[all …]
H A DVLIWMachineScheduler.cpp793 FoundCandidate = NodeOrder; in pickNodeFromQueue()
806 FoundCandidate = NodeOrder; in pickNodeFromQueue()
867 FoundCandidate = NodeOrder; in pickNodeFromQueue()
H A DMachineScheduler.cpp3406 case NodeOrder: return "ORDER "; in getReasonStr()
3594 case GenericScheduler::NodeOrder: in tracePick()
3653 case GenericScheduler::NodeOrder: in tracePick()
4050 TryCand.Reason = NodeOrder; in tryCandidate()
4418 TryCand.Reason = NodeOrder; in tryCandidate()
/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64MachineScheduler.cpp75 TryCand.Reason = NodeOrder; in tryCandidate()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp146 NodeOrdering NodeOrder; // Node ordering, for deterministic behavior. member in __anon9d81f58e0111::HexagonCommonGEP
373 NodeOrder.insert(N); in processGepInst()
387 NodeOrder.insert(Nx); in processGepInst()
589 GepNode *Min = *llvm::min_element(S, NodeOrder); in common()
1263 NodeOrder.clear(); in runOnFunction()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DVLIWMachineScheduler.h108 NodeOrder, enumerator
H A DMachinePipeliner.h308 SetVector<SUnit *> NodeOrder; variable
H A DMachineScheduler.h1094 NodeOrder, enumerator
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp131 case NodeOrder: return "ORDER"; in getReasonStr()
193 TryCand.Reason = NodeOrder; in tryCandidateTopDown()
237 TryCand.Reason = NodeOrder; in tryCandidateTopDown()
1511 TryCand.Reason = NodeOrder; in tryCandidateLatency()
1536 TryCand.Reason = NodeOrder; in tryCandidateRegUsage()
H A DSIMachineScheduler.h37 NodeOrder enumerator
H A DGCNSchedStrategy.cpp547 TryCand.Reason = NodeOrder; in tryCandidate()
618 TryCand.Reason = NodeOrder; in tryCandidate()
646 TryCand.Reason = NodeOrder; in tryCandidate()
748 TryCand.Reason = NodeOrder; in tryCandidate()