Searched refs:node_list (Results 1 - 18 of 18) sorted by relevance

/linux-4.1.27/include/linux/
H A Dplist.h30 * - The tier 2 list is the node_list, serialized nodes.
35 * nl:node_list
50 * The nodes on the node_list are ordered by priority and can contain
55 * for the priority of the node and insert it before the node_list
58 * insert it into the serialized node_list list
60 * Removal means remove it from the node_list and remove it from
61 * the prio_list if the node_list list_head is non empty. In case
82 struct list_head node_list; member in struct:plist_head
88 struct list_head node_list; member in struct:plist_node
97 .node_list = LIST_HEAD_INIT((head).node_list) \
116 .node_list = LIST_HEAD_INIT((node).node_list), \
126 INIT_LIST_HEAD(&head->node_list); plist_head_init()
138 INIT_LIST_HEAD(&node->node_list); plist_node_init()
152 list_for_each_entry(pos, &(head)->node_list, node_list)
162 list_for_each_entry_continue(pos, &(head)->node_list, node_list)
173 list_for_each_entry_safe(pos, n, &(head)->node_list, node_list)
182 list_for_each_entry(pos, &(head)->node_list, mem.node_list)
194 list_for_each_entry_continue(pos, &(head)->node_list, m.node_list)
206 list_for_each_entry_safe(pos, n, &(head)->node_list, m.node_list)
214 return list_empty(&head->node_list); plist_head_empty()
223 return list_empty(&node->node_list); plist_node_empty()
267 list_next_entry(pos, node_list)
274 list_prev_entry(pos, node_list)
284 return list_entry(head->node_list.next, plist_first()
285 struct plist_node, node_list); plist_first()
296 return list_entry(head->node_list.prev, plist_last()
297 struct plist_node, node_list); plist_last()
/linux-4.1.27/lib/
H A Dplist.c61 plist_check_list(&head->node_list); plist_check_head()
77 struct list_head *node_next = &head->node_list; plist_add()
90 node_next = &iter->node_list; plist_add()
102 list_add_tail(&node->node_list, node_next); plist_add()
118 if (node->node_list.next != &head->node_list) { plist_del()
121 next = list_entry(node->node_list.next, plist_del()
122 struct plist_node, node_list); plist_del()
131 list_del_init(&node->node_list); plist_del()
149 struct list_head *node_next = &head->node_list; plist_requeue()
167 node_next = &iter->node_list; plist_for_each_continue()
171 list_add_tail(&node->node_list, node_next);
/linux-4.1.27/drivers/gpu/drm/sti/
H A Dsti_gdp.c94 * @node_list: array of node list
103 struct sti_gdp_node_list node_list[GDP_NODE_NB_BANK]; member in struct:sti_gdp
196 if ((hw_nvn != gdp->node_list[i].btm_field_paddr) && sti_gdp_get_free_nodes()
197 (hw_nvn != gdp->node_list[i].top_field_paddr)) sti_gdp_get_free_nodes()
198 return &gdp->node_list[i]; sti_gdp_get_free_nodes()
205 return &gdp->node_list[0]; sti_gdp_get_free_nodes()
229 if ((hw_nvn == gdp->node_list[i].btm_field_paddr) || sti_gdp_get_current_nodes()
230 (hw_nvn == gdp->node_list[i].top_field_paddr)) sti_gdp_get_current_nodes()
231 return &gdp->node_list[i]; sti_gdp_get_current_nodes()
437 gdp->node_list[i].top_field->gam_gdp_ppt |= GAM_GDP_PPT_IGNORE; sti_gdp_disable_layer()
438 gdp->node_list[i].btm_field->gam_gdp_ppt |= GAM_GDP_PPT_IGNORE; sti_gdp_disable_layer()
507 gdp->node_list[i].top_field = base; sti_gdp_init()
508 gdp->node_list[i].top_field_paddr = dma_addr; sti_gdp_init()
518 gdp->node_list[i].btm_field = base; sti_gdp_init()
519 gdp->node_list[i].btm_field_paddr = dma_addr; sti_gdp_init()
/linux-4.1.27/drivers/gpu/drm/
H A Ddrm_mm.c154 list_add(&node->node_list, &hole_node->node_list); drm_mm_insert_helper()
197 list_add(&node->node_list, &hole->node_list); drm_mm_for_each_hole()
301 list_add(&node->node_list, &hole_node->node_list); drm_mm_insert_helper_range()
374 list_entry(node->node_list.prev, struct drm_mm_node, node_list); drm_mm_remove_node()
391 list_del(&node->node_list); drm_mm_remove_node()
515 list_replace(&old->node_list, &new->node_list); drm_mm_replace_node()
646 prev_node = list_entry(node->node_list.prev, struct drm_mm_node, drm_mm_scan_add_block()
647 node_list); drm_mm_scan_add_block()
651 list_del(&node->node_list); drm_mm_scan_add_block()
652 node->node_list.prev = &prev_node->node_list; drm_mm_scan_add_block()
653 node->node_list.next = &mm->prev_scanned_node->node_list; drm_mm_scan_add_block()
707 prev_node = list_entry(node->node_list.prev, struct drm_mm_node, drm_mm_scan_remove_block()
708 node_list); drm_mm_scan_remove_block()
711 list_add(&node->node_list, &prev_node->node_list); drm_mm_scan_remove_block()
728 struct list_head *head = &mm->head_node.node_list; drm_mm_clean()
748 INIT_LIST_HEAD(&mm->head_node.node_list); drm_mm_init()
772 WARN(!list_empty(&mm->head_node.node_list), drm_mm_takedown()
/linux-4.1.27/net/tipc/
H A Dname_table.c57 * @node_list: circular list of publications made by own node
60 * @node_list_size: number of entries in "node_list"
69 struct list_head node_list; member in struct:name_info
297 INIT_LIST_HEAD(&info->node_list); tipc_nameseq_insert_publ()
327 list_add(&publ->node_list, &info->node_list); tipc_nameseq_insert_publ()
393 list_del(&publ->node_list); tipc_nameseq_remove_publ()
560 if (!list_empty(&info->node_list)) { tipc_nametbl_translate()
561 publ = list_first_entry(&info->node_list, tipc_nametbl_translate()
563 node_list); tipc_nametbl_translate()
564 list_move_tail(&publ->node_list, tipc_nametbl_translate()
565 &info->node_list); tipc_nametbl_translate()
583 if (list_empty(&info->node_list)) tipc_nametbl_translate()
585 publ = list_first_entry(&info->node_list, struct publication, tipc_nametbl_translate()
586 node_list); tipc_nametbl_translate()
587 list_move_tail(&publ->node_list, &info->node_list); tipc_nametbl_translate()
646 list_for_each_entry(publ, &info->node_list, node_list) { tipc_nametbl_mc_translate()
H A Dname_table.h62 * @node_list: adjacent matching name seq publications with >= node scope
80 struct list_head node_list; member in struct:publication
H A Dcore.h85 struct list_head node_list; member in struct:tipc_net
H A Dnode.c136 list_for_each_entry_rcu(temp_node, &tn->node_list, list) { tipc_node_create()
162 list_for_each_entry_safe(node, t_node, &tn->node_list, list) tipc_node_stop()
596 list_for_each_entry_rcu(node, &tn->node_list, list) { tipc_nl_node_dump()
H A Dcore.c60 INIT_LIST_HEAD(&tn->node_list); tipc_init_net()
H A Dname_distr.c95 list_for_each_entry_rcu(node, &tn->node_list, list) { named_cluster_distribute()
H A Dlink.c322 list_for_each_entry_rcu(node, &tn->node_list, list) { tipc_link_delete_list()
486 list_for_each_entry_rcu(n_ptr, &tn->node_list, list) { tipc_link_reset_list()
1780 list_for_each_entry_rcu(n_ptr, &tn->node_list, list) { tipc_link_find_owner()
2137 list_for_each_entry_continue_rcu(node, &tn->node_list, tipc_nl_link_dump()
2153 list_for_each_entry_rcu(node, &tn->node_list, list) { tipc_nl_link_dump()
/linux-4.1.27/include/drm/
H A Ddrm_mm.h62 struct list_head node_list; member in struct:drm_mm_node
79 /* head_node.node_list is the list of all memory nodes, ordered
151 return list_entry(hole_node->node_list.next, __drm_mm_hole_node_end()
152 struct drm_mm_node, node_list)->start; __drm_mm_hole_node_end()
180 &(mm)->head_node.node_list, \
181 node_list)
/linux-4.1.27/fs/btrfs/
H A Ddelayed-inode.h38 struct list_head node_list; member in struct:btrfs_delayed_root
97 INIT_LIST_HEAD(&delayed_root->node_list); btrfs_init_delayed_root()
H A Ddelayed-inode.c180 list_add_tail(&node->n_list, &root->node_list); btrfs_queue_delayed_node()
212 if (list_empty(&delayed_root->node_list)) btrfs_first_delayed_node()
215 p = delayed_root->node_list.next; btrfs_first_delayed_node()
235 if (list_empty(&delayed_root->node_list)) btrfs_next_delayed_node()
237 p = delayed_root->node_list.next; btrfs_next_delayed_node()
238 } else if (list_is_last(&node->n_list, &delayed_root->node_list)) btrfs_next_delayed_node()
/linux-4.1.27/drivers/media/firewire/
H A Dfiredtv-fw.c28 static LIST_HEAD(node_list);
210 list_for_each_entry(f, &node_list, list) { handle_fcp()
285 list_add_tail(&fdtv->list, &node_list); node_probe()
/linux-4.1.27/drivers/staging/lustre/include/linux/lnet/
H A Dlnetst.h104 } lstcon_ndlist_ent_t; /*** node_list entry, for list_batch command */
119 lstcon_ndlist_ent_t tbe_cli_nle; /* client (group) node_list entry */
120 lstcon_ndlist_ent_t tbe_srv_nle; /* server (group) node_list entry */
/linux-4.1.27/drivers/gpu/drm/i915/
H A Di915_gem.c3412 if (list_empty(&gtt_space->node_list)) i915_gem_valid_gtt_space()
3415 other = list_entry(gtt_space->node_list.prev, struct drm_mm_node, node_list); i915_gem_valid_gtt_space()
3419 other = list_entry(gtt_space->node_list.next, struct drm_mm_node, node_list); i915_gem_valid_gtt_space()
H A Di915_gem_gtt.c2005 if (!list_empty(&node->node_list)) { i915_gtt_color_adjust()
2006 node = list_entry(node->node_list.next, i915_gtt_color_adjust()
2008 node_list); i915_gtt_color_adjust()

Completed in 495 milliseconds