Searched refs:node2 (Results 1 – 10 of 10) sorted by relevance
| /tools/testing/selftests/bpf/progs/ |
| A D | linked_list_fail.c | 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);
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 D | linked_list.c | 13 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 D | linked_list.h | 19 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/verification/rvgen/rvgen/ |
| A D | ltl2ba.py | 219 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))
|
| /tools/testing/selftests/drivers/net/netdevsim/ |
| A D | devlink.sh | 739 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"
|
| /tools/testing/selftests/alsa/ |
| A D | pcm-test.c | 125 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/ |
| A D | alloc_exact_nid_api.c | 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()
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()
|
| A D | alloc_nid_api.c | 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()
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/ |
| A D | builtin-kmem.c | 202 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()
|
| /tools/testing/selftests/net/ |
| A D | ioam6_parser.c | 52 static struct ioam_config node2 = { variable
601 return check_data(trace, trace_size, node2, false); in check_ioam_trace()
|
Completed in 24 milliseconds