Lines Matching refs:member
159 #define hlist_entry(ptr, type, member) container_of(ptr, type, member)
170 #define hlist_entry_safe(ptr, type, member) \
173 ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
176 #define hlist_for_each_entry(pos, head, member) \
178 for ((pos) = hlist_entry_safe((head)->first, typeof(*(pos)), member); pos; \
179 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member)) \
182 #define hlist_for_each_entry_continue(pos, member) \
184 for ((pos) = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member); pos; \
185 pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member)) \
188 #define hlist_for_each_entry_from(pos, member) \
190 for (; pos; 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); (pos) && ( { \
196 n = (pos)->member.next; \
199 (pos) = hlist_entry_safe(n, typeof(*(pos)), member)) \
297 * @member: the name of the hlist_node within the struct
299 #define hash_for_each(name, bkt, obj, member) \
301 hlist_for_each_entry((obj), &(name)[bkt], member)
310 * @member: the name of the hlist_node within the struct
312 #define hash_for_each_safe(name, bkt, tmp, obj, member) \
314 hlist_for_each_entry_safe((obj), (tmp), &(name)[bkt], (member))
316 #define hash_for_each_possible(name, obj, member, key) \
317 hlist_for_each_entry((obj), &(name)[hash_min((key), HASH_BITS(name))], (member))