Home
last modified time | relevance | path

Searched +full:4 +full:k (Results 1 – 25 of 1626) sorted by relevance

12345678910>>...66

/freebsd-src/tools/regression/ccd/layout/
H A Dccd0.sh8 f="${1}_${2}_${3}_${4}_${5}_${6}"
10 sh ccd.sh $1 $2 $3 $4 $5 $6 > _.$f
16 foo 128k 128k 128k 128k 0 0
17 foo 128k 128k 128k 128k 0 4
18 foo 128k 128k 128k 128k 4 0
19 foo 128k 128k 128k 128k 4 2
20 foo 128k 128k 128k 128k 4 4
22 foo 256k 128k 128k 128k 0 0
23 foo 256k 128k 128k 128k 0 4
24 foo 256k 128k 128k 128k 4 0
[all …]
/freebsd-src/crypto/openssl/crypto/modes/asm/
H A Daes-gcm-armv8_64.pl20 # main loop to act on 4 16B blocks per iteration, and then do modulo of the accumulated intermediat…
27 # | CTR block 4k+8 | AES block 4k+4 | GHASH block 4k+0 |
30 # | CTR block 4k+9 | AES block 4k+5 | GHASH block 4k+1 |
33 # | CTR block 4k+10| AES block 4k+6 | GHASH block 4k+2 |
36 # | CTR block 4k+11| AES block 4k+7 | GHASH block 4k+3 |
43 # Ensure previous generated intermediate hash is aligned and merged with result for GHASH 4k+0
45 # EOR res_curr (4k+0), res_curr (4k+0), low_acc
109 # We only have 64b->128b polynomial multipliers, naively that means we need to do 4 64b multipl…
169 my ($end_input_ptr,$main_end_input_ptr,$input_l0,$input_h0)=map("x$_",(4..7));
181 my ($res0q,$res1q,$res2q,$res3q)=map("q$_",(4..7));
[all …]
/freebsd-src/sys/crypto/openssl/aarch64/
H A Daes-gcm-armv8_64.S9 .align 4
39 ld1 {v18.4s}, [x8], #16 //load rk0
53 ld1 {v19.4s}, [x8], #16 //load rk1
73 ld1 {v20.4s}, [x8], #16 //load rk2
84 ld1 {v21.4s}, [x8], #16 //load rk3
95 ld1 {v22.4s}, [x8], #16 //load rk4
99 ld1 {v23.4s}, [x8], #16 //load rk5
107 ld1 {v24.4s}, [x8], #16 //load rk6
111 ld1 {v25.4s}, [x8], #16 //load rk7
119 ld1 {v26.4s}, [x8], #16 //load rk8
[all …]
H A Dsha1-armv8.S50 add w23,w23,w28 // future e+=K
64 add w22,w22,w28 // future e+=K
75 add w21,w21,w28 // future e+=K
89 add w20,w20,w28 // future e+=K
100 add w24,w24,w28 // future e+=K
114 add w23,w23,w28 // future e+=K
125 add w22,w22,w28 // future e+=K
139 add w21,w21,w28 // future e+=K
150 add w20,w20,w28 // future e+=K
164 add w24,w24,w28 // future e+=K
[all …]
/freebsd-src/sys/contrib/openzfs/module/icp/asm-x86_64/aes/
H A Daeskey.c37 * values correspond with Nk values of 4, 6 and 8 respectively.
43 * nk = 4 5 6 7 8
45 * cx->n_col = 4 10 9 8 7 7
57 * 4. Removed always-defined ifdefs FUNCS_IN_C, ENC_KEYING_IN_C,
81 #define ke4(k, i) \ argument
82 { k[4 * (i) + 4] = ss[0] ^= ls_box(ss[3], 3) ^ t_use(r, c)[i]; \
83 k[4 * (i) + 5] = ss[1] ^= ss[0]; \
84 k[4 * (i) + 6] = ss[2] ^= ss[1]; \
85 k[4 * (i) + 7] = ss[3] ^= ss[2]; \
91 uint32_t ss[4]; in aes_encrypt_key128()
[all …]
/freebsd-src/crypto/openssl/test/recipes/04-test_pem_reading_data/
H A Ddsa-onecolumn.pem2 Proc-Type: 4,ENCRYPTED
31 k
33 4
72 K
81 K
89 4
92 K
148 k
167 4
173 k
[all …]
H A Dcert-onecolumn.pem19 k
32 k
35 k
385 k
437 4
825 k
877 4
911 4
921 K
945 K
[all …]
/freebsd-src/contrib/file/tests/
H A Dmatilde.arm.testfile2 <[d��y�����'��P�[<k��0^���<j~yJ/�!ݘG&�� ���e�4ta��+a�<�p�������(����n����{i�/�8A�<� ٫7…
3 …< pq��r�y�+��i1{���/Y?SP�E�����<@�l5v����S�b�mS# ����I�=���<6\��r$���K:�z�Ceo5����苭�<2�d�…
6 … Pg����*�0�*=�K|�K~��%PS�k`<� mJ���,��=�Fxh �� S �<Cg��!ˀj1�`��b�\�~.փ�$$瑰<<�r?��…
9 !�:���=K����[��<Ɖ�lH��!L��-��I��w�9:y��<�U'�ԫ�Lc�\vyY>�Ԫ�ϧ�4p<&@i�~#�������)J$��
10 ��[��ơ���<&@�����(�\�W�!"-@��C]�4�<&F����*�2;[��v�w�>�=�����<!x @;����e�R!���F�iW�…
11 …lFaP< ���I�a-��0� Z���p~iz�PP��� �<4xcC��`���x��{��Z\DT�~�;Y��<2�i�'��=�j"\�a�d�>Pa�A:N�…
13 ]��o�<xm�a'H��K�_��1_���A��G�M�@<��o�a��5�6!l4�
14 ,�3۳ޢl�<`e�/ wb��0���n�(R�! p&�K�0<& qX�?��kƳ��y���fD�.+2D��`<L{��K��E2�)5Em@Z�.�fN@…
H A DHWP97.hwp.testfile1 …4��� �2�0��� ���a��� ����� �1�:�5�0�:�4�4���������������������������������������������������������…
2 m��9eI��yؾ�s�N��i�� ���cWgg�K�q1�3.&}�=��k9�r��+w�u�xp
5 …���$��܅y҅���\t�8���#S&O� 貔������ �Z��SV��u�C�:�!g���阔���5*;�L޷4e�<� ������w��N�k��Kf{�iq���…
6 �1n��n$�d���-%R!6O�B��^묘j���-x��������6��J�}��F ��NK�Y�Q�u�9��F�Ŋ��0��+&�Iw4�I��{�fߍǮ����9…
8 …�Փ3Q׻�"����l����a�ˤ�&W:Ln�VdR�u�;*g�^���|�N���צ��{��h_ \��t�:K�Y�>�� i����P�G2i�3�…
14 �bo�����Z�rb����^r~�Kο᮹u�'n�S���8&.!��K���y�p���b����@�>`����(G�9Zp~QX�Ve�
15 �U��s�]�Y �}#�ѽ�k�"!����9v����ߕa�/튏ٰ�������g, ��IL����'.��\`Q�3�kpr��zo�p�s��� ? G.*�
17 lK ��ߥk��'��9��%i&�G��b$�Q ��$M�V�0N4��R4��\&�\$���c�
/freebsd-src/sys/contrib/openzfs/tests/zfs-tests/tests/functional/vdev_disk/
H A Dpage_alignment.c124 "512B blocks, 4K single page",
129 "512B blocks, 1K at start of page",
134 "512B blocks, 1K at end of page",
139 "512B blocks, 1K within page, 512B start offset",
144 "512B blocks, 8K across 2x4K pages",
150 "512B blocks, 4K across two pages, 2K start offset",
156 "512B blocks, 16K acros
[all...]
/freebsd-src/sys/libkern/
H A Djenkins_hash.c33 4-byte integers to hash, use hashword(). If you have a byte array (like
37 Why is this so big? I read 12 bytes at a time into 3 4-byte integers,
44 #define rot(x,k) (((x)<<(k)) | ((x)>>(32-(k)))) argument
67 Some k values for my "a-=c; a^=rot(c,k); c+=b;" arrangement that
69 4 6 8 16 19 4
92 a -= c; a ^= rot(c, 4); c += b; \
97 c -= b; c ^= rot(b, 4); b += a; \
117 14 11 25 16 4 14 24
118 12 14 25 16 4 14 24
120 4 8 15 26 3 22 24
[all …]
H A Dmurmur3_32.c40 * length of the input is always a multiple of 4 bytes.
46 uint32_t hash, k; in murmur3_32_hash() local
55 while (res >= 4) { in murmur3_32_hash()
57 k = le32dec(bytes); in murmur3_32_hash()
58 bytes += 4; in murmur3_32_hash()
59 res -= 4; in murmur3_32_hash()
60 k *= 0xcc9e2d51; in murmur3_32_hash()
61 k = rol32(k, 15); in murmur3_32_hash()
62 k *= 0x1b873593; in murmur3_32_hash()
63 hash ^= k; in murmur3_32_hash()
[all …]
/freebsd-src/crypto/openssl/crypto/chacha/asm/
H A Dchacha-armv8.pl23 # Replace 3xNEON+1xIALU code path with 4+1. 4+1 is actually fastest
34 # IALU/gcc-4.9 4xNEON+1xIALU 6xNEON+2xIALU
45 # (*) slower than 4+1:-(
68 my ($out,$inp,$len,$key,$ctr) = map("x$_",(0..4));
147 .long 1,2,3,4
182 ldp @d[4],@d[5],[$key,#16]
187 ror @d[4],@d[4],#32
198 mov.32 @x[4],@d[2]
202 mov.32 @x[8],@d[4]
203 lsr @x[9],@d[4],#32
[all …]
H A Dchacha-s390x.pl26 # Add vx code path: 4x"vertical".
35 # 4x"vertical" submission [on z13] and >3 faster than scalar code.
37 # from chacha-ppc module, which is also 4x"vertical", to handle inputs
53 $SIZE_T=4;
60 my $stdframe=16*$SIZE_T+4*8;
76 # 0 4 8 12 < even round
83 # 3 4 9 14
121 stm ($xc,$xc_,"$stdframe+4*8+4*$c0($sp)"); # reload pair of 'c's
122 lm ($xc,$xc_,"$stdframe+4*8+4*$c2($sp)");
237 vsldb (@b[$_],@b[$_],@b[$_],$odd?12:4) for (0..5);
[all …]
/freebsd-src/crypto/openssl/crypto/whrlpool/
H A Dwp_block.c159 * 4KB large unconditionally. Otherwise if ROTATE is defined, the
163 * could handle unaligned load as 4KB table doesn't trash the cache,
182 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
183 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
184 # define C2(K,i) ROTATE(Cx.q[K.c[(i)*8+2]],16) argument
185 # define C3(K,i) ROTATE(Cx.q[K.c[(i)*8+3]],24) argument
186 # define C4(K,i) ROTATE(Cx.q[K.c[(i)*8+4]],32) argument
187 # define C5(K,i) ROTATE(Cx.q[K.c[(i)*8+5]],40) argument
188 # define C6(K,i) ROTATE(Cx.q[K.c[(i)*8+6]],48) argument
189 # define C7(K,i) ROTATE(Cx.q[K.c[(i)*8+7]],56) argument
[all …]
/freebsd-src/contrib/unbound/util/storage/
H A Dlookup3.c39 4-byte integers to hash, use hashword(). If you have a byte array (like
43 Why is this so big? I read 12 bytes at a time into 3 4-byte integers,
118 #define rot(x,k) (((x)<<(k)) | ((x)>>(32-(k)))) argument
150 Some k values for my "a-=c; a^=rot(c,k); c+=b;" arrangement that
152 4 6 8 16 19 4
175 a -= c; a ^= rot(c, 4);
233 hashword(const uint32_t * k,size_t length,uint32_t initval) hashword() argument
281 hashword2(const uint32_t * k,size_t length,uint32_t * pc,uint32_t * pb) hashword2() argument
356 const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */ hashlittle() local
424 const uint16_t *k = (const uint16_t *)key; /* read 16-bit chunks */ hashlittle() local
471 const uint8_t *k = (const uint8_t *)key; hashlittle() local
555 const uint32_t *k = (const uint32_t *)key; /* read 32-bit chunks */ hashlittle2() local
623 const uint16_t *k = (const uint16_t *)key; /* read 16-bit chunks */ hashlittle2() local
670 const uint8_t *k = (const uint8_t *)key; hashlittle2() local
880 uint32_t c[HASHSTATE], d[HASHSTATE], i=0, j=0, k, l, m=0, z; driver2() local
[all...]
/freebsd-src/sys/contrib/dpdk_rte_lpm/
H A Drte_jhash.h39 #define rot(x, k) (((x) << (k)) | ((x) >> (32-(k)))) argument
43 a -= c; a ^= rot(c, 4); c += b; \
48 c -= b; c ^= rot(b, 4); b += a; \
56 a ^= c; a -= rot(c, 4); \
65 #define BIT_SHIFT(x, y, k) (((x) >> (k)) | ((uint64_t)(y) << (32-(k)))) argument
67 #define BIT_SHIFT(x, y, k) (((uint64_t)(x) << (k)) | ((y) >> (32-(k))))
89 const uint32_t *k = (const uint32_t *)key; in __rte_jhash_2hashes() local
92 const uint32_t *k = (uint32_t *)((uintptr_t)key & (uintptr_t)~3); in __rte_jhash_2hashes() local
97 a += k[0]; in __rte_jhash_2hashes()
98 b += k[1]; in __rte_jhash_2hashes()
[all …]
/freebsd-src/contrib/libdiff/lib/
H A Ddiff_myers.c61 * k-1 0 1 2 3 4 5
71 * 4 o-o-o-o-o-o c1
90 * d: the step number, starting with 0, a.k.a. the distance from the starting
92 * k: relative index in the state array for the forward scan, indicating on
101 * k= | c=
102 * 4 | 3
108 * 1 | 1,0 4,3 >= 4,3 5,4<-- 0
110 * 0 | -->0,0 3,3 4,4 -1
112 * -1 | 0,1 1,2 3,4 -2
128 * Also note that from the diagonal index k and the x coordinate, the y
[all …]
/freebsd-src/crypto/openssl/crypto/cast/
H A Dc_skey.c21 A[n/4]=l; \
36 CAST_LONG k[32]; in CAST_set_key() local
37 CAST_LONG X[4], Z[4]; in CAST_set_key()
38 CAST_LONG l, *K; in CAST_set_key() local
52 K = &k[0]; in CAST_set_key()
54 X[1] = ((x[4] << 24) | (x[5] << 16) | (x[6] << 8) | x[7]) & 0xffffffffL; in CAST_set_key()
63 CAST_exp(l, Z, z, 4); in CAST_set_key()
64 l = X[3] ^ S4[z[7]] ^ S5[z[6]] ^ S6[z[5]] ^ S7[z[4]] ^ S4[x[9]]; in CAST_set_key()
69 K[0] = S4[z[8]] ^ S5[z[9]] ^ S6[z[7]] ^ S7[z[6]] ^ S4[z[2]]; in CAST_set_key()
70 K[1] = S4[z[10]] ^ S5[z[11]] ^ S6[z[5]] ^ S7[z[4]] ^ S5[z[6]]; in CAST_set_key()
[all …]
/freebsd-src/crypto/openssl/crypto/camellia/
H A Dcamellia.c36 * while code size grows 4 or 7 times. Also, unlike previous versions
286 int Camellia_Ekeygen(int keyBitLength, const u8 *rawKey, KEY_TABLE_TYPE k) in Camellia_Ekeygen() argument
290 k[0] = s0 = GETU32(rawKey); in Camellia_Ekeygen()
291 k[1] = s1 = GETU32(rawKey + 4); in Camellia_Ekeygen()
292 k[2] = s2 = GETU32(rawKey + 8); in Camellia_Ekeygen()
293 k[3] = s3 = GETU32(rawKey + 12); in Camellia_Ekeygen()
296 k[8] = s0 = GETU32(rawKey + 16); in Camellia_Ekeygen()
297 k[9] = s1 = GETU32(rawKey + 20); in Camellia_Ekeygen()
299 k[10] = s2 = ~s0; in Camellia_Ekeygen()
300 k[11] = s3 = ~s1; in Camellia_Ekeygen()
[all …]
/freebsd-src/crypto/openssl/crypto/cast/asm/
H A Dcast-586.pl28 $K="ebp";
44 &cbc("CAST_cbc_encrypt","CAST_encrypt","CAST_decrypt",1,4,5,3,-1,-1);
73 &mov($K,&wparam(1));
79 &mov($R,&DWP(4,$tmp2,"",0));
82 &mov($tmp3,&DWP(128,$K,"",0));
95 &E_CAST( 0,$S,$L,$R,$K,@F1,$tmp1,$tmp2,$tmp3,$tmp4);
96 &E_CAST( 1,$S,$R,$L,$K,@F2,$tmp1,$tmp2,$tmp3,$tmp4);
97 &E_CAST( 2,$S,$L,$R,$K,@F3,$tmp1,$tmp2,$tmp3,$tmp4);
98 &E_CAST( 3,$S,$R,$L,$K,@F1,$tmp1,$tmp2,$tmp3,$tmp4);
99 &E_CAST( 4,$S,$L,$R,$K,@F2,$tmp1,$tmp2,$tmp3,$tmp4);
[all …]
/freebsd-src/sys/contrib/zlib/
H A Dcrc32.c34 each word consists of W bytes (4 or 8). If N is 3, for example, then three
36 indices in the array of words: 0, 3, 6, ..., 1, 4, 7, ..., and 2, 5, 8, ...
40 W must be 4 or 8. The upper limit on N can be increased if desired by adding
48 with N=5, W=8. The Sparc, PowerPC, and MIPS64 were all fastest at N=5, W=4.
85 # define W 4
94 # define W 4
124 # else /* W == 4 */ in byte_swap()
173 Return x^(n * 2^k) modulo p(x). Requires that x2n_table[] has been
176 local z_crc_t x2nmodp(z_off64_t n, unsigned k) { in x2nmodp() argument
182 p = multmodp(x2n_table[k & 31], p); in x2nmodp()
[all …]
/freebsd-src/sys/contrib/libsodium/src/libsodium/crypto_stream/chacha20/dolbeau/
H A Dchacha20_dolbeau-ssse3.c32 chacha_keysetup(chacha_ctx *ctx, const uint8_t *k) in chacha_keysetup() argument
38 ctx->input[4] = LOAD32_LE(k + 0); in chacha_keysetup()
39 ctx->input[5] = LOAD32_LE(k + 4); in chacha_keysetup()
40 ctx->input[6] = LOAD32_LE(k + 8); in chacha_keysetup()
41 ctx->input[7] = LOAD32_LE(k + 12); in chacha_keysetup()
42 ctx->input[8] = LOAD32_LE(k + 16); in chacha_keysetup()
43 ctx->input[9] = LOAD32_LE(k + 20); in chacha_keysetup()
44 ctx->input[10] = LOAD32_LE(k + 24); in chacha_keysetup()
45 ctx->input[11] = LOAD32_LE(k + 28); in chacha_keysetup()
52 ctx->input[13] = counter == NULL ? 0 : LOAD32_LE(counter + 4); in chacha_ivsetup()
[all …]
H A Dchacha20_dolbeau-avx2.c37 chacha_keysetup(chacha_ctx *ctx, const uint8_t *k) in chacha_keysetup() argument
43 ctx->input[4] = LOAD32_LE(k + 0); in chacha_keysetup()
44 ctx->input[5] = LOAD32_LE(k + 4); in chacha_keysetup()
45 ctx->input[6] = LOAD32_LE(k + 8); in chacha_keysetup()
46 ctx->input[7] = LOAD32_LE(k + 12); in chacha_keysetup()
47 ctx->input[8] = LOAD32_LE(k + 16); in chacha_keysetup()
48 ctx->input[9] = LOAD32_LE(k + 20); in chacha_keysetup()
49 ctx->input[10] = LOAD32_LE(k + 24); in chacha_keysetup()
50 ctx->input[11] = LOAD32_LE(k + 28); in chacha_keysetup()
57 ctx->input[13] = counter == NULL ? 0 : LOAD32_LE(counter + 4); in chacha_ivsetup()
[all …]
/freebsd-src/lib/libc/string/
H A Dmemmem.c29 twobyte_memmem(const unsigned char *h, size_t k, const unsigned char *n) in twobyte_memmem() argument
32 for (h += 2, k -= 2; k; k--, hw = hw << 8 | *h++) in twobyte_memmem()
39 threebyte_memmem(const unsigned char *h, size_t k, const unsigned char *n) in threebyte_memmem() argument
43 for (h += 3, k -= 3; k; k--, hw = (hw | *h++) << 8) in threebyte_memmem()
50 fourbyte_memmem(const unsigned char *h, size_t k, const unsigned char *n) in fourbyte_memmem() argument
54 for (h += 4, k -= 4; k; k--, hw = hw << 8 | *h++) in fourbyte_memmem()
56 return (char *)h - 4; in fourbyte_memmem()
57 return hw == nw ? (char *)h - 4 : 0; in fourbyte_memmem()
79 size_t i, ip, jp, k, p, ms, p0, mem, mem0; in twoway_memmem() local
90 k = p = 1; in twoway_memmem()
[all …]

12345678910>>...66