aboutsummaryrefslogtreecommitdiffstats
path: root/lib/prio_tree.c
diff options
context:
space:
mode:
Diffstat (limited to 'lib/prio_tree.c')
-rw-r--r--lib/prio_tree.c4
1 files changed, 4 insertions, 0 deletions
diff --git a/lib/prio_tree.c b/lib/prio_tree.c
index 8d443af03b4c..4e0d2edff2b4 100644
--- a/lib/prio_tree.c
+++ b/lib/prio_tree.c
@@ -14,6 +14,7 @@
14#include <linux/init.h> 14#include <linux/init.h>
15#include <linux/mm.h> 15#include <linux/mm.h>
16#include <linux/prio_tree.h> 16#include <linux/prio_tree.h>
17#include <linux/export.h>
17 18
18/* 19/*
19 * A clever mix of heap and radix trees forms a radix priority search tree (PST) 20 * A clever mix of heap and radix trees forms a radix priority search tree (PST)
@@ -241,6 +242,7 @@ struct prio_tree_node *prio_tree_insert(struct prio_tree_root *root,
241 BUG(); 242 BUG();
242 return NULL; 243 return NULL;
243} 244}
245EXPORT_SYMBOL(prio_tree_insert);
244 246
245/* 247/*
246 * Remove a prio_tree_node @node from a radix priority search tree @root. The 248 * Remove a prio_tree_node @node from a radix priority search tree @root. The
@@ -290,6 +292,7 @@ void prio_tree_remove(struct prio_tree_root *root, struct prio_tree_node *node)
290 while (cur != node) 292 while (cur != node)
291 cur = prio_tree_replace(root, cur->parent, cur); 293 cur = prio_tree_replace(root, cur->parent, cur);
292} 294}
295EXPORT_SYMBOL(prio_tree_remove);
293 296
294static void iter_walk_down(struct prio_tree_iter *iter) 297static void iter_walk_down(struct prio_tree_iter *iter)
295{ 298{
@@ -464,3 +467,4 @@ repeat:
464 467
465 goto repeat; 468 goto repeat;
466} 469}
470EXPORT_SYMBOL(prio_tree_next);