From 404eee8c4b01cdb959a57ef4a52b31433e509a9e Mon Sep 17 00:00:00 2001
From: Andreas Gruenbacher <agruen@linbit.com>
Date: Wed, 26 Jan 2011 15:55:36 +0100
Subject: [PATCH] --- yaml --- r: 232528 b: refs/heads/master c:
 0b6bb66d1247601e4a2560bb048d64c606bd7b73 h: refs/heads/master v: v3

---
 [refs]             | 2 +-
 trunk/lib/rbtree.c | 3 +++
 2 files changed, 4 insertions(+), 1 deletion(-)

diff --git a/[refs] b/[refs]
index ee9911bc11df..afeab9f942fc 100644
--- a/[refs]
+++ b/[refs]
@@ -1,2 +1,2 @@
 ---
-refs/heads/master: b12ece7d852efbc8db45371c068900fcc62002d4
+refs/heads/master: 0b6bb66d1247601e4a2560bb048d64c606bd7b73
diff --git a/trunk/lib/rbtree.c b/trunk/lib/rbtree.c
index 4693f79195d3..a16be19a1305 100644
--- a/trunk/lib/rbtree.c
+++ b/trunk/lib/rbtree.c
@@ -315,6 +315,7 @@ void rb_augment_insert(struct rb_node *node, rb_augment_f func, void *data)
 
 	rb_augment_path(node, func, data);
 }
+EXPORT_SYMBOL(rb_augment_insert);
 
 /*
  * before removing the node, find the deepest node on the rebalance path
@@ -340,6 +341,7 @@ struct rb_node *rb_augment_erase_begin(struct rb_node *node)
 
 	return deepest;
 }
+EXPORT_SYMBOL(rb_augment_erase_begin);
 
 /*
  * after removal, update the tree to account for the removed entry
@@ -350,6 +352,7 @@ void rb_augment_erase_end(struct rb_node *node, rb_augment_f func, void *data)
 	if (node)
 		rb_augment_path(node, func, data);
 }
+EXPORT_SYMBOL(rb_augment_erase_end);
 
 /*
  * This function returns the first node (in sort order) of the tree.