osl_update_object(): Honor OSL_DONT_FREE.

[osl.git] / rbtree.h

diff --git a/rbtree.h b/rbtree.h
index 38b7752b245c5a44f603eceb74e75e60eaf5dded..4bf49178f5fb9d9e790fba33d99ca9116dd2816d 100644 (file)
--- a/rbtree.h
+++ b/rbtree.h
@@ -147,16 +147,12 @@ extern void rb_insert_color(struct rb_node *, struct rb_root *);
 extern void rb_erase(struct rb_node *, struct rb_root *);
 
 /* Find logical next and previous nodes in a tree */
-extern struct rb_node *rb_next(struct rb_node *);
-extern struct rb_node *rb_prev(struct rb_node *);
-extern struct rb_node *rb_first(struct rb_root *);
-extern struct rb_node *rb_last(struct rb_root *);
-extern struct rb_node *rb_nth(struct rb_node *node, unsigned n);
-extern int rb_rank(struct rb_node *node, unsigned *rank);
-
-/* Fast replacement of a single node without remove/rebalance/add/rebalance */
-extern void rb_replace_node(struct rb_node *victim, struct rb_node *new, 
-                           struct rb_root *root);
+extern struct rb_node *rb_next(const struct rb_node *);
+extern struct rb_node *rb_prev(const struct rb_node *);
+extern struct rb_node *rb_first(const struct rb_root *);
+extern struct rb_node *rb_last(const struct rb_root *);
+extern struct rb_node *rb_nth(const struct rb_node *node, unsigned n);
+extern int rb_rank(const struct rb_node *node, unsigned *rank);
 
 static inline void rb_link_node(struct rb_node * node, struct rb_node * parent,
                                struct rb_node ** rb_link)