/linux-master/include/xen/interface/io/ |
H A D | netif.h | 200 * A hash calculated over an IP version 4 header as follows: 212 * A hash calculated over an IP version 4 header and TCP header as 227 * A hash calculated over an IP version 6 header as follows: 239 * A hash calculated over an IP version 6 header and TCP header as 261 * Toeplitz hash: 289 uint64_t hash = 0; local 303 hash ^= prefix; 316 /* The valid part of the hash is in the upper 32 bits. */ 317 return hash >> 32; 395 * This is sent by the frontend to set the desired hash algorith 878 } hash; member in union:xen_netif_extra_info::__anon184 [all...] |
/linux-master/lib/zstd/compress/ |
H A D | zstd_ldm.c | 30 * Initializes the rolling hash state such that it will honor the 43 * In the gear hash algorithm, bit n depends on the last n bytes; 55 /* In this degenerate case we simply honor the hash rate. */ 61 * Feeds [data, data + minMatchLength) into the hash without registering any 62 * splits. This effectively resets the hash state. This is used when skipping 68 U64 hash = state->rolling; local 72 hash = (hash << 1) + ZSTD_ldm_gearTab[data[n] & 0xff]; \ 101 U64 hash, mask; local 103 hash 172 ZSTD_ldm_getBucket( ldmState_t* ldmState, size_t hash, ldmParams_t const ldmParams) argument 180 ZSTD_ldm_insertEntry(ldmState_t* ldmState, size_t const hash, const ldmEntry_t entry, ldmParams_t const ldmParams) argument 293 U32 const hash = (U32)(xxhash & (((U32)1 << hBits) - 1)); local 371 U32 const hash = (U32)(xxhash & (((U32)1 << hBits) - 1)); local 386 U32 const hash = candidates[n].hash; local [all...] |
/linux-master/drivers/md/ |
H A D | dm-ima.h | 45 char *hash; member in struct:dm_ima_device_table_metadata 50 * This structure contains device metadata, and table hash for
|
/linux-master/lib/ |
H A D | libcrc32c.c | 29 #include <crypto/hash.h>
|
/linux-master/drivers/crypto/allwinner/sun4i-ss/ |
H A D | sun4i-ss-hash.c | 3 * sun4i-ss-hash.c - hardware cryptographic accelerator for Allwinner A20 SoC 27 algt = container_of(alg, struct sun4i_ss_alg_template, alg.hash); 56 algt = container_of(alg, struct sun4i_ss_alg_template, alg.hash); 74 octx->hash[i] = op->hash[i]; 76 octx->hash[0] = SHA1_H0; 77 octx->hash[1] = SHA1_H1; 78 octx->hash[2] = SHA1_H2; 79 octx->hash[3] = SHA1_H3; 99 op->hash[ [all...] |
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/en/tc/ |
H A D | act_stats.c | 22 struct rhash_head hash; member in struct:mlx5e_tc_act_stats 27 .head_offset = offsetof(struct mlx5e_tc_act_stats, hash), 83 &act_stats->hash, 122 rhashtable_remove_fast(ht, &act_stats->hash,
|
/linux-master/fs/bcachefs/ |
H A D | nocow_locking.h | 9 #include <linux/hash.h>
|
/linux-master/crypto/ |
H A D | hash.h | 10 #include <crypto/internal/hash.h>
|
H A D | ecdsa.c | 94 static int _ecdsa_verify(struct ecc_ctx *ctx, const u64 *hash, const u64 *r, const u64 *s) argument 110 /* hash is given */ 111 pr_devel("hash : %016llx %016llx ... %016llx\n", 112 hash[ndigits - 1], hash[ndigits - 2], hash[0]); 116 /* u1 = (hash * s1) mod n */ 117 vli_mod_mult_slow(u1, hash, s1, curve->n, ndigits); 146 u64 hash[ECC_MAX_DIGITS]; local 167 /* if the hash i [all...] |
H A D | nhpoly1305.c | 3 * NHPoly1305 - ��-almost-���-universal hash function for Adiantum 15 * ��-almost-���-universal (��-���U) hash function for equal-length inputs over 17 * chunks of the input with the NH hash function [2], reducing the input length 23 * This is *not* a cryptographic hash function; do not use it as such! 35 #include <crypto/internal/hash.h> 43 __le64 hash[NH_NUM_PASSES]) 69 hash[0] = cpu_to_le64(sums[0]); 70 hash[1] = cpu_to_le64(sums[1]); 71 hash[2] = cpu_to_le64(sums[2]); 72 hash[ 42 nh_generic(const u32 *key, const u8 *message, size_t message_len, __le64 hash[NH_NUM_PASSES]) argument [all...] |
/linux-master/fs/xfs/libxfs/ |
H A D | xfs_attr_sf.h | 10 * We generate this then sort it, attr_list() must return things in hash-order. 17 xfs_dahash_t hash; /* this entry's hash value */ member in struct:xfs_attr_sf_sort
|
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/en/ |
H A D | rss.c | 71 struct mlx5e_rss_params_hash hash; member in struct:mlx5e_rss 159 rss->hash.hfunc = ETH_RSS_HASH_TOP; 160 netdev_rss_key_fill(rss->hash.toeplitz_hash_key, 161 sizeof(rss->hash.toeplitz_hash_key)); 227 mlx5e_tir_builder_build_rss(builder, &rss->hash, &rss_tt, inner); 309 mlx5e_tir_builder_build_rss(builder, &rss->hash, &rss_tt, inner); 328 "Failed to update RSS hash of indirect TIR for traffic type %d: err = %d\n", 339 "Failed to update RSS hash of inner indirect TIR for traffic type %d: err = %d\n", 480 err = mlx5e_rqt_redirect_indir(&rss->rqt, rqns, vhca_ids, num_rqns, rss->hash.hfunc, 561 memcpy(key, rss->hash [all...] |
/linux-master/arch/s390/kernel/ |
H A D | vmlinux.lds.S | 213 .hash ALIGN(8) : { 214 *(.hash) 216 .gnu.hash ALIGN(8) : { 217 *(.gnu.hash)
|
/linux-master/security/selinux/ss/ |
H A D | symtab.c | 38 .hash = symhash,
|
H A D | avtab.c | 14 * Tuned number of hash slots for avtab to reduce memory usage 39 u32 hash = 0; local 47 hash ^= v; \ 48 hash = (hash << r2) | (hash >> (32 - r2)); \ 49 hash = hash * m + n; \ 58 hash ^= hash >> 1 [all...] |
/linux-master/fs/jbd2/ |
H A D | revoke.c | 61 * We keep two hash tables of revoke records. One hashtable belongs to the 63 * belongs to the committing transaction. Accesses to the second hash table 70 * All users operating on the hash table belonging to the running transaction 72 * switching hash tables under them. For operations on the lists of entries in 73 * the hash table j_revoke_lock is used. 75 * Finally, also replay code uses the hash tables but at this moment no one else 92 #include <linux/hash.h> 104 struct list_head hash; member in struct:jbd2_revoke_record_s 110 /* The revoke table is just a simple hash table of revoke records. */ 113 /* It is conceivable that we might want a larger hash tabl 131 static inline int hash(journal_t *journal, unsigned long long block) function [all...] |
/linux-master/include/net/ |
H A D | inet_hashtables.h | 30 #include <net/netns/hash.h> 131 * We must use different 'nulls' end-of-chain value for all hash buckets : 157 * TCP hash as well as the others for fast bind/connect. 188 inet_lhash2_bucket(struct inet_hashinfo *h, u32 hash) argument 190 return &h->lhash2[hash & h->lhash2_mask]; 195 unsigned int hash) 197 return &hashinfo->ehash[hash & hashinfo->ehash_mask]; 202 unsigned int hash) 204 return &hashinfo->ehash_locks[hash & hashinfo->ehash_locks_mask]; 265 u32 hash; local 193 inet_ehash_bucket( struct inet_hashinfo *hashinfo, unsigned int hash) argument 200 inet_ehash_lockp( struct inet_hashinfo *hashinfo, unsigned int hash) argument [all...] |
H A D | raw.h | 18 #include <net/netns/hash.h> 19 #include <linux/hash.h>
|
/linux-master/drivers/crypto/caam/ |
H A D | compat.h | 15 #include <linux/hash.h> 48 #include <crypto/internal/hash.h>
|
/linux-master/arch/powerpc/kvm/ |
H A D | book3s_32_mmu_host.c | 13 #include <asm/book3s/32/mmu-hash.h> 65 * a hash, so we don't waste cycles on looping */ 109 u32 page, hash; local 114 hash = ((vsid ^ page) << 6); 116 hash = ~hash; 118 hash &= htabmask; 120 pteg |= hash; 122 dprintk_mmu("htab: %lx | hash: %x | htabmask: %x | pteg: %lx\n", 123 htab, hash, htabmas [all...] |
/linux-master/tools/testing/selftests/bpf/prog_tests/ |
H A D | skb_ctx.c | 65 /* non-zero [hash, sk] fields should be rejected */ 67 skb.hash = 1; 69 ASSERT_NEQ(err, 0, "hash"); 70 skb.hash = 0;
|
/linux-master/arch/x86/boot/compressed/ |
H A D | vmlinux.lds.S | 82 *(.hash) *(.gnu.hash)
|
/linux-master/fs/gfs2/ |
H A D | dir.h | 63 name->hash = gfs2_disk_hash(name->name, name->len); 71 dent->de_hash = cpu_to_be32(name->hash);
|
/linux-master/fs/hfs/ |
H A D | string.c | 57 unsigned int hash, len = this->len; local 62 hash = init_name_hash(dentry); 64 hash = partial_name_hash(caseorder[*name++], hash); 65 this->hash = end_name_hash(hash);
|
/linux-master/net/core/ |
H A D | secure_seq.c | 90 u32 hash; local 93 hash = siphash(&combined, offsetofend(typeof(combined), dport), 95 return seq_scale(hash); 139 u32 hash; local 142 hash = siphash_3u32((__force u32)saddr, (__force u32)daddr, 145 return seq_scale(hash);
|