bpf_rbtree_add
return bpf_rbtree_add(root, node, less, meta__ign, off);
BTF_ID_FLAGS(func, bpf_rbtree_add, KF_IMPLICIT_ARGS)
BTF_ID(func, bpf_rbtree_add)
bpf_rbtree_add(&cgv_tree, &cgv_node->rb_node, cgv_node_less);
bpf_rbtree_add(&cgv_tree, &cgv_node->rb_node, cgv_node_less);
bpf_rbtree_add(&cgv_tree, &cgv_node->rb_node, cgv_node_less);
bpf_rbtree_add(&flow->queue, &skbn->node, skbn_tstamp_less);
bpf_rbtree_add(&fq_delayed, &flow->rb_node, fn_time_next_packet_less);
bpf_rbtree_add(&rbtree, &f->node, rbless);
bpf_rbtree_add(&res->r, &n->node, less);
bpf_rbtree_add(&groot, &n->node, less);
bpf_rbtree_add(&groot, &m->node, less);
bpf_rbtree_add(&groot_array[i], &nodes[i][j]->node, less);
bpf_rbtree_add(&groot_array_one[0], &nodes[2][j]->node, less);
bpf_rbtree_add(&groot, &n->node, less);
bpf_rbtree_add(&groot, &m->node, less);
bpf_rbtree_add(&groot, &o->node, less);
bpf_rbtree_add(&groot, &n->node, less);
bpf_rbtree_add(root, &n->node, less);
bpf_rbtree_add(root, &m->node, less);
bpf_rbtree_add(root, &n->node, less);
bpf_rbtree_add(&groot, &n->node, less2);
bpf_rbtree_add(&groot, &n->node, less);
bpf_rbtree_add(&groot2, &n->node, less);
bpf_rbtree_add(&groot, res, less);
bpf_rbtree_add(&groot, &n->node, less);
bpf_rbtree_add(&groot, &node_a->node, less);
bpf_rbtree_add(&groot, &n->node, cb);
bpf_rbtree_add(&groot, &n->node, less);
bpf_rbtree_add(&groot, &n->node, less);
bpf_rbtree_add(&groot, &n->node, less);
bpf_rbtree_add(&groot0, &n->r0, less0);
bpf_rbtree_add(&groot1, &m->r1, less1);
bpf_rbtree_add(&root_r, &tnode_r->node, less_r);
bpf_rbtree_add(&root, &tnode->node, less);
if (bpf_rbtree_add(root, &m->r, less)) {
bpf_rbtree_add(&aroot, &n->node, less_a);
bpf_rbtree_add(&aroot, &n->node, less_a);
bpf_rbtree_add(&broot, &n->r, less);
bpf_rbtree_add(&root, &n->r, less);
bpf_rbtree_add(&root, &n->r, less);
if (bpf_rbtree_add(root, &n->r, less)) {
bpf_rbtree_add(&groot, &n->node, less);
bpf_rbtree_add(&groot, &n->node, less);
bpf_rbtree_add(&groot, &n->node, less);