/linux-master/net/sunrpc/ |
H A D | svcauth.c | 20 #include <linux/hash.h> 180 * 'auth_domains' are stored in a hash table indexed by name. 199 hlist_del_rcu(&dom->hash); 220 hlist_for_each_entry(hp, head, hash) { 228 hlist_add_head_rcu(&new->hash, head); 242 hlist_for_each_entry_rcu(hp, head, hash) { 273 hlist_for_each_entry(hp, &auth_domain_table[h], hash)
|
/linux-master/net/netfilter/ |
H A D | nf_conntrack_core.c | 52 #include <net/netns/hash.h> 80 /* serialize hash resizes and nf_ct_iterate_cleanup */ 138 /* return true if we need to recompute hashes (in case hash table was resized) */ 228 static u32 scale_hash(u32 hash) argument 230 return reciprocal_scale(hash, nf_conntrack_htable_size); 476 * intentionally doesn't re-use any of the seeds used for hash 605 unsigned int hash, reply_hash; local 610 hash = hash_conntrack(net, 616 } while (nf_conntrack_double_lock(net, hash, reply_hash, sequence)); 619 nf_conntrack_double_unlock(hash, reply_has 735 ____nf_conntrack_find(struct net *net, const struct nf_conntrack_zone *zone, const struct nf_conntrack_tuple *tuple, u32 hash) argument 774 __nf_conntrack_find_get(struct net *net, const struct nf_conntrack_zone *zone, const struct nf_conntrack_tuple *tuple, u32 hash) argument 829 __nf_conntrack_hash_insert(struct nf_conn *ct, unsigned int hash, unsigned int reply_hash) argument 871 unsigned int hash, reply_hash; local 1155 unsigned int hash, reply_hash; local 1300 unsigned int hash, hsize; local 1406 early_drop(struct net *net, unsigned int hash) argument 1606 __nf_conntrack_alloc(struct net *net, const struct nf_conntrack_zone *zone, const struct nf_conntrack_tuple *orig, const struct nf_conntrack_tuple *repl, gfp_t gfp, u32 hash) argument 1703 init_conntrack(struct net *net, struct nf_conn *tmpl, const struct nf_conntrack_tuple *tuple, struct sk_buff *skb, unsigned int dataoff, u32 hash) argument 1819 u32 hash, zone_id, rid; local 2311 const struct nf_conntrack_tuple_hash *hash; local 2558 struct hlist_nulls_head *hash; local 2581 struct hlist_nulls_head *hash, *old_hash; local [all...] |
/linux-master/crypto/ |
H A D | essiv.c | 7 * used for block encryption, by encrypting it using the hash of the 34 #include <crypto/internal/hash.h> 56 struct crypto_shash *hash; member in struct:essiv_tfm_ctx 81 err = crypto_shash_tfm_digest(tctx->hash, key, keylen, salt); 90 crypto_shash_digestsize(tctx->hash)); 97 SHASH_DESC_ON_STACK(desc, tctx->hash); 112 desc->tfm = tctx->hash; 123 crypto_shash_digestsize(tctx->hash)); 274 struct crypto_shash *hash; local 281 hash [all...] |
H A D | adiantum.c | 12 * cipher, two passes of an ��-almost-���-universal (��-���U) hash function based on 24 * This implementation doesn't currently allow other ��-���U hash functions, i.e. 26 * but still provably as secure, and also the ��-���U hash function of HBSH is 29 * here. Nevertheless, if needed in the future, support for other ��-���U hash 36 #include <crypto/internal/hash.h> 45 * cipher's block size and the hash function's output. 52 /* Size of the hash key (K_H) in bytes */ 73 struct crypto_shash *hash; member in struct:adiantum_tfm_ctx 96 * The result of the Poly1305 ��-���U hash function applied to 110 * hash ke 434 struct crypto_shash *hash; local [all...] |
/linux-master/tools/testing/selftests/bpf/progs/ |
H A D | test_tcp_custom_syncookie.c | 318 u32 hash; local 340 hash = siphash_2u64(first, second, &test_key_siphash); 345 ctx->attrs.rcv_tsecr |= hash & COOKIE_MASK; 348 hash &= ~COOKIE_MASK; 349 hash |= mssind << 6; 352 hash |= ctx->attrs.snd_wscale & BPF_SYNCOOKIE_WSCALE_MASK; 355 hash |= BPF_SYNCOOKIE_SACK; 358 hash |= BPF_SYNCOOKIE_ECN; 360 ctx->cookie = hash; 467 u32 hash; local [all...] |
/linux-master/net/appletalk/ |
H A D | aarp.c | 350 /* Expire all entries in a hash chain */ 362 /* Cleanup all hash chains -- module unloading */ 413 int hash = sa->s_node % (AARP_HASH_SIZE - 1); local 418 a = __aarp_find_entry(proxies[hash], dev, sa); 429 int hash = sa->s_node % (AARP_HASH_SIZE - 1); local 430 struct aarp_entry *a = __aarp_find_entry(proxies[hash], dev, sa); 483 int hash, retval = -EPROTONOSUPPORT; local 512 hash = sa->s_node % (AARP_HASH_SIZE - 1); 513 entry->next = proxies[hash]; 514 proxies[hash] 547 int hash; local 685 __aarp_resolved(struct aarp_entry **list, struct aarp_entry *a, int hash) argument 717 int hash, ret = 0; local [all...] |
/linux-master/arch/powerpc/mm/ptdump/ |
H A D | hashpagetable.c | 6 * the hash pagetable, along with their flags to 9 * If radix is enabled then there is no hash page table and so no debugfs file 210 unsigned long hash, vsid, vpn, hpte_group, want_v, hpte_v; local 214 /* calculate hash */ 217 hash = hpt_hash(vpn, shift, ssize); 220 /* to check in the secondary hash table, we invert the hash */ 222 hash = ~hash; 223 hpte_group = (hash 245 unsigned long vsid, vpn, hash, hpte_group, want_v; local [all...] |
/linux-master/drivers/crypto/rockchip/ |
H A D | rk3288_crypto_ahash.c | 13 #include <crypto/internal/hash.h> 23 * IC can not process zero message hash, 24 * so we put the fixed hash out when met zero message. 50 struct rk_crypto_tmp *algt = container_of(alg, struct rk_crypto_tmp, alg.hash.base); 264 struct rk_crypto_tmp *algt = container_of(alg, struct rk_crypto_tmp, alg.hash.base); 349 struct rk_crypto_tmp *algt = container_of(alg, struct rk_crypto_tmp, alg.hash.base); 375 .alg.hash.base = { 400 .alg.hash.op = { 407 .alg.hash.base = { 432 .alg.hash [all...] |
/linux-master/arch/powerpc/mm/book3s64/ |
H A D | hash_native.c | 130 /* Radix flush for a hash guest */ 393 * a tlb invalidate. If a hash bucket gets full, we "evict" a more/less 455 unsigned long hash; local 458 hash = hpt_hash(vpn, mmu_psize_defs[psize].shift, ssize); 462 * We try to keep bolted entries always in primary hash 465 hpte_group = (hash & htab_hash_mask) * HPTES_PER_GROUP; 469 hpte_group = (~hash & htab_hash_mask) * HPTES_PER_GROUP; 565 DBG_LOW(" invalidate(vpn=%016lx, hash: %lx)\n", vpn, slot); 584 * a tlb invalidate. If a hash bucket gets full, we "evict" a more/less 606 unsigned long hidx, vpn = 0, hash, slo local 782 unsigned long hash, index, hidx, shift, slot; local [all...] |
/linux-master/arch/x86/boot/compressed/ |
H A D | kaslr.c | 45 static unsigned long rotate_xor(unsigned long hash, const void *area, argument 51 for (i = 0; i < size / sizeof(hash); i++) { 53 hash = (hash << ((sizeof(hash) * 8) - 7)) | (hash >> 7); 54 hash ^= ptr[i]; 57 return hash; 63 unsigned long hash = 0; local 65 hash [all...] |
/linux-master/drivers/net/ethernet/netronome/nfp/crypto/ |
H A D | ipsec.c | 98 uint32_t hash :4; /* From nfp_ipsec_sa_hash_type */ member in struct:nfp_ipsec_cfg_add_sa::sa_ctrl_word 203 cfg->ctrl_word.hash = NFP_IPSEC_HASH_MD5_96; 206 cfg->ctrl_word.hash = NFP_IPSEC_HASH_MD5_128; 217 cfg->ctrl_word.hash = NFP_IPSEC_HASH_SHA1_96; 220 cfg->ctrl_word.hash = NFP_IPSEC_HASH_SHA1_80; 231 cfg->ctrl_word.hash = NFP_IPSEC_HASH_SHA256_96; 234 cfg->ctrl_word.hash = NFP_IPSEC_HASH_SHA256_128; 245 cfg->ctrl_word.hash = NFP_IPSEC_HASH_SHA384_96; 248 cfg->ctrl_word.hash = NFP_IPSEC_HASH_SHA384_192; 259 cfg->ctrl_word.hash [all...] |
/linux-master/drivers/net/ethernet/chelsio/cxgb4/ |
H A D | clip_tbl.c | 80 int hash; local 86 hash = clip_addr_hash(ctbl, addr, v6); 89 list_for_each_entry(cte, &ctbl->hash_list[hash], list) { 113 list_add_tail(&ce->list, &ctbl->hash_list[hash]); 152 int hash; local 158 hash = clip_addr_hash(ctbl, addr, v6); 161 list_for_each_entry(cte, &ctbl->hash_list[hash], list) {
|
/linux-master/drivers/net/ethernet/mediatek/ |
H A D | mtk_ppe.h | 298 u16 hash; member in struct:mtk_flow_entry 353 void __mtk_ppe_check_skb(struct mtk_ppe *ppe, struct sk_buff *skb, u16 hash); 356 mtk_ppe_check_skb(struct mtk_ppe *ppe, struct sk_buff *skb, u16 hash) argument 363 if (hash > MTK_PPE_HASH_MASK) 367 diff = now - ppe->foe_check_time[hash]; 371 ppe->foe_check_time[hash] = now; 372 __mtk_ppe_check_skb(ppe, skb, hash);
|
/linux-master/fs/efivarfs/ |
H A D | super.c | 143 unsigned long hash = init_name_hash(dentry); local 151 hash = partial_name_hash(*s++, hash); 155 hash = partial_name_hash(tolower(*s++), hash); 157 qstr->hash = end_name_hash(hash);
|
/linux-master/drivers/crypto/allwinner/sun8i-ce/ |
H A D | sun8i-ce-core.c | 14 #include <crypto/internal/hash.h> 400 .alg.hash.base = { 426 .alg.hash.op = { 433 .alg.hash.base = { 459 .alg.hash.op = { 465 .alg.hash.base = { 491 .alg.hash.op = { 497 .alg.hash.base = { 523 .alg.hash.op = { 529 .alg.hash [all...] |
/linux-master/fs/ubifs/ |
H A D | replay.c | 25 #include <crypto/hash.h> 48 u8 hash[UBIFS_HASH_ARR_SZ]; member in struct:replay_entry 254 r->len, r->hash, &r->nm); 279 r->len, r->hash); 368 * @hash: node hash 384 const u8 *hash, union ubifs_key *key, 404 ubifs_copy_hash(c, hash, r->hash); 421 * @hash 383 insert_node(struct ubifs_info *c, int lnum, int offs, int len, const u8 *hash, union ubifs_key *key, unsigned long long sqnum, int deletion, int *used, loff_t old_size, loff_t new_size) argument 433 insert_dent(struct ubifs_info *c, int lnum, int offs, int len, const u8 *hash, union ubifs_key *key, const char *name, int nlen, unsigned long long sqnum, int deletion, int *used) argument 565 authenticate_sleb_hash(struct ubifs_info *c, struct shash_desc *log_hash, u8 *hash) argument 599 u8 hash[UBIFS_HASH_ARR_SZ]; local 723 u8 hash[UBIFS_HASH_ARR_SZ]; local [all...] |
/linux-master/arch/x86/kernel/ |
H A D | alternative.c | 884 * and the kCFI hash value. 959 u32 hash; local 973 if (get_kernel_nofault(hash, func)) 976 return hash; 986 * Re-hash the CFI hash with a boot-time seed while making sure the result is 989 static u32 cfi_rehash(u32 hash) argument 991 hash ^= cfi_seed; 992 while (unlikely(is_endbr(hash) || is_endbr(-hash))) { 1135 u32 hash; local 1158 u32 hash; local 1178 u32 hash; local 1198 u32 hash; local 1231 u32 hash; local 1250 u32 hash; local [all...] |
/linux-master/fs/ext4/ |
H A D | dir.c | 325 * These functions convert from the major/minor hash to an f_pos 375 * directories, where the "offset" is in terms of the filename hash 378 * Because we may return a 64-bit hash that is well beyond offset limits, 379 * we need to pass the max hash as the maximum allowable offset in 401 * the directory entry in hash order. 404 __u32 hash; member in struct:fname 459 int ext4_htree_store_dirent(struct file *dir_file, __u32 hash, argument 477 new_fn->hash = hash; 489 * If the hash an [all...] |
/linux-master/security/integrity/ima/ |
H A D | ima_template_lib.c | 296 * - DATA_FMT_DIGEST_WITH_ALGO: <hash algo> + ':' + '\0' + digest, 298 * <digest type> + ':' + <hash algo> + ':' + '\0' + digest, 301 * with a hash size limitation of 20 bytes, 303 * where <hash algo> is the hash_algo_name[] string. 327 * hash algorithm digest size. 341 struct ima_max_digest_data hash; local 347 memset(&hash, 0, sizeof(hash)); 360 hash.hdr.algo = HASH_ALGO_SHA1; 361 result = ima_calc_boot_aggregate(&hash [all...] |
/linux-master/drivers/infiniband/core/ |
H A D | iwpm_util.c | 101 * info in a hash table 146 * info from the hash table 150 * Returns err code if mapping info is not found in the hash table, 205 /* free the hash list */ 228 /* free the hash list */ 262 * the remote_addr. After that it is removed from the hash table 517 u32 hash = jhash_2words(ipv6_hash, (__force u32) ipv6_sockaddr->sin6_port, 0); local 518 return hash; 524 u32 hash = jhash_2words(ipv4_hash, (__force u32) ipv4_sockaddr->sin_port, 0); local 525 return hash; 528 get_hash_bucket(struct sockaddr_storage *a_sockaddr, struct sockaddr_storage *b_sockaddr, u32 *hash) argument 556 u32 hash; local 569 u32 hash; local [all...] |
/linux-master/drivers/net/ethernet/chelsio/cxgb3/ |
H A D | l2t.c | 238 * presently in the hash table. We need to remove it. 241 int hash = arp_hash(e->addr, e->ifindex, d); local 243 for (p = &d->l2tab[hash].first; *p; p = &(*p)->next) 254 * Called when an L2T entry has no more users. The entry is left in the hash 309 int hash; local 331 hash = arp_hash(addr, ifidx, d); 334 for (e = d->l2tab[hash].first; e; e = e->next) 347 e->next = d->l2tab[hash].first; 348 d->l2tab[hash].first = e; 406 int hash local [all...] |
/linux-master/arch/powerpc/kvm/ |
H A D | book3s_64_mmu_host.c | 15 #include <asm/book3s/64/mmu-hash.h> 32 * a hash, so we don't waste cycles on looping */ 76 ulong hash, hpteg; local 149 hash = hpt_hash(vpn, mmu_psize_defs[hpsize].shift, MMU_SEGSIZE_256M); 160 hpteg = ((hash & htab_hash_mask) * HPTES_PER_GROUP); 174 hash = ~hash; 190 hash = ~hash; 191 hpteg = ((hash [all...] |
/linux-master/drivers/nvme/common/ |
H A D | auth.c | 12 #include <crypto/hash.h> 208 key->hash = key_hash; 216 struct nvme_dhchap_key *nvme_auth_alloc_key(u32 len, u8 hash) argument 223 key->hash = hash; 250 if (key->hash == 0) { 257 hmac_name = nvme_auth_hmac_name(key->hash); 259 pr_warn("Invalid key hash id %d\n", key->hash); 276 transformed_key = nvme_auth_alloc_key(key_len, key->hash); [all...] |
/linux-master/fs/xfs/ |
H A D | xfs_attr_list.c | 34 if (sa->hash < sb->hash) { 36 } else if (sa->hash > sb->hash) { 136 sbp->hash = xfs_da_hashname(sfe->nameval, sfe->namelen); 148 * Sort the entries on hash then entno. 159 if (sbp->hash == cursor->hashval) { 164 } else if (sbp->hash > cursor->hashval) { 175 if (cursor->hashval != sbp->hash) { 176 cursor->hashval = sbp->hash; [all...] |
/linux-master/lib/ |
H A D | digsig.c | 22 #include <crypto/hash.h> 196 * Normally hash of the content is used as a data for this function. 205 unsigned char hash[SHA1_DIGEST_SIZE]; local 244 crypto_shash_final(desc, hash); 250 hash, sizeof(hash));
|