Lines Matching defs:list_entry
149 #define list_entry(ptr, type, field) container_of(ptr, type, field)
152 list_entry((ptr)->next, type, member)
155 list_entry((ptr)->prev, type, member)
161 list_entry(((ptr)->member.next), typeof(*(ptr)), member)
167 list_entry(((ptr)->member.prev), typeof(*(ptr)), member)
176 for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
177 p = list_entry((p)->field.next, typeof(*p), field))
180 for (p = list_entry((h)->next, typeof(*p), field), \
181 n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
182 p = n, n = list_entry(n->field.next, typeof(*n), field))
186 p = list_entry((p)->field.next, typeof(*p), field))
193 for (n = list_entry((pos)->member.next, typeof(*pos), member); \
195 pos = n, n = list_entry(n->member.next, typeof(*n), member))
198 for (p = list_entry((h)->prev, typeof(*p), field); &(p)->field != (h); \
199 p = list_entry((p)->field.prev, typeof(*p), field))
202 for (p = list_entry((h)->prev, typeof(*p), field), \
203 n = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
204 p = n, n = list_entry(n->field.prev, typeof(*n), field))
207 for (p = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
208 p = list_entry((p)->field.prev, typeof(*p), field))