summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorYe Liu <liuye@kylinos.cn>2026-09-28 16:15:55 +0800
committerAndrew Morton <akpm@linux-foundation.org>2026-10-14 17:20:10 -0700
commitcf65e34b2b8dde5f7cd76db8db78ef800537e49b (patch)
tree92ff44e6510f445d4145020577b577c2040408db
parentd247e70fe7a174b9d2ed16715eaf1a21a306da74 (diff)
downloadlinux-next-cf65e34b2b8dde5f7cd76db8db78ef800537e49b.tar.gz
linux-next-cf65e34b2b8dde5f7cd76db8db78ef800537e49b.zip
mm/vmalloc: fix vmalloc_dump_obj cross-zone VA lookup
vmalloc_dump_obj() searches only one vmap node (addr_to_node(addr)), but a vmalloc allocation may span multiple vmap zones. The VA is stored in only one node's rb-tree (addr_to_node(va_start)), so an object pointer in a different zone than va_start maps to a different node and the search misses. This affects any allocation larger than vmap_zone_size (64 KiB) on multi-CPU systems. Extract find_vmap_area_lock() from find_vmap_area() to share the cross-node iteration logic. The helper supports both spin_lock and spin_trylock, the latter for atomic dump contexts (OOM, KASAN, RCU). Link: https://lore.kernel.org/20260928-vmalloc_dump_obj-v4-2-6f288a431edc@linux.dev Signed-off-by: Ye Liu <liuye@kylinos.cn> Signed-off-by: Andrew Morton <akpm@linux-foundation.org> Reviewed-by: Uladzislau Rezki (Sony) <urezki@gmail.com> Cc: Paul Walmsley <pjw@kernel.org> Cc: Palmer Dabbelt <palmer@dabbelt.com> Cc: Albert Ou <aou@eecs.berkeley.edu> Cc: Alexandre Ghiti <alex@ghiti.fr>
-rw-r--r--mm/vmalloc.c108
1 files changed, 66 insertions, 42 deletions
diff --git a/mm/vmalloc.c b/mm/vmalloc.c
index f5da00821f3f..a9fce7efe4f4 100644
--- a/mm/vmalloc.c
+++ b/mm/vmalloc.c
@@ -2516,67 +2516,94 @@ static void free_unmap_vmap_area(struct vmap_area *va)
free_vmap_area_noflush(va);
}
-struct vmap_area *find_vmap_area(unsigned long addr)
+static inline int next_vmap_node_id(int i)
+{
+ return (i + nr_vmap_nodes - 1) % nr_vmap_nodes;
+}
+
+enum vmap_lock_mode {
+ VMAP_LOCK,
+ VMAP_TRYLOCK,
+};
+
+/*
+ * Search for a vmap_area at @addr across all vmap nodes. An
+ * addr_to_node_id(addr) converts an address to a node index where
+ * a VA is located. If VA spans several zones and passed addr is not
+ * the same as va->va_start, what is not common, we may need to scan
+ * extra nodes. See an example:
+ *
+ * <----va---->
+ * -|-----|-----|-----|-----|-
+ * 1 2 0 1
+ *
+ * VA resides in node 1 whereas it spans 1, 2 an 0. If passed addr
+ * is within 2 or 0 nodes we should do extra work.
+ *
+ * Returns the VA with @locked_vn->busy.lock held; the caller must
+ * release it. If @mode is VMAP_TRYLOCK, nodes that cannot be locked
+ * are skipped.
+ */
+static struct vmap_area *
+find_vmap_area_lock(unsigned long addr, struct vmap_node **locked_vn,
+ enum vmap_lock_mode mode)
{
struct vmap_node *vn;
struct vmap_area *va;
int i, j;
+ *locked_vn = NULL;
+
if (unlikely(!vmap_initialized))
return NULL;
- /*
- * An addr_to_node_id(addr) converts an address to a node index
- * where a VA is located. If VA spans several zones and passed
- * addr is not the same as va->va_start, what is not common, we
- * may need to scan extra nodes. See an example:
- *
- * <----va---->
- * -|-----|-----|-----|-----|-
- * 1 2 0 1
- *
- * VA resides in node 1 whereas it spans 1, 2 an 0. If passed
- * addr is within 2 or 0 nodes we should do extra work.
- */
i = j = addr_to_node_id(addr);
do {
vn = &vmap_nodes[i];
- spin_lock(&vn->busy.lock);
- va = __find_vmap_area(addr, &vn->busy.root);
- spin_unlock(&vn->busy.lock);
+ if (mode == VMAP_LOCK) {
+ spin_lock(&vn->busy.lock);
+ } else {
+ if (!spin_trylock(&vn->busy.lock))
+ continue;
+ }
- if (va)
+ va = __find_vmap_area(addr, &vn->busy.root);
+ if (va) {
+ *locked_vn = vn;
return va;
- } while ((i = (i + nr_vmap_nodes - 1) % nr_vmap_nodes) != j);
+ }
+
+ spin_unlock(&vn->busy.lock);
+ } while ((i = next_vmap_node_id(i)) != j);
return NULL;
}
-static struct vmap_area *find_unlink_vmap_area(unsigned long addr)
+struct vmap_area *find_vmap_area(unsigned long addr)
{
struct vmap_node *vn;
struct vmap_area *va;
- int i, j;
-
- /*
- * Check the comment in the find_vmap_area() about the loop.
- */
- i = j = addr_to_node_id(addr);
- do {
- vn = &vmap_nodes[i];
- spin_lock(&vn->busy.lock);
- va = __find_vmap_area(addr, &vn->busy.root);
- if (va)
- unlink_va(va, &vn->busy.root);
+ va = find_vmap_area_lock(addr, &vn, VMAP_LOCK);
+ if (va)
spin_unlock(&vn->busy.lock);
- if (va)
- return va;
- } while ((i = (i + nr_vmap_nodes - 1) % nr_vmap_nodes) != j);
+ return va;
+}
- return NULL;
+static struct vmap_area *find_unlink_vmap_area(unsigned long addr)
+{
+ struct vmap_node *vn;
+ struct vmap_area *va;
+
+ va = find_vmap_area_lock(addr, &vn, VMAP_LOCK);
+ if (va) {
+ unlink_va(va, &vn->busy.root);
+ spin_unlock(&vn->busy.lock);
+ }
+
+ return va;
}
/*** Per cpu kva allocator ***/
@@ -5282,14 +5309,11 @@ bool vmalloc_dump_obj(void *object)
unsigned long nr_pages;
addr = PAGE_ALIGN_DOWN((unsigned long) object);
- vn = addr_to_node(addr);
-
- if (!spin_trylock(&vn->busy.lock))
- return false;
- va = __find_vmap_area(addr, &vn->busy.root);
+ va = find_vmap_area_lock(addr, &vn, VMAP_TRYLOCK);
if (!va || !va->vm) {
- spin_unlock(&vn->busy.lock);
+ if (va)
+ spin_unlock(&vn->busy.lock);
return false;
}