* [PATCH v3 0/2] kho: support preserving high-order non-compound pages
@ 2026-07-23 20:42 Pranjal Shrivastava
2026-07-23 20:42 ` [PATCH v3 1/2] kho: Introduce a helper to init high order pages Pranjal Shrivastava
2026-07-23 20:42 ` [PATCH v3 2/2] kho: Introduce preserve/restore APIs for high-order pages Pranjal Shrivastava
0 siblings, 2 replies; 5+ messages in thread
From: Pranjal Shrivastava @ 2026-07-23 20:42 UTC (permalink / raw)
To: Mike Rapoport, Pasha Tatashin, Pratyush Yadav
Cc: Alexander Graf, Samiullah Khawaja, David Matlack, kexec, linux-mm,
linux-kernel, Pranjal Shrivastava
Introduction
============
This series is required for the ongoing effort to preserve DMA allocations
across KHO [1]. It addresses a fundamental mismatch between the current KHO
restoration logic and the physical reality of high-order buddy allocations.
The Problem
===========
The current KHO restore implementation treats all multi-page blocks as
split pages during restoration. Specifically, kho_restore_pages()
initializes every 4KB sub-page with a refcount of 1.
However, many kernel subsystems, most notably the DMA allocator (via
dma_alloc_coherent), frequently return high-order non-compound pages.
In this state, only the head page carries a refcount of 1, while
all tail pages have a refcount of 0.
Consequently, when these contiguous blocks are restored by KHO in
the new kernel, the forced reference count of 1 on tail pages causes some
trouble with the buddy allocator. Downstream of the eventual free path,
__free_pages_prepare() [2] ends up calling page_expected_state() [3]
when is_check_pages_enabled() returns true (triggered when CONFIG_DEBUG_VM
is enabled or debug_pagealloc=on).
This detects the unexpected non-zero reference counts on tail pages [4] and
incorrectly taints the kernel while leaking the physical pages in question.
Proposed Solution
=================
Following feedback on the v1 RFC, this series moves away from auto type
detection and instead introduces explicit preserve / restore APIs for
high-order pages.
Callers now explicitly preserve these high-order blocks as a single unit by using
kho_preserve_page() and kho_restore_page(). These functions apply a refcount
of 1 to the head page while leaving tail pages at 0.
The existing APIs (kho_preserve_pages / kho_restore_pages) remain as is
for ranges of independent 4KB pages, continuing to use the split refcount.
The internal initialization logic is refactored to provide a helper:
kho_init_high_order_page(), which is shared between folios and high-order page
restore APIs. We also consolidate the common metadata validation and state
clearing into __kho_restore_page() to avoid duplication.
[v3]
- Renamed "unsplit" terminology to "high-order".
- Consolidated the common restoration code (magic checks, private
clearing etc.) into the internal __kho_restore_page() helper.
[v2]
- https://lore.kernel.org/all/20260713204935.3069000-1-praan@google.com/
- Dropped automatic type detection via higher bits in Radix key.
- Introduced explicit kho_preserve_page and kho_restore_page helpers.
- Refactored internal init logic to share code between folios & high-order pages.
[v1] https://lore.kernel.org/all/20260703020832.1731864-1-praan@google.com/
Thanks,
Praan
[1] https://lore.kernel.org/all/20260708234854.4044652-1-skhawaja@google.com/
[2] https://elixir.bootlin.com/linux/v7.1.1/source/mm/page_alloc.c#L1370
[3] https://elixir.bootlin.com/linux/v7.1.1/source/mm/page_alloc.c#L1027
[4] https://elixir.bootlin.com/linux/v7.1.1/source/mm/page_alloc.c#L1034
Pranjal Shrivastava (2):
kho: Introduce a helper to init high order pages
kho: Introduce preserve/restore APIs for high-order pages
include/linux/kexec_handover.h | 10 +++
kernel/liveupdate/kexec_handover.c | 130 ++++++++++++++++++++++++-----
2 files changed, 117 insertions(+), 23 deletions(-)
--
2.55.0.229.g6434b31f56-goog
^ permalink raw reply [flat|nested] 5+ messages in thread
* [PATCH v3 1/2] kho: Introduce a helper to init high order pages
2026-07-23 20:42 [PATCH v3 0/2] kho: support preserving high-order non-compound pages Pranjal Shrivastava
@ 2026-07-23 20:42 ` Pranjal Shrivastava
2026-07-23 20:42 ` [PATCH v3 2/2] kho: Introduce preserve/restore APIs for high-order pages Pranjal Shrivastava
1 sibling, 0 replies; 5+ messages in thread
From: Pranjal Shrivastava @ 2026-07-23 20:42 UTC (permalink / raw)
To: Mike Rapoport, Pasha Tatashin, Pratyush Yadav
Cc: Alexander Graf, Samiullah Khawaja, David Matlack, kexec, linux-mm,
linux-kernel, Pranjal Shrivastava
The current KHO restoration logic assumes all multi-page blocks are
split into independent 4KB pages. Break out a helper to prepare for
supporting high-order non-compound pages.
Extract kho_init_high_order_page() to handle the refcount pattern
where only the head page is refcounted. Use the helper for folio
restoration that requires a similar refcount logic.
Reviewed-by: Samiullah Khawaja <skhawaja@google.com>
Signed-off-by: Pranjal Shrivastava <praan@google.com>
---
kernel/liveupdate/kexec_handover.c | 29 +++++++++++++++++++----------
1 file changed, 19 insertions(+), 10 deletions(-)
diff --git a/kernel/liveupdate/kexec_handover.c b/kernel/liveupdate/kexec_handover.c
index 4834a809985a..e836efd98795 100644
--- a/kernel/liveupdate/kexec_handover.c
+++ b/kernel/liveupdate/kexec_handover.c
@@ -357,6 +357,24 @@ int kho_radix_walk_tree(struct kho_radix_tree *tree,
}
EXPORT_SYMBOL_GPL(kho_radix_walk_tree);
+/* For physically contiguous pages. */
+static void kho_init_high_order_page(struct page *page, unsigned int order)
+{
+ unsigned long nr_pages = (1UL << order);
+
+ /* Head page gets refcount of 1. */
+ set_page_count(page, 1);
+ /* Clear head page's codetag to avoid accounting mismatch. */
+ clear_page_tag_ref(page);
+
+ /* For high-order blocks, tail pages get a page count of zero. */
+ for (unsigned long i = 1; i < nr_pages; i++) {
+ set_page_count(page + i, 0);
+ /* Clear each page's codetag to avoid accounting mismatch. */
+ clear_page_tag_ref(page + i);
+ }
+}
+
/* For physically contiguous 0-order pages. */
static void kho_init_pages(struct page *page, unsigned long nr_pages)
{
@@ -369,16 +387,7 @@ static void kho_init_pages(struct page *page, unsigned long nr_pages)
static void kho_init_folio(struct page *page, unsigned int order)
{
- unsigned long nr_pages = (1 << order);
-
- /* Head page gets refcount of 1. */
- set_page_count(page, 1);
- /* Clear head page's codetag to avoid accounting mismatch. */
- clear_page_tag_ref(page);
-
- /* For higher order folios, tail pages get a page count of zero. */
- for (unsigned long i = 1; i < nr_pages; i++)
- set_page_count(page + i, 0);
+ kho_init_high_order_page(page, order);
if (order > 0)
prep_compound_page(page, order);
--
2.55.0.229.g6434b31f56-goog
^ permalink raw reply related [flat|nested] 5+ messages in thread
* [PATCH v3 2/2] kho: Introduce preserve/restore APIs for high-order pages
2026-07-23 20:42 [PATCH v3 0/2] kho: support preserving high-order non-compound pages Pranjal Shrivastava
2026-07-23 20:42 ` [PATCH v3 1/2] kho: Introduce a helper to init high order pages Pranjal Shrivastava
@ 2026-07-23 20:42 ` Pranjal Shrivastava
2026-07-30 7:26 ` Mike Rapoport
1 sibling, 1 reply; 5+ messages in thread
From: Pranjal Shrivastava @ 2026-07-23 20:42 UTC (permalink / raw)
To: Mike Rapoport, Pasha Tatashin, Pratyush Yadav
Cc: Alexander Graf, Samiullah Khawaja, David Matlack, kexec, linux-mm,
linux-kernel, Pranjal Shrivastava
The current KHO page preservation APIs (e.g. kho_preserve_pages) assume
that multi-page blocks are split into independent 4KB pages during
restoration. This is incompatible with high-order non-compound pages,
such as DMA buffers, which must be restored with tail pages having a
zero reference count.
Introduce explicit preserve and restore APIs for high-order pages,
which preserve and restore a high-order page block as a single unit,
applying a refcount of 1 to the head page while leaving tail pages at 0.
Rename the existing internal helper to __kho_restore_page() and
consolidate the common restoration code into it.
Signed-off-by: Pranjal Shrivastava <praan@google.com>
---
include/linux/kexec_handover.h | 10 +++
kernel/liveupdate/kexec_handover.c | 101 +++++++++++++++++++++++++----
2 files changed, 98 insertions(+), 13 deletions(-)
diff --git a/include/linux/kexec_handover.h b/include/linux/kexec_handover.h
index 8968c56d2d73..6e2c75b16209 100644
--- a/include/linux/kexec_handover.h
+++ b/include/linux/kexec_handover.h
@@ -22,6 +22,8 @@ bool is_kho_boot(void);
int kho_preserve_folio(struct folio *folio);
void kho_unpreserve_folio(struct folio *folio);
+int kho_preserve_page(struct page *page, unsigned int order);
+void kho_unpreserve_page(struct page *page, unsigned int order);
int kho_preserve_pages(struct page *page, unsigned long nr_pages);
void kho_unpreserve_pages(struct page *page, unsigned long nr_pages);
int kho_preserve_vmalloc(void *ptr, struct kho_vmalloc *preservation);
@@ -30,6 +32,7 @@ void *kho_alloc_preserve(size_t size);
void kho_unpreserve_free(void *mem);
void kho_restore_free(void *mem);
struct folio *kho_restore_folio(phys_addr_t phys);
+struct page *kho_restore_page(phys_addr_t phys);
struct page *kho_restore_pages(phys_addr_t phys, unsigned long nr_pages);
void *kho_restore_vmalloc(const struct kho_vmalloc *preservation);
int kho_add_subtree(const char *name, void *blob, size_t size);
@@ -65,6 +68,13 @@ static inline int kho_preserve_pages(struct page *page, unsigned int nr_pages)
static inline void kho_unpreserve_pages(struct page *page, unsigned int nr_pages) { }
+static inline int kho_preserve_page(struct page *page, unsigned int order)
+{
+ return -EOPNOTSUPP;
+}
+
+static inline void kho_unpreserve_page(struct page *page, unsigned int order) { }
+
static inline int kho_preserve_vmalloc(void *ptr,
struct kho_vmalloc *preservation)
{
diff --git a/kernel/liveupdate/kexec_handover.c b/kernel/liveupdate/kexec_handover.c
index e836efd98795..abe1a800fb27 100644
--- a/kernel/liveupdate/kexec_handover.c
+++ b/kernel/liveupdate/kexec_handover.c
@@ -393,10 +393,9 @@ static void kho_init_folio(struct page *page, unsigned int order)
prep_compound_page(page, order);
}
-static struct page *kho_restore_page(phys_addr_t phys, bool is_folio)
+static struct page *__kho_restore_page(phys_addr_t phys, unsigned int *order)
{
struct page *page = pfn_to_online_page(PHYS_PFN(phys));
- unsigned long nr_pages;
union kho_page_info info;
if (!page)
@@ -410,17 +409,12 @@ static struct page *kho_restore_page(phys_addr_t phys, bool is_folio)
*/
if (WARN_ON_ONCE(info.magic != KHO_PAGE_MAGIC))
return NULL;
- nr_pages = (1 << info.order);
/* Clear private to make sure later restores on this page error out. */
page->private = 0;
+ if (order)
+ *order = info.order;
- if (is_folio)
- kho_init_folio(page, info.order);
- else
- kho_init_pages(page, nr_pages);
-
- adjust_managed_page_count(page, nr_pages);
return page;
}
@@ -432,12 +426,43 @@ static struct page *kho_restore_page(phys_addr_t phys, bool is_folio)
*/
struct folio *kho_restore_folio(phys_addr_t phys)
{
- struct page *page = kho_restore_page(phys, true);
+ unsigned int order;
+ struct page *page = __kho_restore_page(phys, &order);
+
+ if (!page)
+ return NULL;
+
+ kho_init_folio(page, order);
+ adjust_managed_page_count(page, 1UL << order);
- return page ? page_folio(page) : NULL;
+ return page_folio(page);
}
EXPORT_SYMBOL_GPL(kho_restore_folio);
+/**
+ * kho_restore_page - restore a high-order page block.
+ * @phys: physical address of the first page.
+ *
+ * Restore a high-order page block that was preserved with
+ * kho_preserve_page().
+ *
+ * Return: the head page on success, NULL on failure.
+ */
+struct page *kho_restore_page(phys_addr_t phys)
+{
+ unsigned int order;
+ struct page *page = __kho_restore_page(phys, &order);
+
+ if (!page)
+ return NULL;
+
+ kho_init_high_order_page(page, order);
+ adjust_managed_page_count(page, 1UL << order);
+
+ return page;
+}
+EXPORT_SYMBOL_GPL(kho_restore_page);
+
/**
* kho_restore_pages - restore list of contiguous order 0 pages.
* @phys: physical address of the first page.
@@ -457,10 +482,14 @@ struct page *kho_restore_pages(phys_addr_t phys, unsigned long nr_pages)
while (pfn < end_pfn) {
const unsigned int order =
min(count_trailing_zeros(pfn), ilog2(end_pfn - pfn));
- struct page *page = kho_restore_page(PFN_PHYS(pfn), false);
+ unsigned int info_order;
+ struct page *page = __kho_restore_page(PFN_PHYS(pfn), &info_order);
if (!page)
return NULL;
+
+ kho_init_pages(page, 1UL << info_order);
+ adjust_managed_page_count(page, 1UL << info_order);
pfn += 1 << order;
}
@@ -890,6 +919,51 @@ void kho_unpreserve_folio(struct folio *folio)
}
EXPORT_SYMBOL_GPL(kho_unpreserve_folio);
+/**
+ * kho_preserve_page - preserve a high-order page block.
+ * @page: head page of the block.
+ * @order: order of the allocation.
+ *
+ * Instructs KHO to preserve a high-order contiguous allocation (like a DMA
+ * buffer) as a single unit. It must be restored using kho_restore_page() to
+ * ensure the tail pages are correctly initialized with a zero refcount.
+ *
+ * If a driver needs to split a block that has been preserved with this
+ * function, it must first unpreserve the block using kho_unpreserve_page(),
+ * perform the split, and then re-preserve the individual pages using
+ * kho_preserve_pages().
+ *
+ * Return: 0 on success, error code on failure
+ */
+int kho_preserve_page(struct page *page, unsigned int order)
+{
+ struct kho_radix_tree *tree = &kho_out.radix_tree;
+ const unsigned long pfn = page_to_pfn(page);
+
+ if (WARN_ON(kho_scratch_overlap(pfn << PAGE_SHIFT, PAGE_SIZE << order)))
+ return -EINVAL;
+
+ return kho_radix_add_page(tree, pfn, order);
+}
+EXPORT_SYMBOL_GPL(kho_preserve_page);
+
+/**
+ * kho_unpreserve_page - unpreserve a high-order page block.
+ * @page: head page of the block.
+ * @order: order of the allocation.
+ *
+ * Instructs KHO to unpreserve a high-order block that was preserved by
+ * kho_preserve_page() before.
+ */
+void kho_unpreserve_page(struct page *page, unsigned int order)
+{
+ struct kho_radix_tree *tree = &kho_out.radix_tree;
+ const unsigned long pfn = page_to_pfn(page);
+
+ kho_radix_del_page(tree, pfn, order);
+}
+EXPORT_SYMBOL_GPL(kho_unpreserve_page);
+
static unsigned int __kho_preserve_pages_order(unsigned long start_pfn,
unsigned long end_pfn)
{
@@ -927,7 +1001,8 @@ static void __kho_unpreserve(struct kho_radix_tree *tree,
* @nr_pages: number of pages.
*
* Preserve a contiguous list of order 0 pages. Must be restored using
- * kho_restore_pages() to ensure the pages are restored properly as order 0.
+ * kho_restore_pages() to ensure the pages are restored properly as order 0
+ * with each page having a reference count of 1 (split).
*
* Return: 0 on success, error code on failure
*/
--
2.55.0.229.g6434b31f56-goog
^ permalink raw reply related [flat|nested] 5+ messages in thread
* Re: [PATCH v3 2/2] kho: Introduce preserve/restore APIs for high-order pages
2026-07-23 20:42 ` [PATCH v3 2/2] kho: Introduce preserve/restore APIs for high-order pages Pranjal Shrivastava
@ 2026-07-30 7:26 ` Mike Rapoport
2026-07-30 12:05 ` Pranjal Shrivastava
0 siblings, 1 reply; 5+ messages in thread
From: Mike Rapoport @ 2026-07-30 7:26 UTC (permalink / raw)
To: Pranjal Shrivastava
Cc: Mike Rapoport, Pasha Tatashin, Pratyush Yadav, Alexander Graf,
Samiullah Khawaja, David Matlack, kexec, linux-mm, linux-kernel
Hi Pranjal,
> The current KHO page preservation APIs (e.g. kho_preserve_pages) assume
> that multi-page blocks are split into independent 4KB pages during
> restoration. This is incompatible with high-order non-compound pages,
> such as DMA buffers, which must be restored with tail pages having a
> zero reference count.
>
> Introduce explicit preserve and restore APIs for high-order pages,
> which preserve and restore a high-order page block as a single unit,
> applying a refcount of 1 to the head page while leaving tail pages at 0.
> Rename the existing internal helper to __kho_restore_page() and
> consolidate the common restoration code into it.
>
> Signed-off-by: Pranjal Shrivastava <praan@google.com>
>
> @@ -457,10 +482,14 @@ struct page *kho_restore_pages(phys_addr_t phys, unsigned long nr_pages)
> while (pfn < end_pfn) {
> const unsigned int order =
> min(count_trailing_zeros(pfn), ilog2(end_pfn - pfn));
> - struct page *page = kho_restore_page(PFN_PHYS(pfn), false);
> + unsigned int info_order;
> + struct page *page = __kho_restore_page(PFN_PHYS(pfn), &info_order);
>
> if (!page)
> return NULL;
> +
> + kho_init_pages(page, 1UL << info_order);
> + adjust_managed_page_count(page, 1UL << info_order);
Seeing
+ adjust_managed_page_count(page, 1UL << info_order);
for the third time hinted that something is off ;-)
--
Sincerely yours,
Mike.
^ permalink raw reply [flat|nested] 5+ messages in thread
* Re: [PATCH v3 2/2] kho: Introduce preserve/restore APIs for high-order pages
2026-07-30 7:26 ` Mike Rapoport
@ 2026-07-30 12:05 ` Pranjal Shrivastava
0 siblings, 0 replies; 5+ messages in thread
From: Pranjal Shrivastava @ 2026-07-30 12:05 UTC (permalink / raw)
To: Mike Rapoport
Cc: Pasha Tatashin, Pratyush Yadav, Alexander Graf, Samiullah Khawaja,
David Matlack, kexec, linux-mm, linux-kernel
On Thu, Jul 30, 2026 at 10:26:41AM +0300, Mike Rapoport wrote:
> Hi Pranjal,
>
> > The current KHO page preservation APIs (e.g. kho_preserve_pages) assume
> > that multi-page blocks are split into independent 4KB pages during
> > restoration. This is incompatible with high-order non-compound pages,
> > such as DMA buffers, which must be restored with tail pages having a
> > zero reference count.
> >
> > Introduce explicit preserve and restore APIs for high-order pages,
> > which preserve and restore a high-order page block as a single unit,
> > applying a refcount of 1 to the head page while leaving tail pages at 0.
> > Rename the existing internal helper to __kho_restore_page() and
> > consolidate the common restoration code into it.
> >
> > Signed-off-by: Pranjal Shrivastava <praan@google.com>
> >
> > @@ -457,10 +482,14 @@ struct page *kho_restore_pages(phys_addr_t phys, unsigned long nr_pages)
> > while (pfn < end_pfn) {
> > const unsigned int order =
> > min(count_trailing_zeros(pfn), ilog2(end_pfn - pfn));
> > - struct page *page = kho_restore_page(PFN_PHYS(pfn), false);
> > + unsigned int info_order;
> > + struct page *page = __kho_restore_page(PFN_PHYS(pfn), &info_order);
> >
> > if (!page)
> > return NULL;
> > +
> > + kho_init_pages(page, 1UL << info_order);
> > + adjust_managed_page_count(page, 1UL << info_order);
>
> Seeing
>
> + adjust_managed_page_count(page, 1UL << info_order);
>
> for the third time hinted that something is off ;-)
>
Ack. I'll fold it into the __kho_restore_page() helper
Thanks,
Praan
^ permalink raw reply [flat|nested] 5+ messages in thread
end of thread, other threads:[~2026-07-30 12:05 UTC | newest]
Thread overview: 5+ messages (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
2026-07-23 20:42 [PATCH v3 0/2] kho: support preserving high-order non-compound pages Pranjal Shrivastava
2026-07-23 20:42 ` [PATCH v3 1/2] kho: Introduce a helper to init high order pages Pranjal Shrivastava
2026-07-23 20:42 ` [PATCH v3 2/2] kho: Introduce preserve/restore APIs for high-order pages Pranjal Shrivastava
2026-07-30 7:26 ` Mike Rapoport
2026-07-30 12:05 ` Pranjal Shrivastava
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).