Home
last modified time | relevance | path

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

/linux/include/linux/
H 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()
129 INIT_LIST_HEAD(&node->node_list); in plist_node_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)
[all …]
H A Dplist_types.h8 struct list_head node_list; member
14 struct list_head node_list; member
H A Dinterconnect-provider.h103 struct list_head node_list; member
/linux/lib/
H A Dplist.c60 plist_check_list(&head->node_list); in plist_check_head()
76 struct list_head *node_next = &head->node_list; in plist_add()
90 node_next = &iter->node_list; in plist_add()
97 node_next = &iter->node_list; in plist_add()
111 list_add_tail(&node->node_list, node_next); in plist_add()
127 if (node->node_list.next != &head->node_list) { in plist_del()
130 next = list_entry(node->node_list.next, in plist_del()
131 struct plist_node, node_list); in plist_del()
140 list_del_init(&node->node_list); in plist_del()
158 struct list_head *node_next = &head->node_list; in plist_requeue()
[all …]
H A Dobjagg.c18 struct list_head node_list; member
679 list_add(&hnode->list, &objagg_hints->node_list); in objagg_hints_node_create()
694 list_for_each_entry_safe(hnode, tmp, &objagg_hints->node_list, list) { in objagg_hints_flush()
940 INIT_LIST_HEAD(&objagg_hints->node_list); in objagg_hints_get()
1019 list_for_each_entry(hnode, &objagg_hints->node_list, list) { in objagg_hints_stats_get()
/linux/drivers/accel/amdxdna/
H A Daie2_solver.c40 struct list_head node_list; member
135 list_for_each_entry(node, &rgp->node_list, list) { in set_dpm_level()
149 list_for_each_entry(node, &rgp->node_list, list) { in rg_search_node()
281 list_add_tail(&node->list, &xrs->rgp.node_list); in create_solver_node()
376 INIT_LIST_HEAD(&rgp->node_list); in xrsm_init()
/linux/drivers/interconnect/
H A Dcore.c57 list_for_each_entry(n, &provider->nodes, node_list) { in icc_summary_show()
120 list_for_each_entry(n, &provider->nodes, node_list) in icc_graph_show()
124 list_for_each_entry(n, &provider->nodes, node_list) in icc_graph_show()
135 list_for_each_entry(n, &provider->nodes, node_list) in icc_graph_show()
159 list_for_each_entry(n, &provider->nodes, node_list) { in node_find_by_name()
1057 list_add_tail(&node->node_list, &provider->nodes); in icc_node_add()
1096 list_del(&node->node_list); in icc_node_del()
1115 list_for_each_entry_safe_reverse(n, tmp, &provider->nodes, node_list) { in icc_nodes_remove()
1213 list_for_each_entry(n, &p->nodes, node_list) { in icc_sync_state()
/linux/net/tipc/
H A Dcore.h107 struct list_head node_list;
162 return &tipc_net(net)->node_list; in tipc_nodes()
106 struct list_head node_list; global() member
H A Dnode.c359 list_for_each_entry_rcu(n, &tn->node_list, list) { in tipc_node_find_by_id()
505 list_for_each_entry_rcu(temp_node, &tn->node_list, list) { in tipc_node_create()
529 list_for_each_entry_rcu(temp_node, &tn->node_list, list) { in tipc_node_create()
596 list_for_each_entry_rcu(temp_node, &tn->node_list, list) { in tipc_node_create()
603 list_for_each_entry_rcu(temp_node, &tn->node_list, list) { in tipc_node_create()
651 list_for_each_entry_safe(node, t_node, &tn->node_list, list) in tipc_node_stop()
790 list_for_each_entry_rcu(temp_node, &tn->node_list, list) { in tipc_node_cleanup()
1319 list_for_each_entry_rcu(n, &tn->node_list, list) { in tipc_node_delete_links()
2218 list_for_each_entry_rcu(n, &tn->node_list, list) { in tipc_node_apply_property()
2302 list_for_each_entry_rcu(temp_node, &tn->node_list, lis in tipc_nl_peer_rm()
[all...]
H A Dcore.c68 INIT_LIST_HEAD(&tn->node_list); in tipc_init_net()
H A Dcrypto.c2025 for (p = tn->node_list.next; p != &tn->node_list; p = p->next) { in tipc_crypto_do_cmd()
2052 for (p = tn->node_list.next; p != &tn->node_list; p = p->next) { in tipc_crypto_do_cmd()
/linux/drivers/media/firewire/
H A Dfiredtv-fw.c29 static LIST_HEAD(node_list);
211 list_for_each_entry(f, &node_list, list) { in handle_fcp()
290 list_add_tail(&fdtv->list, &node_list); in node_probe()
/linux/drivers/target/
H A Dtarget_core_tpg.c570 LIST_HEAD(node_list); in core_tpg_deregister()
581 list_splice_init(&se_tpg->acl_node_list, &node_list); in core_tpg_deregister()
588 list_for_each_entry_safe(nacl, nacl_tmp, &node_list, acl_list) { in core_tpg_deregister()
/linux/fs/btrfs/
H A Ddelayed-inode.c49 INIT_LIST_HEAD(&delayed_root->node_list); in btrfs_init_delayed_root()
206 list_add_tail(&node->n_list, &root->node_list); in btrfs_queue_delayed_node()
241 node = list_first_entry_or_null(&fs_info->delayed_root.node_list, in btrfs_first_delayed_node()
264 if (list_empty(&delayed_root->node_list)) in btrfs_next_delayed_node()
266 p = delayed_root->node_list.next; in btrfs_next_delayed_node()
267 } else if (list_is_last(&node->n_list, &delayed_root->node_list)) in btrfs_next_delayed_node()
H A Dfs.h477 struct list_head node_list; member
/linux/drivers/interconnect/imx/
H A Dimx.c212 list_for_each_entry_safe(node, tmp, &provider->nodes, node_list) in imx_icc_unregister_nodes()
/linux/drivers/interconnect/qcom/
H A Dicc-rpm.c338 list_for_each_entry(node, &provider->nodes, node_list) { in qcom_icc_bus_aggregate()
/linux/drivers/memory/tegra/
H A Dtegra20-emc.c957 list_for_each_entry(node, &provider->nodes, node_list) { in emc_of_icc_xlate_extended()
/linux/drivers/net/ethernet/mellanox/mlxsw/
H A Dspectrum_router.c513 struct list_head node_list; member
547 INIT_LIST_HEAD(&fib->node_list); in mlxsw_sp_fib_create()
569 WARN_ON(!list_empty(&fib->node_list)); in mlxsw_sp_fib_destroy()
946 if (!vr->rif_count && list_empty(&vr->fib4->node_list) && in mlxsw_sp_vr_put()
947 list_empty(&vr->fib6->node_list) && in mlxsw_sp_vr_put()
6606 list_add(&fib_node->list, &fib->node_list); in mlxsw_sp_fib_node_create()
7762 list_for_each_entry_safe(fib_node, tmp, &fib->node_list, list) { in mlxsw_sp_vr_fib_flush()
7763 bool do_break = &tmp->list == &fib->node_list; in mlxsw_sp_vr_fib_flush()