list_next_entry
next = list_next_entry(bridge, chain_node);
node = list_next_entry(node, hole_stack);
DRM_MM_BUG_ON(list_next_entry(hole, node_list) != node);
DRM_MM_BUG_ON(list_next_entry(prev_node, node_list) !=
list_next_entry(node, node_list));
return list_next_entry(hole, node_list);
list_next_entry(rq, signal_link)->fence.seqno))
rq_prio(list_next_entry(rq, sched.link)) > last_prio)
node = list_next_entry(node, node_list);
struct i915_request *n = list_next_entry(rq, mock.link);
ce = list_next_entry(ce, parallel.child_link);
other = list_next_entry(node, node_list);
return list_next_entry(bridge, chain_node);
fb = list_next_entry(fb, head))
return list_next_entry(range, entry);
return list_next_entry(notifier, entry);
#define drm_gpuva_next_op(op) list_next_entry(op, entry)
return list_next_entry(va, rb.entry);
return list_next_entry(hole_node, node_list)->start;
pos = list_next_entry(pos, hole_stack))
node__ = list_next_entry(node__, node_list))
n = list_next_entry(pos, member)
lru = list_next_entry(lru, link);