| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 22 struct Less { struct
24 constexpr explicit Less(int *copies) : copies_(copies) {} in Less() argument
25 constexpr Less(const Less& rhs) : copies_(rhs.copies_) { *copies_ += 1; } in Less() argument
26 constexpr Less& operator=(const Less&) = default;
130 (void)std::ranges::is_heap(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
138 (void)std::ranges::is_sorted(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
151 (void)std::ranges::max(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
158 (void)std::ranges::min(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
163 (void)std::ranges::minmax(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
185 (void)std::ranges::pop_heap(a, Less(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| H A D | robust_against_copying_comparators.pass.cpp | 19 struct Less { struct
21 TEST_CONSTEXPR explicit Less(int *copies) : copies_(copies) {} in Less() function
22 TEST_CONSTEXPR_CXX14 Less(const Less& rhs) : copies_(rhs.copies_) { *copies_ += 1; } in Less() function
23 TEST_CONSTEXPR_CXX14 Less& operator=(const Less&) = default;
133 (void)std::is_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
149 (void)std::max(value, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
155 (void)std::min(value, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
160 (void)std::minmax(value, value, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
192 (void)std::sort(first, first+3, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
193 (void)std::sort(first, first+4, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 32 struct Less { struct
113 (void)std::ranges::is_heap(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
121 (void)std::ranges::is_sorted(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
131 (void)std::ranges::make_heap(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
132 (void)std::ranges::max(T(), T(), Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
134 (void)std::ranges::max(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
141 (void)std::ranges::min(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
146 (void)std::ranges::minmax(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
168 (void)std::ranges::pop_heap(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
172 (void)std::ranges::push_heap(a, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| /llvm-project-15.0.7/flang/include/flang/Evaluate/ |
| H A D | common.h | 36 ENUM_CLASS(Ordering, Less, Equal, Greater) in ENUM_CLASS() argument
42 return Ordering::Less; in ENUM_CLASS()
62 return Ordering::Less; in Compare()
71 if (ordering == Ordering::Less) { in Reverse()
74 return Ordering::Less; in Reverse()
81 if (ordering == Ordering::Less) { in RelationFromOrdering()
82 return Relation::Less; in RelationFromOrdering()
91 if (relation == Relation::Less) { in Reverse()
94 return Relation::Less; in Reverse()
102 case Ordering::Less: in Satisfies()
[all …]
|
| H A D | integer.h | 179 return CompareSigned(that) == Ordering::Less;
191 return CompareSigned(that) != Ordering::Less;
381 return Ordering::Less; in CompareToZeroSigned()
443 return Ordering::Less; in CompareUnsigned()
450 return CompareUnsigned(y) != Ordering::Less; in BGE()
461 return isNegative ? Ordering::Less : Ordering::Greater; in CompareSigned()
739 if (CompareSigned(y) == Ordering::Less) { in MAX()
747 if (CompareSigned(y) == Ordering::Less) { in MIN()
882 bool nextBit{remainder.CompareUnsigned(divisor) != Ordering::Less}; in MultiplyUnsigned()
898 if (divisorOrdering == Ordering::Less) { in MultiplyUnsigned()
[all …]
|
| /llvm-project-15.0.7/clang/include/clang/Basic/ |
| H A D | Thunk.h | 62 bool Less(const VirtualAdjustment &RHS) const { in Less() function
86 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
129 bool Less(const VirtualAdjustment &RHS) const { in Less() function
150 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/predef.iterators/counted.iterator/ |
| H A D | three_way_compare.pass.cpp | 50 auto& Less = std::strong_ordering::less; in test() local
62 assert((iter2 <=> iter1) == Less); in test()
72 assert((iter2 <=> iter1) == Less); in test()
|
| /llvm-project-15.0.7/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | STLAlgorithmModeling.cpp | 152 SVal Less = SVB.evalBinOp(StateFound, BO_LT, in Find() local
156 assert(isa<DefinedSVal>(Less) && in Find()
158 StateFound = StateFound->assume(Less.castAs<DefinedSVal>(), true); in Find()
|
| /llvm-project-15.0.7/libc/benchmarks/automemcpy/lib/ |
| H A D | ResultAnalyzerMain.cpp | 151 const auto Less = [](const FunctionData &FD) { in Main() local
155 return Less(A) < Less(B); in Main()
|
| /llvm-project-15.0.7/flang/unittests/Evaluate/ |
| H A D | integer.cpp | 104 ord = Ordering::Less; in exhaustiveTesting()
144 ord = Ordering::Less; in exhaustiveTesting()
156 ord = Ordering::Less; in exhaustiveTesting()
245 TEST(Reverse(Ordering::Less) == Ordering::Greater); in main()
246 TEST(Reverse(Ordering::Greater) == Ordering::Less); in main()
|
| /llvm-project-15.0.7/clang/include/clang/AST/ |
| H A D | ComparisonCategories.h | 69 Less, enumerator
162 return getValueInfo(ComparisonCategoryResult::Less); in getLess()
|
| /llvm-project-15.0.7/llvm/utils/TableGen/ |
| H A D | SequenceToOffsetTable.h | 89 template<typename SeqT, typename Less = std::less<typename SeqT::value_type> >
96 Less L;
|
| /llvm-project-15.0.7/flang/lib/Evaluate/ |
| H A D | real.cpp | 25 return y.IsNegative() ? Relation::Equal : Relation::Less; in Compare()
30 return IsNegative() ? Relation::Less : Relation::Greater; in Compare()
33 return y.IsNegative() ? Relation::Greater : Relation::Less; in Compare()
40 return isNegative ? Relation::Less : Relation::Greater; in Compare()
94 if (order == Ordering::Less) { in Add()
314 if (cmp == Ordering::Less) { in SQRT()
381 } else if (ABS().Compare(y.ABS()) == Relation::Less) { in HYPOT()
|
| /llvm-project-15.0.7/libcxx/test/std/language.support/cmp/cmp.weakord/ |
| H A D | weakord.pass.cpp | 87 auto& Less = std::weak_ordering::less; in test_constexpr() local
97 {Less, false, true, true, false}, in test_constexpr()
|
| /llvm-project-15.0.7/llvm/unittests/ADT/ |
| H A D | OptionalTest.cpp | 618 struct Less { struct
703 CheckRelation<Less>(NoneIneq, NoneIneq, false); in TEST()
704 CheckRelation<Less>(NoneIneq, InequalityRhs, true); in TEST()
705 CheckRelation<Less>(InequalityLhs, NoneIneq, false); in TEST()
708 CheckRelation<Less>(InequalityLhs, InequalityRhs, IsLess); in TEST()
710 CheckRelation<Less>(InequalityLhs, InequalityRhs, IsLess); in TEST()
|
| /llvm-project-15.0.7/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUTargetMachine.cpp | 571 EnablePromoteKernelArguments && getOptLevel() > CodeGenOpt::Less; in adjustPassManager()
932 if (isPassEnabled(EnableVOPD, CodeGenOpt::Less)) in createPostMachineScheduler()
1161 if (isPassEnabled(EnableAtomicOptimizations, CodeGenOpt::Less)) { in addPreISel()
1184 if (TM->getOptLevel() > CodeGenOpt::Less) in addPreISel()
1300 if (TM->getOptLevel() > CodeGenOpt::Less) in addOptimizedRegAlloc()
1413 if (isPassEnabled(EnableVOPD, CodeGenOpt::Less)) in addPreEmitPass()
1424 if (isPassEnabled(EnableSetWavePriority, CodeGenOpt::Less)) in addPreEmitPass()
1438 if (getOptLevel() > CodeGenOpt::Less) in addPreEmitPass()
1441 if (isPassEnabled(EnableInsertDelayAlu, CodeGenOpt::Less)) in addPreEmitPass()
|
| /llvm-project-15.0.7/libcxx/test/std/language.support/cmp/cmp.partialord/ |
| H A D | partialord.pass.cpp | 67 auto& Less = std::partial_ordering::less; in test_constexpr() local
78 {Less, false, true, true, false}, in test_constexpr()
|
| /llvm-project-15.0.7/libcxx/test/std/language.support/cmp/cmp.strongord/ |
| H A D | strongord.pass.cpp | 107 auto& Less = std::strong_ordering::less; in test_constexpr() local
118 {Less, false, true, true, false}, in test_constexpr()
|
| /llvm-project-15.0.7/clang/lib/AST/ |
| H A D | ComparisonCategories.cpp | 191 case CCVT::Less: in getResultString()
209 Values.push_back(CCR::Less); in getPossibleResultsForType()
|
| /llvm-project-15.0.7/llvm/test/MC/RISCV/ |
| H A D | rv32zbkc-invalid.s | 9 …# CHECK: :[[@LINE]]:1: error: instruction requires the following: 'Zbc' (Carry-Less Multiplication)
|
| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | CodeGen.h | 54 Less = 1, // -O1 enumerator
|
| /llvm-project-15.0.7/clang/lib/Parse/ |
| H A D | ParseTemplate.cpp | 1773 bool Parser::diagnoseUnknownTemplateId(ExprResult LHS, SourceLocation Less) { in diagnoseUnknownTemplateId() argument
1781 ParseGreaterThanInTemplateList(Less, Greater, true, false); in diagnoseUnknownTemplateId()
1783 Less, Greater); in diagnoseUnknownTemplateId()
1808 SourceLocation Less = ConsumeToken(); in checkPotentialAngleBracket() local
1810 ParseGreaterThanInTemplateList(Less, Greater, true, false); in checkPotentialAngleBracket()
1812 getCurScope(), PotentialTemplateName, Less, Greater); in checkPotentialAngleBracket()
1823 SourceLocation Less = ConsumeToken(); in checkPotentialAngleBracket() local
1825 diagnoseUnknownTemplateId(PotentialTemplateName, Less)) { in checkPotentialAngleBracket()
|
| /llvm-project-15.0.7/llvm/lib/MC/MCParser/ |
| H A D | COFFMasmParser.cpp | 369 if (getTok().isNot(AsmToken::Less) || in ParseDirectiveAlias()
374 if (getTok().isNot(AsmToken::Less) || in ParseDirectiveAlias()
|
| /llvm-project-15.0.7/llvm/lib/ExecutionEngine/Orc/ |
| H A D | JITTargetMachineBuilder.cpp | 135 case CodeGenOpt::Less: in print()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AMDGPU/ |
| H A D | nsa-vmem-hazard.mir | 51 # Less than 4 dwords
|