Lines Matching defs:list_entry
165 #define list_entry(ptr, type, field) container_of(ptr, type, field)
168 list_entry((ptr)->next, type, member)
171 list_entry((ptr)->prev, type, member)
177 list_entry(((ptr)->member.next), typeof(*(ptr)), member)
183 list_entry(((ptr)->member.prev), typeof(*(ptr)), member)
192 for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
193 p = list_entry((p)->field.next, typeof(*p), field))
196 for (p = list_entry((h)->next, typeof(*p), field), \
197 n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
198 p = n, n = list_entry(n->field.next, typeof(*n), field))
202 p = list_entry((p)->field.next, typeof(*p), field))
209 for (n = list_entry((pos)->member.next, typeof(*pos), member); \
211 pos = n, n = list_entry(n->member.next, typeof(*n), member))
214 for (p = list_entry((h)->prev, typeof(*p), field); &(p)->field != (h); \
215 p = list_entry((p)->field.prev, typeof(*p), field))
218 for (p = list_entry((h)->prev, typeof(*p), field), \
219 n = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
220 p = n, n = list_entry(n->field.prev, typeof(*n), field))
223 for (p = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
224 p = list_entry((p)->field.prev, typeof(*p), field))