158 #define hlist_entry(ptr, type, member) container_of(ptr,type,member)  argument
167 #define hlist_entry_safe(ptr, type, member) \  argument
169        ____ptr ? hlist_entry(____ptr, type, member) : NULL; \
172 #define hlist_for_each_entry(pos, head, member)             \  argument
173     for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
175          pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
177 #define hlist_for_each_entry_continue(pos, member)          \  argument
178     for (pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member);\
180          pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
182 #define hlist_for_each_entry_from(pos, member)              \  argument
184          pos = hlist_entry_safe((pos)->member.next, typeof(*(pos)), member))
186 #define hlist_for_each_entry_safe(pos, n, head, member)         \  argument
187     for (pos = hlist_entry_safe((head)->first, typeof(*pos), member);\
188          pos && ({ n = pos->member.next; 1; });         \
189          pos = hlist_entry_safe(n, typeof(*pos), member))
293 #define hash_for_each(name, bkt, obj, member)                           \  argument
296     hlist_for_each_entry(obj, &name[bkt], member)
307 #define hash_for_each_safe(name, bkt, tmp, obj, member)                 \  argument
310     hlist_for_each_entry_safe(obj, tmp, &name[bkt], member)
312 #define hash_for_each_possible(name, obj, member, key) \  argument
313     hlist_for_each_entry(obj, &name[hash_min(key, HASH_BITS(name))], member)