mm-vmallocc-find-the-vmap-of-vmap_nodes-in-reverse-order.patch removed from -mm tree
The quilt patch titled
Subject: mm/vmalloc.c: find the vmap of vmap_nodes in reverse order
has been removed from the -mm tree. Its filename was
mm-vmallocc-find-the-vmap-of-vmap_nodes-in-reverse-order.patch
This patch was dropped because it was merged into the mm-stable branch of git://git.kernel.org/pub/scm/linux/kernel/git/akpm/mm
------------------------------------------------------
From: Baoquan He <[email protected]>
Subject: mm/vmalloc.c: find the vmap of vmap_nodes in reverse order
Date: Sat, 19 Apr 2025 06:36:50 +0800
When finding VA in vn->busy, if VA spans several zones and the passed addr is not the same as va->va_start, we should scan the vn in reverse odrdr because the starting address of VA must be smaller than the passed addr if it really resides in the VA.
E.g on a system nr_vmap_nodes=100,
<----va---->
-|-----|-----|-----|-----|-----|-----|-----|-----|-----|-
... n-1 n n+1 n+2 ... 100 0 1VA resides in node 'n' whereas it spans 'n', 'n+1' and 'n+2'. If passed addr is within 'n+2', we should try nodes backwards on 'n+1' and 'n', then succeed very soon.
Meanwhile we still need loop around because VA could spans node from 'n' to node 100, node 0, node 1.
Anyway, changing to find in reverse order can improve efficiency on many CPUs system.
---
mm/vmalloc.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-)
mm/vmalloc.c renamed from mm/vmalloc.c~mm-vmallocc-find-the-vmap-of-vmap_nodes-in-reverse-order +2 -2
@@ -2435,7 +2435,7 @@ struct vmap_area *find_vmap_area(unsigneif (va)return va; - }while ((i = (i +1 ) % nr_vmap_nodes) != j); + }while ((i = (i + nr_vmap_nodes -1 ) % nr_vmap_nodes) != j);return NULL ; }
@@ -2461,7 +2461,7 @@ static struct vmap_area *find_unlink_vmaif (va)return va; - }while ((i = (i +1 ) % nr_vmap_nodes) != j); + }while ((i = (i + nr_vmap_nodes -1 ) % nr_vmap_nodes) != j);return NULL ; }
_
Patches currently in -mm which might be from [email protected] are