Home
last modified time | relevance | path

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

/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
H A DPPCMachineScheduler.cpp56 TryCand.Reason = NodeOrder; in tryCandidate()
144 TryCand.Reason = NodeOrder; in tryCandidate()
152 if (TryCand.Reason != NodeOrder && TryCand.Reason != NoCand) in tryCandidate()
181 TryCand.Reason = NodeOrder; in tryCandidate()
211 TryCand.Reason = NodeOrder; in tryCandidate()
217 if (TryCand.Reason != NodeOrder && TryCand.Reason != NoCand) in tryCandidate()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp1521 static bool pred_L(SetVector<SUnit *> &NodeOrder, in pred_L() argument
1525 for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end(); in pred_L()
1532 if (NodeOrder.count(Pred.getSUnit()) == 0) in pred_L()
1541 if (NodeOrder.count(Succ.getSUnit()) == 0) in pred_L()
1551 static bool succ_L(SetVector<SUnit *> &NodeOrder, in succ_L() argument
1555 for (SetVector<SUnit *>::iterator I = NodeOrder.begin(), E = NodeOrder.end(); in succ_L()
1562 if (NodeOrder.count(Succ.getSUnit()) == 0) in succ_L()
1570 if (NodeOrder.count(Pred.getSUnit()) == 0) in succ_L()
1872 NodeOrder.clear(); in computeNodeOrder()
1878 if (pred_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) { in computeNodeOrder()
[all …]
H A DMachineScheduler.cpp2761 case NodeOrder: return "ORDER "; in getReasonStr()
3185 TryCand.Reason = NodeOrder; in tryCandidate()
3278 TryCand.Reason = NodeOrder; in tryCandidate()
3550 TryCand.Reason = NodeOrder; in tryCandidate()
3581 TryCand.Reason = NodeOrder; in tryCandidate()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
H A DHexagonMachineScheduler.cpp791 FoundCandidate = NodeOrder; in pickNodeFromQueue()
804 FoundCandidate = NodeOrder; in pickNodeFromQueue()
865 FoundCandidate = NodeOrder; in pickNodeFromQueue()
H A DHexagonMachineScheduler.h127 NoCand, NodeOrder, SingleExcess, SingleCritical, SingleMax, MultiPressure, enumerator
H A DHexagonCommonGEP.cpp153 NodeOrdering NodeOrder; // Node ordering, for deterministic behavior. member in __anonfa3046790111::HexagonCommonGEP
368 NodeOrder.insert(N); in processGepInst()
383 NodeOrder.insert(Nx); in processGepInst()
593 GepNode *Min = *std::min_element(S.begin(), S.end(), NodeOrder); in common()
1280 NodeOrder.clear(); in runOnFunction()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
H A DSIMachineScheduler.cpp131 case NodeOrder: return "ORDER"; in getReasonStr()
195 TryCand.Reason = NodeOrder; in tryCandidateTopDown()
239 TryCand.Reason = NodeOrder; in tryCandidateTopDown()
1545 TryCand.Reason = NodeOrder; in tryCandidateLatency()
1570 TryCand.Reason = NodeOrder; in tryCandidateRegUsage()
H A DSIMachineScheduler.h35 NodeOrder enumerator
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h136 SetVector<SUnit *> NodeOrder; variable
H A DMachineScheduler.h815 TopDepthReduce, TopPathReduce, NextDefUse, NodeOrder}; enumerator