| /lib/crypto/ |
| D | sha256.c | 48 u32 a, b, c, d, e, f, g, h, t1, t2; in sha256_transform() local
62 e = state[4]; f = state[5]; g = state[6]; h = state[7]; in sha256_transform()
65 t1 = h + e1(e) + Ch(e, f, g) + 0x428a2f98 + W[0]; in sha256_transform()
66 t2 = e0(a) + Maj(a, b, c); d += t1; h = t1 + t2; in sha256_transform()
68 t2 = e0(h) + Maj(h, a, b); c += t1; g = t1 + t2; in sha256_transform()
70 t2 = e0(g) + Maj(g, h, a); b += t1; f = t1 + t2; in sha256_transform()
72 t2 = e0(f) + Maj(f, g, h); a += t1; e = t1 + t2; in sha256_transform()
74 t2 = e0(e) + Maj(e, f, g); h += t1; d = t1 + t2; in sha256_transform()
75 t1 = c + e1(h) + Ch(h, a, b) + 0x59f111f1 + W[5]; in sha256_transform()
77 t1 = b + e1(g) + Ch(g, h, a) + 0x923f82a4 + W[6]; in sha256_transform()
[all …]
|
| /lib/lz4/ |
| D | lz4_compress.c | 93 U32 h, in LZ4_putPositionOnHash() argument
103 hashTable[h] = p; in LZ4_putPositionOnHash()
110 hashTable[h] = (U32)(p - srcBase); in LZ4_putPositionOnHash()
117 hashTable[h] = (U16)(p - srcBase); in LZ4_putPositionOnHash()
129 U32 const h = LZ4_hashPosition(p, tableType); in LZ4_putPosition() local
131 LZ4_putPositionOnHash(p, h, tableBase, tableType, srcBase); in LZ4_putPosition()
135 U32 h, in LZ4_getPositionOnHash() argument
143 return hashTable[h]; in LZ4_getPositionOnHash()
149 return hashTable[h] + srcBase; in LZ4_getPositionOnHash()
156 return hashTable[h] + srcBase; in LZ4_getPositionOnHash()
[all …]
|
| D | lz4hc_compress.c | 84 U32 const h = LZ4HC_hashPtr(base + idx); in LZ4HC_Insert() local
85 size_t delta = idx - hashTable[h]; in LZ4HC_Insert()
92 hashTable[h] = idx; in LZ4HC_Insert()
|
| /lib/ |
| D | .gitignore | 6 crc32table.h
7 crc64table.h
|
| D | inflate.c | 340 int h; /* table level */ in huft_build() local
446 h = -1; /* no tables yet--level -1 */ in huft_build()
466 h++; in huft_build()
491 if (h) in huft_build()
500 u[h] = ++q; /* table starts after link */ in huft_build()
504 if (h) in huft_build()
506 x[h] = i; /* save pattern for backing up */ in huft_build()
511 u[h-1][j] = r; /* connect to last table */ in huft_build()
545 while ((i & ((1 << w) - 1)) != x[h]) in huft_build()
547 h--; /* don't need to update q */ in huft_build()
[all …]
|
| D | Makefile | 239 clean-files := crc32table.h
240 clean-files += crc64table.h
242 $(obj)/crc32.o: $(obj)/crc32table.h
247 $(obj)/crc32table.h: $(obj)/gen_crc32table
250 $(obj)/crc64.o: $(obj)/crc64table.h
255 $(obj)/crc64table.h: $(obj)/gen_crc64table
265 $(obj)/oid_registry_data.c: $(srctree)/include/linux/oid_registry.h \
|
| D | digsig.c | 69 const char *h, int hlen) in digsig_verify_rsa() argument
169 if (!m || len != hlen || memcmp(m, h, hlen)) in digsig_verify_rsa()
|
| D | test_rhashtable.c | 311 struct rhlist_head *h, *pos; in test_rhltable() local
319 h = rhltable_lookup(&rhlt, &key, test_rht_params); in test_rhltable()
320 if (WARN(!h, "key not found during iteration %d of %d", i, entries)) { in test_rhltable()
327 rhl_for_each_entry_rcu(obj, pos, h, list_node) { in test_rhltable()
337 rhl_for_each_entry_rcu(obj, pos, h, list_node) { in test_rhltable()
|
| D | irq_poll.c | 78 static void __latent_entropy irq_poll_softirq(struct softirq_action *h) in irq_poll_softirq() argument
|
| D | plist.c | 64 # define plist_check_head(h) do { } while (0) argument
|
| D | bch.c | 849 struct gf_poly **g, struct gf_poly **h) in factor_polynomial() argument
860 *h = NULL; in factor_polynomial()
873 *h = &((struct gf_poly_deg1 *)f)[gcd->deg].poly; in factor_polynomial()
875 gf_poly_copy(*h, q); in factor_polynomial()
|
| D | vsprintf.c | 303 uint32_t d3, d2, d1, q, h; in put_dec() local
309 h = (n >> 32); in put_dec()
310 d2 = (h ) & 0xffff; in put_dec()
311 d3 = (h >> 16); /* implicit "& 0xffff" */ in put_dec()
|
| D | Kconfig.debug | 334 __init,, etc. (see the full list in include/linux/init.h),
1834 Enable this option to test the kernel's integer (<linux/hash.h>),
1835 string (<linux/stringhash.h>), and siphash (<linux/siphash.h>)
|
| /lib/raid6/ |
| D | vpermxor.uc | 23 #include <linux/raid/pq.h>
26 #include <altivec.h>
28 #include <asm/cputable.h>
29 #include <asm/ppc-opcode.h>
30 #include <asm/switch_to.h>
|
| D | altivec.uc | 25 #include <linux/raid/pq.h>
29 #include <altivec.h>
31 # include <asm/cputable.h>
32 # include <asm/switch_to.h>
|
| D | s390vx.uc | 14 #include <linux/raid/pq.h>
15 #include <asm/fpu/api.h>
17 asm(".include \"asm/vx-insn.h\"\n");
|
| D | neon.uc | 27 #include <arm_neon.h>
|
| D | int.uc | 21 #include <linux/raid/pq.h>
|
| /lib/zstd/ |
| D | compress.c | 953 static U32 ZSTD_hash3(U32 u, U32 h) { return ((u << (32 - 24)) * prime3bytes) >> (32 - h); } in ZSTD_hash3() argument
954 ZSTD_STATIC size_t ZSTD_hash3Ptr(const void *ptr, U32 h) { return ZSTD_hash3(ZSTD_readLE32(ptr), h)… in ZSTD_hash3Ptr() argument
957 static U32 ZSTD_hash4(U32 u, U32 h) { return (u * prime4bytes) >> (32 - h); } in ZSTD_hash4() argument
958 static size_t ZSTD_hash4Ptr(const void *ptr, U32 h) { return ZSTD_hash4(ZSTD_read32(ptr), h); } in ZSTD_hash4Ptr() argument
961 static size_t ZSTD_hash5(U64 u, U32 h) { return (size_t)(((u << (64 - 40)) * prime5bytes) >> (64 - … in ZSTD_hash5() argument
962 static size_t ZSTD_hash5Ptr(const void *p, U32 h) { return ZSTD_hash5(ZSTD_readLE64(p), h); } in ZSTD_hash5Ptr() argument
965 static size_t ZSTD_hash6(U64 u, U32 h) { return (size_t)(((u << (64 - 48)) * prime6bytes) >> (64 - … in ZSTD_hash6() argument
966 static size_t ZSTD_hash6Ptr(const void *p, U32 h) { return ZSTD_hash6(ZSTD_readLE64(p), h); } in ZSTD_hash6Ptr() argument
969 static size_t ZSTD_hash7(U64 u, U32 h) { return (size_t)(((u << (64 - 56)) * prime7bytes) >> (64 - … in ZSTD_hash7() argument
970 static size_t ZSTD_hash7Ptr(const void *p, U32 h) { return ZSTD_hash7(ZSTD_readLE64(p), h); } in ZSTD_hash7Ptr() argument
[all …]
|
| D | zstd_opt.h | 241 const size_t h = ZSTD_hashPtr(ip, hashLog, mls); in ZSTD_insertBtAndGetAllMatches() local
243 U32 matchIndex = hashTable[h]; in ZSTD_insertBtAndGetAllMatches()
293 hashTable[h] = curr; /* Update Hash Table */ in ZSTD_insertBtAndGetAllMatches()
|
| /lib/zlib_deflate/ |
| D | deftree.c | 418 int h; /* heap index */ in gen_bitlen() local
432 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { in gen_bitlen()
433 n = s->heap[h]; in gen_bitlen()
474 m = s->heap[--h]; in gen_bitlen()
|
| D | deflate.c | 142 #define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask) argument
|
| /lib/mpi/ |
| D | longlong.h | 440 #define rshift_rhlc(r, h, l, c) \ argument
443 "=r" (r) : "r" (h), "r" (l), "rn" (c))
499 #define rshift_rhlc(r, h, l, c) \ argument
504 __nn.__i.__h = (h); __nn.__i.__l = (l); \
|