* Wei Yang <richard.weiyang@xxxxxxxxx> [241115 20:48]:
> At the beginning of loop, it has checked the range is in lower bounds.
>
> Signed-off-by: Wei Yang <richard.weiyang@xxxxxxxxx>
> CC: Liam R. Howlett <Liam.Howlett@xxxxxxxxxx>
> CC: Lorenzo Stoakes <lorenzo.stoakes@xxxxxxxxxx>
> CC: Sidhartha Kumar <sidhartha.kumar@xxxxxxxxxx>
looks good.
Reviewed-by: Liam R. Howlett <Liam.Howlett@xxxxxxxxxx>
> ---
> lib/maple_tree.c | 13 ++++++-------
> 1 file changed, 6 insertions(+), 7 deletions(-)
>
> diff --git a/lib/maple_tree.c b/lib/maple_tree.c
> index 667326717f35..63dccd7b9474 100644
> --- a/lib/maple_tree.c
> +++ b/lib/maple_tree.c
> @@ -4893,13 +4893,12 @@ static inline bool mas_anode_descend(struct ma_state *mas, unsigned long size)
> found = true;
> goto done;
> }
> - if (mas->index <= pivot) {
> - mas->node = mas_slot(mas, slots, offset);
> - mas->min = min;
> - mas->max = pivot;
> - offset = 0;
> - break;
> - }
> +
> + mas->node = mas_slot(mas, slots, offset);
> + mas->min = min;
> + mas->max = pivot;
> + offset = 0;
> + break;
> }
> next_slot:
> min = pivot + 1;
> --
> 2.34.1
>
