bpf_rb_root
return sizeof(struct bpf_rb_root);
return __alignof__(struct bpf_rb_root);
BUILD_BUG_ON(sizeof(struct rb_root_cached) > sizeof(struct bpf_rb_root));
BUILD_BUG_ON(__alignof__(struct rb_root_cached) > __alignof__(struct bpf_rb_root));
__bpf_kfunc struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root,
static int __bpf_rbtree_add(struct bpf_rb_root *root,
__bpf_kfunc int bpf_rbtree_add_impl(struct bpf_rb_root *root, struct bpf_rb_node *node,
__bpf_kfunc struct bpf_rb_node *bpf_rbtree_first(struct bpf_rb_root *root)
__bpf_kfunc struct bpf_rb_node *bpf_rbtree_root(struct bpf_rb_root *root)
__bpf_kfunc struct bpf_rb_node *bpf_rbtree_left(struct bpf_rb_root *root, struct bpf_rb_node *node)
__bpf_kfunc struct bpf_rb_node *bpf_rbtree_right(struct bpf_rb_root *root, struct bpf_rb_node *node)
BTF_ID(struct, bpf_rb_root)
struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root,
int bpf_rbtree_add_impl(struct bpf_rb_root *root, struct bpf_rb_node *node,
struct bpf_rb_node *bpf_rbtree_first(struct bpf_rb_root *root) __ksym;
private(CGV_TREE) struct bpf_rb_root cgv_tree __contains(cgv_node, rb_node);
extern struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root,
extern int bpf_rbtree_add_impl(struct bpf_rb_root *root, struct bpf_rb_node *node,
extern struct bpf_rb_node *bpf_rbtree_first(struct bpf_rb_root *root) __ksym;
private(A) struct bpf_rb_root fq_delayed __contains(fq_flow_node, rb_node);
struct bpf_rb_root queue __contains(skb_node, node);
private(A) struct bpf_rb_root rbtree __contains(foo, node);
struct bpf_rb_root r __contains(node_data, node);
struct bpf_rb_root root __contains(node_data, node);
private(A) struct bpf_rb_root groot __contains(node_data, node);
private(A) struct bpf_rb_root groot_array[2] __contains(node_data, node);
private(A) struct bpf_rb_root groot_array_one[1] __contains(node_data, node);
static long __add_three(struct bpf_rb_root *root, struct bpf_spin_lock *lock)
private(A) struct bpf_rb_root groot __contains(node_data, node);
private(A) struct bpf_rb_root groot __contains(node_data, node);
private(A) struct bpf_rb_root groot __contains(node_data, node);
private(A) struct bpf_rb_root groot2 __contains(node_data, node);
private(A) struct bpf_rb_root groot0 __contains(node_data, r0);
private(B) struct bpf_rb_root groot1 __contains(node_data, r1);
static long __stash_map_insert_tree(int idx, int val, struct bpf_rb_root *root,
static long __read_from_tree(struct bpf_rb_root *root,
private(A) struct bpf_rb_root root __contains(node_data, r);
private(B) struct bpf_rb_root aroot __contains(node_acquire, node);
private(C) struct bpf_rb_root broot __contains(node_data, r);
struct bpf_rb_root *root,
private(A) struct bpf_rb_root groot __contains(node_acquire, node);