kernel/bpf/range_tree.c

11  * represented by struct range_node or 'rn' for short.
23  * The alloc/free of range_node-s is done via kmalloc_nolock().
36 struct range_node {
44 static struct range_node *rb_to_range_node(struct rb_node *rb)
46 	return rb_entry(rb, struct range_node, rb_range_size);
49 static u32 rn_size(struct range_node *rn)
55 static inline struct range_node *__find_range(struct range_tree *rt, u32 len)
58 	struct range_node *best = NULL;
61 		struct range_node *rn = rb_to_range_node(rb);
76 	struct range_node *rn;
85 static inline void __range_size_insert(struct range_node *rn,
109 INTERVAL_TREE_DEFINE(struct range_node, rn_rbnode, u32,
115 range_it_insert(struct range_node *rn, struct range_tree *rt)
122 range_it_remove(struct range_node *rn, struct range_tree *rt)
129 static inline __maybe_unused struct range_node *
139 	struct range_node *new_rn;
140 	struct range_node *rn;
152 			new_rn = kmalloc_nolock(sizeof(struct range_node), __GFP_ACCOUNT,
183 	struct range_node *left;
196 	struct range_node *right;
197 	struct range_node *left;
238 		left = kmalloc_nolock(sizeof(struct range_node), __GFP_ACCOUNT, NUMA_NO_NODE);
250 	struct range_node *rn;