| /llvm-project/libcxx/test/support/ |
| H A D | test_comparisons.h | 38 testComparisonsComplete(const T& t1, const U& t2, bool isEqual, bool isLess, bool isGreater) { in testComparisonsComplete() argument
39 assert(((isEqual ? 1 : 0) + (isLess ? 1 : 0) + (isGreater ? 1 : 0) <= 1) && in testComparisonsComplete()
54 } else if (isLess) { in testComparisonsComplete()
100 …RD TEST_CONSTEXPR_CXX14 bool testComparisons(const T& t1, const U& t2, bool isEqual, bool isLess) { in testComparisons() argument
101 assert(!(isEqual && isLess) && "isEqual and isLess cannot be both true"); in testComparisons()
102 bool isGreater = !isEqual && !isLess; in testComparisons()
103 return testComparisonsComplete(t1, t2, isEqual, isLess, isGreater); in testComparisons()
111 const bool isLess = val1 < val2; in testComparisonsValues() local
114 return testComparisonsComplete(T(val1), T(val2), isEqual, isLess, isGreater); in testComparisonsValues()
|
| /llvm-project/libcxx/test/std/thread/thread.threads/thread.thread.class/thread.thread.id/ |
| H A D | cmp.pass.cpp | 48 bool isLess = id1 < id3; in main() local
49 assert(testComparisons(id1, id3, /*isEqual*/ false, isLess)); in main()
51 assert(testOrder(id1, id3, isLess ? std::strong_ordering::less : std::strong_ordering::greater)); in main()
|
| /llvm-project/llvm/lib/Analysis/ |
| H A D | InlineOrder.cpp | 229 std::pop_heap(Heap.begin(), Heap.end(), isLess); in pop_heap_adjust()
231 std::push_heap(Heap.begin(), Heap.end(), isLess); in pop_heap_adjust()
232 std::pop_heap(Heap.begin(), Heap.end(), isLess); in pop_heap_adjust()
239 isLess = [&](const CallBase *L, const CallBase *R) { in PriorityInlineOrder()
252 std::push_heap(Heap.begin(), Heap.end(), isLess); in push()
271 std::make_heap(Heap.begin(), Heap.end(), isLess); in erase_if()
276 std::function<bool(const CallBase *L, const CallBase *R)> isLess; member in __anondb7e2c310111::PriorityInlineOrder
|
| /llvm-project/libcxx/test/std/diagnostics/syserr/syserr.errcat/syserr.errcat.nonvirtuals/ |
| H A D | cmp.pass.cpp | 32 bool isLess = e_cat1 < e_cat3; in main() local
33 …assert(testOrder(e_cat1, e_cat3, isLess ? std::strong_ordering::less : std::strong_ordering::great… in main()
|
| /llvm-project/libcxx/test/std/diagnostics/syserr/syserr.compare/ |
| H A D | cmp_error_code.pass.cpp | 37 bool isLess = ec2 < ec3; in main() local
38 assert(testOrder(ec2, ec3, isLess ? std::strong_ordering::less : std::strong_ordering::greater)); in main()
|
| H A D | cmp_error_condition.pass.cpp | 37 bool isLess = ec2 < ec3; in main() local
38 assert(testOrder(ec2, ec3, isLess ? std::strong_ordering::less : std::strong_ordering::greater)); in main()
|
| /llvm-project/mlir/lib/Conversion/SCFToOpenMP/ |
| H A D | SCFToOpenMP.cpp | 101 bool isLess; in matchSelectReduction() local
103 isLess = true; in matchSelectReduction()
106 isLess = false; in matchSelectReduction()
133 isMin = (isLess && sameOperands) || (!isLess && swappedOperands); in matchSelectReduction()
134 return isMin || (isLess & swappedOperands) || (!isLess && sameOperands); in matchSelectReduction()
|
| /llvm-project/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/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | IteratorRangeChecker.cpp | 293 bool isLess(ProgramStateRef State, SymbolRef Sym1, SymbolRef Sym2);
328 if (isLess(State, Pos.getOffset(), Beg)) { in isAheadOfRange()
352 bool isLess(ProgramStateRef State, SymbolRef Sym1, SymbolRef Sym2) { in isLess() function
|
| /llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopStrengthReduce.cpp | 1214 bool isLess(const Cost &Other) const; in Cost()
1618 bool Cost::isLess(const Cost &Other) const { in Lose()
4818 if (CostF.isLess(CostBest)) in FilterOutUndesirableDedicatedRegisters()
5078 return CostFA.isLess(CostFB); in NarrowSearchSpaceByFilterFormulaWithSameScaledReg()
5483 if (NewCost.isLess(SolutionCost)) { in SolveRecurse()
5551 if (BaselineCost.isLess(SolutionCost)) { in Solve()
1621 bool Cost::isLess(const Cost &Other) const { isLess() function in Cost
|