Searched refs:hash (Results 201 - 225 of 1185) sorted by last modified time

1234567891011>>

/linux-master/fs/xfs/libxfs/
H A Dxfs_dir2_block.c365 xfs_dahash_t hash; /* hash value of found entry */ local
452 * Find the slot that's first lower than our hash value, -1 if none.
456 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval)
458 if (hash < args->hashval)
690 xfs_dahash_t hash; /* found hash value */ local
709 * Loop doing a binary search for our hash value.
715 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval)
717 if (hash < arg
[all...]
H A Dxfs_dir2.c70 xfs_dahash_t hash; local
73 for (i = 0, hash = 0; i < name->len; i++)
74 hash = xfs_ascii_ci_xfrm(name->name[i]) ^ rol32(hash, 7);
76 return hash;
H A Dxfs_da_btree.c250 /* XXX: hash order check? */
1068 * Copy the last hash value from the oldblk to propagate upwards.
1391 * Walk back up the tree adjusting hash values as necessary,
1490 * Copy the last hash value from the block to propagate upwards.
2118 * Implement a simple hash on a character string.
2119 * Rotate the hash value by 7 bits, then XOR each character in.
2125 xfs_dahash_t hash; local
2130 for (hash = 0; namelen >= 4; namelen -= 4, name += 4)
2131 hash = (name[0] << 21) ^ (name[1] << 14) ^ (name[2] << 7) ^
2132 (name[3] << 0) ^ rol32(hash,
[all...]
/linux-master/fs/smb/client/
H A Dcifsfs.h12 #include <linux/hash.h>
/linux-master/fs/reiserfs/
H A Dsuper.c1712 /* hash detection stuff */
1715 * if root directory is empty - we set default - Yura's - hash and
1729 __u32 hash = DEFAULT_HASH; local
1749 hash = YURA_HASH;
1750 reiserfs_info(s, "FS seems to be empty, autodetect is using the default hash\n");
1763 "Unable to automatically detect hash "
1765 "hash={tea,rupasov,r5}");
1766 hash = UNSET_HASH;
1771 hash = YURA_HASH;
1773 hash
[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/fs/isofs/
H A Dinode.c172 * Compute the hash for the isofs name corresponding to the dentry.
180 unsigned long hash; local
189 hash = init_name_hash(dentry);
192 hash = partial_name_hash(c, hash);
194 qstr->hash = end_name_hash(hash);
244 * Compute the hash for the isofs name corresponding to the dentry.
259 qstr->hash = full_name_hash(dentry, name, len);
/linux-master/fs/ext4/
H A Dext4.h36 #include <crypto/hash.h>
486 #define EXT4_INDEX_FL 0x00001000 /* hash-indexed directory */
585 EXT4_INODE_INDEX = 12, /* hash-indexed directory */
1364 __le32 s_hash_seed[4]; /* HTREE hash seed */
1365 __u8 s_def_hash_version; /* Default hash version to use */
1530 int s_hash_unsigned; /* 3 if hash should be unsigned, 0 if not */
2308 * Encrypted Casefolded entries require saving the hash on disk. This structure
2313 __le32 hash; member in struct:ext4_dir_entry_hash
2338 #define EXT4_DIRENT_HASH(entry) le32_to_cpu(EXT4_DIRENT_HASHES(de)->hash)
2392 * casefolded and encrypted need to store the hash a
2486 u32 hash; member in struct:dx_hash_info
[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/drivers/pci/controller/dwc/
H A Dpcie-qcom.c1069 u8 hash; local
1071 hash = crc8(qcom_pcie_crc8_table, (u8 *)&bdf_be, sizeof(bdf_be), 0);
1073 val = readl(bdf_to_sid_base + hash * sizeof(u32));
1077 u8 current_hash = hash++;
1080 /* If NEXT field is NULL then update it with next hash */
1082 val |= (u32)hash;
1086 val = readl(bdf_to_sid_base + hash * sizeof(u32));
1091 writel(val, bdf_to_sid_base + hash * sizeof(u32));
/linux-master/drivers/net/ethernet/sun/
H A Dsunvnet.c207 unsigned int hash = vnet_hashfn(skb->data); local
208 struct hlist_head *hp = &vp->port_hash[hash];
211 hlist_for_each_entry_rcu(port, hp, hash) {
475 INIT_HLIST_NODE(&port->hash);
490 hlist_add_head_rcu(&port->hash,
527 hlist_del_rcu(&port->hash);
H A Dniu.c3167 /* IPV4 hash entry with valid bit clear, rest is don't care. */
6305 static void niu_load_hash_xmac(struct niu *np, u16 *hash) argument
6310 nw64_mac(XMAC_HASH_TBL(i), hash[i]); local
6313 static void niu_load_hash_bmac(struct niu *np, u16 *hash) argument
6318 nw64_mac(BMAC_HASH_TBL(i), hash[i]); local
6321 static void niu_load_hash(struct niu *np, u16 *hash) argument
6324 niu_load_hash_xmac(np, hash);
6326 niu_load_hash_bmac(np, hash);
6335 u16 hash[16] = { 0, }; local
6382 hash[
[all...]
/linux-master/drivers/md/
H A Ddm-verity.h18 #include <crypto/hash.h>
48 sector_t hash_start; /* hash start in blocks */
50 sector_t hash_blocks; /* the number of hash blocks */
52 unsigned char hash_dev_block_bits; /* log2(hash blocksize) */
53 unsigned char hash_per_block_bits; /* log2(hashes in hash block) */
56 bool hash_failed:1; /* set if hash of any block failed */
58 unsigned int digest_size; /* digest size for the current hash algorithm */
H A Ddm-region-hash.c10 #include <linux/dm-region-hash.h>
20 #define DM_MSG_PREFIX "region hash"
24 * Region hash
28 * nosync. There is no need to put clean regions in the hash.
30 * In addition to being present in the hash table a region _may_
36 * hash table.
46 * hash.
49 * A rw spin lock 'hash_lock' protects just the hash table,
67 /* hash table */
179 * Calculate a suitable number of buckets for our hash
[all...]
H A Ddm-raid1.c21 #include <linux/dm-region-hash.h>
928 ti->error = "Error creating dirty region hash";
H A Ddm-crypt.c32 #include <crypto/hash.h>
117 #define LMK_SEED_SIZE 64 /* hash + 0 */
440 ti->error = "Error initializing LMK hash";
525 __cpu_to_le32s(&md5state.hash[i]);
526 memcpy(iv, &md5state.hash, cc->iv_size);
2933 /* Separate IV options if present, it can contain another '-' in hash name */
H A Ddm-cache-policy-smq.c13 #include <linux/hash.h>
582 * All cache entries are stored in a chained hash table. To save space we
840 * The hash tables allows us to quickly find an entry by origin
/linux-master/drivers/md/dm-vdo/
H A Dint-map.c16 * probing, all the entries that hash to a given bucket are stored within a fixed neighborhood
36 * entries of the hash bucket at the start of the neighborhood, a pair of small offset fields each
66 * struct bucket - hash bucket
101 /** @buckets: The array of hash buckets. */
106 * mix() - The Google CityHash 16-byte hash mixing function.
110 * Return: A hash of the two inputs.
115 u64 hash = (input1 ^ input2); local
117 hash *= CITY_MULTIPLIER;
118 hash ^= (hash >> 4
299 u64 hash = hash_key(key) & 0xFFFFFFFF; local
[all...]
H A Ddedupe.c17 * Hash_locks are assigned to hash_zones by computing a modulus on the hash itself. Each hash_zone
49 * lock, releasing the hash_lock itself back to the hash zone (BYPASSING).
74 * on the hash zone thread. finish_locking() is called by (or continued via callback from) the
97 * to DEDUPE_CONTEXT_COMPLETE, and the associated data_vio will be enqueued to run back in the hash
224 /* The block hash covered by this lock */
225 struct uds_record_name hash; member in struct:hash_lock
303 /* The hash zones themselves */
329 "%s called on hash zone thread", name);
343 * return_hash_lock_to_pool() - (Re)initialize a hash lock and return it to its pool.
372 * hash_lock_key() - Return hash_lock's record name as a hash cod
867 acquire_lock(struct hash_zone *zone, const struct uds_record_name *hash, struct hash_lock *replace_lock, struct hash_lock **lock_ptr) argument
2722 u32 hash = name->name[0]; local
[all...]
/linux-master/drivers/gpu/drm/vmwgfx/
H A Dttm_object.c67 * ref_hash hash tables.
106 * @hash: Hash entry for the per-file object reference hash.
116 * This is similar to an idr object, but it also has a hash table entry
126 struct vmwgfx_hash_item hash; member in struct:ttm_ref_object
146 struct vmwgfx_hash_item *hash; local
148 hash_for_each_possible_rcu(tfile->ref_hash, hash, head, key) {
149 if (hash->key == key) {
150 *p_hash = hash;
161 struct vmwgfx_hash_item *hash; local
261 struct vmwgfx_hash_item *hash; local
299 struct vmwgfx_hash_item *hash; local
368 struct vmwgfx_hash_item *hash; local
[all...]
/linux-master/drivers/gpu/drm/bridge/
H A Dite-it6505.c22 #include <crypto/hash.h>
/linux-master/drivers/gpu/drm/amd/amdkfd/
H A Dkfd_topology.c29 #include <linux/hash.h>
/linux-master/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_gmc.c408 uint32_t hash; local
420 /* Try to find the fault in the hash */
421 hash = hash_64(key, AMDGPU_GMC_FAULT_HASH_ORDER);
422 fault = &gmc->fault_ring[gmc->fault_hash[hash].idx];
455 /* And update the hash */
456 fault->next = gmc->fault_hash[hash].idx;
457 gmc->fault_hash[hash].idx = gmc->last_fault++;
480 uint32_t hash; local
494 hash = hash_64(key, AMDGPU_GMC_FAULT_HASH_ORDER);
495 fault = &gmc->fault_ring[gmc->fault_hash[hash]
[all...]
/linux-master/drivers/crypto/
H A Dn2_core.c27 #include <crypto/internal/hash.h>
/linux-master/crypto/
H A Dblake2b_generic.c23 #include <crypto/internal/hash.h>

Completed in 660 milliseconds

1234567891011>>