| /llvm-project-15.0.7/llvm/test/Transforms/FunctionSpecialization/ |
| H A D | function-specialization.ll | 7 ; CHECK-NEXT: br i1 %flag, label %plus, label %minus 11 ; CHECK: minus: 12 ; CHECK-NEXT: [[TMP1:%.+]] = call i64 @compute.2(i64 %x, i64 (i64)* @minus) 15 ; CHECK-NEXT: [[TMP2:%.+]] = phi i64 [ [[TMP0]], %plus ], [ [[TMP1]], %minus ] 20 br i1 %flag, label %plus, label %minus 26 minus: 27 %tmp1 = call i64 @compute(i64 %x, i64 (i64)* @minus) 31 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus] 45 ; CHECK-NEXT: [[TMP0:%.+]] = call i64 @minus(i64 %x) 61 define internal i64 @minus(i64 %x) {
|
| H A D | function-specialization-minsize3.ll | 9 ; CHECK: minus: 10 ; CHECK: %tmp1 = call i64 @compute(i64 %x, i64 (i64)* @minus) #0 15 br i1 %flag, label %plus, label %minus 21 minus: 22 %tmp1 = call i64 @compute(i64 %x, i64 (i64)* @minus) #0 26 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus] 42 define internal i64 @minus(i64 %x) {
|
| H A D | specialize-multiple-arguments.ll | 14 ; FnSpecialization: FormalArg = binop2, ActualArg = minus 16 ; FnSpecialization: FormalArg = binop1, ActualArg = minus 26 ; NONE: minus: 40 ; ONE: minus: 54 ; TWO: minus: 68 ; THREE: minus: 77 br i1 %flag, label %plus, label %minus 83 minus: 88 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus] 98 ; THREE-NEXT: [[TMP1:%.+]] = call i64 @minus(i64 %x, i64 %y) [all …]
|
| H A D | remove-dead-recursive-function.ll | 5 br i1 %flag, label %plus, label %minus 11 minus: 12 %tmp1 = call i64 @compute(i64 %x, i64 (i64)* @minus) 16 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus] 28 ; CHECK: [[TMP0:%.+]] = call i64 @minus(i64 %n) 29 ; CHECK: [[TMP1:%.+]] = call i64 @compute.2(i64 [[TMP2:%.+]], i64 (i64)* @minus) 55 define internal i64 @minus(i64 %x) {
|
| H A D | function-specialization-minsize.ll | 8 br i1 %flag, label %plus, label %minus 14 minus: 15 %tmp1 = call i64 @compute(i64 %x, i64 (i64)* @minus) 19 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus] 35 define internal i64 @minus(i64 %x) {
|
| H A D | function-specialization-stats.ll | 8 br i1 %flag, label %plus, label %minus 14 minus: 15 %tmp1 = call i64 @compute(i64 %x, i64 (i64)* @minus) 19 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus] 35 define internal i64 @minus(i64 %x) {
|
| H A D | function-specialization-minsize2.ll | 11 br i1 %flag, label %plus, label %minus 17 minus: 18 %tmp1 = call i64 @compute(i64 %x, i64 (i64)* @minus) #0 22 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus] 38 define internal i64 @minus(i64 %x) {
|
| H A D | function-specialization-constant-expression.ll | 36 ; CHECK: minus: 44 br i1 %flag, label %plus, label %minus 51 minus: 57 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus]
|
| /llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/arithmetic.operations/ |
| H A D | minus.pass.cpp | 23 typedef std::minus<int> F; in main() 32 typedef std::minus<> F2; in main() 38 constexpr int foo = std::minus<int> () (3, 2); in main() 41 constexpr double bar = std::minus<> () (3.0, 2); in main()
|
| H A D | transparent.pass.cpp | 34 static_assert ( !is_transparent<std::minus<int>>::value, "" ); in main() 35 static_assert ( !is_transparent<std::minus<std::string>>::value, "" ); in main() 36 static_assert ( is_transparent<std::minus<void>>::value, "" ); in main() 37 static_assert ( is_transparent<std::minus<>>::value, "" ); in main()
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | pr25745.ll | 12 %minus.x = sub i32 0, %x 13 %minus.x.wide = sext i32 %minus.x to i64 15 %val = select i1 %c, i64 %x.wide, i64 %minus.x.wide
|
| /llvm-project-15.0.7/llvm/test/CodeGen/ARM/GlobalISel/ |
| H A D | select-pr35926.mir | 7 %minus.y = fsub double -0.000000e+00, %y 8 %fma = tail call double @llvm.fma.f64(double %x, double %minus.y, double %z) 9 %minus.fma = fsub double -0.000000e+00, %fma 10 ret double %minus.fma
|
| /llvm-project-15.0.7/clang/unittests/Format/ |
| H A D | TokenAnnotatorTest.cpp | 135 EXPECT_TOKEN(Tokens[2], tok::minus, TT_UnaryOperator); in TEST_F() 139 EXPECT_TOKEN(Tokens[1], tok::minus, TT_UnaryOperator); in TEST_F() 142 EXPECT_TOKEN(Tokens[2], tok::minus, TT_UnaryOperator); in TEST_F() 145 EXPECT_TOKEN(Tokens[3], tok::minus, TT_UnaryOperator); in TEST_F() 148 EXPECT_TOKEN(Tokens[2], tok::minus, TT_UnaryOperator); in TEST_F() 151 EXPECT_TOKEN(Tokens[2], tok::minus, TT_UnaryOperator); in TEST_F() 154 EXPECT_TOKEN(Tokens[3], tok::minus, TT_UnaryOperator); in TEST_F() 157 EXPECT_TOKEN(Tokens[1], tok::minus, TT_UnaryOperator); in TEST_F() 160 EXPECT_TOKEN(Tokens[1], tok::minus, TT_UnaryOperator); in TEST_F() 163 EXPECT_TOKEN(Tokens[1], tok::minus, TT_UnaryOperator); in TEST_F() [all …]
|
| /llvm-project-15.0.7/flang/test/Semantics/ |
| H A D | resolve109.f90 | 22 module procedure :: minus ! override 38 real elemental function minus(x) function 40 minus = -x
|
| /llvm-project-15.0.7/llvm/test/Transforms/IRCE/ |
| H A D | decrementing-loop.ll | 130 %len.minus.one = sub nsw i32 %len.a, 1 131 %len.minus.two = sub nsw i32 %len.a, 2 141 %starting.value = phi i32 [ %len.minus.two, %if.true ], [ %len.minus.one, %if.false ] 177 %len.minus.one = sub nsw i32 %len.a, 1 179 %len.minus.two = sub nsw i32 %len.a, 2 189 %starting.value = phi i32 [ %len.minus.two, %if.true ], [ %len.minus.one, %if.false ] 226 %len.minus.one = sub nsw i32 %len.a, 1 228 %len.minus.two = sub nsw i32 %len.a, 2 232 %starting.value = phi i32 [ %len.minus.two, %entry ], [ %len.minus.one, %merge ]
|
| /llvm-project-15.0.7/compiler-rt/lib/builtins/hexagon/ |
| H A D | fastmath_dlib_asm.S | 74 #define minus R3:2 macro 109 minus = #-1 define 126 p1 = cmp.eq(mantexpa, minus) 209 #define minus R3:2 macro 244 minus = #-1 define 261 p1 = cmp.eq(mantexpa, minus)
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.adaptors/range.zip/iterator/ |
| H A D | arithmetic.pass.cpp | 123 static_assert(!std::invocable<std::minus<>, Iter, intptr_t>); in test() 124 static_assert(std::invocable<std::minus<>, Iter, Iter>); in test() 132 static_assert(!std::invocable<std::minus<>, Iter, Iter>); in test()
|
| /llvm-project-15.0.7/llvm/test/DebugInfo/X86/ |
| H A D | dw_op_minus_direct.ll | 21 ; rax+0, constu 0xffffffff, and, constu 0x00000001, minus, stack-value 23 source_filename = "minus.c" 43 !1 = !DIFile(filename: "minus.c", directory: "/tmp")
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Thumb2/LowOverheadLoops/ |
| H A D | tail-pred-pattern-fail.ll | 20 %trip.count.minus.1 = add i32 %N, -1 65 %trip.count.minus.1 = add i32 %N, -1 110 %trip.count.minus.1 = add i32 %N, -1 155 %trip.count.minus.1 = add i32 %N, -1 200 %trip.count.minus.2 = add i32 %N, -2 245 %trip.count.minus.1 = add i32 %N, -1 289 %trip.count.minus.1 = add i32 %N, -1 335 %trip.count.minus.1 = add i32 %N, -1 380 %trip.count.minus.1 = add i32 %N, -1 425 %trip.count.minus.1 = add i32 %N, -1 [all …]
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.distance/ |
| H A D | iterator_sentinel.pass.cpp | 129 constexpr explicit SizedStrideCounter(int *it, int *minus) : it_(it), minus_(minus) {} in SizedStrideCounter() 151 int minus = 0; in test_stride_counting() local 152 SizedStrideCounter first(a, &minus); in test_stride_counting() 156 assert(minus == 1); in test_stride_counting()
|
| /llvm-project-15.0.7/clang/lib/Lex/ |
| H A D | TokenConcatenation.cpp | 78 TokenInfo[tok::minus ] |= aci_custom_firstchar; in TokenConcatenation() 112 TokenInfo[tok::minus ] |= aci_avoid_equal; // -= in TokenConcatenation() 275 case tok::minus: // --, ->, ->* in AvoidConcat()
|
| /llvm-project-15.0.7/openmp/runtime/ |
| H A D | .clang-tidy | 1 # Checks enabled in the top-level .clang-tidy minus readability-identifier-naming and llvm-header-g…
|
| /llvm-project-15.0.7/openmp/libompd/ |
| H A D | .clang-tidy | 1 # Checks enabled in the top-level .clang-tidy minus readability-identifier-naming and llvm-header-g…
|
| /llvm-project-15.0.7/llvm/test/tools/llvm-rc/Inputs/ |
| H A D | tag-stringtable-basic.rc | 37 -1 & 65535 "minus one"
|
| /llvm-project-15.0.7/llvm/test/Transforms/Reassociate/ |
| H A D | add-like-or.ll | 56 %zero.minus.x.numactivebits = or i32 %x.numlz, -32 58 %res = add i32 %bit.plus.one, %zero.minus.x.numactivebits
|