Home
last modified time | relevance | path

Searched refs:hash (Results 1326 - 1350 of 2449) sorted by relevance

1...<<51525354555657585960>>...98

/kernel/linux/linux-5.10/security/tomoyo/
H A Dcommon.h44 * TOMOYO uses this hash only when appending a string into the string
46 * large (e.g. 64k) hash size. 256 will be sufficient.
506 u32 hash; /* = full_name_hash(name, strlen(name)) */ member
1168 return a->hash != b->hash || strcmp(a->name, b->name); in tomoyo_pathcmp()
/kernel/linux/linux-5.10/fs/ntfs/
H A Dlayout.h498 * COLLATION_NTOFS_SECURITY_HASH - Sorting is done first by ascending hash
1797 * A simple hash is computed from each security descriptor. This hash is used
1800 * The $SDH index is sorted by security descriptor hash and is stored in a B+
1803 * matching hash is found, but the security descriptors do not match, the
1804 * search in the $SDH index is continued, searching for a next matching hash.
1827 le32 hash; /* Hash of the security descriptor. */ member
1848 le32 hash; /* Hash of the security descriptor. */ member
1866 * hash and then by security_id. The collation rule is
1870 le32 hash; /* Has member
[all...]
/kernel/linux/linux-5.10/fs/reiserfs/
H A Dxattr.c461 * when trying to fetch xattrs. Treating the hash as __wsum_t would in xattr_hash()
665 __u32 hash = 0; in reiserfs_xattr_get() local
739 hash = le32_to_cpu(rxh->h_hash); in reiserfs_xattr_get()
751 hash) { in reiserfs_xattr_get()
753 "Invalid hash for xattr (%s) associated " in reiserfs_xattr_get()
/kernel/linux/linux-6.6/drivers/net/ethernet/fungible/funeth/
H A Dfuneth_rx.c217 /* Return the type of hash provided by the device based on the L3 and L4
434 if (likely((q->netdev->features & NETIF_F_RXHASH) && rxreq->hash)) in fun_handle_cqe_pkt()
435 skb_set_hash(skb, be32_to_cpu(rxreq->hash), in fun_handle_cqe_pkt()
445 trace_funeth_rx(q, rxreq->nsgl, pkt_len, skb->hash, cv); in fun_handle_cqe_pkt()
/kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/
H A Den_arfs.c33 #include <linux/hash.h>
96 #define mlx5e_for_each_hash_arfs_rule(hn, tmp, hash, j) \
98 hlist_for_each_entry_safe(hn, tmp, &hash[j], hlist)
/kernel/linux/linux-6.6/fs/ntfs/
H A Dlayout.h498 * COLLATION_NTOFS_SECURITY_HASH - Sorting is done first by ascending hash
1797 * A simple hash is computed from each security descriptor. This hash is used
1800 * The $SDH index is sorted by security descriptor hash and is stored in a B+
1803 * matching hash is found, but the security descriptors do not match, the
1804 * search in the $SDH index is continued, searching for a next matching hash.
1827 le32 hash; /* Hash of the security descriptor. */ member
1848 le32 hash; /* Hash of the security descriptor. */ member
1866 * hash and then by security_id. The collation rule is
1870 le32 hash; /* Has member
[all...]
/kernel/linux/linux-6.6/fs/reiserfs/
H A Dxattr.c455 * when trying to fetch xattrs. Treating the hash as __wsum_t would in xattr_hash()
660 __u32 hash = 0; in reiserfs_xattr_get() local
734 hash = le32_to_cpu(rxh->h_hash); in reiserfs_xattr_get()
746 hash) { in reiserfs_xattr_get()
748 "Invalid hash for xattr (%s) associated " in reiserfs_xattr_get()
/kernel/linux/linux-6.6/drivers/fpga/
H A Dintel-m10-bmc-sec-update.c112 u8 hash[REH_SHA384_SIZE]; in show_root_entry_hash() local
120 return sysfs_emit(buf, "hash not programmed\n"); in show_root_entry_hash()
130 ret = m10bmc_sec_read(sec, hash, reh_addr, sha_num_bytes); in show_root_entry_hash()
132 dev_err(dev, "failed to read root entry hash\n"); in show_root_entry_hash()
137 cnt += sprintf(buf + cnt, "%02x", hash[i]); in show_root_entry_hash()
/kernel/linux/linux-6.6/drivers/crypto/amcc/
H A Dcrypto4xx_alg.c16 #include <linux/hash.h>
17 #include <crypto/internal/hash.h>
572 pr_err("GCM hash key setting failed = %d\n", rc); in crypto4xx_setkey_aes_gcm()
635 alg.u.hash); in crypto4xx_hash_alg_init()
659 /* Need to zero hash digest in SA */ in crypto4xx_hash_alg_init()
/kernel/linux/linux-6.6/drivers/net/wireless/realtek/rtw89/
H A Dcam.c641 u8 hash = 0; in rtw89_cam_addr_hash() local
645 hash ^= addr[i]; in rtw89_cam_addr_hash()
647 return hash; in rtw89_cam_addr_hash()
/kernel/linux/linux-6.6/tools/perf/arch/arm/util/
H A Dcs-etm.c254 u32 hash; in cs_etm_set_sink_attr() local
266 ret = perf_pmu__scan_file(pmu, path, "%x", &hash); in cs_etm_set_sink_attr()
280 evsel->core.attr.config2 |= hash; in cs_etm_set_sink_attr()
/kernel/linux/linux-6.6/net/rds/
H A Dconnection.c60 u32 lhash, fhash, hash; in rds_conn_bucket() local
71 hash = __inet_ehashfn(lhash, 0, fhash, 0, rds_hash_secret); in rds_conn_bucket()
73 return &rds_conn_hash[hash & RDS_CONNECTION_HASH_MASK]; in rds_conn_bucket()
426 * to the conn hash, so we never trigger a reconnect on this in rds_conn_shutdown()
/kernel/linux/linux-6.6/rust/alloc/
H A Dboxed.rs158 use core::hash::{Hash, Hasher};
1385 fn hash<H: Hasher>(&self, state: &mut H) { in hash() functions
1386 (**self).hash(state); in hash()
/kernel/linux/linux-6.6/security/tomoyo/
H A Dcommon.h44 * TOMOYO uses this hash only when appending a string into the string
46 * large (e.g. 64k) hash size. 256 will be sufficient.
506 u32 hash; /* = full_name_hash(name, strlen(name)) */ member
1165 return a->hash != b->hash || strcmp(a->name, b->name); in tomoyo_pathcmp()
/kernel/linux/linux-6.6/lib/zstd/compress/
H A Dzstd_fast.c28 /* Always insert every fastHashFillStep position into the hash table. in ZSTD_fillHashTable()
29 * Insert the other positions if their hash entry is empty. in ZSTD_fillHashTable()
39 size_t const hash = ZSTD_hashPtr(ip + p, hBits, mls); in ZSTD_fillHashTable() local
40 if (hashTable[hash] == 0) { /* not yet filled */ in ZSTD_fillHashTable()
41 hashTable[hash] = curr + p; in ZSTD_fillHashTable()
50 * 1. Hash (map position to hash value via input read)
51 * 2. Lookup (map hash val to index via hashtable read)
122 size_t hash0; /* hash for ip0 */ in ZSTD_compressBlock_fast_noDict_generic()
123 size_t hash1; /* hash for ip1 */ in ZSTD_compressBlock_fast_noDict_generic()
172 /* write back hash tabl in ZSTD_compressBlock_fast_noDict_generic()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/chelsio/cxgb4/
H A Dcxgb4_filter.c256 fconf = fs->hash ? adapter->params.tp.filter_mask : in validate_filter()
358 u64 *pkts, u64 *bytes, bool hash) in get_filter_count()
367 if (is_hashfilter(adapter) && hash) { in get_filter_count()
438 u64 *hitcnt, u64 *bytecnt, bool hash) in cxgb4_get_filter_counters()
442 return get_filter_count(adapter, fidx, hitcnt, bytecnt, hash); in cxgb4_get_filter_counters()
996 if ((f->fs.hash || is_t6(adap->params.chip)) && f->fs.type) in clear_filter()
1031 /* Clear all hash filters */ in clear_all_filters()
1166 /* Keep tunnel VNI match disabled for hash-filters for now */ in is_filter_exact_match()
1539 if (fs->hash) { in __cxgb4_set_filter()
1810 if (fs && fs->hash) { in __cxgb4_del_filter()
357 get_filter_count(struct adapter *adapter, unsigned int fidx, u64 *pkts, u64 *bytes, bool hash) get_filter_count() argument
437 cxgb4_get_filter_counters(struct net_device *dev, unsigned int fidx, u64 *hitcnt, u64 *bytecnt, bool hash) cxgb4_get_filter_counters() argument
[all...]
/kernel/linux/linux-5.10/fs/cifs/
H A Dinode.c789 /* Simple function to return a 64 bit hash of string. Rarely called */
793 __u64 hash = 0; local
796 hash = (hash + (__u64) *str++) * hash_mult;
798 return hash;
1290 unsigned long hash; local
1296 /* hash down to 32-bits on 32-bit arch */
1297 hash = cifs_uniqueid_to_ino_t(fattr->cf_uniqueid);
1299 inode = iget5_locked(sb, hash, cifs_find_inode, cifs_init_inode, fattr);
1317 inode->i_ino = hash;
[all...]
/kernel/linux/linux-5.10/fs/ceph/
H A Dinode.c1283 dname.hash = full_name_hash(parent, dname.name, dname.len); in ceph_fill_trace()
1665 dname.hash = full_name_hash(parent, dname.name, dname.len); in ceph_readdir_prepopulate()
1671 u32 hash = ceph_str_hash(ci->i_dir_layout.dl_dir_hash, in ceph_readdir_prepopulate() local
1673 hash = ceph_frag_value(hash); in ceph_readdir_prepopulate()
1674 if (hash != last_hash) in ceph_readdir_prepopulate()
1676 last_hash = hash; in ceph_readdir_prepopulate()
1677 rde->offset = ceph_make_fpos(hash, fpos_offset++, true); in ceph_readdir_prepopulate()
/kernel/linux/linux-5.10/fs/ocfs2/
H A Docfs2_trace.h1761 unsigned int hash, unsigned long long location,
1763 TP_ARGS(ino, name, name_index, hash, location, xe_index),
1768 __field(unsigned int, hash)
1776 __entry->hash = hash;
1781 __entry->name_index, __entry->hash, __entry->location,
1788 unsigned int hash, unsigned long long bucket, \
1790 TP_ARGS(ino, name, name_index, hash, bucket, xe_index))
/kernel/linux/linux-5.10/fs/xfs/libxfs/
H A Dxfs_da_btree.c236 /* XXX: hash order check? */ in xfs_da3_node_verify()
1048 * Copy the last hash value from the oldblk to propagate upwards. in xfs_da3_node_add()
1378 * Walk back up the tree adjusting hash values as necessary,
1477 * Copy the last hash value from the block to propagate upwards. in xfs_da3_node_remove()
2097 * Implement a simple hash on a character string.
2098 * Rotate the hash value by 7 bits, then XOR each character in.
2104 xfs_dahash_t hash; in xfs_da_hashname() local
2109 for (hash = 0; namelen >= 4; namelen -= 4, name += 4) in xfs_da_hashname()
2110 hash = (name[0] << 21) ^ (name[1] << 14) ^ (name[2] << 7) ^ in xfs_da_hashname()
2111 (name[3] << 0) ^ rol32(hash, in xfs_da_hashname()
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/chelsio/cxgb4/
H A Dcxgb4_filter.c256 fconf = fs->hash ? adapter->params.tp.filter_mask : in validate_filter()
358 u64 *pkts, u64 *bytes, bool hash) in get_filter_count()
367 if (is_hashfilter(adapter) && hash) { in get_filter_count()
438 u64 *hitcnt, u64 *bytecnt, bool hash) in cxgb4_get_filter_counters()
442 return get_filter_count(adapter, fidx, hitcnt, bytecnt, hash); in cxgb4_get_filter_counters()
996 if ((f->fs.hash || is_t6(adap->params.chip)) && f->fs.type) in clear_filter()
1031 /* Clear all hash filters */ in clear_all_filters()
1166 /* Keep tunnel VNI match disabled for hash-filters for now */ in is_filter_exact_match()
1539 if (fs->hash) { in __cxgb4_set_filter()
1810 if (fs && fs->hash) { in __cxgb4_del_filter()
357 get_filter_count(struct adapter *adapter, unsigned int fidx, u64 *pkts, u64 *bytes, bool hash) get_filter_count() argument
437 cxgb4_get_filter_counters(struct net_device *dev, unsigned int fidx, u64 *hitcnt, u64 *bytecnt, bool hash) cxgb4_get_filter_counters() argument
[all...]
/kernel/linux/linux-6.6/fs/ocfs2/
H A Docfs2_trace.h1762 unsigned int hash, unsigned long long location,
1764 TP_ARGS(ino, name, name_index, hash, location, xe_index),
1769 __field(unsigned int, hash)
1777 __entry->hash = hash;
1782 __entry->name_index, __entry->hash, __entry->location,
1789 unsigned int hash, unsigned long long bucket, \
1791 TP_ARGS(ino, name, name_index, hash, bucket, xe_index))
/kernel/linux/linux-6.6/fs/xfs/libxfs/
H A Dxfs_da_btree.c248 /* XXX: hash order check? */ in xfs_da3_node_verify()
1060 * Copy the last hash value from the oldblk to propagate upwards. in xfs_da3_node_add()
1390 * Walk back up the tree adjusting hash values as necessary,
1489 * Copy the last hash value from the block to propagate upwards. in xfs_da3_node_remove()
2109 * Implement a simple hash on a character string.
2110 * Rotate the hash value by 7 bits, then XOR each character in.
2116 xfs_dahash_t hash; in xfs_da_hashname() local
2121 for (hash = 0; namelen >= 4; namelen -= 4, name += 4) in xfs_da_hashname()
2122 hash = (name[0] << 21) ^ (name[1] << 14) ^ (name[2] << 7) ^ in xfs_da_hashname()
2123 (name[3] << 0) ^ rol32(hash, in xfs_da_hashname()
[all...]
/kernel/linux/linux-5.10/drivers/md/bcache/
H A Drequest.c17 #include <linux/hash.h>
416 hlist_for_each_entry(i, iohash(dc, bio->bi_iter.bi_sector), hash) in check_should_bypass()
433 hlist_del(&i->hash); in check_should_bypass()
434 hlist_add_head(&i->hash, iohash(dc, i->last)); in check_should_bypass()
/kernel/linux/linux-5.10/drivers/net/ethernet/ti/
H A Dcpmac.c312 u32 mbp, bit, hash[2] = { 0, }; in cpmac_set_multicast_list() local
344 hash[bit / 32] |= 1 << (bit % 32); in cpmac_set_multicast_list()
347 cpmac_write(priv->regs, CPMAC_MAC_HASH_LO, hash[0]); in cpmac_set_multicast_list()
348 cpmac_write(priv->regs, CPMAC_MAC_HASH_HI, hash[1]); in cpmac_set_multicast_list()

Completed in 57 milliseconds

1...<<51525354555657585960>>...98