Home
last modified time | relevance | path

Searched refs:node_list (Results 1 – 4 of 4) sorted by relevance

/include/linux/
A Dplist.h88 .node_list = LIST_HEAD_INIT((head).node_list) \
107 .node_list = LIST_HEAD_INIT((node).node_list), \
117 INIT_LIST_HEAD(&head->node_list); in plist_head_init()
143 list_for_each_entry(pos, &(head)->node_list, node_list)
153 list_for_each_entry_continue(pos, &(head)->node_list, node_list)
164 list_for_each_entry_safe(pos, n, &(head)->node_list, node_list)
173 list_for_each_entry(pos, &(head)->node_list, mem.node_list)
185 list_for_each_entry_continue(pos, &(head)->node_list, m.node_list)
197 list_for_each_entry_safe(pos, n, &(head)->node_list, m.node_list)
258 list_next_entry(pos, node_list)
[all …]
A Dplist_types.h8 struct list_head node_list; member
14 struct list_head node_list; member
A Dinterconnect-provider.h103 struct list_head node_list; member
/include/drm/
A Ddrm_mm.h166 struct list_head node_list; member
322 return list_next_entry(hole_node, node_list)->start; in __drm_mm_hole_node_end()
353 #define drm_mm_nodes(mm) (&(mm)->head_node.node_list)
364 list_for_each_entry(entry, drm_mm_nodes(mm), node_list)
376 list_for_each_entry_safe(entry, next, drm_mm_nodes(mm), node_list)
505 node__ = list_next_entry(node__, node_list))

Completed in 16 milliseconds