/dports/lang/gcc10-devel/gcc-10-20211008/gcc/testsuite/gcc.target/aarch64/ |
H A D | fmls_intrinsic_1.c | 48 #define BUILD_TEST(size, lanes) \ argument 53 float##size##_t pool[lanes] = POOL##lanes; \ 54 float##size##_t res[lanes] = EMPTY##lanes; \ 55 float##size##_t res2[lanes] = EMPTY##lanes; \ 56 float##size##_t res3[lanes] = EMPTY##lanes; \ 57 float##size##_t res4[lanes] = EMPTY##lanes; \ 63 for (i = 0; i < lanes / 2; i++) \ 70 for (i = 0; i < lanes; i++) \ 77 for (i = 0; i < lanes / 2; i++) \ 84 for (i = 0; i < lanes; i++) \
|
H A D | fmul_intrinsic_1.c | 46 #define BUILD_TEST(size, lanes) \ argument 51 float##size##_t pool[lanes] = POOL##lanes; \ 52 float##size##_t res[lanes] = EMPTY##lanes; \ 53 float##size##_t res2[lanes] = EMPTY##lanes; \ 54 float##size##_t res3[lanes] = EMPTY##lanes; \ 55 float##size##_t res4[lanes] = EMPTY##lanes; \ 62 for (i = 0; i < lanes / 2; i++) \ 69 for (i = 0; i < lanes; i++) \ 76 for (i = 0; i < lanes / 2; i++) \ 83 for (i = 0; i < lanes; i++) \
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/testsuite/gcc.target/aarch64/ |
H A D | fmul_intrinsic_1.c | 47 #define BUILD_TEST(size, lanes) \ argument 52 float##size##_t pool[lanes] = POOL##lanes; \ 53 float##size##_t res[lanes] = EMPTY##lanes; \ 54 float##size##_t res2[lanes] = EMPTY##lanes; \ 55 float##size##_t res3[lanes] = EMPTY##lanes; \ 56 float##size##_t res4[lanes] = EMPTY##lanes; \ 63 for (i = 0; i < lanes / 2; i++) \ 70 for (i = 0; i < lanes; i++) \ 77 for (i = 0; i < lanes / 2; i++) \ 84 for (i = 0; i < lanes; i++) \
|
H A D | fmla_intrinsic_1.c | 49 #define BUILD_TEST(size, lanes) \ argument 54 float##size##_t pool[lanes] = POOL##lanes; \ 55 float##size##_t res[lanes] = EMPTY##lanes; \ 56 float##size##_t res2[lanes] = EMPTY##lanes; \ 57 float##size##_t res3[lanes] = EMPTY##lanes; \ 58 float##size##_t res4[lanes] = EMPTY##lanes; \ 63 for (i = 0; i < lanes / 2; i++) \ 70 for (i = 0; i < lanes; i++) \ 77 for (i = 0; i < lanes / 2; i++) \ 84 for (i = 0; i < lanes; i++) \
|
H A D | fmls_intrinsic_1.c | 49 #define BUILD_TEST(size, lanes) \ argument 54 float##size##_t pool[lanes] = POOL##lanes; \ 55 float##size##_t res[lanes] = EMPTY##lanes; \ 56 float##size##_t res2[lanes] = EMPTY##lanes; \ 57 float##size##_t res3[lanes] = EMPTY##lanes; \ 58 float##size##_t res4[lanes] = EMPTY##lanes; \ 64 for (i = 0; i < lanes / 2; i++) \ 71 for (i = 0; i < lanes; i++) \ 78 for (i = 0; i < lanes / 2; i++) \ 85 for (i = 0; i < lanes; i++) \
|
/dports/lang/spidermonkey78/firefox-78.9.0/js/src/jit/x64/ |
H A D | Lowering-x64.cpp | 637 if (!((lanes[i] & 1) == 0 && lanes[i + 1] == lanes[i] + 1)) { in ByteMaskToWordMask() 652 if (!((lanes[i] & 3) == 0 && lanes[i + 1] == lanes[i] + 1 && in ByteMaskToDWordMask() 653 lanes[i + 2] == lanes[i] + 2 && lanes[i + 3] == lanes[i] + 3)) { in ByteMaskToDWordMask() 673 while (i < len && lanes[i] == lanes[i - 1] + 1) { in ScanIncreasingMasked() 692 while (i < len && lanes[i] < len && lanes[i - 1] == lanes[i] - 1) { in ScanIncreasingUnmasked() 697 while (i < len && lanes[i] >= len && lanes[i - 1] == lanes[i] - 1) { in ScanIncreasingUnmasked() 748 if (lanes[i] != lanes[i - 1] + 1) { in IsIdentity() 834 if (ScanConstant(lanes, lanes[0], 0) < 8) { in TryBroadcast16x8() 845 if (ScanConstant(lanes, lanes[0], 0) < 16) { in TryBroadcast8x16() 974 if ((lanes[i] & 16) == (lanes[i - 1] & 16)) { in TryConcatRightShift8x16() [all …]
|
/dports/cad/sumo/sumo-1.2.0/tools/contributed/sumopy/coremodules/scenario/ |
H A D | networkxtools.py | 979 n_lane = len(lanes) 1113 lanes = [] 1236 lanes = [] 1375 n_lane = len(lanes) 1429 n_lane = len(lanes) 1467 lanes = [] 1598 lanes = [] 1898 lanes = [] 1952 lanes = [] 2070 lanes = [] [all …]
|
/dports/devel/highway/highway-0.15.0/hwy/tests/ |
H A D | combine_test.cc | 38 auto lanes = AllocateAligned<T>(N); in operator ()() local 40 std::fill(lanes.get(), lanes.get() + N, T(0)); in operator ()() 52 HWY_ASSERT_EQ(T(0), lanes[i]); in operator ()() 67 std::fill(lanes.get(), lanes.get() + N, T(0)); in operator ()() 72 Store(lo, d4, lanes.get()); in operator ()() 81 HWY_ASSERT_EQ(T(0), lanes[i]); in operator ()() 102 std::fill(lanes.get(), lanes.get() + N, T(0)); in operator ()() 111 HWY_ASSERT_EQ(T(0), lanes[i]); in operator ()() 131 Store(v, d, &lanes[0]); in operator ()() 132 Store(v, d, &lanes[N2 / 2]); in operator ()() [all …]
|
/dports/www/firefox/firefox-99.0/third_party/jpeg-xl/lib/jxl/ |
H A D | convolve-inl.h | 38 HWY_ALIGN constexpr int32_t lanes[16] = {0, 0, 1, 2, 3, 4, 5, 6, in FirstL1() local 40 const auto indices = SetTableIndices(d, lanes); in FirstL1() 53 HWY_ALIGN constexpr int lanes[4] = {0, 0, 1, 2}; // KJII in FirstL1() 54 const auto indices = SetTableIndices(d, lanes); in FirstL1() 64 HWY_ALIGN constexpr int32_t lanes[16] = {1, 0, 0, 1, 2, 3, 4, 5, in FirstL2() local 66 const auto indices = SetTableIndices(d, lanes); in FirstL2() 79 HWY_ALIGN constexpr int lanes[4] = {1, 0, 0, 1}; // JIIJ in FirstL2() 80 const auto indices = SetTableIndices(d, lanes); in FirstL2() 92 const auto indices = SetTableIndices(d, lanes); in FirstL3() 105 HWY_ALIGN constexpr int lanes[4] = {2, 1, 0, 0}; // IIJK in FirstL3() [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/jpeg-xl/lib/jxl/ |
H A D | convolve-inl.h | 38 HWY_ALIGN constexpr int32_t lanes[16] = {0, 0, 1, 2, 3, 4, 5, 6, in FirstL1() local 40 const auto indices = SetTableIndices(d, lanes); in FirstL1() 53 HWY_ALIGN constexpr int lanes[4] = {0, 0, 1, 2}; // KJII in FirstL1() 54 const auto indices = SetTableIndices(d, lanes); in FirstL1() 64 HWY_ALIGN constexpr int32_t lanes[16] = {1, 0, 0, 1, 2, 3, 4, 5, in FirstL2() local 66 const auto indices = SetTableIndices(d, lanes); in FirstL2() 79 HWY_ALIGN constexpr int lanes[4] = {1, 0, 0, 1}; // JIIJ in FirstL2() 80 const auto indices = SetTableIndices(d, lanes); in FirstL2() 92 const auto indices = SetTableIndices(d, lanes); in FirstL3() 105 HWY_ALIGN constexpr int lanes[4] = {2, 1, 0, 0}; // IIJK in FirstL3() [all …]
|
/dports/graphics/libjxl/libjxl-0.6.1/lib/jxl/ |
H A D | convolve-inl.h | 38 HWY_ALIGN constexpr int32_t lanes[16] = {0, 0, 1, 2, 3, 4, 5, 6, in FirstL1() local 40 const auto indices = SetTableIndices(d, lanes); in FirstL1() 53 HWY_ALIGN constexpr int lanes[4] = {0, 0, 1, 2}; // KJII in FirstL1() 54 const auto indices = SetTableIndices(d, lanes); in FirstL1() 64 HWY_ALIGN constexpr int32_t lanes[16] = {1, 0, 0, 1, 2, 3, 4, 5, in FirstL2() local 66 const auto indices = SetTableIndices(d, lanes); in FirstL2() 79 HWY_ALIGN constexpr int lanes[4] = {1, 0, 0, 1}; // JIIJ in FirstL2() 80 const auto indices = SetTableIndices(d, lanes); in FirstL2() 92 const auto indices = SetTableIndices(d, lanes); in FirstL3() 105 HWY_ALIGN constexpr int lanes[4] = {2, 1, 0, 0}; // IIJK in FirstL3() [all …]
|
/dports/www/firefox-esr/firefox-91.8.0/third_party/jpeg-xl/lib/jxl/ |
H A D | convolve-inl.h | 38 HWY_ALIGN constexpr int32_t lanes[16] = {0, 0, 1, 2, 3, 4, 5, 6, in FirstL1() local 40 const auto indices = SetTableIndices(d, lanes); in FirstL1() 53 HWY_ALIGN constexpr int lanes[4] = {0, 0, 1, 2}; // KJII in FirstL1() 54 const auto indices = SetTableIndices(d, lanes); in FirstL1() 64 HWY_ALIGN constexpr int32_t lanes[16] = {1, 0, 0, 1, 2, 3, 4, 5, in FirstL2() local 66 const auto indices = SetTableIndices(d, lanes); in FirstL2() 79 HWY_ALIGN constexpr int lanes[4] = {1, 0, 0, 1}; // JIIJ in FirstL2() 80 const auto indices = SetTableIndices(d, lanes); in FirstL2() 92 const auto indices = SetTableIndices(d, lanes); in FirstL3() 105 HWY_ALIGN constexpr int lanes[4] = {2, 1, 0, 0}; // IIJK in FirstL3() [all …]
|
/dports/security/libgcrypt/libgcrypt-1.9.4/cipher/ |
H A D | keccak_permute_64.h | 308 absorb_lanes64_8(&hd->u.state64[0], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 309 absorb_lanes64_8(&hd->u.state64[8], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 322 absorb_lanes64_8(&hd->u.state64[0], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 323 absorb_lanes64_8(&hd->u.state64[8], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 335 absorb_lanes64_8(&hd->u.state64[0], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 336 absorb_lanes64_8(&hd->u.state64[8], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 348 absorb_lanes64_8(&hd->u.state64[0], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 349 absorb_lanes64_4(&hd->u.state64[8], lanes); lanes += 8 * 4; in KECCAK_F1600_ABSORB_FUNC_NAME() 361 absorb_lanes64_8(&hd->u.state64[0], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 362 absorb_lanes64_1(&hd->u.state64[8], lanes); lanes += 8 * 1; in KECCAK_F1600_ABSORB_FUNC_NAME() [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/comm/third_party/libgcrypt/cipher/ |
H A D | keccak_permute_64.h | 308 absorb_lanes64_8(&hd->u.state64[0], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 309 absorb_lanes64_8(&hd->u.state64[8], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 322 absorb_lanes64_8(&hd->u.state64[0], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 323 absorb_lanes64_8(&hd->u.state64[8], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 335 absorb_lanes64_8(&hd->u.state64[0], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 336 absorb_lanes64_8(&hd->u.state64[8], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 348 absorb_lanes64_8(&hd->u.state64[0], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 349 absorb_lanes64_4(&hd->u.state64[8], lanes); lanes += 8 * 4; in KECCAK_F1600_ABSORB_FUNC_NAME() 361 absorb_lanes64_8(&hd->u.state64[0], lanes); lanes += 8 * 8; in KECCAK_F1600_ABSORB_FUNC_NAME() 362 absorb_lanes64_1(&hd->u.state64[8], lanes); lanes += 8 * 1; in KECCAK_F1600_ABSORB_FUNC_NAME() [all …]
|
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/testsuite/gcc.target/aarch64/ |
H A D | mla_intrinsic_1.c | 39 #define BUILD_TEST(su, size, lanes) \ argument 44 MAP##su (size,) pool[lanes] = POOL##lanes; \ 45 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 46 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 51 for (i = 0; i < lanes; i++) \ 58 for (i = 0; i < lanes; i++) \ 64 #define BUILD_VARS(size, lanes) \ argument 65 BUILD_TEST (s, size, lanes) \ 66 BUILD_TEST (u, size, lanes)
|
H A D | mul_intrinsic_1.c | 38 #define BUILD_TEST(su, size, lanes) \ argument 43 MAP##su (size,) pool[lanes] = POOL##lanes; \ 44 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 45 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 50 for (i = 0; i < lanes; i++) \ 57 for (i = 0; i < lanes; i++) \ 63 #define BUILD_VARS(size, lanes) \ argument 64 BUILD_TEST (s, size, lanes) \ 65 BUILD_TEST (u, size, lanes)
|
/dports/lang/gcc8/gcc-8.5.0/gcc/testsuite/gcc.target/aarch64/ |
H A D | mul_intrinsic_1.c | 38 #define BUILD_TEST(su, size, lanes) \ argument 43 MAP##su (size,) pool[lanes] = POOL##lanes; \ 44 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 45 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 50 for (i = 0; i < lanes; i++) \ 57 for (i = 0; i < lanes; i++) \ 63 #define BUILD_VARS(size, lanes) \ argument 64 BUILD_TEST (s, size, lanes) \ 65 BUILD_TEST (u, size, lanes)
|
/dports/lang/gcc10/gcc-10.3.0/gcc/testsuite/gcc.target/aarch64/ |
H A D | mla_intrinsic_1.c | 39 #define BUILD_TEST(su, size, lanes) \ argument 44 MAP##su (size,) pool[lanes] = POOL##lanes; \ 45 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 46 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 51 for (i = 0; i < lanes; i++) \ 58 for (i = 0; i < lanes; i++) \ 64 #define BUILD_VARS(size, lanes) \ argument 65 BUILD_TEST (s, size, lanes) \ 66 BUILD_TEST (u, size, lanes)
|
H A D | mul_intrinsic_1.c | 38 #define BUILD_TEST(su, size, lanes) \ argument 43 MAP##su (size,) pool[lanes] = POOL##lanes; \ 44 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 45 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 50 for (i = 0; i < lanes; i++) \ 57 for (i = 0; i < lanes; i++) \ 63 #define BUILD_VARS(size, lanes) \ argument 64 BUILD_TEST (s, size, lanes) \ 65 BUILD_TEST (u, size, lanes)
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gcc.target/aarch64/ |
H A D | mul_intrinsic_1.c | 38 #define BUILD_TEST(su, size, lanes) \ argument 43 MAP##su (size,) pool[lanes] = POOL##lanes; \ 44 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 45 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 50 for (i = 0; i < lanes; i++) \ 57 for (i = 0; i < lanes; i++) \ 63 #define BUILD_VARS(size, lanes) \ argument 64 BUILD_TEST (s, size, lanes) \ 65 BUILD_TEST (u, size, lanes)
|
H A D | mla_intrinsic_1.c | 39 #define BUILD_TEST(su, size, lanes) \ argument 44 MAP##su (size,) pool[lanes] = POOL##lanes; \ 45 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 46 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 51 for (i = 0; i < lanes; i++) \ 58 for (i = 0; i < lanes; i++) \ 64 #define BUILD_VARS(size, lanes) \ argument 65 BUILD_TEST (s, size, lanes) \ 66 BUILD_TEST (u, size, lanes)
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/testsuite/gcc.target/aarch64/ |
H A D | mla_intrinsic_1.c | 39 #define BUILD_TEST(su, size, lanes) \ argument 44 MAP##su (size,) pool[lanes] = POOL##lanes; \ 45 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 46 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 51 for (i = 0; i < lanes; i++) \ 58 for (i = 0; i < lanes; i++) \ 64 #define BUILD_VARS(size, lanes) \ argument 65 BUILD_TEST (s, size, lanes) \ 66 BUILD_TEST (u, size, lanes)
|
H A D | mul_intrinsic_1.c | 38 #define BUILD_TEST(su, size, lanes) \ argument 43 MAP##su (size,) pool[lanes] = POOL##lanes; \ 44 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 45 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 50 for (i = 0; i < lanes; i++) \ 57 for (i = 0; i < lanes; i++) \ 63 #define BUILD_VARS(size, lanes) \ argument 64 BUILD_TEST (s, size, lanes) \ 65 BUILD_TEST (u, size, lanes)
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gcc.target/aarch64/ |
H A D | mul_intrinsic_1.c | 38 #define BUILD_TEST(su, size, lanes) \ argument 43 MAP##su (size,) pool[lanes] = POOL##lanes; \ 44 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 45 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 50 for (i = 0; i < lanes; i++) \ 57 for (i = 0; i < lanes; i++) \ 63 #define BUILD_VARS(size, lanes) \ argument 64 BUILD_TEST (s, size, lanes) \ 65 BUILD_TEST (u, size, lanes)
|
H A D | mla_intrinsic_1.c | 39 #define BUILD_TEST(su, size, lanes) \ argument 44 MAP##su (size,) pool[lanes] = POOL##lanes; \ 45 MAP##su (size,) res[lanes] = EMPTY##lanes; \ 46 MAP##su (size,) res2[lanes] = EMPTY##lanes; \ 51 for (i = 0; i < lanes; i++) \ 58 for (i = 0; i < lanes; i++) \ 64 #define BUILD_VARS(size, lanes) \ argument 65 BUILD_TEST (s, size, lanes) \ 66 BUILD_TEST (u, size, lanes)
|