Home
last modified time | relevance | path

Searched +full:2 +full:k (Results 1 – 25 of 1135) sorted by relevance

12345678910>>...46

/freebsd/share/doc/papers/sysperf/
H A Dappendix.ms17 'ev 2
23 \f2\s12\h'\\n(.lu-\w'\\*(=f'u'\\*(=f\fP\s0\h'|0u'
29 'ev 2
36 'if \\n(cm=1 'ft 2
43 'ft 2
44 'ds +K
45 'ds -K
50 'ds +K \f3
51 'ds -K \fP
59 \f2\s14\h'\\n(.lu-\w'\\$1'u'\\$1\fP\s0\h'|0u'\c
[all …]
/freebsd/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/crypto/openssl/crypto/modes/asm/
H A Daes-gcm-armv8_64.pl27 # | 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
312 rev $ctr32w, $rctr32w @ CTR block 2
314 fmov $ctr2d, $ctr96_b64x @ CTR block 2
315 orr $ctr32x, $ctr96_t32x, $ctr32x, lsl #32 @ CTR block 2
316 add $rctr32w, $rctr32w, #1 @ CTR block 2
[all …]
/freebsd/sys/crypto/openssl/aarch64/
H A Daes-gcm-armv8_64.S63 rev w9, w12 //CTR block 2
65 fmov d2, x10 //CTR block 2
66 orr x9, x11, x9, lsl #32 //CTR block 2
67 add w12, w12, #1 //CTR block 2
69 fmov v2.d[1], x9 //CTR block 2
87 aesmc v2.16b, v2.16b //AES block 2 - round 0
102 aesmc v2.16b, v2.16b //AES block 2 - round 1
103 trn2 v17.2d, v14.2d, v15.2d //h4l | h3l
115 trn1 v9.2d, v14.2d, v15.2d //h4h | h3h
118 aesmc v0.16b, v0.16b //AES block 0 - round 2
[all …]
/freebsd/sys/contrib/dpdk_rte_lpm/
H A Drte_jhash.h39 #define rot(x, k) (((x) << (k)) | ((x) >> (32-(k)))) argument
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()
99 c += k[2]; in __rte_jhash_2hashes()
103 k += 3; in __rte_jhash_2hashes()
109 c += k[2]; b += k[1]; a += k[0]; break; in __rte_jhash_2hashes()
[all …]
/freebsd/contrib/bearssl/src/ec/
H A Dec_c25519_m64.c72 * A field element is encoded as four 64-bit integers, in basis 2^63.
74 * 2^255+37.
90 w = m & (a[2] ^ b[2]); a[2] ^= w; b[2] ^= w; in f255_cswap()
109 z = (unsigned __int128)a[2] + (unsigned __int128)b[2] + (z >> 64); in f255_add()
116 * Since operands are at most 2^255+37, the sum is at most in f255_add()
117 * 2^256+74; thus, the carry cc is equal to 0, 1 or 2. in f255_add()
119 * We use: 2^255 = 19 mod p. in f255_add()
121 * the result is at most 2^255+37. in f255_add()
128 d[2] = (uint64_t)z; in f255_add()
134 unsigned char k; in f255_add()
[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
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]; \
95 rk[2] = ss[2] = word_in(key, 2); in aes_encrypt_key128()
100 ke4(rk, 2); ke4(rk, 3); in aes_encrypt_key128()
115 #define kef6(k, i) \ argument
[all …]
/freebsd/share/doc/papers/kernmalloc/
H A Dappendix.ms17 'ev 2
23 \f2\s12\h'\\n(.lu-\w'\\*(=f'u'\\*(=f\fP\s0\h'|0u'
29 'ev 2
36 'if \\n(cm=1 'ft 2
43 'ft 2
44 'ds +K
45 'ds -K
50 'ds +K \f3
51 'ds -K \fP
59 \f2\s14\h'\\n(.lu-\w'\\$1'u'\\$1\fP\s0\h'|0u'\c
[all …]
/freebsd/sys/libkern/
H A Djenkins_hash.c44 #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
150 const uint32_t *k, /* the key, an array of uint32_t values */ in jenkins_hash32() argument
157 a = b = c = 0xdeadbeef + (((uint32_t)length)<<2) + initval; in jenkins_hash32()
162 a += k[0]; in jenkins_hash32()
163 b += k[1]; in jenkins_hash32()
164 c += k[2]; in jenkins_hash32()
167 k += 3; in jenkins_hash32()
173 case 3 : c+=k[2]; in jenkins_hash32()
174 case 2 : b+=k[1]; in jenkins_hash32()
[all …]
/freebsd/contrib/unbound/util/storage/
H A Dlookup3.c118 #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
233 const uint32_t *k, /* the key, an array of uint32_t values */ in hashword() argument
240 a = b = c = raninit + (((uint32_t)length)<<2) + initval; in hashword()
245 a += k[0]; in hashword()
246 b += k[1]; in hashword()
247 c += k[2]; in hashword()
250 k += 3; in hashword()
256 case 3 : c+=k[2]; in hashword()
259 case 2 : b+=k[1]; in hashword()
[all …]
/freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/
H A Dcert-onecolumn.pem19 k
32 k
35 k
95 2
119 2
183 2
225 2
257 2
259 2
267 2
[all …]
H A Ddsa-onecolumn.pem31 k
52 2
72 K
81 K
92 K
118 2
148 k
151 2
173 k
184 2
[all …]
/freebsd/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()
34 return (char *)h - 2; in twobyte_memmem()
35 return hw == nw ? (char *)h - 2 : 0; in twobyte_memmem()
39 threebyte_memmem(const unsigned char *h, size_t k, const unsigned char *n) in threebyte_memmem() argument
41 uint32_t nw = (uint32_t)n[0] << 24 | n[1] << 16 | n[2] << 8; in threebyte_memmem()
42 uint32_t hw = (uint32_t)h[0] << 24 | h[1] << 16 | h[2] << 8; in threebyte_memmem()
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
52 uint32_t nw = (uint32_t)n[0] << 24 | n[1] << 16 | n[2] << 8 | n[3]; in fourbyte_memmem()
[all …]
H A Dstrstr.c40 uint32_t nw = (uint32_t)n[0] << 24 | n[1] << 16 | n[2] << 8; in threebyte_strstr()
41 uint32_t hw = (uint32_t)h[0] << 24 | h[1] << 16 | h[2] << 8; in threebyte_strstr()
42 for (h += 2; *h && hw != nw; hw = (hw | *++h) << 8) in threebyte_strstr()
44 return *h ? (char *)h - 2 : 0; in threebyte_strstr()
50 uint32_t nw = (uint32_t)n[0] << 24 | n[1] << 16 | n[2] << 8 | n[3]; in fourbyte_strstr()
51 uint32_t hw = (uint32_t)h[0] << 24 | h[1] << 16 | h[2] << 8 | h[3]; in fourbyte_strstr()
67 * initialized to avoid fully initializing a 1kb/2kb table.
76 size_t l, ip, jp, k, p, ms, p0, mem, mem0; in twoway_strstr() local
89 k = p = 1; in twoway_strstr()
90 while (jp + k < l) { in twoway_strstr()
[all …]
/freebsd/crypto/openssh/openbsd-compat/
H A Dmemmem.c38 twobyte_memmem(const unsigned char *h, size_t k, const unsigned char *n) in twobyte_memmem() argument
41 for (h+=2, k-=2; k; k--, hw = hw<<8 | *h++) in twobyte_memmem()
42 if (hw == nw) return (char *)h-2; in twobyte_memmem()
43 return hw == nw ? (char *)h-2 : 0; in twobyte_memmem()
47 threebyte_memmem(const unsigned char *h, size_t k, const unsigned char *n) in threebyte_memmem() argument
49 uint32_t nw = n[0]<<24 | n[1]<<16 | n[2]<<8; in threebyte_memmem()
50 uint32_t hw = h[0]<<24 | h[1]<<16 | h[2]<<8; in threebyte_memmem()
51 for (h+=3, k-=3; k; k--, hw = (hw|*h++)<<8) in threebyte_memmem()
57 fourbyte_memmem(const unsigned char *h, size_t k, const unsigned char *n) in fourbyte_memmem() argument
59 uint32_t nw = n[0]<<24 | n[1]<<16 | n[2]<<8 | n[3]; in fourbyte_memmem()
[all …]
/freebsd/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 …SP�E�����<@�l5v����S�b�mS# ����I�=���<6\��r$���K:�z�Ceo5����苭�<2�d�m!��i:�((���5pT�A( y�…
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 …B:�<6BmЩ���2Z��8Ђ�ׯ�^��lFaP< ���I�a-��0� Z���p~iz�PP��� �<4xcC��`���x��{��Z\DT�~�;Y��<…
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@…
15 …����А��0&��Y�lCZ�<z�����'h(kZ�k)վ` � ���~�<w@~� ��b9�w��⎭������\����0<:@~�e��j���cH���x�…
16 �G�� ���K)�i���
/freebsd/crypto/openssl/crypto/whrlpool/
H A Dwp_block.c114 # elif defined(__GNUC__) && __GNUC__>=2
132 # define ROTATE(a,n) ({ u64 ret; asm ("shrp %0=%1,%1,%2" \
135 # define ROTATE(a,n) ({ u64 ret; asm ("shrp %0=%1,%1,%2" \
160 * table is 2KB large, and otherwise - 16KB. 2KB table requires a
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
[all …]
/freebsd/crypto/openssl/crypto/camellia/
H A Dcamellia.c56 #define GETU32(p) (((u32)(p)[0] << 24) ^ ((u32)(p)[1] << 16) ^ ((u32)(p)[2] << 8) ^ ((u32)(p)[3]…
57 #define PUTU32(p,v) ((p)[0] = (u8)((v) >> 24), (p)[1] = (u8)((v) >> 16), (p)[2] = (u8)((v) >> 8), …
62 #define SBOX2_0222 Camellia_SBOX[2]
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()
[all …]
/freebsd/sys/contrib/ck/include/gcc/x86_64/
H A Dck_pr.h10 * 2. Redistributions in binary form must reproduce the above copyright
204 ck_pr_load_64_2(const uint64_t target[2], uint64_t v[2]) in ck_pr_load_64_2() argument
208 CK_PR_LOCK_PREFIX "cmpxchg16b %2;" in ck_pr_load_64_2()
226 ck_pr_md_load_##S##_##W(const T t[2], T v[2]) \
245 #define CK_PR_STORE_IMM(S, M, T, C, I, K) \ argument
251 : K "q" (v) \
272 #define CK_PR_STORE_S(S, T, I, K) CK_PR_STORE_IMM(S, T, T, T, I, K) argument
319 #define CK_PR_UNARY(K, S, T, C, I) \ argument
320 CK_PR_UNARY_R(K, S, T, C, I) \
321 CK_PR_UNARY_V(K, S, T, C, I)
[all …]
/freebsd/crypto/openssl/crypto/chacha/asm/
H A Dchacha-ia64.pl20 my @k = map("r$_",(16..31));
46 ADDP @k[11]=4,$key
57 { .mlx; ld4 @k[4]=[$key],8
58 movl @k[0]=0x61707865 }
59 { .mlx; ld4 @k[5]=[@k[11]],8
60 movl @k[1]=0x3320646e };;
61 { .mlx; ld4 @k[6]=[$key],8
62 movl @k[2]=0x79622d32 }
63 { .mlx; ld4 @k[7]=[@k[11]],8
64 movl @k[3]=0x6b206574 };;
[all …]
/freebsd/lib/msun/src/
H A Ds_expm1.c17 * Given x, find r and integer k such that
19 * x = k*ln2 + r, |r| <= 0.5*ln2 ~ 0.34658
24 * 2. Approximating expm1(r) by a special rational function on
27 * r*(exp(r)+1)/(exp(r)-1) = 2+ r^2/6 - r^4/360 + ...
29 * r*(exp(r)+1)/(exp(r)-1) = 2+ r^2/6 * R1(r*r)
31 * R1(r**2) = 6/r *((exp(r)+1)/(exp(r)-1) - 2/r)
33 * = 1 - r^2/60 + r^4/2520 - r^6/100800 + ...
37 * by 2**-61. In other words,
38 * R1(z) ~ 1.0 + Q1*z + Q2*z**2 + Q3*z**3 + Q4*z**4 + Q5*z**5
39 * where Q1 = -1.6666666666666567384E-2,
[all …]
/freebsd/tools/test/sort/bigtest/
H A Dkcmd21 # zh* is a 2-bytes locale
40 if ! ${FILECMP} siks/sik1 siks/sik2 >siks/res.0.0 2>&1 ; then
57 if ! ${FILECMP} siks/sik1 siks/sik2 >siks/res.0.0 2>&1 ; then
74 if ! ${FILECMP} siks/sik1 siks/sik2 >siks/res.0.0 2>&1 ; then
91 if ! ${FILECMP} siks/sik1 siks/sik2 >siks/res.0.0 2>&1 ; then
101 for f1 in 1 2 3 4 5 6 7 8 9
103 for c1 in 1 2 3 4 5 10 15 20 25 30
114 if ! ${FILECMP} siks/sik1 siks/sik2 >siks/res.${f1}.${c1} 2>&1 ; then
124 ${BSDSORT} ${KEYS} -k${f1}.${c1} ${INPUT_FILE} -o siks/sik1
127 echo ${LANG} ${KEYS} -k${f1}.${c1} crash >> test.log
[all …]
/freebsd/contrib/ofed/opensm/opensm/
H A Dosm_torus.c10 * General Public License (GPL) Version 2, available from the file
61 #define SWITCH_MAX_PORTGRPS (1 + 2 * TORUS_MAX_DIM)
150 struct endpoint end[2];
158 * 2) share the same two switches as endpoints.
160 * Torus-2QoS uses one master spanning tree for multicast, of which every
188 * A t_switch used to build an N-dimensional torus will have 2N+1 port groups,
190 * port_grp[2d] => links leaving in negative direction for coordinate d
191 * port_grp[2d+1] => links leaving in positive direction for coordinate d
192 * port_grp[2N] => endpoints local to switch; i.e., hosts on switch
200 int i, j, k; member
[all …]
/freebsd/crypto/openssl/crypto/aes/asm/
H A Daes-c64xplus.pl44 @K=("A6","B6","A7","B7");
113 LDW *$KPA++[2],$Te0[0] ; zero round key
114 || LDW *$KPB++[2],$Te0[1]
119 LDW *$KPA++[2],$Te0[2]
120 || LDW *$KPB++[2],$Te0[3]
126 || MV B9,$s[2]
131 || MV B8,$s[2]
136 || LDW *$KPA++[2],$K[0] ; 1st round key
137 || LDW *$KPB++[2],$K[1]
138 SUB B0,2,B0
[all …]
/freebsd/contrib/bearssl/src/int/
H A Di15_moddiv.c45 size_t k; in cond_negate() local
50 for (k = 0; k < len; k ++) { in cond_negate()
53 aw = a[k]; in cond_negate()
55 a[k] = aw & 0x7FFF; in cond_negate()
64 * if neg = 0, then 0 <= a < 2*m
73 size_t k; in finish_mod() local
80 for (k = 0; k < len; k ++) { in finish_mod()
83 aw = a[k]; in finish_mod()
84 mw = m[k]; in finish_mod()
97 for (k = 0; k < len; k ++) { in finish_mod()
[all …]

12345678910>>...46