mirrors/linux
1
0
Fork 1
mirror of https://github.com/torvalds/linux.git synced 2025-11-03 10:10:33 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

maple_tree: use mas_next_slot() directly

Browse source 
The loop condition makes sure (mas.last < max), so we can directly use
mas_next_slot() here.

Since no other use of mas_next_entry(), it is removed.

Link: https://lkml.kernel.org/r/20241125024156.26093-1-richard.weiyang@gmail.com
Signed-off-by: Wei Yang <richard.weiyang@gmail.com>
Reviewed-by: Liam R. Howlett <Liam.Howlett@Oracle.com>
Cc: Sidhartha Kumar <sidhartha.kumar@oracle.com>
Cc: Lorenzo Stoakes <lorenzo.stoakes@oracle.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
This commit is contained in:
Wei Yang 2024-11-25 02:41:56 +00:00 committed by Andrew Morton
parent cbc5dde0a4
commit 002ebb925e
1 changed files with 1 additions and 24 deletions
repo.diff.show_diff_stats Download patch file Download diff file Expand all files Collapse all files

25
lib/maple_tree.c
View file

@ -4745,29 +4745,6 @@ static void *mas_next_slot(struct ma_state *mas, unsigned long max, bool empty)
return entry; return entry;
} }
/*
* mas_next_entry() - Internal function to get the next entry.
* @mas: The maple state
* @limit: The maximum range start.
*
* Set the @mas->node to the next entry and the range_start to
* the beginning value for the entry. Does not check beyond @limit.
* Sets @mas->index and @mas->last to the range, Does not update @mas->index and
* @mas->last on overflow.
* Restarts on dead nodes.
*
* Return: the next entry or %NULL.
*/
static inline void *mas_next_entry(struct ma_state *mas, unsigned long limit)
{
if (mas->last >= limit) {
mas->status = ma_overflow;
return NULL;
}
return mas_next_slot(mas, limit, false);
}
/* /*
* 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. * highest gap address of a given size in a given node and descend.
@ -6938,7 +6915,7 @@ void *mt_find(struct maple_tree *mt, unsigned long *index, unsigned long max)
goto unlock; goto unlock;
while (mas_is_active(&mas) && (mas.last < max)) { while (mas_is_active(&mas) && (mas.last < max)) {
entry = mas_next_entry(&mas, max); entry = mas_next_slot(&mas, max, false);
if (likely(entry && !xa_is_zero(entry))) if (likely(entry && !xa_is_zero(entry)))
break; break;
} }