maple_tree: Rename _mas_rev_awalk() to mas_rev_awalk()

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

diff --git a/lib/maple_tree.c b/lib/maple_tree.c
index f349edc04ebfed78abd5e6a85ef248d42a9ce515..43c378554441d8d5e784eae521b2d6f4295d7195 100644 (file)
--- a/lib/maple_tree.c
+++ b/lib/maple_tree.c
@@ -4854,7 +4854,7 @@ retry:
 }
 
 /*
- * _mas_rev_awalk() - Internal function.  Reverse allocation walk.  Find the
+ * mas_rev_awalk() - Internal function.  Reverse allocation walk.  Find the
  * highest gap address of a given size in a given node and descend.
  * @mas: The maple state
  * @size: The needed size.
@@ -4862,7 +4862,7 @@ retry:
  * Return: True if found in a leaf, false otherwise.
  *
  */
-static bool _mas_rev_awalk(struct ma_state *mas, unsigned long size)
+static bool mas_rev_awalk(struct ma_state *mas, unsigned long size)
 {
        enum maple_type type = mte_node_type(mas->node);
        struct maple_node *node = mas_mn(mas);
@@ -5281,7 +5281,7 @@ int mas_empty_area_rev(struct ma_state *mas, unsigned long min,
        mas->index = min;
        mas->last = max;
 
-       while (!_mas_rev_awalk(mas, size)) {
+       while (!mas_rev_awalk(mas, size)) {
                if (last == mas->node) {
                        if (!mas_rewind_node(mas))
                                return -EBUSY;