/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/gcc.target/aarch64/sve/ |
H A D | var_stride_1.h | 8 int abs_n = (n < 0 ? -n : n); in test() local 10 int max_i = (abs_n > abs_m ? abs_n : abs_m); in test()
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/gcc.target/aarch64/sve/ |
H A D | var_stride_1.h | 8 int abs_n = (n < 0 ? -n : n); in test() local 10 int max_i = (abs_n > abs_m ? abs_n : abs_m); in test()
|
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/testsuite/gcc.target/aarch64/sve/ |
H A D | var_stride_1.h | 8 int abs_n = (n < 0 ? -n : n); in test() local 10 int max_i = (abs_n > abs_m ? abs_n : abs_m); in test()
|
/dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/gcc.target/aarch64/sve/ |
H A D | var_stride_1.h | 8 int abs_n = (n < 0 ? -n : n); in test() local 10 int max_i = (abs_n > abs_m ? abs_n : abs_m); in test()
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/testsuite/gcc.target/aarch64/sve/ |
H A D | var_stride_1.h | 8 int abs_n = (n < 0 ? -n : n); in test() local 10 int max_i = (abs_n > abs_m ? abs_n : abs_m); in test()
|
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/testsuite/gcc.target/aarch64/sve/ |
H A D | var_stride_1.h | 8 int abs_n = (n < 0 ? -n : n); in test() local 10 int max_i = (abs_n > abs_m ? abs_n : abs_m); in test()
|
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/testsuite/gcc.target/aarch64/sve/ |
H A D | var_stride_1.h | 8 int abs_n = (n < 0 ? -n : n); in test() local 10 int max_i = (abs_n > abs_m ? abs_n : abs_m); in test()
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gcc.target/aarch64/sve/ |
H A D | var_stride_1.h | 8 int abs_n = (n < 0 ? -n : n); in test() local 10 int max_i = (abs_n > abs_m ? abs_n : abs_m); in test()
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/test/Transforms/LoopIdiom/X86/ |
H A D | ctlz.ll | 36 %abs_n = select i1 %c, i32 %n, i32 %negn 37 %shr8 = lshr i32 %abs_n, 1 49 %and = and i32 %shl, %abs_n 95 %abs_n = select i1 %c, i32 %n, i32 %negn 96 %tobool4 = icmp eq i32 %abs_n, 0 179 ; ALL: %0 = ashr i32 %abs_n, 1 191 %abs_n = select i1 %c, i32 %n, i32 %negn 259 ; ALL: %0 = ashr i32 %abs_n, 1 272 %abs_n = select i1 %c, i32 %n, i32 %negn 343 ; ALL: %0 = ashr i32 %abs_n, 1 [all …]
|
/dports/devel/llvm10/llvm-10.0.1.src/test/Transforms/LoopIdiom/X86/ |
H A D | ctlz.ll | 36 %abs_n = select i1 %c, i32 %n, i32 %negn 37 %shr8 = lshr i32 %abs_n, 1 49 %and = and i32 %shl, %abs_n 95 %abs_n = select i1 %c, i32 %n, i32 %negn 96 %tobool4 = icmp eq i32 %abs_n, 0 179 ; ALL: %0 = ashr i32 %abs_n, 1 191 %abs_n = select i1 %c, i32 %n, i32 %negn 259 ; ALL: %0 = ashr i32 %abs_n, 1 272 %abs_n = select i1 %c, i32 %n, i32 %negn 343 ; ALL: %0 = ashr i32 %abs_n, 1 [all …]
|
/dports/devel/llvm11/llvm-11.0.1.src/test/Transforms/LoopIdiom/X86/ |
H A D | ctlz.ll | 36 %abs_n = select i1 %c, i32 %n, i32 %negn 37 %shr8 = lshr i32 %abs_n, 1 49 %and = and i32 %shl, %abs_n 95 %abs_n = select i1 %c, i32 %n, i32 %negn 96 %tobool4 = icmp eq i32 %abs_n, 0 179 ; ALL: %0 = ashr i32 %abs_n, 1 191 %abs_n = select i1 %c, i32 %n, i32 %negn 259 ; ALL: %0 = ashr i32 %abs_n, 1 272 %abs_n = select i1 %c, i32 %n, i32 %negn 343 ; ALL: %0 = ashr i32 %abs_n, 1 [all …]
|
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/test/Transforms/LoopIdiom/X86/ |
H A D | ctlz.ll | 36 %abs_n = select i1 %c, i32 %n, i32 %negn 37 %shr8 = lshr i32 %abs_n, 1 49 %and = and i32 %shl, %abs_n 95 %abs_n = select i1 %c, i32 %n, i32 %negn 96 %tobool4 = icmp eq i32 %abs_n, 0 179 ; ALL: %0 = ashr i32 %abs_n, 1 191 %abs_n = select i1 %c, i32 %n, i32 %negn 259 ; ALL: %0 = ashr i32 %abs_n, 1 272 %abs_n = select i1 %c, i32 %n, i32 %negn 343 ; ALL: %0 = ashr i32 %abs_n, 1 [all …]
|
/dports/devel/llvm90/llvm-9.0.1.src/test/Transforms/LoopIdiom/X86/ |
H A D | ctlz.ll | 36 %abs_n = select i1 %c, i32 %n, i32 %negn 37 %shr8 = lshr i32 %abs_n, 1 49 %and = and i32 %shl, %abs_n 95 %abs_n = select i1 %c, i32 %n, i32 %negn 96 %tobool4 = icmp eq i32 %abs_n, 0 179 ; ALL: %0 = ashr i32 %abs_n, 1 191 %abs_n = select i1 %c, i32 %n, i32 %negn 259 ; ALL: %0 = ashr i32 %abs_n, 1 272 %abs_n = select i1 %c, i32 %n, i32 %negn 343 ; ALL: %0 = ashr i32 %abs_n, 1 [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/test/Transforms/LoopIdiom/X86/ |
H A D | ctlz.ll | 36 %abs_n = select i1 %c, i32 %n, i32 %negn 37 %shr8 = lshr i32 %abs_n, 1 49 %and = and i32 %shl, %abs_n 95 %abs_n = select i1 %c, i32 %n, i32 %negn 96 %tobool4 = icmp eq i32 %abs_n, 0 179 ; ALL: %0 = ashr i32 %abs_n, 1 191 %abs_n = select i1 %c, i32 %n, i32 %negn 259 ; ALL: %0 = ashr i32 %abs_n, 1 272 %abs_n = select i1 %c, i32 %n, i32 %negn 343 ; ALL: %0 = ashr i32 %abs_n, 1 [all …]
|
/dports/devel/llvm80/llvm-8.0.1.src/test/Transforms/LoopIdiom/X86/ |
H A D | ctlz.ll | 36 %abs_n = select i1 %c, i32 %n, i32 %negn 37 %shr8 = lshr i32 %abs_n, 1 49 %and = and i32 %shl, %abs_n 95 %abs_n = select i1 %c, i32 %n, i32 %negn 96 %tobool4 = icmp eq i32 %abs_n, 0 179 ; ALL: %0 = ashr i32 %abs_n, 1 191 %abs_n = select i1 %c, i32 %n, i32 %negn 259 ; ALL: %0 = ashr i32 %abs_n, 1 272 %abs_n = select i1 %c, i32 %n, i32 %negn 343 ; ALL: %0 = ashr i32 %abs_n, 1 [all …]
|
/dports/devel/llvm70/llvm-7.0.1.src/test/Transforms/LoopIdiom/X86/ |
H A D | ctlz.ll | 36 %abs_n = select i1 %c, i32 %n, i32 %negn 37 %shr8 = lshr i32 %abs_n, 1 49 %and = and i32 %shl, %abs_n 95 %abs_n = select i1 %c, i32 %n, i32 %negn 96 %tobool4 = icmp eq i32 %abs_n, 0 179 ; ALL: %0 = ashr i32 %abs_n, 1 191 %abs_n = select i1 %c, i32 %n, i32 %negn 259 ; ALL: %0 = ashr i32 %abs_n, 1 272 %abs_n = select i1 %c, i32 %n, i32 %negn 343 ; ALL: %0 = ashr i32 %abs_n, 1 [all …]
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.prev/ |
H A D | iterator_count.pass.cpp | 30 std::ptrdiff_t const abs_n = n < 0 ? -n : n; in check() local 31 assert(result.stride_count() == abs_n); in check()
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.prev/ |
H A D | iterator_count.pass.cpp | 29 std::ptrdiff_t const abs_n = n < 0 ? -n : n; in check() local 30 assert(result.stride_count() == abs_n); in check()
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.prev/ |
H A D | iterator_count.pass.cpp | 30 std::ptrdiff_t const abs_n = n < 0 ? -n : n; in check() local 31 assert(result.stride_count() == abs_n); in check()
|
/dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.prev/ |
H A D | iterator_count.pass.cpp | 30 std::ptrdiff_t const abs_n = n < 0 ? -n : n; in check() local 31 assert(result.stride_count() == abs_n); in check()
|
/dports/math/piranha/piranha-0.11/src/ |
H A D | real_trigonometric_kronecker_monomial.hpp | 1268 const value_type abs_n = (n >= 0) ? n : static_cast<value_type>(-n); in t_subs() local 1273 for (value_type k(0); k < abs_n; ++k) { in t_subs() 1278 res_type cos_nx((cos_phase(abs_n) * math::binomial(abs_n, value_type(0))) in t_subs() 1279 * (c_map[value_type(0)] * s_map[abs_n])), in t_subs() 1280 …sin_nx((sin_phase(abs_n) * math::binomial(abs_n, value_type(0))) * (c_map[value_type(0)] * s_map[a… in t_subs() 1281 for (value_type k(0); k < abs_n; ++k) { in t_subs() 1282 const value_type p = abs_n - (k + value_type(1)); in t_subs() 1288 … res_type tmp(math::binomial(abs_n, k + value_type(1)) * (c_map[k + value_type(1)] * s_map[p])); in t_subs() 1293 if (abs_n != n) { in t_subs()
|
/dports/math/py-piranha/piranha-0.11/src/ |
H A D | real_trigonometric_kronecker_monomial.hpp | 1268 const value_type abs_n = (n >= 0) ? n : static_cast<value_type>(-n); in t_subs() local 1273 for (value_type k(0); k < abs_n; ++k) { in t_subs() 1278 res_type cos_nx((cos_phase(abs_n) * math::binomial(abs_n, value_type(0))) in t_subs() 1279 * (c_map[value_type(0)] * s_map[abs_n])), in t_subs() 1280 …sin_nx((sin_phase(abs_n) * math::binomial(abs_n, value_type(0))) * (c_map[value_type(0)] * s_map[a… in t_subs() 1281 for (value_type k(0); k < abs_n; ++k) { in t_subs() 1282 const value_type p = abs_n - (k + value_type(1)); in t_subs() 1288 … res_type tmp(math::binomial(abs_n, k + value_type(1)) * (c_map[k + value_type(1)] * s_map[p])); in t_subs() 1293 if (abs_n != n) { in t_subs()
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.next/ |
H A D | iterator_count.pass.cpp | 38 auto const abs_n = n < 0 ? -n : n; in check_steps() local 39 assert(result.stride_count() == abs_n); in check_steps()
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.next/ |
H A D | iterator_count.pass.cpp | 37 auto const abs_n = n < 0 ? -n : n; in check_steps() local 38 assert(result.stride_count() == abs_n); in check_steps()
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.next/ |
H A D | iterator_count.pass.cpp | 38 auto const abs_n = n < 0 ? -n : n; in check_steps() local 39 assert(result.stride_count() == abs_n); in check_steps()
|