list_next_entry
(n) = list_next_entry(ptr, member)
for (p = list_next_entry((p), field); &(p)->field != (h); \
p = list_next_entry((p), field))
(n) = list_next_entry(ptr, member)
for (p = list_next_entry((p), field); &(p)->field != (h); \
p = list_next_entry((p), field))
return list_next_entry(ft, node.list);
((reverse) ? list_prev_entry(pos, list) : list_next_entry(pos, list))