Home
last modified time | relevance | path

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

/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/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/tools/verification/rvgen/rvgen/
H A Dltl2ba.py215 node2 = GraphNode(node.incoming,
219 return node2.expand(node1.expand(node_set))
237 node2 = GraphNode(node.incoming,
241 return node2.expand(node1.expand(node_set))
259 node2 = GraphNode(node.incoming,
263 return node2.expand(node1.expand(node_set))
/linux/tools/testing/selftests/drivers/net/netdevsim/
H A Ddevlink.sh920 local node2="$DL_HANDLE/$node2_name"
921 rate_node_add "$node2"
922 check_err $? "Failed to add node $node2"
924 rate_attr_parent_check $node2 $node1_name \
926 rate_node_del "$node2"
927 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.h638 struct hlist_node *node2 = right->first; in hlists_swap_heads_rcu() local
640 rcu_assign_pointer(left->first, node2); in hlists_swap_heads_rcu()
642 WRITE_ONCE(node2->pprev, &left->first); in hlists_swap_heads_rcu()
/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/scsi/aic7xxx/aicasm/
H 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/
H A Dalloc_exact_nid_api.c187 * | | requested | | node1 | node2 | |
202 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()
458 * | | requested | | node1 | node2 | |
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()
787 * | node0 | node1 | node2 | node3 | node4 | node5 | node6 | node7 |
H A Dalloc_nid_api.c1624 * | | requested | | node1 | node2 | |
1639 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()
2172 * | | requested | | node1 | node2 | |
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()
2339 * | node0 | node1 | node2 | node3 | node4 | node5 | node6 | node7 |
/linux/scripts/gcc-plugins/
H A Dgcc-common.h297 static inline void cgraph_call_node_duplication_hooks(cgraph_node_ptr node, cgraph_node_ptr node2) in cgraph_call_node_duplication_hooks() argument
299 symtab->call_cgraph_duplication_hooks(node, node2); in cgraph_call_node_duplication_hooks()
/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.c203 int node1, node2; in evsel__process_alloc_event()
206 node2 = perf_sample__intval(sample, "node"); in evsel__process_alloc_event()
212 if ((node2 != NUMA_NO_NODE) && (node1 != node2)) in evsel__process_alloc_event()
202 int node1, node2; evsel__process_alloc_event() local
/linux/lib/842/
H A D842_compress.c106 struct sw842_hlist_node2 node2[1 << I2_BITS]; member
/linux/fs/ext4/
H A Dnamei.c2520 struct dx_node *node2; in ext4_dx_add_entry() local
2552 node2 = (struct dx_node *)(bh2->b_data); in ext4_dx_add_entry()
2553 entries2 = node2->entries; in ext4_dx_add_entry()
2554 memset(&node2->fake, 0, sizeof(struct fake_dirent)); in ext4_dx_add_entry()
2555 node2->fake.rec_len = ext4_rec_len_to_disk(sb->s_blocksize, in ext4_dx_add_entry()
/linux/drivers/mtd/ubi/
H A Dfastmap.c373 struct rb_node *node, *node2; in unmap_peb() local
377 ubi_rb_for_each_entry(node2, aeb, &av->root, u.rb) { in unmap_peb()
/linux/drivers/net/ethernet/intel/ixgbe/
H A Dixgbe_main.c5693 struct hlist_node *node2; in ixgbe_fdir_filter_restore() local
5702 hlist_for_each_entry_safe(filter, node2, in ixgbe_fdir_filter_restore()
6683 struct hlist_node *node2; in ixgbe_fdir_filter_exit() local
6688 hlist_for_each_entry_safe(filter, node2, in ixgbe_fdir_filter_exit()
/linux/drivers/net/ethernet/intel/i40e/
H A Di40e_main.c8891 struct hlist_node *node2; in i40e_find_cloud_filter() local
8893 hlist_for_each_entry_safe(filter, node2, in i40e_find_cloud_filter()
9152 struct hlist_node *node2; in i40e_fdir_filter_exit() local
9154 hlist_for_each_entry_safe(filter, node2, in i40e_fdir_filter_exit()
/linux/drivers/net/ethernet/intel/igb/
H A Digb_main.c2495 struct hlist_node *node2; in igb_set_features() local
2499 hlist_for_each_entry_safe(rule, node2, in igb_set_features()