1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17#ifndef __TOOLS_LINUX_PERF_RBTREE_H
18#define __TOOLS_LINUX_PERF_RBTREE_H
19
20#include <linux/kernel.h>
21#include <linux/stddef.h>
22
23struct rb_node {
24 unsigned long __rb_parent_color;
25 struct rb_node *rb_right;
26 struct rb_node *rb_left;
27} __attribute__((aligned(sizeof(long))));
28
29
30struct rb_root {
31 struct rb_node *rb_node;
32};
33
34#define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
35
36#define RB_ROOT (struct rb_root) { NULL, }
37#define rb_entry(ptr, type, member) container_of(ptr, type, member)
38
39#define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
40
41
42#define RB_EMPTY_NODE(node) \
43 ((node)->__rb_parent_color == (unsigned long)(node))
44#define RB_CLEAR_NODE(node) \
45 ((node)->__rb_parent_color = (unsigned long)(node))
46
47
48extern void rb_insert_color(struct rb_node *, struct rb_root *);
49extern void rb_erase(struct rb_node *, struct rb_root *);
50
51
52
53extern struct rb_node *rb_next(const struct rb_node *);
54extern struct rb_node *rb_prev(const struct rb_node *);
55extern struct rb_node *rb_first(const struct rb_root *);
56extern struct rb_node *rb_last(const struct rb_root *);
57
58
59extern struct rb_node *rb_first_postorder(const struct rb_root *);
60extern struct rb_node *rb_next_postorder(const struct rb_node *);
61
62
63extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
64 struct rb_root *root);
65
66static inline void rb_link_node(struct rb_node *node, struct rb_node *parent,
67 struct rb_node **rb_link)
68{
69 node->__rb_parent_color = (unsigned long)parent;
70 node->rb_left = node->rb_right = NULL;
71
72 *rb_link = node;
73}
74
75#define rb_entry_safe(ptr, type, member) \
76 ({ typeof(ptr) ____ptr = (ptr); \
77 ____ptr ? rb_entry(____ptr, type, member) : NULL; \
78 })
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97#define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \
98 for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \
99 pos && ({ n = rb_entry_safe(rb_next_postorder(&pos->field), \
100 typeof(*pos), field); 1; }); \
101 pos = n)
102
103static inline void rb_erase_init(struct rb_node *n, struct rb_root *root)
104{
105 rb_erase(n, root);
106 RB_CLEAR_NODE(n);
107}
108
109
110
111
112
113
114
115
116
117
118
119struct rb_root_cached {
120 struct rb_root rb_root;
121 struct rb_node *rb_leftmost;
122};
123
124#define RB_ROOT_CACHED (struct rb_root_cached) { {NULL, }, NULL }
125
126
127#define rb_first_cached(root) (root)->rb_leftmost
128
129static inline void rb_insert_color_cached(struct rb_node *node,
130 struct rb_root_cached *root,
131 bool leftmost)
132{
133 if (leftmost)
134 root->rb_leftmost = node;
135 rb_insert_color(node, &root->rb_root);
136}
137
138static inline void rb_erase_cached(struct rb_node *node,
139 struct rb_root_cached *root)
140{
141 if (root->rb_leftmost == node)
142 root->rb_leftmost = rb_next(node);
143 rb_erase(node, &root->rb_root);
144}
145
146static inline void rb_replace_node_cached(struct rb_node *victim,
147 struct rb_node *new,
148 struct rb_root_cached *root)
149{
150 if (root->rb_leftmost == victim)
151 root->rb_leftmost = new;
152 rb_replace_node(victim, new, &root->rb_root);
153}
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177static __always_inline void
178rb_add_cached(struct rb_node *node, struct rb_root_cached *tree,
179 bool (*less)(struct rb_node *, const struct rb_node *))
180{
181 struct rb_node **link = &tree->rb_root.rb_node;
182 struct rb_node *parent = NULL;
183 bool leftmost = true;
184
185 while (*link) {
186 parent = *link;
187 if (less(node, parent)) {
188 link = &parent->rb_left;
189 } else {
190 link = &parent->rb_right;
191 leftmost = false;
192 }
193 }
194
195 rb_link_node(node, parent, link);
196 rb_insert_color_cached(node, tree, leftmost);
197}
198
199
200
201
202
203
204
205static __always_inline void
206rb_add(struct rb_node *node, struct rb_root *tree,
207 bool (*less)(struct rb_node *, const struct rb_node *))
208{
209 struct rb_node **link = &tree->rb_node;
210 struct rb_node *parent = NULL;
211
212 while (*link) {
213 parent = *link;
214 if (less(node, parent))
215 link = &parent->rb_left;
216 else
217 link = &parent->rb_right;
218 }
219
220 rb_link_node(node, parent, link);
221 rb_insert_color(node, tree);
222}
223
224
225
226
227
228
229
230
231
232
233static __always_inline struct rb_node *
234rb_find_add(struct rb_node *node, struct rb_root *tree,
235 int (*cmp)(struct rb_node *, const struct rb_node *))
236{
237 struct rb_node **link = &tree->rb_node;
238 struct rb_node *parent = NULL;
239 int c;
240
241 while (*link) {
242 parent = *link;
243 c = cmp(node, parent);
244
245 if (c < 0)
246 link = &parent->rb_left;
247 else if (c > 0)
248 link = &parent->rb_right;
249 else
250 return parent;
251 }
252
253 rb_link_node(node, parent, link);
254 rb_insert_color(node, tree);
255 return NULL;
256}
257
258
259
260
261
262
263
264
265
266static __always_inline struct rb_node *
267rb_find(const void *key, const struct rb_root *tree,
268 int (*cmp)(const void *key, const struct rb_node *))
269{
270 struct rb_node *node = tree->rb_node;
271
272 while (node) {
273 int c = cmp(key, node);
274
275 if (c < 0)
276 node = node->rb_left;
277 else if (c > 0)
278 node = node->rb_right;
279 else
280 return node;
281 }
282
283 return NULL;
284}
285
286
287
288
289
290
291
292
293
294static __always_inline struct rb_node *
295rb_find_first(const void *key, const struct rb_root *tree,
296 int (*cmp)(const void *key, const struct rb_node *))
297{
298 struct rb_node *node = tree->rb_node;
299 struct rb_node *match = NULL;
300
301 while (node) {
302 int c = cmp(key, node);
303
304 if (c <= 0) {
305 if (!c)
306 match = node;
307 node = node->rb_left;
308 } else if (c > 0) {
309 node = node->rb_right;
310 }
311 }
312
313 return match;
314}
315
316
317
318
319
320
321
322
323
324static __always_inline struct rb_node *
325rb_next_match(const void *key, struct rb_node *node,
326 int (*cmp)(const void *key, const struct rb_node *))
327{
328 node = rb_next(node);
329 if (node && cmp(key, node))
330 node = NULL;
331 return node;
332}
333
334
335
336
337
338
339
340
341#define rb_for_each(node, key, tree, cmp) \
342 for ((node) = rb_find_first((key), (tree), (cmp)); \
343 (node); (node) = rb_next_match((key), (node), (cmp)))
344
345#endif
346