Searched refs:isLess (Results 1 – 7 of 7) sorted by relevance
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | InlineOrder.h | 128 std::pop_heap(Heap.begin(), Heap.end(), isLess); in adjust()
129 std::push_heap(Heap.begin(), Heap.end(), isLess); in adjust()
136 isLess = [this](const CallBase *L, const CallBase *R) { in PriorityInlineOrder()
149 std::push_heap(Heap.begin(), Heap.end(), isLess); in push()
160 std::pop_heap(Heap.begin(), Heap.end(), isLess); in pop()
178 std::make_heap(Heap.begin(), Heap.end(), isLess); in erase_if()
183 std::function<bool(const CallBase *L, const CallBase *R)> isLess; variable
|
| /llvm-project-15.0.7/libcxx/test/support/ |
| H A D | test_comparisons.h | 32 TEST_CONSTEXPR_CXX14 bool testComparisons(const T& t1, const U& t2, bool isEqual, bool isLess) in testComparisons() argument
34 assert(!(isEqual && isLess) && "isEqual and isLess cannot be both true"); in testComparisons()
50 else if (isLess) in testComparisons()
89 const bool isLess = val1 < val2; in testComparisonsValues() local
91 return testComparisons(T(val1), T(val2), isEqual, isLess); in testComparisonsValues()
|
| /llvm-project-15.0.7/mlir/lib/Conversion/SCFToOpenMP/ |
| H A D | SCFToOpenMP.cpp | 96 bool isLess; in matchSelectReduction() local
98 isLess = true; in matchSelectReduction()
101 isLess = false; in matchSelectReduction()
128 isMin = (isLess && sameOperands) || (!isLess && swappedOperands); in matchSelectReduction()
129 return isMin || (isLess & swappedOperands) || (!isLess && sameOperands); in matchSelectReduction()
|
| /llvm-project-15.0.7/llvm/include/llvm/ADT/ |
| H A D | ImmutableSet.h | 82 else if (ImutInfo::isLess(K,CurrentKey)) in find()
192 ImutInfo::isLess(ImutInfo::KeyOfValue(getLeft()->getValue()), in validateTree()
197 ImutInfo::isLess(ImutInfo::KeyOfValue(getValue()), in validateTree()
540 else if (ImutInfo::isLess(K,KCurrent))
560 } else if (ImutInfo::isLess(K,KCurrent)) {
923 static bool isLess(key_type_ref LHS, key_type_ref RHS) {
947 static bool isLess(key_type_ref LHS, key_type_ref RHS) { return LHS < RHS; }
|
| H A D | ImmutableMap.h | 47 static inline bool isLess(key_type_ref L, key_type_ref R) { in isLess() function
48 return ImutContainerInfo<T>::isLess(L,R); in isLess()
|
| /llvm-project-15.0.7/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | IteratorRangeChecker.cpp | 294 bool isLess(ProgramStateRef State, SymbolRef Sym1, SymbolRef Sym2);
329 if (isLess(State, Pos.getOffset(), Beg)) { in isAheadOfRange()
353 bool isLess(ProgramStateRef State, SymbolRef Sym1, SymbolRef Sym2) { in isLess() function
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | LoopStrengthReduce.cpp | 1070 bool isLess(const Cost &Other);
1469 bool Cost::isLess(const Cost &Other) { in isLess() function in Cost
4483 if (CostF.isLess(CostBest)) in FilterOutUndesirableDedicatedRegisters()
4739 return CostFA.isLess(CostFB); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5105 if (NewCost.isLess(SolutionCost)) { in SolveRecurse()
|