Searched refs:NodeOrder (Results 1 – 5 of 5) sorted by relevance
| /external/llvm/lib/Target/Hexagon/ |
| D | HexagonMachineScheduler.h | 127 NoCand, NodeOrder, SingleExcess, SingleCritical, SingleMax, MultiPressure, enumerator
|
| D | HexagonCommonGEP.cpp | 135 NodeOrdering NodeOrder; // Node ordering, for deterministic behavior. member in __anon71ab34300111::HexagonCommonGEP
356 NodeOrder.insert(N); in processGepInst()
371 NodeOrder.insert(Nx); in processGepInst()
582 GepNode *Min = *std::min_element(S.begin(), S.end(), NodeOrder); in common()
1285 NodeOrder.clear(); in runOnFunction()
|
| D | HexagonMachineScheduler.cpp | 562 FoundCandidate = NodeOrder; in pickNodeFromQueue()
|
| /external/llvm/lib/CodeGen/ |
| D | MachineScheduler.cpp | 2312 case NodeOrder: return "ORDER "; in getReasonStr()
2695 TryCand.Reason = NodeOrder; in tryCandidate()
2782 TryCand.Reason = NodeOrder; in tryCandidate()
3038 TryCand.Reason = NodeOrder; in tryCandidate()
3063 TryCand.Reason = NodeOrder; in tryCandidate()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineScheduler.h | 759 TopDepthReduce, TopPathReduce, NextDefUse, NodeOrder}; enumerator
|