X-Git-Url: http://git.tuebingen.mpg.de/?p=paraslash.git;a=blobdiff_plain;f=rbtree.h;h=8295d2ad248b7afca440db9694961daf4359f404;hp=1dafb7927a789de18ca83c91332b9e0ef44e1098;hb=ddd7cd853044105f329a2c70cce2d8f1470f559e;hpb=f6f50d03a09d6bc423324206d274336e9905bbb4

diff --git a/rbtree.h b/rbtree.h
index 1dafb792..8295d2ad 100644
--- a/rbtree.h
+++ b/rbtree.h
@@ -91,6 +91,8 @@ static inline struct page * rb_insert_page_cache(struct inode * inode,
 -----------------------------------------------------------------------
 */
 
+/** \file rbtree.h Exported symbols from rbtree.h */
+
 #ifndef	_LINUX_RBTREE_H
 #define	_LINUX_RBTREE_H
 
@@ -145,12 +147,13 @@ 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);
+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);
 
 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,