Home
last modified time | relevance | path

Searched refs:LIST_NODE (Results 1 – 3 of 3) sorted by relevance

/linux/tools/testing/selftests/bpf/prog_tests/
H A Dlinked_list.c250 #define LIST_NODE 4 macro
270 if (!ASSERT_EQ(nid, LIST_NODE, "btf__add_struct bpf_list_node")) in init_btf()
301 err = btf__add_field(btf, "a", LIST_NODE, 0, 0); in list_and_rb_node_same_struct()
375 err = btf__add_field(btf, "a", LIST_NODE, 0, 0); in test_btf()
395 err = btf__add_field(btf, "b", LIST_NODE, 0, 0); in test_btf()
516 err = btf__add_field(btf, "b", LIST_NODE, 128, 0); in test_btf()
519 err = btf__add_field(btf, "b", LIST_NODE, 256, 0); in test_btf()
545 err = btf__add_field(btf, "b", LIST_NODE, 128, 0); in test_btf()
571 err = btf__add_field(btf, "b", LIST_NODE, 128, 0); in test_btf()
586 err = btf__add_field(btf, "b", LIST_NODE, 128, 0); in test_btf()
[all …]
H A Dlocal_kptr_ownership.c10 #define LIST_NODE 4 macro
32 if (!ASSERT_EQ(id, LIST_NODE, "btf__add_struct bpf_list_node")) in init_btf()
136 err = btf__add_field(btf, "node", LIST_NODE, 0, 0); in test_mixed_cycle()
204 int root_type = LIST_HEAD, node_type = LIST_NODE, node_size = 24; in test_graph_depth()
/linux/drivers/android/binder/
H A Dnode.rs180 refs: List<NodeRefInfo, { NodeRefInfo::LIST_NODE }>,
295 info: ListArc<NodeRefInfo, { NodeRefInfo::LIST_NODE }>,
311 ) -> Option<ListArc<NodeRefInfo, { NodeRefInfo::LIST_NODE }>> { in remove_node_info()