Home
last modified time | relevance | path

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

12

/linux/tools/testing/selftests/bpf/progs/
A Dlinked_list_fail.c84 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);
341 return *(int *)&f->node2; in direct_read_node()
352 *(int *)&f->node2 = 0; in direct_write_node()
367 bpf_list_push_front(&ghead, &f->node2); in use_after_unlock()
369 bpf_list_push_back(&ghead, &f->node2); in use_after_unlock()
397 bpf_list_push_front(&ghead, &f->node2); in list_double_add()
398 bpf_list_push_front(&ghead, &f->node2); in list_double_add()
400 bpf_list_push_back(&ghead, &f->node2); in list_double_add()
[all …]
A Dlinked_list.c13 struct bpf_list_head head __contains(foo, node2);
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()
135 bpf_list_push_front(head, &f[i]->node2); in list_push_pop_multiple()
146 pf = container_of(n, struct foo, node2); in list_push_pop_multiple()
152 bpf_list_push_back(head, &pf->node2); in list_push_pop_multiple()
165 pf = container_of(n, struct foo, node2); in list_push_pop_multiple()
215 bpf_list_push_front(head, &f->node2); in list_in_list()
[all …]
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/
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/tools/testing/selftests/net/
A Dioam6_parser.c50 static struct ioam_config node2 = { variable
411 __u32 tmp32 = node2.egr_wide; in check_ioam_header_and_data()
412 __u16 tmp16 = node2.egr_id; in check_ioam_header_and_data()
415 node2.egr_id = 0xffff; in check_ioam_header_and_data()
416 node2.egr_wide = 0xffffffff; in check_ioam_header_and_data()
418 res = check_ioam6_data(&p, ioam6h, node2); in check_ioam_header_and_data()
420 node2.egr_id = tmp16; in check_ioam_header_and_data()
421 node2.egr_wide = tmp32; in check_ioam_header_and_data()
429 if (check_ioam6_data(&p, ioam6h, node2)) in check_ioam_header_and_data()
/linux/include/net/
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/
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/
A Dbnode.c246 struct hfs_bnode *node, *node2; in __hfs_bnode_create() local
270 node2 = hfs_bnode_findhash(tree, cnid); in __hfs_bnode_create()
271 if (!node2) { in __hfs_bnode_create()
277 hfs_bnode_get(node2); in __hfs_bnode_create()
280 wait_event(node2->lock_wq, !test_bit(HFS_BNODE_NEW, &node2->flags)); in __hfs_bnode_create()
281 return node2; in __hfs_bnode_create()
/linux/drivers/base/test/
A Dproperty-entry-test.c409 static const struct software_node node2 = { .name = "2" }; in pe_test_reference() local
410 static const struct software_node *group[] = { &node1, &node2, NULL }; in pe_test_reference()
414 SOFTWARE_NODE_REFERENCE(&node2, 3, 4), in pe_test_reference()
419 PROPERTY_ENTRY_REF("ref-2", &node2, 1, 2), in pe_test_reference()
448 KUNIT_EXPECT_PTR_EQ(test, to_software_node(ref.fwnode), &node2); in pe_test_reference()
456 KUNIT_EXPECT_PTR_EQ(test, to_software_node(ref.fwnode), &node2); in pe_test_reference()
478 KUNIT_EXPECT_PTR_EQ(test, to_software_node(ref.fwnode), &node2); in pe_test_reference()
/linux/tools/testing/selftests/drivers/net/netdevsim/
A Ddevlink.sh684 local node2="$DL_HANDLE/$node2_name"
685 rate_node_add "$node2"
686 check_err $? "Failed to add node $node2"
688 rate_attr_parent_check $node2 $node1_name \
690 rate_node_del "$node2"
691 check_err $? "Failed to delete node $node2"
/linux/include/linux/
A Dunion_find.h39 void uf_union(struct uf_node *node1, struct uf_node *node2);
A Drculist.h555 struct hlist_node *node2 = right->first; in hlists_swap_heads_rcu() local
557 rcu_assign_pointer(left->first, node2); in hlists_swap_heads_rcu()
559 WRITE_ONCE(node2->pprev, &left->first); in hlists_swap_heads_rcu()
/linux/fs/hfsplus/
A Dbnode.c395 struct hfs_bnode *node, *node2; in __hfs_bnode_create() local
420 node2 = hfs_bnode_findhash(tree, cnid); in __hfs_bnode_create()
421 if (!node2) { in __hfs_bnode_create()
429 wait_event(node2->lock_wq, in __hfs_bnode_create()
430 !test_bit(HFS_BNODE_NEW, &node2->flags)); in __hfs_bnode_create()
431 return node2; in __hfs_bnode_create()
/linux/tools/testing/selftests/alsa/
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/
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/
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()
1869 struct xfs_da_intnode *node2; in xfs_da3_node_order() local
1876 node2 = node2_bp->b_addr; in xfs_da3_node_order()
[all …]
/linux/drivers/scsi/aic7xxx/aicasm/
A Daicasm_symbol.c300 symbol_node_t *node1, *node2; in symlist_free() local
304 node2 = SLIST_NEXT(node1, links); in symlist_free()
306 node1 = node2; in symlist_free()
/linux/tools/testing/memblock/tests/
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()
/linux/scripts/gcc-plugins/
A Dgcc-common.h286 static inline void cgraph_call_node_duplication_hooks(cgraph_node_ptr node, cgraph_node_ptr node2) in cgraph_call_node_duplication_hooks() argument
288 symtab->call_cgraph_duplication_hooks(node, node2); in cgraph_call_node_duplication_hooks()
/linux/fs/bcachefs/
A Dtrace.h1686 __array(char, node2, 24 )
1714 strscpy(__entry->node2, bch2_err_str(PTR_ERR(b)), sizeof(__entry->node0));
1716 scnprintf(__entry->node2, sizeof(__entry->node0), "%px", &b->c);
1741 __entry->node2,
1774 __array(char, node2, 24 )
1799 strscpy(__entry->node2, bch2_err_str(PTR_ERR(b)), sizeof(__entry->node0));
1801 scnprintf(__entry->node2, sizeof(__entry->node0), "%px", &b->c);
1826 __entry->node2,
/linux/arch/powerpc/mm/
A Dnuma.c202 int node1, node2; in __cpu_form2_relative_distance() local
205 node2 = associativity_to_nid(cpu2_assoc); in __cpu_form2_relative_distance()
207 dist = numa_distance_table[node1][node2]; in __cpu_form2_relative_distance()
/linux/drivers/net/ethernet/wangxun/txgbe/
A Dtxgbe_ethtool.c246 struct hlist_node *node2; in txgbe_match_ethtool_fdir_entry() local
248 hlist_for_each_entry_safe(rule, node2, &txgbe->fdir_filter_list, in txgbe_match_ethtool_fdir_entry()
/linux/Documentation/devicetree/bindings/interrupt-controller/
A Dmarvell,icu.txt74 node2 {
/linux/drivers/pci/hotplug/
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/
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()

Completed in 99 milliseconds

12