From 5e4241f3e54fdba59d893e78a1fc69aa43636de3 Mon Sep 17 00:00:00 2001 From: "Liam R. Howlett" Date: Wed, 24 Nov 2021 11:42:24 -0500 Subject: [PATCH] maple_tree: Rename _mas_rev_awalk() to mas_rev_awalk() Signed-off-by: Liam R. Howlett --- lib/maple_tree.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lib/maple_tree.c b/lib/maple_tree.c index f349edc04ebfe..43c378554441d 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; -- 2.50.1