Lines Matching refs:name
15 #define DEFINE_HASHTABLE(name, bits) \ argument
16 struct hlist_head name[1 << (bits)] = \
19 #define DECLARE_HASHTABLE(name, bits) \ argument
20 struct hlist_head name[1 << (bits)]
22 #define HASH_SIZE(name) (ARRAY_SIZE(name)) argument
23 #define HASH_BITS(name) ilog2(HASH_SIZE(name)) argument
121 #define hash_for_each(name, bkt, obj, member) \ argument
122 for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
124 hlist_for_each_entry(obj, &name[bkt], member)
133 #define hash_for_each_rcu(name, bkt, obj, member) \ argument
134 for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
136 hlist_for_each_entry_rcu(obj, &name[bkt], member)
147 #define hash_for_each_safe(name, bkt, tmp, obj, member) \ argument
148 for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
150 hlist_for_each_entry_safe(obj, tmp, &name[bkt], member)
160 #define hash_for_each_possible(name, obj, member, key) \ argument
161 hlist_for_each_entry(obj, &name[hash_min(key, HASH_BITS(name))], member)
172 #define hash_for_each_possible_rcu(name, obj, member, key) \ argument
173 hlist_for_each_entry_rcu(obj, &name[hash_min(key, HASH_BITS(name))],\
187 #define hash_for_each_possible_rcu_notrace(name, obj, member, key) \ argument
189 &name[hash_min(key, HASH_BITS(name))], member)
200 #define hash_for_each_possible_safe(name, obj, tmp, member, key) \ argument
202 &name[hash_min(key, HASH_BITS(name))], member)