Lines Matching refs:member
159 #define hlist_entry(ptr, type, member) container_of(ptr, type, member)
168 #define hlist_entry_safe(ptr, type, member) \
170 ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
173 #define hlist_for_each_entry(pos, head, member) \
175 for ((pos) = hlist_entry_safe((head)->first, typeof(*(pos)), member); \
177 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member)) \
180 #define hlist_for_each_entry_continue(pos, member) \
182 for ((pos) = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); \
184 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member)) \
187 #define hlist_for_each_entry_from(pos, member) \
190 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member)) \
193 #define hlist_for_each_entry_safe(pos, n, head, member) \
195 for ((pos) = hlist_entry_safe((head)->first, typeof(*(pos)), member); \
196 (pos) && ( {n = (pos)->member.next; 1;} ); \
197 (pos) = hlist_entry_safe(n, typeof(*(pos)), member)) \
300 * @member: the name of the hlist_node within the struct
302 #define hash_for_each(name, bkt, obj, member) \
305 hlist_for_each_entry((obj), &(name)[bkt], member)
314 * @member: the name of the hlist_node within the struct
316 #define hash_for_each_safe(name, bkt, tmp, obj, member) \
319 hlist_for_each_entry_safe((obj), (tmp), &(name)[bkt], (member))
321 #define hash_for_each_possible(name, obj, member, key) \
322 hlist_for_each_entry((obj), &(name)[hash_min((key), HASH_BITS(name))], (member))