22 	struct node_data *node_a;  in less()  local
25 	node_a = container_of(a, struct node_data, node);  in less()
28 	return node_a->key < node_b->key;  in less()
232 	struct node_data *node_a;  in less__bad_fn_call_add()  local
235 	node_a = container_of(a, struct node_data, node);  in less__bad_fn_call_add()
237 	bpf_rbtree_add(&groot, &node_a->node, less);  in less__bad_fn_call_add()
239 	return node_a->key < node_b->key;  in less__bad_fn_call_add()
244 	struct node_data *node_a;  in less__bad_fn_call_remove()  local
247 	node_a = container_of(a, struct node_data, node);  in less__bad_fn_call_remove()
249 	bpf_rbtree_remove(&groot, &node_a->node);  in less__bad_fn_call_remove()
251 	return node_a->key < node_b->key;  in less__bad_fn_call_remove()
256 	struct node_data *node_a;  in less__bad_fn_call_first_unlock_after()  local
259 	node_a = container_of(a, struct node_data, node);  in less__bad_fn_call_first_unlock_after()
264 	return node_a->key < node_b->key;  in less__bad_fn_call_first_unlock_after()