maple_tree: whitespace

Signed-off-by: Liam R. Howlett <Liam.Howlett@oracle.com>

diff --git a/lib/maple_tree.c b/lib/maple_tree.c
index f1edea07152b72bde2d32b35409c2b4f50e35801..c8cf9490e940b1b785d3692357a37df99d046513 100644 (file)
--- a/lib/maple_tree.c
+++ b/lib/maple_tree.c
@@ -3006,15 +3006,15 @@ static inline int mas_rebalance(struct ma_state *mas,
 
        trace_ma_op(__func__, mas);
 
-/*
- * Rebalancing occurs if a node is insufficient.  Data is rebalanced against the
- * node to the right if it exists, otherwise the node to the left of this node
- * is rebalanced against this node.  If rebalancing causes just one node to be
- * produced instead of two, then the parent is also examined and rebalanced if
- * it is insufficient.  Every level tries to combine the data in the same way.
- * If one node contains the entire range of the tree, then that node is used as
- * a new root node.
- */
+       /*
+        * Rebalancing occurs if a node is insufficient.  Data is rebalanced
+        * against the node to the right if it exists, otherwise the node to the
+        * left of this node is rebalanced against this node.  If rebalancing
+        * causes just one node to be produced instead of two, then the parent
+        * is also examined and rebalanced if it is insufficient.  Every level
+        * tries to combine the data in the same way.  If one node contains the
+        * entire range of the tree, then that node is used as a new root node.
+        */
        mas_node_count(mas, 1 + empty_count * 3);
        if (mas_is_err(mas))
                return 0;