Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/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()
183 TryCand.Reason = NodeOrder; in tryCandidate()
213 TryCand.Reason = NodeOrder; in tryCandidate()
219 if (TryCand.Reason != NodeOrder && TryCand.Reason != NoCand) in tryCandidate()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp1467 static bool pred_L(SetVector<SUnit *> &NodeOrder, in pred_L() argument
1471 for (const SUnit *SU : NodeOrder) { in pred_L()
1477 if (NodeOrder.count(Pred.getSUnit()) == 0) in pred_L()
1486 if (NodeOrder.count(Succ.getSUnit()) == 0) in pred_L()
1496 static bool succ_L(SetVector<SUnit *> &NodeOrder, in succ_L() argument
1500 for (const SUnit *SU : NodeOrder) { in succ_L()
1506 if (NodeOrder.count(Succ.getSUnit()) == 0) in succ_L()
1514 if (NodeOrder.count(Pred.getSUnit()) == 0) in succ_L()
1818 NodeOrder.clear(); in computeNodeOrder()
1824 if (pred_L(NodeOrder, N) && llvm::set_is_subset(N, Nodes)) { in computeNodeOrder()
[all …]
H A DVLIWMachineScheduler.cpp796 FoundCandidate = NodeOrder; in pickNodeFromQueue()
809 FoundCandidate = NodeOrder; in pickNodeFromQueue()
870 FoundCandidate = NodeOrder; in pickNodeFromQueue()
H A DMachineScheduler.cpp2790 case NodeOrder: return "ORDER "; in getReasonStr()
3217 TryCand.Reason = NodeOrder; in tryCandidate()
3310 TryCand.Reason = NodeOrder; in tryCandidate()
3584 TryCand.Reason = NodeOrder; in tryCandidate()
3615 TryCand.Reason = NodeOrder; in tryCandidate()
/openbsd-src/gnu/llvm/llvm/lib/Target/AArch64/
H A DAArch64MachineScheduler.cpp75 TryCand.Reason = NodeOrder; in tryCandidate()
/openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/
H A DHexagonCommonGEP.cpp153 NodeOrdering NodeOrder; // Node ordering, for deterministic behavior. member in __anon16873bc50111::HexagonCommonGEP
380 NodeOrder.insert(N); in processGepInst()
394 NodeOrder.insert(Nx); in processGepInst()
596 GepNode *Min = *std::min_element(S.begin(), S.end(), NodeOrder); in common()
1268 NodeOrder.clear(); in runOnFunction()
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DVLIWMachineScheduler.h107 NodeOrder, enumerator
H A DMachinePipeliner.h145 SetVector<SUnit *> NodeOrder; variable
H A DMachineScheduler.h845 TopDepthReduce, TopPathReduce, NextDefUse, NodeOrder}; enumerator
/openbsd-src/gnu/llvm/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()
1529 TryCand.Reason = NodeOrder; in tryCandidateLatency()
1554 TryCand.Reason = NodeOrder; in tryCandidateRegUsage()
H A DSIMachineScheduler.h37 NodeOrder enumerator
H A DGCNSchedStrategy.cpp388 TryCand.Reason = NodeOrder; in tryCandidate()
460 TryCand.Reason = NodeOrder; in tryCandidate()