Lines Matching refs:name
17 #define DEFINE_HASHTABLE(name, bits) \
18 struct hlist_head name[1 << (bits)] = \
21 #define DECLARE_HASHTABLE(name, bits) \
22 struct hlist_head name[1 << (bits)]
24 #define HASH_SIZE(name) (ARRAY_SIZE(name))
25 #define HASH_BITS(name) ilog2(HASH_SIZE(name))
100 * @name: hashtable to iterate
103 * @member: the name of the hlist_node within the struct
105 #define hash_for_each(name, bkt, obj, member) \
106 for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
108 hlist_for_each_entry(obj, &name[bkt], member)
113 * @name: hashtable to iterate
117 * @member: the name of the hlist_node within the struct
119 #define hash_for_each_safe(name, bkt, tmp, obj, member) \
120 for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
122 hlist_for_each_entry_safe(obj, tmp, &name[bkt], member)
127 * @name: hashtable to iterate
129 * @member: the name of the hlist_node within the struct
132 #define hash_for_each_possible(name, obj, member, key) \
133 hlist_for_each_entry(obj, &name[hash_min(key, HASH_BITS(name))], member)
138 * @name: hashtable to iterate
141 * @member: the name of the hlist_node within the struct
144 #define hash_for_each_possible_safe(name, obj, tmp, member, key) \
146 &name[hash_min(key, HASH_BITS(name))], member)