Home
last modified time | relevance | path

Searched +full:2 +full:v (Results 1 – 25 of 1328) sorted by relevance

12345678910>>...54

/freebsd/contrib/llvm-project/llvm/lib/Support/BLAKE3/
H A Dblake3_avx512.c105 *row0 = _mm_shuffle_epi32(*row0, _MM_SHUFFLE(2, 1, 0, 3)); in diagonalize()
106 *row3 = _mm_shuffle_epi32(*row3, _MM_SHUFFLE(1, 0, 3, 2)); in diagonalize()
107 *row2 = _mm_shuffle_epi32(*row2, _MM_SHUFFLE(0, 3, 2, 1)); in diagonalize()
111 *row0 = _mm_shuffle_epi32(*row0, _MM_SHUFFLE(0, 3, 2, 1)); in undiagonalize()
112 *row3 = _mm_shuffle_epi32(*row3, _MM_SHUFFLE(1, 0, 3, 2)); in undiagonalize()
113 *row2 = _mm_shuffle_epi32(*row2, _MM_SHUFFLE(2, 1, 0, 3)); in undiagonalize()
121 rows[2] = set4(IV[0], IV[1], IV[2], IV[3]); in compress_pre()
127 __m128i m2 = loadu_128(&block[sizeof(__m128i) * 2]); in compress_pre()
134 t0 = _mm_shuffle_ps2(m0, m1, _MM_SHUFFLE(2, 0, 2, 0)); // 6 4 2 0 in compress_pre()
135 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
[all …]
H A Dblake3_sse41.c32 x, _mm_set_epi8(13, 12, 15, 14, 9, 8, 11, 10, 5, 4, 7, 6, 1, 0, 3, 2)); in rot16()
41 x, _mm_set_epi8(12, 15, 14, 13, 8, 11, 10, 9, 4, 7, 6, 5, 0, 3, 2, 1)); in rot8()
72 *row0 = _mm_shuffle_epi32(*row0, _MM_SHUFFLE(2, 1, 0, 3)); in diagonalize()
73 *row3 = _mm_shuffle_epi32(*row3, _MM_SHUFFLE(1, 0, 3, 2)); in diagonalize()
74 *row2 = _mm_shuffle_epi32(*row2, _MM_SHUFFLE(0, 3, 2, 1)); in diagonalize()
78 *row0 = _mm_shuffle_epi32(*row0, _MM_SHUFFLE(0, 3, 2, 1)); in undiagonalize()
79 *row3 = _mm_shuffle_epi32(*row3, _MM_SHUFFLE(1, 0, 3, 2)); in undiagonalize()
80 *row2 = _mm_shuffle_epi32(*row2, _MM_SHUFFLE(2, 1, 0, 3)); in undiagonalize()
88 rows[2] = set4(IV[0], IV[1], IV[2], IV[3]); in compress_pre()
94 __m128i m2 = loadu(&block[sizeof(__m128i) * 2]); in compress_pre()
[all …]
H A Dblake3_sse2.c70 *row0 = _mm_shuffle_epi32(*row0, _MM_SHUFFLE(2, 1, 0, 3)); in diagonalize()
71 *row3 = _mm_shuffle_epi32(*row3, _MM_SHUFFLE(1, 0, 3, 2)); in diagonalize()
72 *row2 = _mm_shuffle_epi32(*row2, _MM_SHUFFLE(0, 3, 2, 1)); in diagonalize()
76 *row0 = _mm_shuffle_epi32(*row0, _MM_SHUFFLE(0, 3, 2, 1)); in undiagonalize()
77 *row3 = _mm_shuffle_epi32(*row3, _MM_SHUFFLE(1, 0, 3, 2)); in undiagonalize()
78 *row2 = _mm_shuffle_epi32(*row2, _MM_SHUFFLE(2, 1, 0, 3)); in undiagonalize()
94 rows[2] = set4(IV[0], IV[1], IV[2], IV[3]); in compress_pre()
100 __m128i m2 = loadu(&block[sizeof(__m128i) * 2]); in compress_pre()
107 t0 = _mm_shuffle_ps2(m0, m1, _MM_SHUFFLE(2, 0, 2, 0)); // 6 4 2 0 in compress_pre()
108 g1(&rows[0], &rows[1], &rows[2], &rows[3], t0); in compress_pre()
[all …]
H A Dblake3_neon.c66 INLINE void round_fn4(uint32x4_t v[16], uint32x4_t m[16], size_t r) { in round_fn4()
67 v[0] = add_128(v[0], m[(size_t)MSG_SCHEDULE[r][0]]); in round_fn4()
68 v[1] = add_128(v[1], m[(size_t)MSG_SCHEDULE[r][2]]); in round_fn4()
69 v[2] = add_128(v[2], m[(size_t)MSG_SCHEDULE[r][4]]); in round_fn4()
70 v[3] = add_128(v[3], m[(size_t)MSG_SCHEDULE[r][6]]); in round_fn4()
71 v[0] = add_128(v[0], v[4]); in round_fn4()
72 v[1] = add_128(v[1], v[5]); in round_fn4()
73 v[2] = add_128(v[2], v[6]); in round_fn4()
74 v[3] = add_128(v[3], v[7]); in round_fn4()
75 v[12] = xor_128(v[12], v[0]); in round_fn4()
[all …]
H A Dblake3_avx2.c24 x, _mm256_set_epi8(13, 12, 15, 14, 9, 8, 11, 10, 5, 4, 7, 6, 1, 0, 3, 2, in rot16()
25 13, 12, 15, 14, 9, 8, 11, 10, 5, 4, 7, 6, 1, 0, 3, 2)); in rot16()
34 x, _mm256_set_epi8(12, 15, 14, 13, 8, 11, 10, 9, 4, 7, 6, 5, 0, 3, 2, 1, in rot8()
35 12, 15, 14, 13, 8, 11, 10, 9, 4, 7, 6, 5, 0, 3, 2, 1)); in rot8()
42 INLINE void round_fn(__m256i v[16], __m256i m[16], size_t r) { in round_fn()
43 v[0] = addv(v[0], m[(size_t)MSG_SCHEDULE[r][0]]); in round_fn()
44 v[1] = addv(v[1], m[(size_t)MSG_SCHEDULE[r][2]]); in round_fn()
45 v[2] = addv(v[2], m[(size_t)MSG_SCHEDULE[r][4]]); in round_fn()
46 v[3] = addv(v[3], m[(size_t)MSG_SCHEDULE[r][6]]); in round_fn()
47 v[0] = addv(v[0], v[4]); in round_fn()
[all …]
/freebsd/sys/contrib/openzfs/module/zcommon/
H A Dzfs_fletcher_superscalar4.c17 * General Public License (GPL) Version 2, available from the file
61 A = ctx->superscalar[0].v[0] + ctx->superscalar[0].v[1] + in fletcher_4_superscalar4_fini()
62 ctx->superscalar[0].v[2] + ctx->superscalar[0].v[3]; in fletcher_4_superscalar4_fini()
63 B = 0 - ctx->superscalar[0].v[1] - 2 * ctx->superscalar[0].v[2] - in fletcher_4_superscalar4_fini()
64 3 * ctx->superscalar[0].v[3] + 4 * ctx->superscalar[1].v[0] + in fletcher_4_superscalar4_fini()
65 4 * ctx->superscalar[1].v[1] + 4 * ctx->superscalar[1].v[2] + in fletcher_4_superscalar4_fini()
66 4 * ctx->superscalar[1].v[3]; in fletcher_4_superscalar4_fini()
68 C = ctx->superscalar[0].v[2] + 3 * ctx->superscalar[0].v[3] - in fletcher_4_superscalar4_fini()
69 6 * ctx->superscalar[1].v[0] - 10 * ctx->superscalar[1].v[1] - in fletcher_4_superscalar4_fini()
70 14 * ctx->superscalar[1].v[2] - 18 * ctx->superscalar[1].v[3] + in fletcher_4_superscalar4_fini()
[all …]
H A Dzfs_fletcher_superscalar.c17 * General Public License (GPL) Version 2, available from the file
60 A = ctx->superscalar[0].v[0] + ctx->superscalar[0].v[1]; in fletcher_4_superscalar_fini()
61 B = 2 * ctx->superscalar[1].v[0] + 2 * ctx->superscalar[1].v[1] - in fletcher_4_superscalar_fini()
62 ctx->superscalar[0].v[1]; in fletcher_4_superscalar_fini()
63 C = 4 * ctx->superscalar[2].v[0] - ctx->superscalar[1].v[0] + in fletcher_4_superscalar_fini()
64 4 * ctx->superscalar[2].v[1] - 3 * ctx->superscalar[1].v[1]; in fletcher_4_superscalar_fini()
65 D = 8 * ctx->superscalar[3].v[0] - 4 * ctx->superscalar[2].v[0] + in fletcher_4_superscalar_fini()
66 8 * ctx->superscalar[3].v[1] - 8 * ctx->superscalar[2].v[1] + in fletcher_4_superscalar_fini()
67 ctx->superscalar[1].v[1]; in fletcher_4_superscalar_fini()
80 a = ctx->superscalar[0].v[0]; in fletcher_4_superscalar_native()
[all …]
H A Dzfs_fletcher_intel.c16 * General Public License (GPL) Version 2, available from the file
61 A = ctx->avx[0].v[0] + ctx->avx[0].v[1] + in fletcher_4_avx2_fini()
62 ctx->avx[0].v[2] + ctx->avx[0].v[3]; in fletcher_4_avx2_fini()
63 B = 0 - ctx->avx[0].v[1] - 2 * ctx->avx[0].v[2] - 3 * ctx->avx[0].v[3] + in fletcher_4_avx2_fini()
64 4 * ctx->avx[1].v[0] + 4 * ctx->avx[1].v[1] + 4 * ctx->avx[1].v[2] + in fletcher_4_avx2_fini()
65 4 * ctx->avx[1].v[3]; in fletcher_4_avx2_fini()
67 C = ctx->avx[0].v[2] + 3 * ctx->avx[0].v[3] - 6 * ctx->avx[1].v[0] - in fletcher_4_avx2_fini()
68 10 * ctx->avx[1].v[1] - 14 * ctx->avx[1].v[2] - in fletcher_4_avx2_fini()
69 18 * ctx->avx[1].v[3] + 16 * ctx->avx[2].v[0] + in fletcher_4_avx2_fini()
70 16 * ctx->avx[2].v[1] + 16 * ctx->avx[2].v[2] + in fletcher_4_avx2_fini()
[all …]
/freebsd/bin/sh/tests/expansion/
H A Darith2.05 if [ $(($1)) != $2 ]; then
7 echo "For $1, expected $2 actual $(($1))"
12 unset v
13 check "v=2" 2
14 check "v" 2
15 check "$(($v))" 2
16 check "v+=1" 3
17 check "v" 3
27 v=42
28 check "!v" 0
[all …]
H A Dassign1.09 expected="$2"
23 testcase 'v=; set -- ${v=a b} $v' '0|'
24 testcase 'unset v; set -- ${v=a b} $v' '4|a|b|a|b'
25 testcase 'v=; set -- ${v:=a b} $v' '4|a|b|a|b'
26 testcase 'v=; set -- "${v:=a b}" "$v"' '2|a b|a b'
28 testcase 'v=; set -- ${v:=a\ b} $v' '4|a|b|a|b'
29 testcase 'v=; set -- ${v:=$p} $v' '2|/etc/|/etc/'
30 testcase 'v=; set -- "${v:=$p}" "$v"' '2|/et[c]/|/et[c]/'
31 testcase 'v=; set -- "${v:=a\ b}" "$v"' '2|a\ b|a\ b'
32 testcase 'v=; set -- ${v:="$p"} $v' '2|/etc/|/etc/'
[all …]
/freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/
H A Dcert-onecolumn.pem61 V
76 V
89 v
95 2
99 V
119 2
128 V
144 V
153 v
183 2
[all …]
H A Ddsa-onecolumn.pem40 v
52 2
90 V
118 2
151 2
184 2
193 V
225 2
257 V
301 V
[all …]
/freebsd/sys/contrib/libsodium/src/libsodium/crypto_pwhash/argon2/
H A Dargon2-fill-block-ref.c37 blockR.v[16 * i], blockR.v[16 * i + 1], blockR.v[16 * i + 2], in fill_block()
38 blockR.v[16 * i + 3], blockR.v[16 * i + 4], blockR.v[16 * i + 5], in fill_block()
39 blockR.v[16 * i + 6], blockR.v[16 * i + 7], blockR.v[16 * i + 8], in fill_block()
40 blockR.v[16 * i + 9], blockR.v[16 * i + 10], blockR.v[16 * i + 11], in fill_block()
41 blockR.v[16 * i + 12], blockR.v[16 * i + 13], blockR.v[16 * i + 14], in fill_block()
42 blockR.v[16 * i + 15]); in fill_block()
46 (2,3,18,19,...,114,115).. finally (14,15,30,31,...,126,127) */ in fill_block()
49 blockR.v[2 * i], blockR.v[2 * i + 1], blockR.v[2 * i + 16], in fill_block()
50 blockR.v[2 * i + 17], blockR.v[2 * i + 32], blockR.v[2 * i + 33], in fill_block()
51 blockR.v[2 * i + 48], blockR.v[2 * i + 49], blockR.v[2 * i + 64], in fill_block()
[all …]
/freebsd/sys/contrib/libsodium/src/libsodium/crypto_generichash/blake2b/ref/
H A Dblake2b-compress-ref.c16 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 },
17 { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 },
18 { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 },
19 { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 },
20 { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 },
21 { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 },
22 { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 },
23 { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 },
24 { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 },
25 { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0 },
[all …]
/freebsd/sys/dev/sound/pcm/
H A Dpcm.h2 * SPDX-License-Identifier: BSD-2-Clause
16 * 2. Redistributions in binary form must reproduce the above copyright
100 #define PCM_16_BPS 2
104 #define INTPCM_T(v) ((intpcm_t)(v)) argument
105 #define INTPCM8_T(v) ((intpcm8_t)(v)) argument
106 #define INTPCM16_T(v) ((intpcm16_t)(v)) argument
107 #define INTPCM24_T(v) ((intpcm24_t)(v)) argument
108 #define INTPCM32_T(v) ((intpcm32_t)(v)) argument
131 intpcm_t v; in pcm_sample_read() local
137 v = 0; in pcm_sample_read()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/
H A Ddivmod.m424 * Note that this is log_base_(2ˆN) of the quotient.
25 * V -- the current comparand -- initially divisor*2ˆ(ITER*N-1)
28 * CEIL( lg2(quotient) / N ) x ( 10 + 7N/2 ) + C
29 * a large dividend is one greater than 2ˆ(31-TOPBITS) and takes a
40 define(V, `%o5') macro
48 * $2 -- the current accumulation of quotient bits
50 * We add a new bit to $2 and either recurse or insert the bits in the quotient.
54 * V -- current comparand
57 * R', Q', V', cc'
63 ` !depth $1, accumulated bits $2
[all …]
/freebsd/sys/contrib/openzfs/module/icp/asm-x86_64/aes/
H A Daeskey.c13 * 2. binary distributions include the above copyright notice, this list
55 * 2. Changed uint_8t and uint_32t to uint8_t and uint32_t
84 k[4 * (i) + 6] = ss[2] ^= ss[1]; \
85 k[4 * (i) + 7] = ss[3] ^= ss[2]; \
95 rk[2] = ss[2] = word_in(key, 2); in aes_encrypt_key128()
100 ke4(rk, 2); ke4(rk, 3); in aes_encrypt_key128()
118 k[6 * (i) + 8] = ss[2] ^= ss[1]; \
119 k[6 * (i) + 9] = ss[3] ^= ss[2]; \
135 rk[2] = ss[2] = word_in(key, 2); in aes_encrypt_key192()
142 ke6(rk, 2); ke6(rk, 3); in aes_encrypt_key192()
[all …]
/freebsd/contrib/bearssl/src/int/
H A Di31_montmul.c34 * d <- (d + xu*y + f*m) / 2^31 in br_i31_montymul()
35 * We have xu <= 2^31-1 and f <= 2^31-1. in br_i31_montymul()
36 * Thus, if d <= 2*m-1 on input, then: in br_i31_montymul()
37 * 2*m-1 + 2*(2^31-1)*m <= (2^32)*m-1 in br_i31_montymul()
38 * and the new d value is less than 2*m. in br_i31_montymul()
43 size_t len, len4, u, v; in br_i31_montymul() local
53 * d[v+1] <= 2^31-1 in br_i31_montymul()
54 * xu*y[v+1] <= (2^31-1)*(2^31-1) in br_i31_montymul()
55 * f*m[v+1] <= (2^31-1)*(2^31-1) in br_i31_montymul()
56 * r <= 2^32-1 in br_i31_montymul()
[all …]
H A Di62_modpow2.c86 fmatt = (fma1lo >> 2) + (fma2lo >> 2) \
87 + ((v1) >> 2) + ((v2) >> 2); \
88 (lo) = fmatt << 2; \
160 size_t v; in montymul() local
165 xu = x[u] << 2; in montymul()
166 f = MUL62_lo(d[0] + MUL62_lo(x[u], y[0]), m0i) << 2; in montymul()
168 FMA2(hi, lo, xu, y[0], f, m[0], d[0] << 2, 0); in montymul()
171 for (v = 1; v < num4; v += 4) { in montymul()
172 FMA2(hi, lo, xu, y[v + 0], in montymul()
173 f, m[v + 0], d[v + 0] << 2, r << 2); in montymul()
[all …]
/freebsd/sys/opencrypto/
H A Dgfmult.c12 * 2. Redistributions in binary form must reproduce the above copyright
40 /* calculate v * 2 */
42 gf128_mulalpha(struct gf128 v) in gf128_mulalpha() argument
46 mask = !!(v.v[1] & 1); in gf128_mulalpha()
48 v.v[1] = (v.v[1] >> 1) | ((v.v[0] & 1) << 63); in gf128_mulalpha()
49 v.v[0] = (v.v[0] >> 1) ^ ((mask & REV_POLY_REDUCT) << 56); in gf128_mulalpha()
51 return v; in gf128_mulalpha()
67 for (i = 2; i < 16; i += 2) { in gf128_genmultable()
68 tbl[i] = gf128_mulalpha(tbl[i / 2]); in gf128_genmultable()
73 t->a[nib_rev[i]] = tbl[i].v[0] >> 32; in gf128_genmultable()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Dhexagon_types.h72 #define HEXAGON_V64_GET_D(v) (v) argument
73 #define HEXAGON_V64_GET_UD(v) ((unsigned long long)(v)) argument
77 #define HEXAGON_V64_GET_W0(v) \ argument
81 int w[2]; \
83 _HEXAGON_V64_internal_union.d = (v); \
86 #define HEXAGON_V64_GET_W1(v) \ argument
90 int w[2]; \
92 _HEXAGON_V64_internal_union.d = (v); \
95 #define HEXAGON_V64_GET_UW0(v) \ argument
99 unsigned int uw[2]; \
[all …]
/freebsd/sys/crypto/siphash/
H A Dsiphash.c10 * 2. Redistributions in binary form must reproduce the above copyright
58 ctx->v[0] = 0x736f6d6570736575ull; in SipHash_InitX()
59 ctx->v[1] = 0x646f72616e646f6dull; in SipHash_InitX()
60 ctx->v[2] = 0x6c7967656e657261ull; in SipHash_InitX()
61 ctx->v[3] = 0x7465646279746573ull; in SipHash_InitX()
73 uint64_t k[2]; in SipHash_SetKey()
75 KASSERT(ctx->v[0] == 0x736f6d6570736575ull && in SipHash_SetKey()
82 ctx->v[0] ^= k[0]; in SipHash_SetKey()
83 ctx->v[ in SipHash_SetKey()
[all...]
/freebsd/sys/powerpc/include/
H A Datomic.h2 * SPDX-License-Identifier: BSD-2-Clause
15 * 2. Redistributions in binary form must reproduce the above copyright
44 * of this file. See also Appendix B.2 of Book II of the architecture manual.
78 * atomic_add(p, v)
79 * { *p += v; }
82 #define __atomic_add_int(p, v, t) \ argument
84 "1: lwarx %0, 0, %2\n" \
86 " stwcx. %0, 0, %2\n" \
89 : "r" (p), "r" (v), "m" (*p) \
94 #define __atomic_add_long(p, v, t) \ argument
[all …]
/freebsd/sys/dev/wg/
H A Dwg_crypto.c53 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 },
54 { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 },
55 { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 },
56 { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 },
57 { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 },
58 { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 },
59 { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 },
60 { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 },
61 { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 },
62 { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13, 0 },
[all …]
/freebsd/crypto/openssl/providers/implementations/digests/
H A Dblake2b_prov.c33 { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 } ,
34 { 14, 10, 4, 8, 9, 15, 13, 6, 1, 12, 0, 2, 11, 7, 5, 3 } ,
35 { 11, 8, 12, 0, 5, 2, 15, 13, 10, 14, 3, 6, 7, 1, 9, 4 } ,
36 { 7, 9, 3, 1, 13, 12, 11, 14, 2, 6, 5, 10, 4, 0, 15, 8 } ,
37 { 9, 0, 5, 7, 2, 4, 10, 15, 14, 1, 11, 12, 6, 8, 3, 13 } ,
38 { 2, 12, 6, 10, 0, 11, 8, 3, 4, 13, 7, 5, 15, 14, 1, 9 } ,
39 { 12, 5, 1, 15, 14, 13, 4, 10, 0, 7, 6, 3, 9, 2, 8, 11 } ,
40 { 13, 11, 7, 14, 12, 1, 3, 9, 5, 0, 15, 4, 8, 6, 2, 10 } ,
41 { 6, 15, 14, 9, 11, 3, 0, 8, 12, 2, 13, 7, 1, 4, 10, 5 } ,
42 { 10, 2, 8, 4, 7, 6, 1, 5, 15, 11, 9, 14, 3, 12, 13 , 0 } ,
[all …]

12345678910>>...54