Home
last modified time | relevance | path

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

12345678910>>...50

/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()
120 rows[1] = loadu_128((uint8_t *)&cv[4]); in compress_pre()
121 rows[2] = set4(IV[0], IV[1], IV[2], IV[3]); in compress_pre()
126 __m128i m1 = loadu_128(&block[sizeof(__m128i) * 1]); in compress_pre()
132 // Round 1. The first round permutes the message words from the original 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 …]
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()
87 rows[1] = loadu((uint8_t *)&cv[4]); in compress_pre()
88 rows[2] = set4(IV[0], IV[1], IV[2], IV[3]); 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()
93 rows[1] = loadu((uint8_t *)&cv[4]); in compress_pre()
94 rows[2] = set4(IV[0], IV[1], IV[2], IV[3]); in compress_pre()
99 __m128i m1 = loadu(&block[sizeof(__m128i) * 1]); in compress_pre()
105 // Round 1. The first round permutes the message words from the original in compress_pre()
[all …]
/freebsd/bin/sh/tests/expansion/
H A Darith2.05 if [ $(($1)) != $2 ]; then
6 failures=$((failures+1))
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
[all …]
/freebsd/contrib/bc/tests/bc/
H A Ddivmod.txt2 v = divmod(0, 1, v[]); v[0]; v
3 v = divmod(0, 321566, v[]); v[0]; v
4 v = divmod(0, 0.3984567238456, v[]); v[0]; v
5 v = divmod(1, 1, v[]); v[0]; v
6 v = divmod(1, 1287469297356, v[]); v[0]; v
7 v = divmod(1, 0.2395672438567234, v[]); v[0]; v
8 v = divmod(1, 237586239856.0293596728392360, v[]); v[0]; v
9 v = divmod(1249687284356, 3027949207835207, v[]); v[0]; v
10 v = divmod(378617298617396719, 35748521, v[]); v[0]; v
11 v = divmod(9348576237845624358, 0.9857829375461, v[]); v[0]; v
[all …]
/freebsd/sys/contrib/openzfs/module/zcommon/
H A Dzfs_fletcher_superscalar4.c62 A = ctx->superscalar[0].v[0] + ctx->superscalar[0].v[1] + in fletcher_4_superscalar4_fini()
63 ctx->superscalar[0].v[2] + ctx->superscalar[0].v[3]; in fletcher_4_superscalar4_fini()
64 B = 0 - ctx->superscalar[0].v[1] - 2 * ctx->superscalar[0].v[2] - in fletcher_4_superscalar4_fini()
65 3 * ctx->superscalar[0].v[3] + 4 * ctx->superscalar[1].v[0] + in fletcher_4_superscalar4_fini()
66 4 * ctx->superscalar[1].v[1] + 4 * ctx->superscalar[1].v[2] + in fletcher_4_superscalar4_fini()
67 4 * ctx->superscalar[1].v[3]; in fletcher_4_superscalar4_fini()
69 C = ctx->superscalar[0].v[2] + 3 * ctx->superscalar[0].v[3] - in fletcher_4_superscalar4_fini()
70 6 * ctx->superscalar[1].v[0] - 10 * ctx->superscalar[1].v[1] - in fletcher_4_superscalar4_fini()
71 14 * ctx->superscalar[1].v[2] - 18 * ctx->superscalar[1].v[3] + in fletcher_4_superscalar4_fini()
72 16 * ctx->superscalar[2].v[0] + 16 * ctx->superscalar[2].v[1] + in fletcher_4_superscalar4_fini()
[all …]
H A Dzfs_fletcher_superscalar.c61 A = ctx->superscalar[0].v[0] + ctx->superscalar[0].v[1]; in fletcher_4_superscalar_fini()
62 B = 2 * ctx->superscalar[1].v[0] + 2 * ctx->superscalar[1].v[1] - in fletcher_4_superscalar_fini()
63 ctx->superscalar[0].v[1]; in fletcher_4_superscalar_fini()
64 C = 4 * ctx->superscalar[2].v[0] - ctx->superscalar[1].v[0] + in fletcher_4_superscalar_fini()
65 4 * ctx->superscalar[2].v[1] - 3 * ctx->superscalar[1].v[1]; in fletcher_4_superscalar_fini()
66 D = 8 * ctx->superscalar[3].v[0] - 4 * ctx->superscalar[2].v[0] + in fletcher_4_superscalar_fini()
67 8 * ctx->superscalar[3].v[1] - 8 * ctx->superscalar[2].v[1] + in fletcher_4_superscalar_fini()
68 ctx->superscalar[1].v[1]; in fletcher_4_superscalar_fini()
81 a = ctx->superscalar[0].v[0]; in fletcher_4_superscalar_native()
82 b = ctx->superscalar[1].v[0]; in fletcher_4_superscalar_native()
[all …]
/freebsd/crypto/openssl/doc/designs/quic-design/images/
H A Dquic-concurrency-models.svg1 …v"><path d="M0 0h3575v1622.546H0Z" transform="matrix(.33343 0 0 .33343 -994.875 -362)" clip-rule="…
/freebsd/sys/dev/sound/pcm/
H A Dpcm.h14 * 1. Redistributions of source code must retain the above copyright
50 #define SND_PCM_64 1
95 #define PCM_S32_MIN (-0x7fffffff - 1)
99 #define PCM_8_BPS 1
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, e, m; in pcm_sample_read() local
[all …]
/freebsd/contrib/bc/src/
H A Dvector.c46 bc_vec_grow(BcVec* restrict v, size_t n) in bc_vec_grow() argument
53 cap = v->cap; in bc_vec_grow()
54 len = v->len + n; in bc_vec_grow()
69 v->v = bc_vm_realloc(v->v, bc_vm_arraySize(cap, v->size)); in bc_vec_grow()
70 v->cap = cap; in bc_vec_grow()
76 bc_vec_init(BcVec* restrict v, size_t esize, BcDtorType dtor) in bc_vec_init() argument
80 assert(v != NULL && esize); in bc_vec_init()
82 v->v = bc_vm_malloc(bc_vm_arraySize(BC_VEC_START_CAP, esize)); in bc_vec_init()
84 v->size = (BcSize) esize; in bc_vec_init()
85 v->cap = BC_VEC_START_CAP; in bc_vec_init()
[all …]
/freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/
H A Dcert-onecolumn.pem61 V
76 V
89 v
99 V
128 V
136 1
144 V
153 v
195 1
202 V
[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/opencrypto/
H A Dgfmult.c10 * 1. Redistributions of source code must retain 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()
47 mask = ~(mask - 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()
65 tbl[1] = h; in gf128_genmultable()
69 tbl[i + 1] = gf128_add(tbl[i], h); in gf128_genmultable()
[all …]
/freebsd/sys/contrib/openzfs/cmd/
H A Dzarcstat.in4 # Print out ZFS ARC Statistics exported via kstat(1)
5 # For a definition of fields, or usage, use zarcstat -v
46 # Fields have a fixed width. Every interval, we fill the "v"
47 # hash with its corresponding value (v[field]=value) using calculate().
66 "time": [8, -1, "Time"],
238 fields, stats = fs[0], fs[1:]
246 coldesc = fieldval[1] + " " + statval[1]
249 cols[colname + "%"] = [len(colname) + 1, 100, \
252 v = {}
259 sint = 1 # Default interval is 1 second
[all …]
/freebsd/sys/i386/include/
H A Datomic.h10 * 1. Redistributions of source code must retain the above copyright
68 * atomic_set_char(P, V) (*(u_char *)(P) |= (V))
69 * atomic_clear_char(P, V) (*(u_char *)(P) &= ~(V))
70 * atomic_add_char(P, V) (*(u_char *)(P) += (V))
71 * atomic_subtract_char(P, V) (*(u_char *)(P) -= (V))
73 * atomic_set_short(P, V) (*(u_short *)(P) |= (V))
74 * atomic_clear_short(P, V) (*(u_short *)(P) &= ~(V))
75 * atomic_add_short(P, V) (*(u_short *)(P) += (V))
76 * atomic_subtract_short(P, V) (*(u_short *)(P) -= (V))
78 * atomic_set_int(P, V) (*(u_int *)(P) |= (V))
[all …]
/freebsd/usr.sbin/bsnmpd/tools/libbsnmptools/
H A Dbsnmptc.c11 * 1. Redistributions of source code or documentation must retain the above
214 binary = 1; in snmp_oct2str()
263 MAX_OCTSTRING_LEN - 1); in parse_octetstring()
264 return (-1); in parse_octetstring()
267 if ((value->v.octetstring.octets = malloc(len)) == NULL) { in parse_octetstring()
268 value->v.octetstring.len = 0; in parse_octetstring()
270 return (-1); in parse_octetstring()
273 value->v.octetstring.len = len; in parse_octetstring()
274 memcpy(value->v.octetstring.octets, val, len); in parse_octetstring()
285 * DISPLAY-HINT "2d-1d-1d,1d:1d:1d.1d,1a1d:1d"
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/
H A Ddivmod.m418 * define(TOPBITS, eval( WORDSIZE - N*((WORDSIZE-1)/N) ) )
25 * V -- the current comparand -- initially divisor*2ˆ(ITER*N-1)
40 define(V, `%o5') macro
47 * $1 -- the current depth, 1<=$1<=N
54 * V -- current comparand
57 * R', Q', V', cc'
63 ` !depth $1, accumulated bits $2
64 bl L.$1.eval(TWOSUPN+$2)
65 srl V,1,V
67 subcc R,V,R
[all …]
/freebsd/crypto/krb5/src/lib/crypto/builtin/aes/
H A Daeskey.c87 k[4*(i)+5] = ss[1] ^= ss[0]; \
88 k[4*(i)+6] = ss[2] ^= ss[1]; \
92 AES_RETURN aes_xi(encrypt_key128)(const unsigned char *key, aes_encrypt_ctx cx[1]) in aes_xi()
96 cx->ks[1] = ss[1] = word_in(key, 1); in aes_xi()
101 ke4(cx->ks, 0); ke4(cx->ks, 1); in aes_xi()
118 cx->inf.b[1] = 0xff; in aes_xi()
130 k[6*(i)+ 7] = ss[1] ^= ss[0]; \
131 k[6*(i)+ 8] = ss[2] ^= ss[1]; \
141 AES_RETURN aes_xi(encrypt_key192)(const unsigned char *key, aes_encrypt_ctx cx[1]) in aes_xi()
145 cx->ks[1] = ss[1] = word_in(key, 1); in aes_xi()
[all …]
/freebsd/contrib/bsnmp/snmp_mibII/
H A DmibII_ip.c11 * 1. Redistributions of source code must retain the above copyright
29 * $Begemot: bsnmp/snmp_mibII/mibII_ip.c,v 1.11 2005/05/23 09:03:40 brandt_h Exp $
58 if (sysctlbyname("net.inet.ip.stats", &ipstat, &len, NULL, 0) == -1) { in fetch_ipstat()
60 return (-1); in fetch_ipstat()
64 return (-1); in fetch_ipstat()
67 if (sysctlbyname("net.inet.ip.intr_queue_drops", &ip_idrop, &len, NULL, 0) == -1) in fetch_ipstat()
74 if (sysctlbyname("net.inet.icmp.stats", &icmpstat, &len, NULL, 0) == -1) { in fetch_ipstat()
76 return (-1); in fetch_ipstat()
80 return (-1); in fetch_ipstat()
85 NULL, 0) == -1) { in fetch_ipstat()
[all …]
/freebsd/sys/contrib/libsodium/src/libsodium/crypto_pwhash/argon2/
H A Dargon2-fill-block-ref.c33 Apply Blake2 on columns of 64-bit words: (0,1,...,15), then in fill_block()
37 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()
45 /* Apply Blake2 on rows of 64-bit words: (0,1,16,17,...112,113), then 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()
[all …]
/freebsd/crypto/krb5/src/util/support/
H A Dt_json.c14 * 1. Redistributions of source code must retain the above copyright
78 exit(1); in err()
95 k5_json_value v; in test_array() local
106 v = k5_json_array_get(a, 2); in test_array()
107 check(k5_json_get_tid(v) == K5_JSON_TID_NULL, "array[2] tid"); in test_array()
108 v = k5_json_array_get(a, 1); in test_array()
109 check(k5_json_get_tid(v) == K5_JSON_TID_NUMBER, "array[1] tid"); in test_array()
110 check(k5_json_number_value(v) == 2, "array[1] value"); in test_array()
111 v = k5_json_array_get(a, 0); in test_array()
112 check(k5_json_get_tid(v) == K5_JSON_TID_STRING, "array[0] tid"); in test_array()
[all …]
/freebsd/sys/contrib/openzfs/module/icp/asm-x86_64/aes/
H A Daeskey.c11 * 1. source code distributions include the above copyright notice, this
55 * 1. Added header files aes_impl.h and aestab2.h
84 k[4 * (i) + 5] = ss[1] ^= ss[0]; \
85 k[4 * (i) + 6] = ss[2] ^= ss[1]; \
95 rk[1] = ss[1] = word_in(key, 1); in aes_encrypt_key128()
100 ke4(rk, 0); ke4(rk, 1); in aes_encrypt_key128()
118 k[6 * (i) + 7] = ss[1] ^= ss[0]; \
119 k[6 * (i) + 8] = ss[2] ^= ss[1]; \
135 rk[1] = ss[1] = word_in(key, 1); in aes_encrypt_key192()
142 ke6(rk, 0); ke6(rk, 1); in aes_encrypt_key192()
[all …]
/freebsd/sys/compat/linuxkpi/common/include/asm/
H A Datomic64.h8 * 1. Redistributions of source code must retain the above copyright
42 #define atomic64_add(i, v) atomic64_add_return((i), (v)) argument
43 #define atomic64_sub(i, v) atomic64_sub_return((i), (v)) argument
44 #define atomic64_inc_return(v) atomic64_add_return(1, (v)) argument
45 #define atomic64_add_negative(i, v) (atomic64_add_return((i), (v)) < 0) argument
46 #define atomic64_add_and_test(i, v) (atomic64_add_return((i), (v)) == 0) argument
47 #define atomic64_sub_and_test(i, v) (atomic64_sub_return((i), (v)) == 0) argument
48 #define atomic64_dec_and_test(v) (atomic64_sub_return(1, (v)) == 0) argument
49 #define atomic64_inc_and_test(v) (atomic64_add_return(1, (v)) == 0) argument
50 #define atomic64_dec_return(v) atomic64_sub_return(1, (v)) argument
[all …]

12345678910>>...50