/linux-master/fs/gfs2/ |
H A D | quota.c | 99 static inline void spin_lock_bucket(unsigned int hash) argument 101 hlist_bl_lock(&qd_hash_table[hash]); 104 static inline void spin_unlock_bucket(unsigned int hash) argument 106 hlist_bl_unlock(&qd_hash_table[hash]); 232 static struct gfs2_quota_data *qd_alloc(unsigned hash, struct gfs2_sbd *sdp, struct kqid qid) argument 247 qd->qd_hash = hash; 261 static struct gfs2_quota_data *gfs2_qd_search_bucket(unsigned int hash, argument 268 hlist_bl_for_each_entry_rcu(qd, h, &qd_hash_table[hash], qd_hlist) { 287 unsigned int hash = gfs2_qd_hash(sdp, qid); local 290 *qdp = qd = gfs2_qd_search_bucket(hash, sd 1408 unsigned int hash; local [all...] |
/linux-master/security/keys/ |
H A D | keyring.c | 168 unsigned long hash, type; local 194 /* Fold the hash down to 32 bits if need be. */ 195 hash = acc; 197 hash ^= acc >> 32; 200 * ordinary keys by making sure the lowest level segment in the hash is 203 if (index_key->type != &key_type_keyring && (hash & fan_mask) == 0) 204 hash |= (hash >> (ASSOC_ARRAY_KEY_CHUNK_SIZE - level_shift)) | 1; 205 else if (index_key->type == &key_type_keyring && (hash & fan_mask) != 0) 206 hash [all...] |
/linux-master/drivers/crypto/marvell/cesa/ |
H A D | hash.c | 321 /* Set the hash state in the IVDIG regs. */ 371 data = creq->base.chain.last->op->ctx.hash.hash; 557 * some data outstanding, we can ask the engine to finish the hash. 840 static int mv_cesa_ahash_export(struct ahash_request *req, void *hash, argument 851 memcpy(hash, creq->state, digsize); 858 static int mv_cesa_ahash_import(struct ahash_request *req, const void *hash, argument 879 memcpy(creq->state, hash, digsize); 913 return mv_cesa_ahash_export(req, out_state->hash, 921 return mv_cesa_ahash_import(req, in_state->hash, in_stat [all...] |
/linux-master/fs/ |
H A D | dcache.c | 26 #include <linux/hash.h> 43 * - the dcache hash table 95 * This hash-function tries to avoid losing too many bits of hash 96 * information, yet avoid using a prime hash-size or similar. 103 static inline struct hlist_bl_head *d_hash(unsigned int hash) argument 105 return dentry_hashtable + (hash >> d_hash_shift); 112 unsigned int hash) 114 hash += (unsigned long) parent / L1_CACHE_BYTES; 115 return in_lookup_hashtable + hash_32(hash, IN_LOOKUP_SHIF 111 in_lookup_hash(const struct dentry *parent, unsigned int hash) argument 2279 unsigned int hash = name->hash; local 2459 unsigned int hash = name->hash; local 2659 unsigned int hash = entry->d_name.hash; local [all...] |
/linux-master/crypto/ |
H A D | testmgr.c | 20 #include <crypto/hash.h> 150 struct hash_test_suite hash; member in union:alg_test_desc::__anon174 216 /* flush type for hash algorithms */ 228 /* finalization function for hash algorithms */ 1267 /* Test one hash test vector in one configuration, using the shash API */ 1450 /* Test one hash test vector in one configuration, using the ahash API */ 1684 * Generate a hash test vector from the given implementation. 1726 * Test the hash algorithm represented by @req against the corresponding generic 1772 pr_warn("alg: hash: skipping comparison tests for %s because %s is unavailable\n", 1776 pr_err("alg: hash [all...] |
H A D | sha512_generic.c | 8 #include <crypto/internal/hash.h> 164 static int sha512_final(struct shash_desc *desc, u8 *hash) argument 167 return sha512_base_finish(desc, hash); 171 unsigned int len, u8 *hash) 174 return sha512_final(desc, hash); 170 crypto_sha512_finup(struct shash_desc *desc, const u8 *data, unsigned int len, u8 *hash) argument
|
H A D | wp512.c | 22 #include <crypto/internal/hash.h> 43 u64 hash[WP512_DIGEST_SIZE/8]; member in struct:wp512_ctx 793 state[0] = block[0] ^ (K[0] = wctx->hash[0]); 794 state[1] = block[1] ^ (K[1] = wctx->hash[1]); 795 state[2] = block[2] ^ (K[2] = wctx->hash[2]); 796 state[3] = block[3] ^ (K[3] = wctx->hash[3]); 797 state[4] = block[4] ^ (K[4] = wctx->hash[4]); 798 state[5] = block[5] ^ (K[5] = wctx->hash[5]); 799 state[6] = block[6] ^ (K[6] = wctx->hash[6]); 800 state[7] = block[7] ^ (K[7] = wctx->hash[ [all...] |
/linux-master/net/netfilter/ipvs/ |
H A D | ip_vs_mh.c | 11 * destination with the hash key of source IP address��through looking 53 /* For IPVS MH entry hash table */ 87 /* Returns hash value for IPVS MH entry */ 104 /* Reset all the hash buckets of the specified table. */ 238 unsigned int hash = ip_vs_mh_hashkey(svc->af, addr, port, &s->hash1, 0) local 240 struct ip_vs_dest *dest = rcu_dereference(s->lookup[hash].dest); 251 unsigned int hash, ihash; local 271 hash = ip_vs_mh_hashkey(svc->af, addr, port, &s->hash1, 273 dest = rcu_dereference(s->lookup[hash].dest); 287 /* Assign all the hash bucket [all...] |
H A D | ip_vs_lblc.c | 46 #include <linux/hash.h> 74 * for IPVS lblc entry hash table 99 * IPVS lblc hash table 103 struct hlist_head bucket[IP_VS_LBLC_TAB_SIZE]; /* hash bucket */ 146 * Returns hash value for IPVS LBLC entry 169 unsigned int hash = ip_vs_lblc_hashkey(en->af, &en->addr); local 171 hlist_add_head_rcu(&en->list, &tbl->bucket[hash]); 181 unsigned int hash = ip_vs_lblc_hashkey(af, addr); local 184 hlist_for_each_entry_rcu(en, &tbl->bucket[hash], list) 355 IP_VS_DBG(6, "LBLC hash tabl [all...] |
H A D | ip_vs_proto_sctp.c | 493 __u16 hash; local 498 hash = sctp_app_hashkey(port); 500 list_for_each_entry(i, &ipvs->sctp_apps[hash], p_list) { 506 list_add_rcu(&inc->p_list, &ipvs->sctp_apps[hash]); 524 int hash; local 532 hash = sctp_app_hashkey(cp->vport); 534 list_for_each_entry_rcu(inc, &ipvs->sctp_apps[hash], p_list) {
|
/linux-master/drivers/net/dsa/mv88e6xxx/ |
H A D | global1_atu.c | 78 int mv88e6165_g1_atu_get_hash(struct mv88e6xxx_chip *chip, u8 *hash) argument 87 *hash = val & MV88E6161_G1_ATU_CTL_HASH_MASK; 92 int mv88e6165_g1_atu_set_hash(struct mv88e6xxx_chip *chip, u8 hash) argument 97 if (hash & ~MV88E6161_G1_ATU_CTL_HASH_MASK) 105 val |= hash;
|
/linux-master/drivers/gpu/drm/nouveau/nvkm/engine/fifo/ |
H A D | uchan.c | 71 int hash; member in struct:nvkm_uobj 141 engn->func->ramht_del(uobj->chan, uobj->hash); 195 uobj->hash = engn->func->ramht_add(engn, uobj->oproxy.object, uobj->chan); 196 if (uobj->hash < 0) 197 return uobj->hash;
|
/linux-master/fs/notify/fanotify/ |
H A D | fanotify.h | 261 unsigned int hash : FANOTIFY_EVENT_HASH_BITS; member in struct:fanotify_event::__anon402 267 unsigned int hash, u32 mask) 271 event->hash = hash; 470 * Use 128 size hash table to speed up events merge. 477 * Permission events and overflow event do not get merged - don't hash them. 489 return event->hash & FANOTIFY_HTABLE_MASK; 266 fanotify_init_event(struct fanotify_event *event, unsigned int hash, u32 mask) argument
|
/linux-master/net/netfilter/ |
H A D | nf_conntrack_bpf.c | 153 struct nf_conntrack_tuple_hash *hash; local 177 hash = nf_conntrack_find_get(net, &nf_ct_zone_dflt, &tuple); 180 if (!hash) 183 ct = nf_ct_tuplehash_to_ctrack(hash); 184 opts->dir = NF_CT_DIRECTION(hash);
|
/linux-master/fs/ubifs/ |
H A D | tnc_misc.c | 306 err = ubifs_node_check_hash(c, idx, zzbr->hash); 308 ubifs_bad_hash(c, idx, zzbr->hash, lnum, offs); 336 ubifs_copy_hash(c, ubifs_branch_hash(c, br), zbr->hash); 402 /* These can only be keys with colliding hash */ 517 err = ubifs_node_check_hash(c, node, zbr->hash); 519 ubifs_bad_hash(c, node, zbr->hash, zbr->lnum, zbr->offs);
|
/linux-master/drivers/net/ethernet/chelsio/cxgb4/ |
H A D | l2t.c | 78 * neighbors to be on the same hash chain. We keep v4 entries in the first 79 * half of available hash buckets and v6 in the second. We need at least two 115 * family, something made trivial by the separation of IP and IPv6 hash chains 284 * presently in the hash table. We need to remove it. 287 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next) 326 * presently in the hash table. We need to remove it. 329 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next) 341 /* Called when an L2T entry has no more users. The entry is left in the hash 425 int hash = addr_hash(d, addr, addr_len, ifidx); local 440 for (e = d->l2tab[hash] 513 int hash, ifidx = neigh->dev->ifindex; local [all...] |
/linux-master/drivers/crypto/ |
H A D | padlock-sha.c | 10 #include <crypto/internal/hash.h> 194 static int padlock_init_tfm(struct crypto_shash *hash) argument 196 const char *fallback_driver_name = crypto_shash_alg_name(hash); 197 struct padlock_sha_ctx *ctx = crypto_shash_ctx(hash); 210 hash->descsize += crypto_shash_descsize(fallback_tfm); 214 static void padlock_exit_tfm(struct crypto_shash *hash) argument 216 struct padlock_sha_ctx *ctx = crypto_shash_ctx(hash); 268 * multiple-parts hash supported by VIA Nano Processor.*/
|
/linux-master/tools/testing/selftests/bpf/progs/ |
H A D | map_ptr_kern.c | 110 struct bpf_htab *hash = (struct bpf_htab *)&m_hash; local 114 VERIFY(check_default_noinline(&hash->map, map)); 116 VERIFY(hash->n_buckets == MAX_ENTRIES); 117 VERIFY(hash->elem_size == 64); 119 VERIFY(hash->count.counter == 0); 126 if (bpf_map_update_elem(hash, &key, &val, 0)) 129 VERIFY(hash->count.counter == HALF_ENTRIES);
|
/linux-master/init/ |
H A D | initramfs.c | 67 /* link hash */ 71 static __initdata struct hash { struct 74 struct hash *next; 78 static inline int hash(int major, int minor, int ino) function 88 struct hash **p, *q; 89 for (p = head + hash(major, minor, ino); *p; p = &(*p)->next) { 100 q = kmalloc(sizeof(struct hash), GFP_KERNEL); 102 panic_show_mem("can't allocate link hash entry"); 115 struct hash **p, *q;
|
/linux-master/block/ |
H A D | elevator.c | 35 #include <linux/hash.h> 52 * Merge hash stuff. 137 hash_init(eq->hash); 168 hash_del(&rq->hash); 184 hash_add(e->hash, &rq->hash, rq_hash_key(rq)); 201 hash_for_each_possible_safe(e->hash, rq, next, hash, offset) { 300 * See if our hash lookup can find a potential backmerge. 347 * See if our hash looku [all...] |
/linux-master/arch/powerpc/platforms/pseries/ |
H A D | lpar.c | 9 /* Enables debugging of low-level hash table routines - careful! */ 800 pr_err("Failed hash pte insert with error %ld\n", lpar_rc); 865 pr_info("Failed to read hash page table at %ld err %ld\n", 941 pr_devel(" update: avpnv=%016lx, hash=%016lx, f=%lx, psize: %d ...", 971 pr_info("Failed to read hash page table at %ld err %ld\n", 989 unsigned long hash; local 993 hash = hpt_hash(vpn, mmu_psize_defs[psize].shift, ssize); 997 * We try to keep bolted entries always in primary hash 1000 hpte_group = (hash & htab_hash_mask) * HPTES_PER_GROUP; 1004 hpte_group = (~hash 1258 unsigned long shift, hidx, vpn = 0, hash, slot; local 1334 unsigned long slot, hash, hidx; local [all...] |
/linux-master/drivers/crypto/intel/qat/qat_common/ |
H A D | qat_algs.c | 12 #include <crypto/hash.h> 55 struct icp_qat_hw_auth_algo_blk hash; member in struct:qat_alg_cd::__anon58::qat_enc 58 struct icp_qat_hw_auth_algo_blk hash; member in struct:qat_alg_cd::__anon58::qat_dec 111 static int qat_alg_do_precomputes(struct icp_qat_hw_auth_algo_blk *hash, argument 152 hash_state_out = (__be32 *)hash->sha.state1; 188 hash_state_out = (__be32 *)(hash->sha.state1 + offset); 245 struct icp_qat_hw_auth_algo_blk *hash = local 258 hash->sha.inner_setup.auth_config.config = 261 hash->sha.inner_setup.auth_counter.counter = 264 if (qat_alg_do_precomputes(hash, ct 325 struct icp_qat_hw_auth_algo_blk *hash = &dec_ctx->hash; local 1152 qat_alg_aead_init(struct crypto_aead *tfm, enum icp_qat_hw_auth_algo hash, const char *hash_name) argument [all...] |
/linux-master/drivers/net/wireless/zydas/zd1211rw/ |
H A D | zd_chip.h | 427 /* Group hash table for filtering incoming packets. 429 * The group hash table is 64 bit large and split over two parts. The first 431 * address are used as index. Packets are received if the hash table bit is 942 static inline void zd_mc_clear(struct zd_mc_hash *hash) argument 944 hash->low = 0; 946 * The hash of the broadcast address ff:ff:ff:ff:ff:ff is 63. 948 hash->high = 0x80000000; 951 static inline void zd_mc_add_all(struct zd_mc_hash *hash) argument 953 hash->low = hash 956 zd_mc_add_addr(struct zd_mc_hash *hash, u8 *addr) argument [all...] |
/linux-master/fs/f2fs/ |
H A D | dir.c | 88 /* hash was decoded from the no-key name */ 89 fname->hash = cpu_to_le32(crypt_name->hash); 276 if (de->hash_code == fname->hash) { 318 le32_to_cpu(fname->hash) % nbucket); 352 if (!de && room && F2FS_I(dir)->chash != fname->hash) { 353 F2FS_I(dir)->chash = fname->hash; 490 put_unaligned(fname->hash, (f2fs_hash_t *) 696 if (F2FS_I(dir)->chash == fname->hash) { 716 (le32_to_cpu(fname->hash) [all...] |
/linux-master/fs/nfsd/ |
H A D | nfs4idmap.c | 114 uint32_t hash; local 116 hash = hash_str(ent->authname, ENT_HASHBITS); 117 hash = hash_long(hash ^ ent->id, ENT_HASHBITS); 121 hash ^= 1; 123 return hash;
|