Searched refs:hash (Results 151 - 175 of 1185) sorted by relevance

1234567891011>>

/linux-master/fs/nfs/
H A Dpnfs_dev.c81 long hash)
85 hlist_for_each_entry_rcu(d, &nfs4_deviceid_cache[hash], node)
174 const struct nfs4_deviceid *id, long hash)
180 hash);
192 long hash = nfs4_deviceid_hash(id); local
195 d = __nfs4_find_get_deviceid(server, id, hash);
206 d = __nfs4_find_get_deviceid(server, id, hash);
212 hlist_add_head_rcu(&new->node, &nfs4_deviceid_cache[hash]);
331 _deviceid_purge_client(const struct nfs_client *clp, long hash) argument
338 hlist_for_each_entry_rcu(d, &nfs4_deviceid_cache[hash], nod
79 _lookup_deviceid(const struct pnfs_layoutdriver_type *ld, const struct nfs_client *clp, const struct nfs4_deviceid *id, long hash) argument
173 __nfs4_find_get_deviceid(struct nfs_server *server, const struct nfs4_deviceid *id, long hash) argument
[all...]
/linux-master/io_uring/
H A Dio-wq.c39 IO_ACCT_STALLED_BIT = 0, /* stalled on hash */
102 struct io_wq_hash *hash; member in struct:io_wq
458 static bool io_wait_on_hash(struct io_wq *wq, unsigned int hash) argument
462 spin_lock_irq(&wq->hash->wait.lock);
464 __add_wait_queue(&wq->hash->wait, &wq->wait);
465 if (!test_bit(hash, &wq->hash->map)) {
471 spin_unlock_irq(&wq->hash->wait.lock);
485 unsigned int hash; variable
495 hash
590 unsigned int hash = io_get_work_hash(work); variable
901 unsigned int hash; local
1021 unsigned int hash = io_get_work_hash(work); local
[all...]
/linux-master/fs/ubifs/
H A Dauth.c13 #include <crypto/hash.h>
21 * __ubifs_node_calc_hash - calculate the hash of a UBIFS node
23 * @node: the node to calculate a hash for
24 * @hash: the returned hash
29 u8 *hash)
34 hash);
38 * ubifs_hash_calc_hmac - calculate a HMAC from a hash
40 * @hash: the node to calculate a HMAC for
45 static int ubifs_hash_calc_hmac(const struct ubifs_info *c, const u8 *hash, argument
28 __ubifs_node_calc_hash(const struct ubifs_info *c, const void *node, u8 *hash) argument
66 u8 hash[UBIFS_HASH_ARR_SZ]; local
136 ubifs_bad_hash(const struct ubifs_info *c, const void *node, const u8 *hash, int lnum, int offs) argument
[all...]
/linux-master/lib/xz/
H A Dxz_dec_stream.c93 struct xz_dec_hash hash; member in struct:xz_dec::__anon1182
112 * Hash calculated from the Records (matches block.hash in
115 struct xz_dec_hash hash; member in struct:xz_dec::__anon1183
215 * the sizes possibly stored in the Block Header. Update the hash and
259 s->block.hash.unpadded += s->block_header.size
263 s->block.hash.unpadded += check_sizes[s->check_type];
266 s->block.hash.unpadded += 4;
269 s->block.hash.uncompressed += s->block.uncompressed;
270 s->block.hash.crc32 = xz_crc32(
271 (const uint8_t *)&s->block.hash,
[all...]
/linux-master/scripts/
H A Dparse-maintainers.pl177 my %hash;
180 file_input(\%hash, $input_file);
183 foreach my $key (keys %hash) {
184 if ($key =~ /$type/ || $hash{$key} =~ /$type/) {
185 $new_hash{$key} = $hash{$key};
186 delete $hash{$key};
191 alpha_output(\%hash, $output_file);
/linux-master/drivers/net/wireguard/
H A Dratelimiter.c30 struct hlist_node hash; member in struct:ratelimiter_entry
50 hlist_del_rcu(&entry->hash);
64 hlist_for_each_entry_safe(entry, temp, &table_v4[i], hash) {
70 hlist_for_each_entry_safe(entry, temp, &table_v6[i], hash) {
86 /* We only take the bottom half of the net pointer, so that we can hash
111 hlist_for_each_entry_rcu(entry, bucket, hash) {
144 INIT_HLIST_NODE(&entry->hash);
149 hlist_add_head_rcu(&entry->hash, bucket);
/linux-master/arch/mips/cavium-octeon/crypto/
H A Docteon-sha1.c24 #include <crypto/internal/hash.h>
34 u64 *hash = (u64 *)sctx->state; local
40 write_octeon_64bit_hash_dword(hash[0], 0);
41 write_octeon_64bit_hash_dword(hash[1], 1);
48 u64 *hash = (u64 *)sctx->state; local
54 hash[0] = read_octeon_64bit_hash_dword(0);
55 hash[1] = read_octeon_64bit_hash_dword(1);
/linux-master/net/netfilter/
H A Dnft_set_hash.c21 /* We target a hash table size of 4, element hint is 75% of final size */
499 u32 hash; local
501 hash = jhash(key, set->klen, priv->seed);
502 hash = reciprocal_scale(hash, priv->buckets);
503 hlist_for_each_entry_rcu(he, &priv->table[hash], node) {
520 u32 hash; local
522 hash = jhash(elem->key.val.data, set->klen, priv->seed);
523 hash = reciprocal_scale(hash, pri
540 u32 hash, k1, k2; local
560 u32 hash, k1; local
580 u32 hash; local
619 u32 hash; local
[all...]
/linux-master/drivers/infiniband/hw/mthca/
H A Dmthca_mcg.c54 * If GID is found in MGM or MGM is empty, *index = *hash, *prev = -1
58 * previous entry in hash chain and *mgm holds AMGM entry.
61 * entry in hash chain and *mgm holds end of hash chain.
65 u16 *hash, int *prev, int *index)
79 err = mthca_MGID_HASH(dev, mailbox, hash);
86 mthca_dbg(dev, "Hash for %pI6 is %04x\n", gid, *hash);
88 *index = *hash;
99 if (*index != *hash) {
125 u16 hash; local
63 find_mgm(struct mthca_dev *dev, u8 *gid, struct mthca_mailbox *mgm_mailbox, u16 *hash, int *prev, int *index) argument
219 u16 hash; local
[all...]
/linux-master/drivers/firmware/efi/
H A Dembedded-firmware.c41 u8 hash[32]; local
56 sha256(map + i, desc->length, hash);
57 if (memcmp(hash, desc->sha256, 32) == 0)
/linux-master/crypto/
H A Dcrc32_generic.c12 #include <crypto/internal/hash.h>
36 static int crc32_setkey(struct crypto_shash *hash, const u8 *key, argument
39 u32 *mctx = crypto_shash_ctx(hash);
H A Dsha256_generic.c10 #include <crypto/internal/hash.h>
54 unsigned int len, u8 *hash)
57 return crypto_sha256_final(desc, hash);
53 crypto_sha256_finup(struct shash_desc *desc, const u8 *data, unsigned int len, u8 *hash) argument
/linux-master/fs/f2fs/
H A Dhash.c3 * fs/f2fs/hash.c
8 * Portions of this code from linux/fs/ext3/hash.c
74 /* Initialize the default seed for the hash checksum functions */
92 * Compute @fname->hash. For all directories, @fname->disk_name must be set.
104 fname->hash = 0;
111 * If the casefolded name is provided, hash it instead of the
130 fname->hash =
136 fname->hash = cpu_to_le32(TEA_hash_name(name, len));
/linux-master/net/tls/
H A Dtls_toe.c109 err = ctx->sk_proto->hash(sk);
112 if (dev->hash) {
115 err |= dev->hash(dev, sk);
/linux-master/include/net/
H A Dudp.h53 * struct udp_hslot - UDP hash slot
68 * @hash: hash table, sockets are hashed on (local port)
69 * @hash2: hash table, sockets are hashed on (local port, local address)
70 * @mask: number of slots in hash tables, minus 1
71 * @log: log2(number of slots in hash table)
74 struct udp_hslot *hash; member in struct:udp_table
84 return &table->hash[udp_hashfn(net, num, table->mask)];
87 * For secondary hash, net_hash_mix() is performed before calling
91 unsigned int hash)
90 udp_hashslot2(struct udp_table *table, unsigned int hash) argument
210 u32 hash; local
[all...]
/linux-master/security/selinux/ss/
H A Dhashtab.h3 * A hash table (hashtab) maintains associations between
6 * functions for hash computation and key comparison are
22 u32 (*hash)(const void *key); /* hash func */ member in struct:hashtab_key_params
33 struct hashtab_node **htable; /* hash table */
34 u32 size; /* number of slots in hash table */
35 u32 nel; /* number of elements in hash table */
45 * Initializes a new hash table with the specified characteristics.
55 * Inserts the specified (key, datum) pair into the specified hash table.
73 hvalue = key_params.hash(ke
[all...]
/linux-master/lib/
H A Dstackdepot.c5 * Internally, stack depot maintains a hash table of unique stacktraces. The
49 /* Use one hash table bucket per 16 KB of memory. */
112 /* Initialize list_head's within the hash table. */
121 /* Allocates a hash table via memblock. Can only be used during early boot. */
161 pr_info("allocating hash table via alloc_large_system_hash\n");
172 pr_err("hash table allocation failed, disabling\n");
188 /* Allocates a hash table via kvcalloc. Can be used after boot. */
223 pr_info("allocating hash table of %lu entries via kvcalloc\n", entries);
226 pr_err("hash table allocation failed, disabling\n");
381 depot_alloc_stack(unsigned long *entries, unsigned int nr_entries, u32 hash, depot_flags_ argument
535 find_stack(struct list_head *bucket, unsigned long *entries, int size, u32 hash, depot_flags_t flags) argument
596 u32 hash; local
[all...]
H A Drhashtable.c53 int lockdep_rht_bucket_is_held(const struct bucket_table *tbl, u32 hash) argument
59 return bit_spin_is_locked(0, (unsigned long *)&tbl->buckets[hash]);
375 * rhashtable_shrink - Shrink hash table while allowing concurrent lookups
376 * @ht: the hash table to shrink
378 * This function shrinks the hash table to fit, i.e., the smallest
492 struct bucket_table *tbl, unsigned int hash,
504 rht_for_each_from(head, rht_ptr(bkt, tbl, hash), tbl, hash) {
524 head = rht_dereference_bucket(head->next, tbl, hash);
543 struct bucket_table *tbl, unsigned int hash, struc
490 rhashtable_lookup_one(struct rhashtable *ht, struct rhash_lock_head __rcu **bkt, struct bucket_table *tbl, unsigned int hash, const void *key, struct rhash_head *obj) argument
541 rhashtable_insert_one( struct rhashtable *ht, struct rhash_lock_head __rcu **bkt, struct bucket_table *tbl, unsigned int hash, struct rhash_head *obj, void *data) argument
597 unsigned int hash; local
1178 __rht_bucket_nested( const struct bucket_table *tbl, unsigned int hash) argument
1207 rht_bucket_nested( const struct bucket_table *tbl, unsigned int hash) argument
1218 rht_bucket_nested_insert( struct rhashtable *ht, struct bucket_table *tbl, unsigned int hash) argument
[all...]
/linux-master/fs/ext2/
H A Dxattr.c523 __u32 hash = le32_to_cpu(header->h_hash); local
527 hash, bh->b_blocknr);
661 __u32 hash = le32_to_cpu(HDR(bh)->h_hash); local
668 oe = mb_cache_entry_delete_or_get(ea_block_cache, hash,
874 __u32 hash = le32_to_cpu(HDR(bh)->h_hash); local
877 error = mb_cache_entry_create(cache, GFP_KERNEL, hash, bh->b_blocknr,
885 ea_bdebug(bh, "inserting [%x]", (int)hash);
940 __u32 hash = le32_to_cpu(header->h_hash); local
946 ea_idebug(inode, "looking for cached blocks [%x]", (int)hash);
948 ce = mb_cache_entry_find_first(ea_block_cache, hash);
991 __u32 hash = 0; local
1028 __u32 hash = 0; local
[all...]
/linux-master/fs/notify/fanotify/
H A Dfanotify.c135 if (old->hash != new->hash ||
400 unsigned int fh_len, unsigned int *hash,
455 if (hash)
456 *hash ^= fanotify_hash_fh(fh);
535 unsigned int *hash,
546 *hash ^= fanotify_hash_path(path);
575 unsigned int *hash,
586 *hash ^= fanotify_hash_fsid(fsid);
588 hash, gf
399 fanotify_encode_fh(struct fanotify_fh *fh, struct inode *inode, unsigned int fh_len, unsigned int *hash, gfp_t gfp) argument
534 fanotify_alloc_path_event(const struct path *path, unsigned int *hash, gfp_t gfp) argument
573 fanotify_alloc_fid_event(struct inode *id, __kernel_fsid_t *fsid, unsigned int *hash, gfp_t gfp) argument
593 fanotify_alloc_name_event(struct inode *dir, __kernel_fsid_t *fsid, const struct qstr *name, struct inode *child, struct dentry *moved, unsigned int *hash, gfp_t gfp) argument
668 fanotify_alloc_error_event( struct fsnotify_group *group, __kernel_fsid_t *fsid, const void *data, int data_type, unsigned int *hash) argument
723 unsigned int hash = 0; local
[all...]
/linux-master/net/batman-adv/
H A Dnetwork-coding.c40 #include "hash.h"
130 * batadv_nc_mesh_init() - initialise coding hash table and start housekeeping
390 * batadv_nc_purge_orig_hash() - traverse entire originator hash to check if
396 struct batadv_hashtable *hash = bat_priv->orig_hash; local
401 if (!hash)
405 for (i = 0; i < hash->size; i++) {
406 head = &hash->table[i];
417 * batadv_nc_purge_paths() - traverse all nc paths part of the hash and remove
420 * @hash: hash tabl
426 batadv_nc_purge_paths(struct batadv_priv *bat_priv, struct batadv_hashtable *hash, bool (*to_purge)(struct batadv_priv *, struct batadv_nc_path *)) argument
498 u32 hash = 0; local
540 batadv_nc_hash_find(struct batadv_hashtable *hash, void *data) argument
667 batadv_nc_process_nc_paths(struct batadv_priv *bat_priv, struct batadv_hashtable *hash, bool (*process_fn)(struct batadv_priv *, struct batadv_nc_path *, struct batadv_nc_packet *)) argument
951 batadv_nc_get_path(struct batadv_priv *bat_priv, struct batadv_hashtable *hash, u8 *src, u8 *dst) argument
1266 struct batadv_hashtable *hash = bat_priv->nc.coding_hash; local
1733 struct batadv_hashtable *hash = bat_priv->nc.decoding_hash; local
[all...]
/linux-master/fs/kernfs/
H A Ddir.c16 #include <linux/hash.h>
306 * kernfs_name_hash - calculate hash of @ns + @name
307 * @name: Null terminated string to hash
308 * @ns: Namespace tag to hash
310 * Return: 31-bit hash of ns + name (so it fits in an off_t)
314 unsigned long hash = init_name_hash(ns); local
317 hash = partial_name_hash(*name++, hash);
318 hash = end_name_hash(hash);
328 kernfs_name_compare(unsigned int hash, const char *name, const void *ns, const struct kernfs_node *kn) argument
843 unsigned int hash; local
1792 kernfs_dir_pos(const void *ns, struct kernfs_node *parent, loff_t hash, struct kernfs_node *pos) argument
[all...]
/linux-master/drivers/gpu/drm/nouveau/nvkm/core/
H A Dramht.c29 u32 hash = 0; local
32 hash ^= (handle & ((1 << ramht->bits) - 1));
36 hash ^= chid << (ramht->bits - 4);
37 return hash;
/linux-master/net/ceph/
H A Dceph_hash.c6 * Robert Jenkin's hash function.
7 * https://burtleburtle.net/bob/hash/evahash.html
92 * linux dcache hash
96 unsigned long hash = 0; local
101 hash = (hash + (c << 4) + (c >> 4)) * 11;
103 return hash;
/linux-master/drivers/crypto/
H A Datmel-authenc.h18 #include <crypto/hash.h>

Completed in 213 milliseconds

1234567891011>>