Home
last modified time | relevance | path

Searched full:hash (Results 1 – 25 of 3743) sorted by relevance

12345678910>>...150

/OK3568_Linux_fs/kernel/samples/bpf/
H A Dhash_func01.h3 * Based on Paul Hsieh's (LGPG 2.1) hash function
4 * From: http://www.azillionmonkeys.com/qed/hash.html
11 __u32 hash = initval; in SuperFastHash() local
23 hash += get16bits (data); in SuperFastHash()
24 tmp = (get16bits (data+2) << 11) ^ hash; in SuperFastHash()
25 hash = (hash << 16) ^ tmp; in SuperFastHash()
27 hash += hash >> 11; in SuperFastHash()
32 case 3: hash += get16bits (data); in SuperFastHash()
33 hash ^= hash << 16; in SuperFastHash()
34 hash ^= ((signed char)data[sizeof (__u16)]) << 18; in SuperFastHash()
[all …]
/OK3568_Linux_fs/kernel/include/linux/
H A Drhashtable.h3 * Resizable, Scalable, Concurrent Hash Table
32 * which is linked into as hash chain from the hash table - or one
33 * of two or more hash tables when the rhashtable is being resized.
36 * the hash bucket. This allows us to be sure we've found the end
38 * The value stored in the hash bucket has BIT(0) used as a lock bit.
51 * The maximum (not average) chain length grows with the size of the hash
54 * The value of 16 is selected so that even if the hash table grew to
65 * struct bucket_table - Table of hash buckets
66 * @size: Number of hash buckets
69 * @hash_rnd: Random seed to fold into hash
[all …]
/OK3568_Linux_fs/kernel/net/batman-adv/
H A Dhash.c7 #include "hash.h"
14 /* clears the hash */
15 static void batadv_hash_init(struct batadv_hashtable *hash) in batadv_hash_init() argument
19 for (i = 0; i < hash->size; i++) { in batadv_hash_init()
20 INIT_HLIST_HEAD(&hash->table[i]); in batadv_hash_init()
21 spin_lock_init(&hash->list_locks[i]); in batadv_hash_init()
24 atomic_set(&hash->generation, 0); in batadv_hash_init()
28 * batadv_hash_destroy() - Free only the hashtable and the hash itself
29 * @hash: hash object to destroy
31 void batadv_hash_destroy(struct batadv_hashtable *hash) in batadv_hash_destroy() argument
[all …]
H A Dhash.h44 /** @list_locks: spinlock for each hash list entry */
54 /* allocates and clears the hash */
58 void batadv_hash_set_lock_class(struct batadv_hashtable *hash,
61 /* free only the hashtable and the hash itself. */
62 void batadv_hash_destroy(struct batadv_hashtable *hash);
66 * @hash: storage hash table
67 * @compare: callback to determine if 2 hash elements are identical
68 * @choose: callback calculating the hash index
72 * Return: 0 on success, 1 if the element already is in the hash
75 static inline int batadv_hash_add(struct batadv_hashtable *hash, in batadv_hash_add() argument
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8723ds/os_dep/linux/
H A Drhashtable.h2 * Resizable, Scalable, Concurrent Hash Table
35 * | Base | Hash |1|
40 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
57 * struct bucket_table - Table of hash buckets
58 * @size: Number of hash buckets
60 * @hash_rnd: Random seed to fold into hash
66 * @buckets: size * hash buckets
84 * @ht: Hash table
100 * struct rhashtable_params - Hash table construction parameters
112 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8822bs/os_dep/linux/
H A Drhashtable.h2 * Resizable, Scalable, Concurrent Hash Table
35 * | Base | Hash |1|
40 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
57 * struct bucket_table - Table of hash buckets
58 * @size: Number of hash buckets
60 * @hash_rnd: Random seed to fold into hash
66 * @buckets: size * hash buckets
84 * @ht: Hash table
100 * struct rhashtable_params - Hash table construction parameters
112 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8189fs/os_dep/linux/
H A Drhashtable.h2 * Resizable, Scalable, Concurrent Hash Table
35 * | Base | Hash |1|
40 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
57 * struct bucket_table - Table of hash buckets
58 * @size: Number of hash buckets
60 * @hash_rnd: Random seed to fold into hash
66 * @buckets: size * hash buckets
84 * @ht: Hash table
100 * struct rhashtable_params - Hash table construction parameters
112 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8189fs/os_dep/linux/
H A Drhashtable.h3 * Resizable, Scalable, Concurrent Hash Table
36 * | Base | Hash |1|
41 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
58 * struct bucket_table - Table of hash buckets
59 * @size: Number of hash buckets
61 * @hash_rnd: Random seed to fold into hash
67 * @buckets: size * hash buckets
85 * @ht: Hash table
101 * struct rhashtable_params - Hash table construction parameters
113 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8822cs/os_dep/linux/
H A Drhashtable.h2 * Resizable, Scalable, Concurrent Hash Table
35 * | Base | Hash |1|
40 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
57 * struct bucket_table - Table of hash buckets
58 * @size: Number of hash buckets
60 * @hash_rnd: Random seed to fold into hash
66 * @buckets: size * hash buckets
84 * @ht: Hash table
100 * struct rhashtable_params - Hash table construction parameters
112 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8852be/os_dep/linux/
H A Drhashtable.h2 * Resizable, Scalable, Concurrent Hash Table
35 * | Base | Hash |1|
40 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
57 * struct bucket_table - Table of hash buckets
58 * @size: Number of hash buckets
60 * @hash_rnd: Random seed to fold into hash
66 * @buckets: size * hash buckets
84 * @ht: Hash table
100 * struct rhashtable_params - Hash table construction parameters
112 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8188fu/os_dep/linux/
H A Drhashtable.h2 * Resizable, Scalable, Concurrent Hash Table
35 * | Base | Hash |1|
40 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
57 * struct bucket_table - Table of hash buckets
58 * @size: Number of hash buckets
60 * @hash_rnd: Random seed to fold into hash
66 * @buckets: size * hash buckets
84 * @ht: Hash table
100 * struct rhashtable_params - Hash table construction parameters
112 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8188fu/os_dep/linux/
H A Drhashtable.h3 * Resizable, Scalable, Concurrent Hash Table
36 * | Base | Hash |1|
41 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
58 * struct bucket_table - Table of hash buckets
59 * @size: Number of hash buckets
61 * @hash_rnd: Random seed to fold into hash
67 * @buckets: size * hash buckets
85 * @ht: Hash table
101 * struct rhashtable_params - Hash table construction parameters
113 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8188eu/os_dep/linux/
H A Drhashtable.h3 * Resizable, Scalable, Concurrent Hash Table
36 * | Base | Hash |1|
41 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
58 * struct bucket_table - Table of hash buckets
59 * @size: Number of hash buckets
61 * @hash_rnd: Random seed to fold into hash
67 * @buckets: size * hash buckets
85 * @ht: Hash table
101 * struct rhashtable_params - Hash table construction parameters
113 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8723ds/os_dep/linux/
H A Drhashtable.h3 * Resizable, Scalable, Concurrent Hash Table
36 * | Base | Hash |1|
41 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
58 * struct bucket_table - Table of hash buckets
59 * @size: Number of hash buckets
61 * @hash_rnd: Random seed to fold into hash
67 * @buckets: size * hash buckets
85 * @ht: Hash table
101 * struct rhashtable_params - Hash table construction parameters
113 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8723cs/os_dep/linux/
H A Drhashtable.h2 * Resizable, Scalable, Concurrent Hash Table
35 * | Base | Hash |1|
40 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
57 * struct bucket_table - Table of hash buckets
58 * @size: Number of hash buckets
60 * @hash_rnd: Random seed to fold into hash
66 * @buckets: size * hash buckets
84 * @ht: Hash table
100 * struct rhashtable_params - Hash table construction parameters
112 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/kernel/drivers/net/wireless/rockchip_wlan/rtl8821cs/os_dep/linux/
H A Drhashtable.h3 * Resizable, Scalable, Concurrent Hash Table
36 * | Base | Hash |1|
41 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
58 * struct bucket_table - Table of hash buckets
59 * @size: Number of hash buckets
61 * @hash_rnd: Random seed to fold into hash
67 * @buckets: size * hash buckets
85 * @ht: Hash table
101 * struct rhashtable_params - Hash table construction parameters
113 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8821cs/os_dep/linux/
H A Drhashtable.h2 * Resizable, Scalable, Concurrent Hash Table
35 * | Base | Hash |1|
40 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
57 * struct bucket_table - Table of hash buckets
58 * @size: Number of hash buckets
60 * @hash_rnd: Random seed to fold into hash
66 * @buckets: size * hash buckets
84 * @ht: Hash table
100 * struct rhashtable_params - Hash table construction parameters
112 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/external/rkwifibt/drivers/rtl8852bs/os_dep/linux/
H A Drhashtable.h2 * Resizable, Scalable, Concurrent Hash Table
35 * | Base | Hash |1|
40 * Hash (27 bits): Full hash (unmasked) of first element added to bucket
57 * struct bucket_table - Table of hash buckets
58 * @size: Number of hash buckets
60 * @hash_rnd: Random seed to fold into hash
66 * @buckets: size * hash buckets
84 * @ht: Hash table
100 * struct rhashtable_params - Hash table construction parameters
112 * @hashfn: Hash function (default: jhash2 if !(key_len % 4), or jhash)
[all …]
/OK3568_Linux_fs/kernel/net/ceph/crush/
H A Dhash.c3 # include <linux/crush/hash.h>
5 # include "hash.h"
10 * https://burtleburtle.net/bob/hash/evahash.html
29 __u32 hash = crush_hash_seed ^ a; in crush_hash32_rjenkins1() local
33 crush_hashmix(b, x, hash); in crush_hash32_rjenkins1()
34 crush_hashmix(y, a, hash); in crush_hash32_rjenkins1()
35 return hash; in crush_hash32_rjenkins1()
40 __u32 hash = crush_hash_seed ^ a ^ b; in crush_hash32_rjenkins1_2() local
43 crush_hashmix(a, b, hash); in crush_hash32_rjenkins1_2()
44 crush_hashmix(x, a, hash); in crush_hash32_rjenkins1_2()
[all …]
/OK3568_Linux_fs/kernel/drivers/net/xen-netback/
H A Dhash.c50 spin_lock_irqsave(&vif->hash.cache.lock, flags); in xenvif_add_hash()
54 list_for_each_entry_rcu(entry, &vif->hash.cache.list, link, in xenvif_add_hash()
55 lockdep_is_held(&vif->hash.cache.lock)) { in xenvif_add_hash()
65 new->seq = atomic_inc_return(&vif->hash.cache.seq); in xenvif_add_hash()
66 list_add_rcu(&new->link, &vif->hash.cache.list); in xenvif_add_hash()
68 if (++vif->hash.cache.count > xenvif_hash_cache_size) { in xenvif_add_hash()
70 vif->hash.cache.count--; in xenvif_add_hash()
75 spin_unlock_irqrestore(&vif->hash.cache.lock, flags); in xenvif_add_hash()
86 val = xen_netif_toeplitz_hash(vif->hash.key, in xenvif_new_hash()
87 sizeof(vif->hash.key), in xenvif_new_hash()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dhash-table.h1 /* A type-safe hash table template.
22 /* This file implements a typed hash table.
28 Users of the hash table generally need to be aware of three types.
30 1. The type being placed into the hash table. This type is called
34 the hash table. This descriptor type provides the hash table with
41 - A static member function named 'hash' that takes a value_type
48 hash values and pass them to the hash table.
57 when deleting a hash table, removing elements from the table, etc).
69 3. The type of the hash table itself. (More later.)
73 4. The template type used to describe how hash table memory
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dhash-table.h1 /* A type-safe hash table template.
22 /* This file implements a typed hash table.
28 Users of the hash table generally need to be aware of three types.
30 1. The type being placed into the hash table. This type is called
34 the hash table. This descriptor type provides the hash table with
41 - A static member function named 'hash' that takes a value_type
48 hash values and pass them to the hash table.
57 when deleting a hash table, removing elements from the table, etc).
69 3. The type of the hash table itself. (More later.)
73 4. The template type used to describe how hash table memory
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/host_include/
H A Dfs_htree.h29 /* Note that calc_node_hash() depends on hash first in struct */
30 uint8_t hash[TEE_FS_HTREE_HASH_SIZE]; member
37 * This struct is not interpreted by the hash tree, it's up to the user of
60 * enum tee_fs_htree_type - type of hash tree element
102 * tee_fs_htree_open() - opens/creates a hash tree
103 * @create: true if a new hash tree is to be created, else the hash tree
105 * @hash: hash of root node, ignored if NULL
110 * @ht: returned hash tree on success
112 TEE_Result tee_fs_htree_open(bool create, uint8_t *hash, const TEE_UUID *uuid,
116 * tee_fs_htree_close() - close a hash tree
[all …]
/OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm32/host_include/
H A Dfs_htree.h29 /* Note that calc_node_hash() depends on hash first in struct */
30 uint8_t hash[TEE_FS_HTREE_HASH_SIZE]; member
37 * This struct is not interpreted by the hash tree, it's up to the user of
60 * enum tee_fs_htree_type - type of hash tree element
102 * tee_fs_htree_open() - opens/creates a hash tree
103 * @create: true if a new hash tree is to be created, else the hash tree
105 * @hash: hash of root node, ignored if NULL
110 * @ht: returned hash tree on success
112 TEE_Result tee_fs_htree_open(bool create, uint8_t *hash, const TEE_UUID *uuid,
116 * tee_fs_htree_close() - close a hash tree
[all …]
/OK3568_Linux_fs/kernel/fs/verity/
H A Dhash_algs.c3 * fs-verity hash algorithms
10 #include <crypto/hash.h>
13 /* The hash algorithms supported by fs-verity */
30 * fsverity_get_hash_alg() - validate and prepare a hash algorithm
32 * @num: the hash algorithm number
34 * Get the struct fsverity_hash_alg for the given hash algorithm number, and
35 * ensure it has a hash transform ready to go. The hash transforms are
39 * Return: pointer to the hash alg on success, else an ERR_PTR()
50 fsverity_warn(inode, "Unknown hash algorithm number: %u", num); in fsverity_get_hash_alg()
72 "Missing crypto API support for hash algorithm \"%s\"", in fsverity_get_hash_alg()
[all …]

12345678910>>...150