Home
last modified time | relevance | path

Searched refs:plus (Results 1 – 25 of 279) sorted by relevance

12345678910>>...12

/llvm-project-15.0.7/llvm/test/Transforms/LoopUnroll/
H A Dpeel-loop-not-forced.ll6 ; CHECK-NOT: %plus = phi
21 %incsum = add i32 %sum, %plus
40 ; CHECK-NOT: %plus = phi
50 %incsum = add i32 %sum, %plus
71 ; CHECK-NOT: %plus = phi
82 %incsum = add i32 %sum, %plus
116 %incsum = add i32 %sum, %plus
120 %incsum2 = add i32 %incsum, %plus
121 %incsum3 = add i32 %incsum, %plus
140 ; CHECK: %plus = phi
[all …]
H A Dpeel-loop-negative.ll11 ; CHECK: %plus = phi
18 %plus = phi i32 [ %a, %entry ], [ %b, %loop ]
20 %incsum = add i32 %sum, %plus
/llvm-project-15.0.7/llvm/test/Transforms/FunctionSpecialization/
H A Dfunction-specialization.ll7 ; CHECK-NEXT: br i1 %flag, label %plus, label %minus
8 ; CHECK: plus:
9 ; CHECK-NEXT: [[TMP0:%.+]] = call i64 @compute.1(i64 %x, i64 (i64)* @plus)
15 ; CHECK-NEXT: [[TMP2:%.+]] = phi i64 [ [[TMP0]], %plus ], [ [[TMP1]], %minus ]
20 br i1 %flag, label %plus, label %minus
22 plus:
23 %tmp0 = call i64 @compute(i64 %x, i64 (i64)* @plus)
31 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus]
39 ; CHECK-NEXT: [[TMP0:%.+]] = call i64 @plus(i64 %x)
55 define internal i64 @plus(i64 %x) {
H A Dfunction-specialization-minsize3.ll6 ; CHECK: plus:
7 ; CHECK: %tmp0 = call i64 @compute.1(i64 %x, i64 (i64)* @plus)
15 br i1 %flag, label %plus, label %minus
17 plus:
18 %tmp0 = call i64 @compute(i64 %x, i64 (i64)* @plus)
26 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus]
36 define internal i64 @plus(i64 %x) {
H A Dremove-dead-recursive-function.ll5 br i1 %flag, label %plus, label %minus
7 plus:
8 %tmp0 = call i64 @compute(i64 %x, i64 (i64)* @plus)
16 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus]
23 ; CHECK: [[TMP0:%.+]] = call i64 @plus(i64 %n)
24 ; CHECK: [[TMP1:%.+]] = call i64 @compute.1(i64 [[TMP2:%.+]], i64 (i64)* @plus)
49 define internal i64 @plus(i64 %x) {
H A Dfunction-specialization-minsize.ll8 br i1 %flag, label %plus, label %minus
10 plus:
11 %tmp0 = call i64 @compute(i64 %x, i64 (i64)* @plus)
19 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus]
29 define internal i64 @plus(i64 %x) {
H A Dfunction-specialization-stats.ll8 br i1 %flag, label %plus, label %minus
10 plus:
11 %tmp0 = call i64 @compute(i64 %x, i64 (i64)* @plus)
19 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus]
29 define internal i64 @plus(i64 %x) {
H A Dfunction-specialization-minsize2.ll11 br i1 %flag, label %plus, label %minus
13 plus:
14 %tmp0 = call i64 @compute(i64 %x, i64 (i64)* @plus) #0
22 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus]
32 define internal i64 @plus(i64 %x) {
H A Dspecialize-multiple-arguments.ll13 ; FnSpecialization: FormalArg = binop1, ActualArg = plus
23 ; NONE: plus:
37 ; ONE: plus:
51 ; TWO: plus:
65 ; THREE: plus:
77 br i1 %flag, label %plus, label %minus
79 plus:
84 %tmp1 = call i64 @compute(i64 %x, i64 %y, i64 (i64, i64)* @plus, i64 (i64, i64)* @minus)
88 %tmp2 = phi i64 [ %tmp0, %plus ], [ %tmp1, %minus]
97 ; THREE-NEXT: [[TMP0:%.+]] = call i64 @plus(i64 %x, i64 %y)
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/
H A Dpr35743.ll17 ret i8 %accum.plus
20 %accum.phi = phi i8 [ %c, %entry ], [ %accum.plus, %loop ]
23 %accum.plus = add nuw nsw i8 %accum.and, 3
39 %lcssa = phi i8 [ %accum.plus, %loop ]
43 %accum.phi = phi i8 [ %c, %entry ], [ %accum.plus, %loop ]
46 %accum.plus = add nuw nsw i8 %accum.and, 3
63 %lcssa = phi i8 [ %accum.plus, %loop ]
68 %accum.phi = phi i8 [ %c, %entry ], [ %accum.plus, %loop ]
71 %accum.plus = add nuw nsw i8 %accum.and, 3
90 %lcssa = phi i8 [ %accum.plus, %loop ]
[all …]
/llvm-project-15.0.7/llvm/test/tools/llvm-ar/
H A Dflatten-thin-archive.test9 # RUN: rm -f %t-a-plus-b.a %t-d-plus-e.a %t.a
10 # RUN: llvm-ar rcs --thin %t-a-plus-b.a %t-a.txt %t-b.txt
11 # RUN: llvm-ar rcs %t-d-plus-e.a %t-d.txt %t-e.txt
12 # RUN: llvm-ar rcs --thin %t.a %t-a-plus-b.a %t-c.txt %t-d-plus-e.a
19 # CHECK-NEXT: -d-plus-e.a
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/transform.reduce/
H A Dtransform_reduce_iter_iter_iter_init_op_op.pass.cpp47 test(SIter(ia), SIter(ia), UIter(ua), 0, std::plus<>(), std::multiplies<>(), 0); in test()
48 test(UIter(ua), UIter(ua), SIter(ia), 1, std::multiplies<>(), std::plus<>(), 1); in test()
49 test(SIter(ia), SIter(ia+1), UIter(ua), 0, std::multiplies<>(), std::plus<>(), 0); in test()
50 test(UIter(ua), UIter(ua+1), SIter(ia), 2, std::plus<>(), std::multiplies<>(), 4); in test()
51 test(SIter(ia), SIter(ia+2), UIter(ua), 0, std::plus<>(), std::multiplies<>(), 10); in test()
52 test(UIter(ua), UIter(ua+2), SIter(ia), 3, std::multiplies<>(), std::plus<>(), 54); in test()
53 test(SIter(ia), SIter(ia+sa), UIter(ua), 4, std::multiplies<>(), std::plus<>(), 2099520); in test()
54 test(UIter(ua), UIter(ua+sa), SIter(ia), 4, std::plus<>(), std::multiplies<>(), 186); in test()
63 decltype(std::transform_reduce(p, p, p, Init{}, std::plus<>(), std::multiplies<>()))> ); in test_return_type()
H A Dtransform_reduce_iter_iter_init_bop_uop.pass.cpp61 test(Iter(ia), Iter(ia), 0, std::plus<>(), identity(), 0); in test()
64 test(Iter(ia), Iter(ia+1), 2, std::plus<>(), identity(), 3); in test()
65 test(Iter(ia), Iter(ia+2), 0, std::plus<>(), identity(), 3); in test()
68 test(Iter(ia), Iter(ia+sa), 4, std::plus<>(), identity(), 25); in test()
70 test(Iter(ia), Iter(ia), 0, std::plus<>(), twice(), 0); in test()
73 test(Iter(ia), Iter(ia+1), 2, std::plus<>(), twice(), 4); in test()
74 test(Iter(ia), Iter(ia+2), 0, std::plus<>(), twice(), 6); in test()
77 test(Iter(ia), Iter(ia+sa), 4, std::plus<>(), twice(), 46); in test()
86 decltype(std::transform_reduce(p, p, Init{}, std::plus<>(), identity()))> ); in test_return_type()
/llvm-project-15.0.7/libcxx/test/std/utilities/function.objects/arithmetic.operations/
H A Dplus.pass.cpp23 typedef std::plus<int> F; in main()
32 typedef std::plus<> F2; in main()
38 constexpr int foo = std::plus<int> () (3, 2); in main()
41 constexpr double bar = std::plus<> () (3.0, 2); in main()
H A Dtransparent.pass.cpp29 static_assert ( !is_transparent<std::plus<int>>::value, "" ); in main()
30 static_assert ( !is_transparent<std::plus<std::string>>::value, "" ); in main()
31 static_assert ( is_transparent<std::plus<void>>::value, "" ); in main()
32 static_assert ( is_transparent<std::plus<>>::value, "" ); in main()
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/reduce/
H A Dreduce_init_op.pass.cpp38 test(Iter(ia), Iter(ia), 0, std::plus<>(), 0); in test()
40 test(Iter(ia), Iter(ia+1), 0, std::plus<>(), 1); in test()
42 test(Iter(ia), Iter(ia+2), 0, std::plus<>(), 3); in test()
44 test(Iter(ia), Iter(ia+sa), 0, std::plus<>(), 21); in test()
53 static_assert( std::is_same_v<Init, decltype(std::reduce(p, p, Init{}, std::plus<>()))>, "" ); in test_return_type()
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/transform.inclusive.scan/
H A Dtransform_inclusive_scan_bop_uop_init.pass.cpp82 test(Iter(ia), Iter(ia + i), std::plus<>(), add_one{}, 0, pResI0, pResI0 + i); in test()
84 test(Iter(ia), Iter(ia + i), std::plus<>(), std::negate<>(), 0, pResN0, pResN0 + i); in test()
86 test(Iter(ia), Iter(ia + i), std::plus<>(), add_one{}, 2, pResI2, pResI2 + i); in test()
88 test(Iter(ia), Iter(ia + i), std::plus<>(), std::negate<>(), 2, pResN2, pResN2 + i); in test()
102 …std::transform_inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>(), add_one{}, size_t{50}); in basic_tests()
110 …std::transform_inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>(), add_one{}, size_t{30}); in basic_tests()
118 …std::transform_inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>(), add_one{}, size_t{40}); in basic_tests()
125 …std::transform_inclusive_scan(v.begin(), v.end(), res.begin(), std::plus<>(), add_one{}, size_t{1}… in basic_tests()
H A Dtransform_inclusive_scan_bop_uop.pass.cpp73 test(Iter(ia), Iter(ia + i), std::plus<>(), add_one{}, pResI0, pResI0 + i); in test()
75 test(Iter(ia), Iter(ia + i), std::plus<>(), std::negate<>(), pResN0, pResN0 + i); in test()
89 std::transform_inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>(), add_one{}); in basic_tests()
97 std::transform_inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>(), add_one{}); in basic_tests()
105 std::transform_inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>(), add_one{}); in basic_tests()
112 std::transform_inclusive_scan(v.begin(), v.end(), res.begin(), std::plus<>(), add_one{}); in basic_tests()
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/transform.exclusive.scan/
H A Dtransform_exclusive_scan_init_bop_uop.pass.cpp80 test(Iter(ia), Iter(ia + i), std::plus<>(), add_one{}, 0, pResI0, pResI0 + i); in test()
82 test(Iter(ia), Iter(ia + i), std::plus<>(), std::negate<>(), 0, pResN0, pResN0 + i); in test()
84 test(Iter(ia), Iter(ia + i), std::plus<>(), add_one{}, 2, pResI2, pResI2 + i); in test()
86 test(Iter(ia), Iter(ia + i), std::plus<>(), std::negate<>(), 2, pResN2, pResN2 + i); in test()
100 …std::transform_exclusive_scan(v.begin(), v.end(), v.begin(), size_t{50}, std::plus<>(), add_one{}); in basic_tests()
108 …std::transform_exclusive_scan(v.begin(), v.end(), v.begin(), size_t{30}, std::plus<>(), add_one{}); in basic_tests()
116 …std::transform_exclusive_scan(v.begin(), v.end(), v.begin(), size_t{40}, std::plus<>(), add_one{}); in basic_tests()
123 …std::transform_exclusive_scan(v.begin(), v.end(), res.begin(), size_t{40}, std::plus<>(), add_one{… in basic_tests()
/llvm-project-15.0.7/llvm/unittests/Support/
H A DParallelTest.cpp56 std::plus<uint32_t>(), identity); in TEST()
62 parallelTransformReduce(strs, static_cast<size_t>(0), std::plus<size_t>(), in TEST()
69 sum = parallelTransformReduce(range, 0U, std::plus<uint32_t>(), identity); in TEST()
73 sum = parallelTransformReduce(range, 0U, std::plus<uint32_t>(), identity); in TEST()
79 sum = parallelTransformReduce(range2, 0U, std::plus<uint32_t>(), identity); in TEST()
/llvm-project-15.0.7/llvm/test/Analysis/BasicAA/
H A Dq.bad.ll135 %zext.plus.7 = add nsw i3 %val, 7
136 %zext.plus.4 = add nsw i3 %val, 4
138 %zext.4 = zext i3 %zext.plus.4 to i32
139 %zext.7 = zext i3 %zext.plus.7 to i32
154 %zext.plus.7 = add nsw i8 %val, 7
155 %zext.plus.4 = add nsw i8 %val, 4
157 %zext.4 = zext i8 %zext.plus.4 to i32
173 %zext.plus.7 = add nsw i3 %val, 7
174 %zext.plus.4 = add nsw i3 %val, 4
195 %zext.plus.7 = add nsw i8 %val, 7
[all …]
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/inclusive.scan/
H A Dinclusive_scan_op.pass.cpp60 test(Iter(ia), Iter(ia + i), std::plus<>(), pRes, pRes + i); in test()
74 std::inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>()); in basic_tests()
82 std::inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>()); in basic_tests()
90 std::inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>()); in basic_tests()
97 std::inclusive_scan(v.begin(), v.end(), res.begin(), std::plus<>()); in basic_tests()
H A Dinclusive_scan_op_init.pass.cpp60 test(Iter(ia), Iter(ia + i), std::plus<>(), 0, pRes, pRes + i); in test()
74 std::inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>(), size_t{50}); in basic_tests()
82 std::inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>(), size_t{40}); in basic_tests()
90 std::inclusive_scan(v.begin(), v.end(), v.begin(), std::plus<>(), size_t{30}); in basic_tests()
97 std::inclusive_scan(v.begin(), v.end(), res.begin(), std::plus<>(), size_t{40}); in basic_tests()
/llvm-project-15.0.7/llvm/test/Transforms/Reassociate/
H A Dadd-like-or.ll28 %c.plus.one = add i32 %c, 1
29 ret i32 %c.plus.one
43 %res.plus.one = add i32 %res, %y
44 ret i32 %res.plus.one
57 %bit.plus.one = add i32 %bit, 1
58 %res = add i32 %bit.plus.one, %zero.minus.x.numactivebits
/llvm-project-15.0.7/llvm/test/TableGen/
H A DTree.td9 def plus : TreeNode;
17 def ADDrr32 : Inst<(set R32, (plus R32, R32))>; // a = b + c
18 def ADDri32 : Inst<(set R32, (plus R32, imm))>; // a = b + imm

12345678910>>...12