Searched refs:hash (Results 51 - 75 of 1185) sorted by last modified time

1234567891011>>

/linux-master/arch/powerpc/kernel/
H A Diommu.c23 #include <linux/hash.h>
98 * We precalculate the hash to avoid doing it on every allocation.
100 * The hash is important to spread CPUs across all the pools. For example,
/linux-master/net/unix/
H A Daf_unix.c126 * hash table is protected with spinlock.
132 unsigned long hash = (unsigned long)sk; local
134 hash ^= hash >> 16;
135 hash ^= hash >> 8;
136 hash ^= sk->sk_type;
138 return hash & UNIX_HASH_MOD;
150 unsigned int hash; local
152 hash
325 __unix_set_addr_hash(struct net *net, struct sock *sk, struct unix_address *addr, unsigned int hash) argument
367 __unix_find_socket_byname(struct net *net, struct sockaddr_un *sunname, int len, unsigned int hash) argument
383 unix_find_socket_byname(struct net *net, struct sockaddr_un *sunname, int len, unsigned int hash) argument
399 unsigned int hash = unix_bsd_hash(i); local
1103 unsigned int hash = unix_abstract_hash(sunaddr, addr_len, type); local
[all...]
/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/net/core/
H A Ddev.c77 #include <linux/hash.h>
190 unsigned int hash = full_name_hash(net, name, strnlen(name, IFNAMSIZ)); local
192 return &net->dev_name_head[hash_32(hash, NETDEV_HASHBITS)];
530 * MUST BE last in hash buckets and checking protocol handlers
3189 * Returns a Tx hash based on the given packet descriptor a Tx queues' number
3196 u32 hash; local
3215 hash = skb_get_rx_queue(skb);
3216 if (hash >= qoffset)
3217 hash -= qoffset;
3218 while (unlikely(hash >
4523 u32 hash; local
6160 unsigned int hash = napi_id % HASH_SIZE(napi_hash); local
11441 struct hlist_head *hash; local
[all...]
/linux-master/include/net/
H A Dsch_generic.h101 struct hlist_node hash; member in struct:Qdisc
610 struct hlist_head *hash; member in struct:Qdisc_class_hash
624 qdisc_class_find(const struct Qdisc_class_hash *hash, u32 id) argument
632 h = qdisc_class_hash(id, hash->hashmask);
633 hlist_for_each_entry(cl, &hash->hash[h], hnode) {
/linux-master/include/linux/
H A Dudp.h18 #include <net/netns/hash.h>
/linux-master/fs/fuse/
H A Ddir.c163 * dentry from the hash
1369 name->hash = full_name_hash(dir, name->name, name->len);
/linux-master/drivers/net/
H A Dtun.c389 "create flow: hash %u index %u\n",
404 netif_info(tun, tx_queued, tun->dev, "delete flow: hash %u index %u\n",
510 /* Save the hash received in the stack receive path and update the
513 static inline void tun_flow_save_rps_rxhash(struct tun_flow_entry *e, u32 hash) argument
515 if (unlikely(e->rps_rxhash != hash))
516 e->rps_rxhash = hash;
1039 * RPS hash and save it into the flow_table here.
1935 /* Compute the costly rx hash only if needed for flow updates.
/linux-master/drivers/net/ethernet/stmicro/stmmac/
H A Dstmmac_main.c5121 u32 hash; local
5143 if (!stmmac_get_rx_hash(priv, p, &hash, &hash_type))
5144 skb_set_hash(skb, hash, hash_type);
5456 u32 hash; local
5664 if (!stmmac_get_rx_hash(priv, p, &hash, &hash_type))
5665 skb_set_hash(skb, hash, hash_type);
6633 u32 crc, hash = 0; local
6641 hash |= (1 << crc);
6650 hash = 0;
6653 return stmmac_update_vlan_hash(priv, priv->hw, hash, pmatc
[all...]
H A Ddwxgmac2_core.c617 static void dwxgmac2_update_vlan_hash(struct mac_device_info *hw, u32 hash, argument
622 writel(hash, ioaddr + XGMAC_VLAN_HASH_TABLE);
624 if (hash) {
H A Ddwmac4_core.c595 u32 hash; local
613 hash = readl(ioaddr + GMAC_VLAN_HASH_TABLE);
614 if (hash & GMAC_VLAN_VLHT) {
667 * index the contents of the hash table. The number of
984 static void dwmac4_update_vlan_hash(struct mac_device_info *hw, u32 hash, argument
990 writel(hash, ioaddr + GMAC_VLAN_HASH_TABLE);
994 if (hash) {
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/
H A Den_arfs.c33 #include <linux/hash.h>
102 #define mlx5e_for_each_hash_arfs_rule(hn, tmp, hash, j) \
104 hlist_for_each_entry_safe(hn, tmp, &hash[j], hlist)
/linux-master/drivers/net/ethernet/mediatek/
H A Dmtk_wed.c1961 u32 reason, u32 hash)
1975 mtk_ppe_check_skb(eth->ppe[dev->hw->index], skb, hash);
1960 mtk_wed_ppe_check(struct mtk_wed_device *dev, struct sk_buff *skb, u32 reason, u32 hash) argument
/linux-master/drivers/gpu/drm/vmwgfx/
H A Dvmwgfx_drv.h125 * @hash: Hash entry for quick lookup of the TTM buffer object.
132 struct vmwgfx_hash_item hash; member in struct:vmw_validate_buffer
391 * @res_ht: Pointer hash table used to find validation duplicates
/linux-master/drivers/char/
H A Drandom.c20 * When enough bits of entropy are available, the hash is finalized and
617 struct blake2s_state hash; member in struct:__anon5
621 .hash.h = { BLAKE2S_IV0 ^ (0x01010000 | BLAKE2S_HASH_SIZE),
624 .hash.outlen = BLAKE2S_HASH_SIZE,
630 blake2s_update(&input_pool.hash, buf, len);
678 blake2s_final(&input_pool.hash, seed);
683 blake2s_init_key(&input_pool.hash, BLAKE2S_HASH_SIZE, next_key, sizeof(next_key));
/linux-master/fs/bcachefs/
H A Dec.c899 * Stripes that are being created or modified are kept in a hash table, so that
905 unsigned hash = hash_64(idx, ilog2(ARRAY_SIZE(c->ec_stripes_new))); local
908 hlist_for_each_entry(s, &c->ec_stripes_new[hash], hash)
934 unsigned hash = hash_64(idx, ilog2(ARRAY_SIZE(c->ec_stripes_new))); local
937 hlist_add_head(&s->hash, &c->ec_stripes_new[hash]);
949 hlist_del_init(&s->hash);
H A Dec.h161 struct hlist_node hash; member in struct:ec_stripe_new
H A Dbtree_cache.c88 .head_offset = offsetof(struct btree, hash),
155 /* Btree in memory cache - hash table */
159 int ret = rhashtable_remove_fast(&bc->table, &b->hash, bch_btree_cache_params);
172 return rhashtable_lookup_insert_fast(&bc->table, &b->hash,
H A Ddebug.c570 rht_for_each_entry_rcu(b, pos, tbl, i->iter, hash)
/linux-master/fs/smb/client/
H A Dinode.c878 /* Simple function to return a 64 bit hash of string. Rarely called */
882 __u64 hash = 0; local
885 hash = (hash + (__u64) *str++) * hash_mult;
887 return hash;
1411 unsigned long hash; local
1417 /* hash down to 32-bits on 32-bit arch */
1418 hash = cifs_uniqueid_to_ino_t(fattr->cf_uniqueid);
1420 inode = iget5_locked(sb, hash, cifs_find_inode, cifs_init_inode, fattr);
1439 inode->i_ino = hash;
[all...]
/linux-master/fs/ceph/
H A Dmds_client.c844 u32 hash = dentry->d_name.hash; local
852 hnode, hash) {
856 if (udentry->d_name.hash != hash)
1291 u32 hash = req->r_direct_hash; local
1351 hash = ceph_dentry_hash(dir, req->r_dentry);
1364 ceph_vinop(inode), (int)is_hash, hash, mode);
1371 ceph_choose_frag(ci, hash, &frag, &found);
5132 dname.hash
[all...]
/linux-master/net/ipv6/
H A Daddrconf.c64 #include <linux/hash.h>
1024 struct net_device *dev, unsigned int hash)
1028 hlist_for_each_entry(ifp, &net->ipv6.inet6_addr_lst[hash], addr_lst) {
1040 unsigned int hash = inet6_addr_hash(net, &ifa->addr); local
1046 if (ipv6_chk_same_addr(net, &ifa->addr, dev, hash)) {
1050 hlist_add_head_rcu(&ifa->addr_lst, &net->ipv6.inet6_addr_lst[hash]);
1974 unsigned int hash = inet6_addr_hash(net, addr); local
1985 hlist_for_each_entry_rcu(ifp, &net->ipv6.inet6_addr_lst[hash], addr_lst) {
2086 unsigned int hash = inet6_addr_hash(net, addr); local
2090 hlist_for_each_entry_rcu(ifp, &net->ipv6.inet6_addr_lst[hash], addr_ls
1023 ipv6_chk_same_addr(struct net *net, const struct in6_addr *addr, struct net_device *dev, unsigned int hash) argument
4534 unsigned int hash = inet6_addr_hash(net, addr); local
4568 unsigned int hash; local
[all...]
/linux-master/net/batman-adv/
H A Dtranslation-table.c47 #include "hash.h"
61 /* hash class keys */
97 * batadv_choose_tt() - return the index of the tt entry in the hash table
99 * @size: the size of the hash table
101 * Return: the hash index where the object represented by 'data' should be
107 u32 hash = 0; local
110 hash = jhash(&tt->addr, ETH_ALEN, hash);
111 hash = jhash(&tt->vid, sizeof(tt->vid), hash);
126 batadv_tt_hash_find(struct batadv_hashtable *hash, const u8 *addr, unsigned short vid) argument
1128 batadv_tt_local_dump_bucket(struct sk_buff *msg, u32 portid, struct netlink_callback *cb, struct batadv_priv *bat_priv, struct batadv_hashtable *hash, unsigned int bucket, int *idx_s) argument
1170 struct batadv_hashtable *hash; local
1345 struct batadv_hashtable *hash = bat_priv->tt.local_hash; local
1362 struct batadv_hashtable *hash; local
1945 struct batadv_hashtable *hash; local
2200 struct batadv_hashtable *hash = bat_priv->tt.global_hash; local
2266 struct batadv_hashtable *hash = bat_priv->tt.global_hash; local
2305 struct batadv_hashtable *hash; local
2441 struct batadv_hashtable *hash = bat_priv->tt.global_hash; local
2521 struct batadv_hashtable *hash = bat_priv->tt.local_hash; local
2751 batadv_tt_tvlv_generate(struct batadv_priv *bat_priv, struct batadv_hashtable *hash, void *tvlv_buff, u16 tt_len, bool (*valid_cb)(const void *, const void *, u8 *flags), void *cb_data) argument
3602 struct batadv_hashtable *hash = bat_priv->tt.local_hash; local
3639 struct batadv_hashtable *hash = bat_priv->tt.local_hash; local
[all...]
/linux-master/kernel/trace/
H A Dring_buffer.c25 #include <linux/hash.h>
/linux-master/kernel/
H A Dkprobes.c24 #include <linux/hash.h>
460 /* Return true if the kprobe is disarmed. Note: p must be on hash list */
561 /* Loop on 'freeing_list' for disarming and removing from kprobe hash list */
570 * Remove unused probes from hash list. After waiting
590 * still in use, keep it on kprobes hash list.
801 * the kprobe hash list and free it.
1764 * (not an aggrprobe). Remove from the hash list.

Completed in 595 milliseconds

1234567891011>>