Home
last modified time | relevance | path

Searched refs:node2 (Results 1 – 25 of 30) sorted by relevance

12

/linux/tools/testing/selftests/bpf/progs/
H A Dlinked_list_fail.c83 CHECK(global, push_front, &ghead, &f->node2);
84 CHECK(global, push_back, &ghead, &f->node2);
86 CHECK(map, push_front, &v->head, &f->node2);
87 CHECK(map, push_back, &v->head, &f->node2);
89 CHECK(inner_map, push_front, &iv->head, &f->node2);
90 CHECK(inner_map, push_back, &iv->head, &f->node2);
144 CHECK(kptr_global, op, &f1->lock, &ghead, &f->node2); \
145 CHECK(kptr_map, op, &f1->lock, &v->head, &f->node2); \
146 CHECK(kptr_inner_map, op, &f1->lock, &iv->head, &f->node2); \
148 CHECK(global_global, op, &glock2, &ghead, &f->node2); \
[all …]
H A Dlinked_list.c13 struct bpf_list_head head __contains(foo, node2);
22 private(C) struct bpf_list_head ghead_array[2] __contains(foo, node2);
23 private(C) struct bpf_list_head ghead_array_one[1] __contains(foo, node2);
41 bpf_obj_drop(container_of(n, struct foo, node2)); in list_push_pop()
50 bpf_obj_drop(container_of(n, struct foo, node2)); in list_push_pop()
58 bpf_list_push_front(head, &f->node2); in list_push_pop()
67 f = container_of(n, struct foo, node2); in list_push_pop()
75 bpf_list_push_front(head, &f->node2); in list_push_pop()
82 f = container_of(n, struct foo, node2); in list_push_pop()
93 bpf_obj_drop(container_of(n, struct foo, node2)); in list_push_pop()
[all …]
H A Dlinked_list.h19 struct bpf_list_node node2; member
25 struct bpf_list_head head __contains(foo, node2);
53 private(A) struct bpf_list_head ghead __contains(foo, node2);
/linux/arch/sparc/prom/
H A Dtree_32.c234 phandle node = prom_root_node, node2; in prom_finddevice() local
256 node2 = node; in prom_finddevice()
257 while (node2 && (s32)node2 != -1) { in prom_finddevice()
258 if (prom_getproperty (node2, "reg", (char *)reg, sizeof (reg)) > 0) { in prom_finddevice()
260 node = node2; in prom_finddevice()
264 node2 = prom_getsibling(node2); in prom_finddevice()
265 if (!node2 || (s32)node2 == -1) in prom_finddevice()
267 node2 = prom_searchsiblings(prom_getsibling(node2), nbuf); in prom_finddevice()
/linux/include/net/
H A Dnetrom.h164 #define nr_neigh_for_each_safe(__nr_neigh, node2, list) \ argument
165 hlist_for_each_entry_safe(__nr_neigh, node2, list, neigh_node)
170 #define nr_node_for_each_safe(__nr_node, node2, list) \ argument
171 hlist_for_each_entry_safe(__nr_node, node2, list, node_node)
/linux/lib/
H A Dunion_find.c33 void uf_union(struct uf_node *node1, struct uf_node *node2) in uf_union() argument
36 struct uf_node *root2 = uf_find(node2); in uf_union()
/linux/fs/hfs/
H A Dbnode.c344 struct hfs_bnode *node, *node2; in __hfs_bnode_create() local
368 node2 = hfs_bnode_findhash(tree, cnid); in __hfs_bnode_create()
369 if (!node2) { in __hfs_bnode_create()
375 hfs_bnode_get(node2); in __hfs_bnode_create()
378 wait_event(node2->lock_wq, !test_bit(HFS_BNODE_NEW, &node2->flags)); in __hfs_bnode_create()
379 return node2; in __hfs_bnode_create()
/linux/tools/verification/rvgen/rvgen/
H A Dltl2ba.py219 node2 = GraphNode(node.incoming,
223 return node2.expand(node1.expand(node_set))
241 node2 = GraphNode(node.incoming,
245 return node2.expand(node1.expand(node_set))
263 node2 = GraphNode(node.incoming,
267 return node2.expand(node1.expand(node_set))
/linux/tools/testing/selftests/drivers/net/netdevsim/
H A Ddevlink.sh739 local node2="$DL_HANDLE/$node2_name"
740 rate_node_add "$node2"
741 check_err $? "Failed to add node $node2"
743 rate_attr_parent_check $node2 $node1_name \
745 rate_node_del "$node2"
746 check_err $? "Failed to delete node $node2"
/linux/include/linux/
H A Dunion_find.h39 void uf_union(struct uf_node *node1, struct uf_node *node2);
H A Drculist.h599 struct hlist_node *node2 = right->first; in hlists_swap_heads_rcu() local
601 rcu_assign_pointer(left->first, node2); in hlists_swap_heads_rcu()
603 WRITE_ONCE(node2->pprev, &left->first); in hlists_swap_heads_rcu()
/linux/fs/hfsplus/
H A Dbnode.c493 struct hfs_bnode *node, *node2; in __hfs_bnode_create() local
518 node2 = hfs_bnode_findhash(tree, cnid); in __hfs_bnode_create()
519 if (!node2) { in __hfs_bnode_create()
527 wait_event(node2->lock_wq, in __hfs_bnode_create()
528 !test_bit(HFS_BNODE_NEW, &node2->flags)); in __hfs_bnode_create()
529 return node2; in __hfs_bnode_create()
/linux/tools/testing/selftests/alsa/
H A Dpcm-test.c125 snd_config_t *pcm_config, *node1, *node2; in missing_devices() local
140 node2 = snd_config_iterator_entry(i2); in missing_devices()
141 subdevice = device_from_id(node2); in missing_devices()
144 if (conf_get_subtree(node2, "PLAYBACK", NULL)) in missing_devices()
146 if (conf_get_subtree(node2, "CAPTURE", NULL)) in missing_devices()
/linux/drivers/pci/
H A Dof.c141 struct device_node *node, *node2; in of_pci_find_child_device() local
152 for_each_child_of_node(node, node2) { in of_pci_find_child_device()
153 if (__of_pci_pci_compare(node2, devfn)) { in of_pci_find_child_device()
155 return node2; in of_pci_find_child_device()
/linux/fs/xfs/libxfs/
H A Dxfs_da_btree.c935 struct xfs_da_intnode *node2; in xfs_da3_node_rebalance() local
951 node2 = blk2->bp->b_addr; in xfs_da3_node_rebalance()
953 xfs_da3_node_hdr_from_disk(dp->i_mount, &nodehdr2, node2); in xfs_da3_node_rebalance()
965 swap(node1, node2); in xfs_da3_node_rebalance()
967 xfs_da3_node_hdr_from_disk(dp->i_mount, &nodehdr2, node2); in xfs_da3_node_rebalance()
1036 xfs_da3_node_hdr_to_disk(dp->i_mount, node2, &nodehdr2); in xfs_da3_node_rebalance()
1038 XFS_DA_LOGRANGE(node2, &node2->hdr, in xfs_da3_node_rebalance()
1048 node2 = blk2->bp->b_addr; in xfs_da3_node_rebalance()
1050 xfs_da3_node_hdr_from_disk(dp->i_mount, &nodehdr2, node2); in xfs_da3_node_rebalance()
1869 struct xfs_da_intnode *node2; in xfs_da3_node_order() local
[all …]
/linux/tools/testing/memblock/tests/
H A Dalloc_exact_nid_api.c202 struct memblock_region *node2 = &memblock.memory.regions[6]; in alloc_exact_nid_top_down_numa_no_overlap_split_check() local
212 min_addr = node2->base - SZ_256; in alloc_exact_nid_top_down_numa_no_overlap_split_check()
473 struct memblock_region *node2 = &memblock.memory.regions[6]; in alloc_exact_nid_bottom_up_numa_no_overlap_split_check() local
483 min_addr = node2->base - SZ_256; in alloc_exact_nid_bottom_up_numa_no_overlap_split_check()
H A Dalloc_nid_api.c1639 struct memblock_region *node2 = &memblock.memory.regions[6]; in alloc_nid_top_down_numa_no_overlap_split_check() local
1649 min_addr = node2->base - SZ_256; in alloc_nid_top_down_numa_no_overlap_split_check()
2187 struct memblock_region *node2 = &memblock.memory.regions[6]; in alloc_nid_bottom_up_numa_no_overlap_split_check() local
2197 min_addr = node2->base - SZ_256; in alloc_nid_bottom_up_numa_no_overlap_split_check()
/linux/scripts/gcc-plugins/
H A Dgcc-common.h290 static inline void cgraph_call_node_duplication_hooks(cgraph_node_ptr node, cgraph_node_ptr node2) in cgraph_call_node_duplication_hooks() argument
292 symtab->call_cgraph_duplication_hooks(node, node2); in cgraph_call_node_duplication_hooks()
/linux/fs/bcachefs/
H A Dtrace.h1680 __array(char, node2, 24 )
1708 strscpy(__entry->node2, bch2_err_str(PTR_ERR(b)), sizeof(__entry->node0));
1710 scnprintf(__entry->node2, sizeof(__entry->node0), "%px", &b->c);
1735 __entry->node2,
1768 __array(char, node2, 24 )
1793 strscpy(__entry->node2, bch2_err_str(PTR_ERR(b)), sizeof(__entry->node0));
1795 scnprintf(__entry->node2, sizeof(__entry->node0), "%px", &b->c);
1820 __entry->node2,
/linux/drivers/net/ethernet/wangxun/txgbe/
H A Dtxgbe_ethtool.c271 struct hlist_node *node2; in txgbe_match_ethtool_fdir_entry() local
273 hlist_for_each_entry_safe(rule, node2, &txgbe->fdir_filter_list, in txgbe_match_ethtool_fdir_entry()
/linux/drivers/pci/hotplug/
H A Dcpqphp_ctrl.c816 struct pci_resource *node2; in cpqhp_resource_sort_and_combine() local
849 node2 = node1->next; in cpqhp_resource_sort_and_combine()
852 node2->next = node1->next; in cpqhp_resource_sort_and_combine()
853 node1->next = node2; in cpqhp_resource_sort_and_combine()
866 node2 = node1->next; in cpqhp_resource_sort_and_combine()
868 kfree(node2); in cpqhp_resource_sort_and_combine()
/linux/tools/perf/
H A Dbuiltin-kmem.c202 int node1, node2; in evsel__process_alloc_event() local
205 node2 = evsel__intval(evsel, sample, "node"); in evsel__process_alloc_event()
211 if ((node2 != NUMA_NO_NODE) && (node1 != node2)) in evsel__process_alloc_event()
/linux/drivers/net/ethernet/intel/i40e/
H A Di40e_ethtool.c3337 struct hlist_node *node2; in i40e_get_ethtool_fdir_all() local
3343 hlist_for_each_entry_safe(rule, node2, in i40e_get_ethtool_fdir_all()
3374 struct hlist_node *node2; in i40e_get_ethtool_fdir_entry() local
3379 hlist_for_each_entry_safe(rule, node2, in i40e_get_ethtool_fdir_entry()
3755 struct hlist_node *node2; in i40e_update_ethtool_fdir_entry() local
3761 hlist_for_each_entry_safe(rule, node2, in i40e_update_ethtool_fdir_entry()
4764 struct hlist_node *node2; in i40e_disallow_matching_filters() local
4767 hlist_for_each_entry_safe(rule, node2, in i40e_disallow_matching_filters()
5030 struct hlist_node *node2; in i40e_set_channels() local
5059 hlist_for_each_entry_safe(rule, node2, in i40e_set_channels()
/linux/drivers/net/ethernet/intel/ixgbe/
H A Dixgbe_ethtool.c2669 struct hlist_node *node2; in ixgbe_get_ethtool_fdir_entry() local
2675 hlist_for_each_entry_safe(rule, node2, in ixgbe_get_ethtool_fdir_entry()
2736 struct hlist_node *node2; in ixgbe_get_ethtool_fdir_all() local
2743 hlist_for_each_entry_safe(rule, node2, in ixgbe_get_ethtool_fdir_all()
2842 struct hlist_node *node2; in ixgbe_update_ethtool_fdir_entry() local
2849 hlist_for_each_entry_safe(rule, node2, in ixgbe_update_ethtool_fdir_entry()
/linux/lib/842/
H A D842_compress.c106 struct sw842_hlist_node2 node2[1 << I2_BITS]; member

12