Home
last modified time | relevance | path

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

12345678910>>...48

/freebsd/share/doc/papers/sysperf/
H A Dappendix.ms18 'ft 1
22 'ft 1
35 'ft 1
36 'if \\n(cm=1 'ft 2
39 'pn 1
42 'nr cm 1
44 'ds +K
45 'ds -K
49 'ft 1
50 'ds +K \f3
[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/ofed/opensm/opensm/
H A Dosm_torus.c61 #define SWITCH_MAX_PORTGRPS (1 + 2 * TORUS_MAX_DIM)
114 * links, the port value is -1, as those links aren't
157 * 1) are parallel to a given coordinate direction
188 * A t_switch used to build an N-dimensional torus will have 2N+1 port groups,
191 * port_grp[2d+1] => links leaving in positive direction for coordinate d
195 * traversing a link from link.end[0] to link.end[1] is always in the positive
200 int i, j, k; member
267 * A torus dimension has coordinate values 0, 1, ..., radix - 1.
270 * radix - 1 and 0. The following specify the dateline location
274 * zero; if the shared switch is at 1,1,1, the following are all
[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
52 # INS ctr_next.d[1], ctr64X
53 # ADD rev_ctr32, #1
66 # INS res_curr.d[1], input_high
102 # MOV output_high, res_curr.d[1]
[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
31 uint16_t nw = n[0] << 8 | n[1], hw = h[0] << 8 | h[1]; in twobyte_memmem()
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
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()
53 uint32_t hw = (uint32_t)h[0] << 24 | h[1] << 16 | h[2] << 8 | h[3]; in fourbyte_memmem()
[all …]
H A Dstrstr.c31 uint16_t nw = n[0] << 8 | n[1], hw = h[0] << 8 | h[1]; in twobyte_strstr()
34 return *h ? (char *)h - 1 : 0; in twobyte_strstr()
40 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()
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()
62 (size_t)1 << ((size_t)(b) % (8 * sizeof *(a))))
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
82 BITOP(byteset, n[l], |=), shift[n[l]] = l + 1; in twoway_strstr()
[all …]
/freebsd/sys/crypto/openssl/aarch64/
H A Daes-gcm-armv8_64.S41 sub x5, x5, #1 //byte_len - 1
48 fmov d1, x10 //CTR block 1
51 add w12, w12, #1 //increment rev_ctr32
55 rev w9, w12 //CTR block 1
56 add w12, w12, #1 //CTR block 1
59 orr x9, x11, x9, lsl #32 //CTR block 1
62 fmov v1.d[1], x9 //CTR block 1
67 add w12, w12, #1 //CTR block 2
69 fmov v2.d[1], x9 //CTR block 2
75 add w12, w12, #1 //CTR block 3
[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
40 uint16_t nw = n[0]<<8 | n[1], hw = h[0]<<8 | h[1]; in twobyte_memmem()
41 for (h+=2, k-=2; k; k--, hw = hw<<8 | *h++) 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()
60 uint32_t hw = h[0]<<24 | h[1]<<16 | h[2]<<8 | h[3]; in fourbyte_memmem()
[all …]
/freebsd/share/doc/papers/kernmalloc/
H A Dappendix.ms18 'ft 1
22 'ft 1
35 'ft 1
36 'if \\n(cm=1 'ft 2
39 'pn 1
42 'nr cm 1
44 'ds +K
45 'ds -K
49 'ft 1
50 'ds +K \f3
[all …]
H A Dusage.tbl7 .\" 1. Redistributions of source code must retain the above copyright
45 16385\-32768 1 0 1
58 mbuf 6 1K 17K 3099066
59 devbuf 13 53K 53K 13
60 socket 37 5K 6K 1275
61 pcb 55 7K 8K 1512
62 routetbl 229 29K 29K 2424
63 fragtbl 0 0K 1K 404
64 zombie 3 1K 1K 24538
65 namei 0 0K 5K 648754
[all …]
/freebsd/sys/libkern/
H A Djenkins_hash.c40 on 1 byte), but shoehorning those bytes into integers efficiently is messy.
44 #define rot(x,k) (((x)<<(k)) | ((x)>>(32-(k)))) argument
61 the output delta to a Gray code (a^(a>>1)) so a string of 1's (as
62 is commonly produced by subtraction) look like a single 1-bit
67 Some k values for my "a-=c; a^=rot(c,k); c+=b;" arrangement that
110 the output delta to a Gray code (a^(a>>1)) so a string of 1's (as
111 is commonly produced by subtraction) look like a single 1-bit
150 const uint32_t *k, /* the key, an array of uint32_t values */ in jenkins_hash32() argument
162 a += k[0]; in jenkins_hash32()
163 b += k[1]; in jenkins_hash32()
[all …]
/freebsd/contrib/unbound/util/storage/
H A Dlookup3.c46 on 1 byte), but shoehorning those bytes into integers efficiently is messy.
49 /*#define SELF_TEST 1*/
50 #define ARRAY_CLEAN_ACCESS 1
65 # define HASH_BIG_ENDIAN 1
67 # define HASH_LITTLE_ENDIAN 1
93 # define HASH_LITTLE_ENDIAN 1
99 # define HASH_BIG_ENDIAN 1
104 # define HASH_BIG_ENDIAN 1
107 # define HASH_LITTLE_ENDIAN 1
116 #define hashsize(n) ((uint32_t)1<<(n))
[all …]
/freebsd/contrib/bearssl/src/ec/
H A Dec_c25519_m64.c77 #define MASK63 (((uint64_t)1 << 63) - (uint64_t)1)
89 w = m & (a[1] ^ b[1]); a[1] ^= w; b[1] ^= w; in f255_cswap()
107 z = (unsigned __int128)a[1] + (unsigned __int128)b[1] + (z >> 64); in f255_add()
117 * 2^256+74; thus, the carry cc is equal to 0, 1 or 2. in f255_add()
126 d[1] = (uint64_t)z; in f255_add()
134 unsigned char k; in f255_add()
136 k = _addcarry_u64(0, a[0], b[0], &t0); in f255_add()
137 k = _addcarry_u64(k, a[1], b[1], &t1); in f255_add()
138 k = _addcarry_u64(k, a[2], b[2], &t2); in f255_add()
139 k = _addcarry_u64(k, a[3], b[3], &t3); in f255_add()
[all …]
/freebsd/sys/contrib/openzfs/module/icp/asm-x86_64/aes/
H A Daeskey.c10 * 1. source code distributions include the above copyright notice, this
54 * 1. Added header files aes_impl.h and aestab2.h
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]; \
94 rk[1] = ss[1] = word_in(key, 1); in aes_encrypt_key128()
99 ke4(rk, 0); ke4(rk, 1); in aes_encrypt_key128()
115 #define kef6(k, i) \ argument
[all …]
/freebsd/contrib/gdtoa/
H A Dmisc.c34 static Bigint *freelist[Kmax+1];
39 #define PRIVATE_mem ((PRIVATE_MEM+sizeof(double)-1)/sizeof(double))
46 (k) int k; in Balloc() argument
48 (int k)
58 /* The k > Kmax case does not need ACQUIRE_DTOA_LOCK(0), */
60 if (k <= Kmax && (rv = freelist[k]) !=0) {
61 freelist[k] = rv->next;
64 x = 1 << k;
66 rv = (Bigint *)MALLOC(sizeof(Bigint) + (x-1)*sizeof(ULong));
68 len = (sizeof(Bigint) + (x-1)*sizeof(ULong) + sizeof(double) - 1)
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/rsend/
H A Dsend-cpL_varied_recsize.ksh25 # 1. Check the recv behavior (into pools with features enabled and disabled)
35 # | 128k | | 128k | 128k | 128k | 128k |
36 # | 128k | -c | Fails | Fails | 128k | 128k |
37 # | 128k | -p | 128k | 128k | 128k | 128k |
38 # | 128k | -L | 128k | 128k | 128k | 128k |
39 # | 128k | -cp | Fails | Fails | 128k | 128k |
40 # | 128k | -cL | Fails | Fails | 128k | 128k |
41 # | 128k | -pL | 128k | 128k | 128k | 128k |
42 # | 128k | -cpL | Fails | Fails | 128k | 128k |
43 # | 1m | | Fails | Fails | 128k | 128k |
[all …]
/freebsd/bin/ps/
H A Dprint.c10 * 1. Redistributions of source code must retain the above copyright
94 arguments(KINFO *k, VARENT *ve) in arguments() argument
98 if ((vis_args = malloc(strlen(k->ki_args) * 4 + 1)) == NULL) in arguments()
99 xo_errx(1, "malloc failed"); in arguments()
100 strvis(vis_args, k->ki_args, VIS_TAB | VIS_NL | VIS_NOSLASH); in arguments()
109 command(KINFO *k, VARENT *ve) in command() argument
117 k->ki_d.prefix ? k->ki_d.prefix : "", in command()
118 k->ki_p->ki_comm, in command()
119 (showthreads && k->ki_p->ki_numthreads > 1) ? "/" : "", in command()
120 (showthreads && k->ki_p->ki_numthreads > 1) ? k->ki_p->ki_tdname : "", in command()
[all …]
/freebsd/crypto/openssl/test/recipes/04-test_pem_reading_data/
H A Ddsa-onecolumn.pem31 k
72 K
81 K
92 K
103 1
148 k
173 k
186 k
198 k
204 1
[all …]
H A Dcert-onecolumn.pem19 k
32 k
35 k
136 1
195 1
239 1
285 1
385 k
440 1
477 1
[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/crypto/openssl/crypto/cast/
H A Dc_enc.c22 const CAST_LONG *k; in CAST_encrypt() local
24 k = &(key->data[0]); in CAST_encrypt()
26 r = data[1]; in CAST_encrypt()
28 E_CAST(0, k, l, r, +, ^, -); in CAST_encrypt()
29 E_CAST(1, k, r, l, ^, -, +); in CAST_encrypt()
30 E_CAST(2, k, l, r, -, +, ^); in CAST_encrypt()
31 E_CAST(3, k, r, l, +, ^, -); in CAST_encrypt()
32 E_CAST(4, k, l, r, ^, -, +); in CAST_encrypt()
33 E_CAST(5, k, r, l, -, +, ^); in CAST_encrypt()
34 E_CAST(6, k, l, r, +, ^, -); in CAST_encrypt()
[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), …
61 #define SBOX4_4404 Camellia_SBOX[1]
258 _t1 = _s1 ^ (_key)[1];\
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()
[all …]
/freebsd/contrib/ldns/
H A Dkeys.c105 ldns_key_new_frm_fp(ldns_key **k, FILE *fp) in ldns_key_new_frm_fp() argument
107 return ldns_key_new_frm_fp_l(k, fp, NULL); in ldns_key_new_frm_fp()
114 ldns_key *k; in ldns_key_new_frm_engine() local
116 k = ldns_key_new(); in ldns_key_new_frm_engine()
117 if(!k) return LDNS_STATUS_MEM_ERR; in ldns_key_new_frm_engine()
119 k->_key.key = ENGINE_load_private_key(e, key_id, UI_OpenSSL(), NULL); in ldns_key_new_frm_engine()
120 if(!k->_key.key) { in ldns_key_new_frm_engine()
121 ldns_key_free(k); in ldns_key_new_frm_engine()
124 ldns_key_set_algorithm(k, (ldns_signing_algorithm) alg); in ldns_key_new_frm_engine()
125 if (!k->_key.key) { in ldns_key_new_frm_engine()
[all …]
/freebsd/sys/net/
H A Dbpf_filter.c15 * 1. Redistributions of source code must retain the above copyright
57 (u_int16_t)*((u_char *)p+1)<<0))
60 (u_int32_t)*((u_char *)p+1)<<16|\
72 #define MINDEX(m, k) \ argument
76 while (k >= len) { \
77 k -= len; \
85 static u_int16_t m_xhalf(struct mbuf *m, bpf_u_int32 k, int *err);
86 static u_int32_t m_xword(struct mbuf *m, bpf_u_int32 k, int *err);
89 m_xword(struct mbuf *m, bpf_u_int32 k, int *err) in m_xword() argument
96 while (k >= len) { in m_xword()
[all …]
/freebsd/sbin/ipf/ipf/
H A Dbpf_filter.c14 * 1. Redistributions of source code must retain the above copyright
91 (u_short)*((u_char *)p+1)<<0))
94 (u_int32)*((u_char *)p+1)<<16|\
112 m_xword(mb_t *m, int k, int *err) in m_xword() argument
118 MINDEX(len, m, k); in m_xword()
119 cp = MTOD(m, u_char *) + k; in m_xword()
120 if (len - k >= 4) { in m_xword()
125 if (m0 == NULL || M_LEN(m0) + len - k < 4) in m_xword()
129 switch (len - k) { in m_xword()
131 case 1: in m_xword()
[all …]

12345678910>>...48