From: Kaitao Cheng <[email protected]> In BPF, a list can only be used to implement a stack structure. Due to an incomplete API set, only FIFO or LIFO operations are supported. The patches enhance the BPF list API, making it more list-like.
Five new kfuncs have been added: bpf_list_del: remove a node from the list bpf_list_add_impl: insert a node after a given list node bpf_list_is_first: check if a node is the first in the list bpf_list_is_last: check if a node is the last in the list bpf_list_empty: check if the list is empty Changes in v2: - Remove the head parameter from bpf_list_del - Add bpf_list_add/is_first/is_last/empty to API and test cases Link to v1: https://lore.kernel.org/all/[email protected]/ Kaitao Cheng (6): bpf: Introduce the bpf_list_del kfunc. selftests/bpf: Add test cases for bpf_list_del bpf: add bpf_list_add_impl to insert node after a given list node selftests/bpf: Add test case for bpf_list_add_impl bpf: add bpf_list_is_first/last/empty kfuncs selftests/bpf: Add test cases for bpf_list_is_first/is_last/empty kernel/bpf/btf.c | 33 ++++++- kernel/bpf/helpers.c | 92 +++++++++++++++++++ kernel/bpf/verifier.c | 28 +++++- .../testing/selftests/bpf/bpf_experimental.h | 38 ++++++++ .../selftests/bpf/progs/refcounted_kptr.c | 87 ++++++++++++++++++ 5 files changed, 272 insertions(+), 6 deletions(-) -- 2.50.1 (Apple Git-155)
