Home
last modified time | relevance | path

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

/tools/testing/selftests/bpf/progs/
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 …]
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 …]
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);
/tools/testing/selftests/net/
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()
/tools/testing/selftests/drivers/net/netdevsim/
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"
/tools/testing/selftests/alsa/
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()
/tools/testing/memblock/tests/
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()
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()
/tools/perf/
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()