maple_tree: Random whitespace fixes

Also add some missing EXPORT_SYMBOLs

Signed-off-by: Matthew Wilcox (Oracle) <willy@infradead.org>

diff --git a/lib/maple_tree.c b/lib/maple_tree.c
index bd005880d0075be7527ee9556014aa6b791bd3da..12ebb48b10a35c0ead7db63e5512420dd6b146b7 100644 (file)
--- a/lib/maple_tree.c
+++ b/lib/maple_tree.c
@@ -3232,6 +3232,7 @@ ascend:
        ma_set_slot(mas, i);
        return found;
 }
+
 /*
  * Private: Returns true if mas->node is a leaf
  */
@@ -3301,6 +3302,7 @@ done:
        ma_set_slot(mas, i);
        return ret;
 }
+
 static inline bool _mas_walk(struct ma_state *mas)
 {
        mas->node = mas_start(mas);
@@ -3326,6 +3328,7 @@ static inline int mas_safe_slot(struct ma_state *mas, unsigned char *slot,
        }
        return false;
 }
+
 static inline int mas_dead_node(struct ma_state *mas, unsigned long index)
 {
        if (!mt_dead_node(mas->node))
@@ -3394,9 +3397,9 @@ done:
 not_found:
        mas->node = MAS_NONE;
        return NULL;
-
-
 }
+EXPORT_SYMBOL_GPL(mas_find);
+
 /**
  * mas_pause() - Pause a mas_find/mas_for_each to drop the lock.
  *
@@ -3415,6 +3418,8 @@ void mas_pause(struct ma_state *mas)
        mas->index = mas->last + 1;
        mas->last++;
 }
+EXPORT_SYMBOL_GPL(mas_pause);
+
 /* mt_find() - Search from start up until an entry is found.
  *
  * Note: Does not return the zero entry.
@@ -3458,6 +3463,7 @@ done:
 
        return entry;
 }
+EXPORT_SYMBOL(mt_find);
 
 /* mt_find_after() - Search up from the entry of index until an entry is
  * found.
@@ -3490,6 +3496,8 @@ done:
        return entry;
 
 }
+EXPORT_SYMBOL(mt_find_after);
+
 static inline void ma_inactive_insert(struct ma_state *mas, void *entry);
 static inline int mas_replace_tree(struct ma_state *mas, void *new_entry)
 {
@@ -4063,6 +4071,7 @@ retry:
        return 0;
 }
 EXPORT_SYMBOL(mtree_store_range);
+
 int mtree_store(struct maple_tree *mt, unsigned long index, void *entry,
                 gfp_t gfp)
 {
@@ -4186,8 +4195,8 @@ int mtree_next(struct maple_tree *mt, unsigned long index, unsigned long *next)
        if (mas.node)
                return 0;
        return ret;
-
 }
+
 int mtree_erase(struct maple_tree *mt, unsigned long index)
 {
        int ret = -EINVAL;