| /lib/crypto/ |
| D | curve25519-fiat32.c | 30 static __always_inline void fe_frombytes_impl(u32 h[10], const u8 *s) in fe_frombytes_impl()
41 h[0] = a0&((1<<26)-1); /* 26 used, 32-26 left. 26 */ in fe_frombytes_impl()
42 h[1] = (a0>>26) | ((a1&((1<<19)-1))<< 6); /* (32-26) + 19 = 6+19 = 25 */ in fe_frombytes_impl()
43 h[2] = (a1>>19) | ((a2&((1<<13)-1))<<13); /* (32-19) + 13 = 13+13 = 26 */ in fe_frombytes_impl()
44 h[3] = (a2>>13) | ((a3&((1<< 6)-1))<<19); /* (32-13) + 6 = 19+ 6 = 25 */ in fe_frombytes_impl()
45 h[4] = (a3>> 6); /* (32- 6) = 26 */ in fe_frombytes_impl()
46 h[5] = a4&((1<<25)-1); /* 25 */ in fe_frombytes_impl()
47 h[6] = (a4>>25) | ((a5&((1<<19)-1))<< 7); /* (32-25) + 19 = 7+19 = 26 */ in fe_frombytes_impl()
48 h[7] = (a5>>19) | ((a6&((1<<12)-1))<<13); /* (32-19) + 12 = 13+12 = 25 */ in fe_frombytes_impl()
49 h[8] = (a6>>12) | ((a7&((1<< 6)-1))<<20); /* (32-12) + 6 = 20+ 6 = 26 */ in fe_frombytes_impl()
[all …]
|
| D | sha256.c | 65 #define SHA256_ROUND(i, a, b, c, d, e, f, g, h) do { \ argument
67 t1 = h + e1(e) + Ch(e, f, g) + SHA256_K[i] + W[i]; \
70 h = t1 + t2; \
75 u32 a, b, c, d, e, f, g, h; in sha256_transform() local
104 e = state[4]; f = state[5]; g = state[6]; h = state[7]; in sha256_transform()
108 SHA256_ROUND(i + 0, a, b, c, d, e, f, g, h); in sha256_transform()
109 SHA256_ROUND(i + 1, h, a, b, c, d, e, f, g); in sha256_transform()
110 SHA256_ROUND(i + 2, g, h, a, b, c, d, e, f); in sha256_transform()
111 SHA256_ROUND(i + 3, f, g, h, a, b, c, d, e); in sha256_transform()
112 SHA256_ROUND(i + 4, e, f, g, h, a, b, c, d); in sha256_transform()
[all …]
|
| D | poly1305-donna32.c | 58 h0 = state->h[0]; in poly1305_core_blocks()
59 h1 = state->h[1]; in poly1305_core_blocks()
60 h2 = state->h[2]; in poly1305_core_blocks()
61 h3 = state->h[3]; in poly1305_core_blocks()
62 h4 = state->h[4]; in poly1305_core_blocks()
112 state->h[0] = h0; in poly1305_core_blocks()
113 state->h[1] = h1; in poly1305_core_blocks()
114 state->h[2] = h2; in poly1305_core_blocks()
115 state->h[3] = h3; in poly1305_core_blocks()
116 state->h[4] = h4; in poly1305_core_blocks()
[all …]
|
| D | poly1305.c | 23 poly1305_core_init(&desc->h); in poly1305_init_generic()
43 poly1305_core_blocks(&desc->h, &desc->core_r, desc->buf, in poly1305_update_generic()
50 poly1305_core_blocks(&desc->h, &desc->core_r, src, in poly1305_update_generic()
69 poly1305_core_blocks(&desc->h, &desc->core_r, desc->buf, 1, 0); in poly1305_final_generic()
72 poly1305_core_emit(&desc->h, desc->s, dst); in poly1305_final_generic()
|
| D | blake2s.c | 55 cpu_to_le32_array(state->h, ARRAY_SIZE(state->h)); in blake2s_final()
56 memcpy(out, state->h, state->outlen); in blake2s_final()
|
| D | blake2s-generic.c | 57 memcpy(v, state->h, 32); in blake2s_compress_generic()
103 state->h[i] ^= v[i] ^ v[i + 8]; in blake2s_compress_generic()
|
| /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/zstd/compress/ |
| D | zstd_compress_internal.h | 786 static U32 ZSTD_hash3(U32 u, U32 h) { return ((u << (32-24)) * prime3bytes) >> (32-h) ; } in ZSTD_hash3() argument
787 MEM_STATIC size_t ZSTD_hash3Ptr(const void* ptr, U32 h) { return ZSTD_hash3(MEM_readLE32(ptr), h); … in ZSTD_hash3Ptr() argument
790 static U32 ZSTD_hash4(U32 u, U32 h) { return (u * prime4bytes) >> (32-h) ; } in ZSTD_hash4() argument
791 static size_t ZSTD_hash4Ptr(const void* ptr, U32 h) { return ZSTD_hash4(MEM_read32(ptr), h); } in ZSTD_hash4Ptr() argument
794 static size_t ZSTD_hash5(U64 u, U32 h) { return (size_t)(((u << (64-40)) * prime5bytes) >> (64-h))… in ZSTD_hash5() argument
795 static size_t ZSTD_hash5Ptr(const void* p, U32 h) { return ZSTD_hash5(MEM_readLE64(p), h); } in ZSTD_hash5Ptr() argument
798 static size_t ZSTD_hash6(U64 u, U32 h) { return (size_t)(((u << (64-48)) * prime6bytes) >> (64-h))… in ZSTD_hash6() argument
799 static size_t ZSTD_hash6Ptr(const void* p, U32 h) { return ZSTD_hash6(MEM_readLE64(p), h); } in ZSTD_hash6Ptr() argument
802 static size_t ZSTD_hash7(U64 u, U32 h) { return (size_t)(((u << (64-56)) * prime7bytes) >> (64-h))… in ZSTD_hash7() argument
803 static size_t ZSTD_hash7Ptr(const void* p, U32 h) { return ZSTD_hash7(MEM_readLE64(p), h); } in ZSTD_hash7Ptr() argument
[all …]
|
| D | zstd_fast.c | 427 size_t const h = ZSTD_hashPtr(ip, hlog, mls); in ZSTD_compressBlock_fast_dictMatchState_generic() local
429 U32 const matchIndex = hashTable[h]; in ZSTD_compressBlock_fast_dictMatchState_generic()
435 hashTable[h] = curr; /* update hash table */ in ZSTD_compressBlock_fast_dictMatchState_generic()
584 const size_t h = ZSTD_hashPtr(ip, hlog, mls); in ZSTD_compressBlock_fast_extDict_generic() local
585 const U32 matchIndex = hashTable[h]; in ZSTD_compressBlock_fast_extDict_generic()
592 hashTable[h] = curr; /* update hash table */ in ZSTD_compressBlock_fast_extDict_generic()
|
| D | zstd_lazy.c | 44 … size_t const h = ZSTD_hashPtr(base + idx, hashLog, mls); /* assumption : ip + 8 <= iend */ in ZSTD_updateDUBT() local
45 U32 const matchIndex = hashTable[h]; in ZSTD_updateDUBT()
51 hashTable[h] = idx; /* Update Hash Table */ in ZSTD_updateDUBT()
166 size_t const h = ZSTD_hashPtr(ip, hashLog, mls); in ZSTD_DUBT_findBetterDictMatch() local
167 U32 dictMatchIndex = dictHashTable[h]; in ZSTD_DUBT_findBetterDictMatch()
240 size_t const h = ZSTD_hashPtr(ip, hashLog, mls); in ZSTD_DUBT_findBestMatch() local
241 U32 matchIndex = hashTable[h]; in ZSTD_DUBT_findBestMatch()
309 matchIndex = hashTable[h]; in ZSTD_DUBT_findBestMatch()
310 hashTable[h] = curr; /* Update Hash Table */ in ZSTD_DUBT_findBestMatch()
431 U32 const h = (U32)ZSTD_hashPtr(base + idx, hashLog, ms->cParams.minMatch); in ZSTD_dedicatedDictSearch_lazy_loadDictionary() local
[all …]
|
| D | zstd_opt.c | 420 size_t const h = ZSTD_hashPtr(ip, hashLog, mls); in ZSTD_insertBt1() local
424 U32 matchIndex = hashTable[h]; in ZSTD_insertBt1()
455 hashTable[h] = curr; /* Update Hash Table */ in ZSTD_insertBt1()
573 size_t const h = ZSTD_hashPtr(ip, hashLog, mls); in ZSTD_insertBtAndGetAllMatches() local
574 U32 matchIndex = hashTable[h]; in ZSTD_insertBtAndGetAllMatches()
687 hashTable[h] = curr; /* Update Hash Table */ in ZSTD_insertBtAndGetAllMatches()
|
| D | zstd_double_fast.c | 311 size_t const h = ZSTD_hashPtr(ip, hBitsS, mls); in ZSTD_compressBlock_doubleFast_dictMatchState_generic() local
316 U32 matchIndexS = hashSmall[h]; in ZSTD_compressBlock_doubleFast_dictMatchState_generic()
323 hashLong[h2] = hashSmall[h] = curr; /* update hash tables */ in ZSTD_compressBlock_doubleFast_dictMatchState_generic()
|
| /lib/ |
| 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 | .gitignore | 2 /crc32table.h
3 /crc64table.h
|
| D | Makefile | 308 clean-files := crc32table.h
309 clean-files += crc64table.h
311 $(obj)/crc32.o: $(obj)/crc32table.h
316 $(obj)/crc32table.h: $(obj)/gen_crc32table
319 $(obj)/crc64.o: $(obj)/crc64table.h
324 $(obj)/crc64table.h: $(obj)/gen_crc64table
334 $(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 | 312 struct rhlist_head *h, *pos; in test_rhltable() local
320 h = rhltable_lookup(&rhlt, &key, test_rht_params); in test_rhltable()
321 if (WARN(!h, "key not found during iteration %d of %d", i, entries)) { in test_rhltable()
328 rhl_for_each_entry_rcu(obj, pos, h, list_node) { in test_rhltable()
338 rhl_for_each_entry_rcu(obj, pos, h, list_node) { in test_rhltable()
|
| /lib/raid6/ |
| D | vpermxor.uc | 23 #include <linux/raid/pq.h>
26 #include <altivec.h>
27 #include <asm/ppc-opcode.h>
29 #include <asm/cputable.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.h>
|
| D | neon.uc | 27 #include <arm_neon.h>
28 #include "neon.h"
|
| /lib/zlib_deflate/ |
| D | deftree.c | 364 int h; /* heap index */ in gen_bitlen() local
378 for (h = s->heap_max+1; h < HEAP_SIZE; h++) { in gen_bitlen()
379 n = s->heap[h]; in gen_bitlen()
420 m = s->heap[--h]; in gen_bitlen()
|
| D | deflate.c | 163 #define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask) argument
|
| /lib/crypto/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); \
|