Lines Matching refs:n
307 #define list_for_each_entry_safe(pos, n, head, member) \ argument
309 n = list_next_entry(pos, member); \
311 pos = n, n = list_next_entry(n, member))
341 static inline void __hlist_del(struct hlist_node *n) in __hlist_del() argument
343 struct hlist_node *next = n->next; in __hlist_del()
344 struct hlist_node **pprev = n->pprev; in __hlist_del()
358 static inline void hlist_del(struct hlist_node *n) in hlist_del() argument
360 __hlist_del(n); in hlist_del()
361 n->next = LIST_POISON1; in hlist_del()
362 n->pprev = LIST_POISON2; in hlist_del()
371 static inline void hlist_del_init(struct hlist_node *n) in hlist_del_init() argument
373 if (!hlist_unhashed(n)) { in hlist_del_init()
374 __hlist_del(n); in hlist_del_init()
375 INIT_HLIST_NODE(n); in hlist_del_init()
387 static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h) in hlist_add_head() argument
391 n->next = first; in hlist_add_head()
393 first->pprev = &n->next; in hlist_add_head()
394 h->first = n; in hlist_add_head()
395 n->pprev = &h->first; in hlist_add_head()
423 #define hlist_for_each_entry_safe(pos, n, head, member) \ argument
425 pos && ({ n = pos->member.next; 1; }); \
426 pos = hlist_entry_safe(n, typeof(*pos), member))