bpf_rb_node
return sizeof(struct bpf_rb_node);
return __alignof__(struct bpf_rb_node);
__alignof__(struct bpf_rb_node));
__bpf_kfunc struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root,
struct bpf_rb_node *node)
return (struct bpf_rb_node *)n;
__bpf_kfunc int bpf_rbtree_add_impl(struct bpf_rb_root *root, struct bpf_rb_node *node,
bool (less)(struct bpf_rb_node *a, const struct bpf_rb_node *b),
__bpf_kfunc struct bpf_rb_node *bpf_rbtree_first(struct bpf_rb_root *root)
return (struct bpf_rb_node *)rb_first_cached(r);
__bpf_kfunc struct bpf_rb_node *bpf_rbtree_root(struct bpf_rb_root *root)
return (struct bpf_rb_node *)r->rb_root.rb_node;
__bpf_kfunc struct bpf_rb_node *bpf_rbtree_left(struct bpf_rb_root *root, struct bpf_rb_node *node)
return (struct bpf_rb_node *)node_internal->rb_node.rb_left;
__bpf_kfunc struct bpf_rb_node *bpf_rbtree_right(struct bpf_rb_root *root, struct bpf_rb_node *node)
return (struct bpf_rb_node *)node_internal->rb_node.rb_right;
BTF_ID(struct, bpf_rb_node)
struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root,
struct bpf_rb_node *node) __ksym;
int bpf_rbtree_add_impl(struct bpf_rb_root *root, struct bpf_rb_node *node,
bool (less)(struct bpf_rb_node *a, const struct bpf_rb_node *b),
struct bpf_rb_node *bpf_rbtree_first(struct bpf_rb_root *root) __ksym;
struct bpf_rb_node rb_node;
static bool cgv_node_less(struct bpf_rb_node *a, const struct bpf_rb_node *b)
struct bpf_rb_node *rb_node;
extern struct bpf_rb_node *bpf_rbtree_remove(struct bpf_rb_root *root,
struct bpf_rb_node *node) __ksym;
extern int bpf_rbtree_add_impl(struct bpf_rb_root *root, struct bpf_rb_node *node,
bool (less)(struct bpf_rb_node *a, const struct bpf_rb_node *b),
extern struct bpf_rb_node *bpf_rbtree_first(struct bpf_rb_root *root) __ksym;
static bool skbn_tstamp_less(struct bpf_rb_node *a, const struct bpf_rb_node *b)
static bool fn_time_next_packet_less(struct bpf_rb_node *a, const struct bpf_rb_node *b)
struct bpf_rb_node *node = NULL;
struct bpf_rb_node *rb_node;
struct bpf_rb_node *rb_node;
struct bpf_rb_node node;
struct bpf_rb_node rb_node;
static bool rbless(struct bpf_rb_node *n1, const struct bpf_rb_node *n2)
struct bpf_rb_node node;
struct bpf_rb_node node;
struct bpf_rb_node rb_node;
static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b)
struct bpf_rb_node node;
struct bpf_rb_node node;
struct bpf_rb_node *res1 = NULL, *res2 = NULL, *res3 = NULL;
struct bpf_rb_node *res = NULL;
struct bpf_rb_node *res, *res2;
static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b)
struct bpf_rb_node *res = NULL;
struct bpf_rb_node node;
struct bpf_rb_node node;
static bool less2(struct bpf_rb_node *a, const struct bpf_rb_node *b)
struct bpf_rb_node *res;
struct bpf_rb_node node;
struct bpf_rb_node *res;
static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b)
struct bpf_rb_node *res;
static bool less__bad_fn_call_add(struct bpf_rb_node *a, const struct bpf_rb_node *b)
static bool less__bad_fn_call_remove(struct bpf_rb_node *a, const struct bpf_rb_node *b)
static bool less__bad_fn_call_first_unlock_after(struct bpf_rb_node *a, const struct bpf_rb_node *b)
long add_with_cb(bool (cb)(struct bpf_rb_node *a, const struct bpf_rb_node *b))
struct bpf_rb_node *res_n, *res_m;
struct bpf_rb_node r0;
struct bpf_rb_node r1;
struct bpf_rb_node *rb_n; \
struct bpf_rb_node *rb_n; \
static bool less0(struct bpf_rb_node *a, const struct bpf_rb_node *b)
static bool less1(struct bpf_rb_node *a, const struct bpf_rb_node *b)
struct bpf_rb_node *rb_n, *rb_m, *gc_ns[NR_NODES];
struct bpf_rb_node *rb;
struct bpf_rb_node r;
struct bpf_rb_node node;
struct bpf_rb_node *res;
struct bpf_rb_node *rb;
static bool less(struct bpf_rb_node *node_a, const struct bpf_rb_node *node_b)
struct bpf_rb_node *rb;
static bool less_a(struct bpf_rb_node *a, const struct bpf_rb_node *b)
struct bpf_rb_node node;
static bool less(struct bpf_rb_node *a, const struct bpf_rb_node *b)