/llvm-project/libcxx/test/std/numerics/numeric.ops/transform.reduce/ |
H A D | transform_reduce_iter_iter_init_bop_uop.pass.cpp | 62 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), identity(), 1); in test() 63 test(Iter(ia), Iter(ia+1), 0, std::multiplies<>(), identity(), 0); in test() 66 test(Iter(ia), Iter(ia+2), 3, std::multiplies<>(), identity(), 6); in test() 67 test(Iter(ia), Iter(ia+sa), 4, std::multiplies<>(), identity(), 2880); in test() 71 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), twice(), 1); in test() 72 test(Iter(ia), Iter(ia+1), 0, std::multiplies<>(), twice(), 0); in test() 75 test(Iter(ia), Iter(ia+2), 3, std::multiplies<>(), twice(), 24); in test() 76 test(Iter(ia), Iter(ia+sa), 4, std::multiplies<>(), twice(), 184320); // 64 * 2880 in test() 121 unsigned res = std::transform_reduce(v.begin(), v.end(), 1U, std::multiplies<>(), twice()); in test()
|
H A D | transform_reduce_iter_iter_iter_init_op_op.pass.cpp | 47 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()
|
/llvm-project/libcxx/test/std/utilities/function.objects/arithmetic.operations/ |
H A D | multiplies.pass.cpp | 13 // multiplies 23 typedef std::multiplies<int> F; in main() 32 typedef std::multiplies<> F2; in main() 38 constexpr int foo = std::multiplies<int> () (3, 2); in main() 41 constexpr double bar = std::multiplies<> () (3.0, 2); in main()
|
H A D | transparent.pass.cpp | 39 static_assert ( !is_transparent<std::multiplies<int>>::value, "" ); in main() 40 static_assert ( !is_transparent<std::multiplies<std::string>>::value, "" ); in main() 41 static_assert ( is_transparent<std::multiplies<void>>::value, "" ); in main() 42 static_assert ( is_transparent<std::multiplies<>>::value, "" ); in main()
|
/llvm-project/llvm/test/Transforms/Reassociate/ |
H A D | repeats.ll | 58 ; Can be done with two multiplies. 74 ; Can be done with two multiplies. 90 ; Can be done with two multiplies. 107 ; Can be done with two multiplies. 126 ; Can be done with two multiplies. 145 ; Can be done with three multiplies. 166 ; Can be done with three multiplies. 188 ; Can be done with four multiplies. 212 ; Can be done with two multiplies. 236 ; Can be done with three multiplies. [all …]
|
/llvm-project/libcxx/test/std/numerics/numeric.ops/reduce/ |
H A D | reduce_init_op.pass.cpp | 39 test(Iter(ia), Iter(ia), 1, std::multiplies<>(), 1); in test() 41 test(Iter(ia), Iter(ia+1), 2, std::multiplies<>(), 2); in test() 43 test(Iter(ia), Iter(ia+2), 3, std::multiplies<>(), 6); in test() 45 test(Iter(ia), Iter(ia+sa), 4, std::multiplies<>(), 2880); in test() 76 unsigned res = std::reduce(v.begin(), v.end(), 1U, std::multiplies<>()); in test()
|
/llvm-project/libcxx/test/std/numerics/numeric.ops/transform.inclusive.scan/ |
H A D | transform_inclusive_scan_bop_uop_init.pass.cpp | 82 test(Iter(ia), Iter(ia + i), std::multiplies<>(), add_one{}, 0, mResI0, mResI0 + i); in test() 84 test(Iter(ia), Iter(ia + i), std::multiplies<>(), std::negate<>(), 0, mResN0, mResN0 + i); in test() 86 test(Iter(ia), Iter(ia + i), std::multiplies<>(), add_one{}, 2, mResI2, mResI2 + i); in test() 88 test(Iter(ia), Iter(ia + i), std::multiplies<>(), std::negate<>(), 2, mResN2, mResN2 + i); in test() 133 std::transform_inclusive_scan(v.begin(), v.end(), res.begin(), std::multiplies<>(), add_one{}, std::size_t{1}); in basic_tests()
|
H A D | transform_inclusive_scan_bop_uop.pass.cpp | 73 test(Iter(ia), Iter(ia + i), std::multiplies<>(), add_one{}, mResI0, mResI0 + i); in test() 75 test(Iter(ia), Iter(ia + i), std::multiplies<>(), std::negate<>(), mResN0, mResN0 + i); in test()
|
/llvm-project/libcxx/test/std/numerics/numeric.ops/transform.exclusive.scan/ |
H A D | transform_exclusive_scan_init_bop_uop.pass.cpp | 80 test(Iter(ia), Iter(ia + i), std::multiplies<>(), add_one{}, 0, mResI0, mResI0 + i); in test() 82 test(Iter(ia), Iter(ia + i), std::multiplies<>(), std::negate<>(), 0, mResN0, mResN0 + i); in test() 84 test(Iter(ia), Iter(ia + i), std::multiplies<>(), add_one{}, 2, mResI2, mResI2 + i); in test() 86 test(Iter(ia), Iter(ia + i), std::multiplies<>(), std::negate<>(), 2, mResN2, mResN2 + i); in test() 131 std::transform_exclusive_scan(v.begin(), v.end(), res.begin(), std::size_t{1}, std::multiplies<>(), add_one{}); in basic_tests()
|
/llvm-project/pstl/test/std/numerics/numeric.ops/ |
H A D | transform_reduce.pass.cpp | 116 …test_by_type<int32_t>(42, std::plus<int32_t>(), std::multiplies<int32_t>(), std::negate<int32_t>(), in main() 122 …1.0f, std::multiplies<float32_t>(), [](const float32_t& a, const float32_t& b) -> float32_t { retu… in main() 124 …test_by_type<MyClass>(MyClass(), std::plus<MyClass>(), std::multiplies<MyClass>(), std::negate<MyC… in main()
|
/llvm-project/libcxx/test/std/utilities/function.objects/ |
H A D | operations.implicit_ctad.pass.cpp | 29 std::multiplies f; in main() 30 ASSERT_SAME_TYPE(decltype(f), std::multiplies<>); in main()
|
/llvm-project/llvm/test/Transforms/InstSimplify/ |
H A D | vec-cmp.ll | 53 ; Multiplies of non-zero numbers are non-zero if there is no unsigned overflow. 65 ; Multiplies of non-zero numbers are non-zero if there is no signed overflow.
|
/llvm-project/llvm/include/llvm/Support/ |
H A D | BlockFrequency.h | 40 /// Multiplies with a branch probability. The computation will never 82 /// Multiplies frequency with `Factor`. Returns `nullopt` in case of overflow.
|
/llvm-project/libcxx/test/std/numerics/numeric.ops/exclusive.scan/ |
H A D | exclusive_scan_init_op.pass.cpp | 61 test(Iter(ia), Iter(ia + i), 1, std::multiplies<>(), mRes, mRes + i); in test() 81 std::exclusive_scan(v.begin(), v.end(), res.begin(), 1, std::multiplies<>()); in test()
|
/llvm-project/mlir/include/mlir/Dialect/ArmNeon/ |
H A D | ArmNeon.td | 84 Signed Multiply Long (vector). This instruction multiplies corresponding 141 Signed 8-bit integer matrix multiply-accumulate. This instruction multiplies 172 multiplies the 2x8 matrix of unsigned 8-bit integer values in the first 203 instruction multiplies the 2x8 matrix of unsigned 8-bit integer values in
|
/llvm-project/llvm/test/CodeGen/X86/ |
H A D | combine-multiplies.ll | 60 ; Test for the same optimization on vector multiplies. 95 ; Again, we want to make sure we don't generate two different multiplies. 98 ; do 2 adds, followed by 2 multiplies (i.e. 4 pmuludq instructions).
|
H A D | avx512fp16-machine-combiner.ll | 105 ; Verify that SSE and AVX scalar single-precision multiplies are reassociated. 135 ; Verify that SSE and AVX 128-bit vector half-precision multiplies are reassociated. 165 ; Verify that AVX 256-bit vector half-precision multiplies are reassociated. 195 ; Verify that AVX512 512-bit vector half-precision multiplies are reassociated.
|
/llvm-project/llvm/test/Transforms/SLPVectorizer/X86/ |
H A D | slp-fma-loss.ll | 46 ; floating-point adds, or vectorizing a tree of floating-point multiplies, 51 ; still vectorize some of the multiplies.
|
/llvm-project/llvm/include/llvm/Analysis/ |
H A D | BlockFrequencyInfo.h | 68 /// This computes the relative block frequency of \p BB and multiplies it by 74 /// This uses the frequency \p Freq and multiplies it by
|
/llvm-project/libcxx/test/std/numerics/numeric.ops/inclusive.scan/ |
H A D | inclusive_scan_op_init.pass.cpp | 61 test(Iter(ia), Iter(ia + i), std::multiplies<>(), 1, mRes, mRes + i); in test() 106 std::inclusive_scan(v.begin(), v.end(), res.begin(), std::multiplies<>(), std::size_t{1}); in basic_tests()
|
/llvm-project/llvm/test/Transforms/LoopStrengthReduce/ |
H A D | variable_stride.ll | 1 ; Check that variable strides are reduced to adds instead of multiplies.
|
/llvm-project/llvm/lib/Support/ |
H A D | DivisionByConstantInfo.cpp | 18 /// by a constant as a sequence of multiplies, adds and shifts. Requires that 68 /// division by a constant as a sequence of multiplies, adds and shifts.
|
/llvm-project/llvm/test/CodeGen/SystemZ/ |
H A D | int-mul-11.ll | 23 ; Verify that we still use MSGFR for i32->i64 multiplies.
|
/llvm-project/clang-tools-extra/test/clang-doc/Inputs/basic-project/include/ |
H A D | Calculator.h | 29 * @brief Multiplies two integers.
|
/llvm-project/compiler-rt/lib/builtins/arm/ |
H A D | muldf3vfp.S | 14 // Multiplies two double precision floating point numbers using the Darwin
|