From: Liam R. Howlett <Liam.Howlett@oracle.com>
Date: Wed, 24 Nov 2021 16:42:24 +0000 (-0500)
Subject: maple_tree: Rename _mas_rev_awalk() to mas_rev_awalk()
X-Git-Url: https://www.infradead.org/git/?a=commitdiff_plain;h=5e4241f3e54fdba59d893e78a1fc69aa43636de3;p=users%2Fjedix%2Flinux-maple.git

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 f349edc04ebf..43c378554441 100644
--- 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;