mm-compaction-optimize-0-order-folio-compaction-with-free-page-split.patch removed from -mm tree
The quilt patch titled
Subject: mm/compaction: optimize >0 order folio compaction with free page split.
has been removed from the -mm tree. Its filename was
mm-compaction-optimize-0-order-folio-compaction-with-free-page-split.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: Zi Yan <[email protected]>
Subject: mm/compaction: optimize >0 order folio compaction with free page split.
Date: Tue, 20 Feb 2024 13:32:20 -0500
During migration in a memory compaction, free pages are placed in an array of page lists based on their order. But the desired free page order (i.e., the order of a source page) might not be always present, thus leading to migration failures and premature compaction termination. Split a high order free pages when source migration page has a lower order to increase migration successful rate.
Note: merging free pages when a migration fails and a lower order free page is returned via compaction_free() is possible, but there is too much work. Since the free pages are not buddy pages, it is hard to identify these free pages using existing PFN-based page merging algorithm.
---
mm/compaction.c | 35 ++++++++++++++++++++++++++++++----- 1 file changed, 30 insertions(+), 5 deletions(-)
mm/compaction.c renamed from mm/compaction.c~mm-compaction-optimize-0-order-folio-compaction-with-free-page-split +30 -5
@@ -1856,15 +1856,40 @@ static struct folio *compaction_alloc(ststruct compact_control *cc = (struct compact_control *)data;struct folio *dst;int order =folio_order (src); +bool has_isolated_pages = false; +int start_order; +struct page *freepage; +unsigned long size; -if (list_empty (&cc->freepages[order])) { -isolate_freepages (cc); -if (list_empty (&cc->freepages[order])) +again: +for (start_order = order; start_order <NR_PAGE_ORDERS ; start_order++) +if (!list_empty (&cc->freepages[start_order])) +break ; + +/* no free pages in the list */ +if (start_order ==NR_PAGE_ORDERS ) { +if (has_isolated_pages)return NULL ; +isolate_freepages (cc); + has_isolated_pages = true; + goto again; + } + + freepage = list_first_entry(&cc->freepages[start_order], struct page, + lru); + size =1 << start_order; + +list_del (&freepage->lru); + +while (start_order > order) { + start_order--; + size >>=1 ; + +list_add (&freepage[size].lru, &cc->freepages[start_order]); +set_page_private (&freepage[size], start_order); } + dst = (struct folio *)freepage; - dst = list_first_entry(&cc->freepages[order], struct folio, lru); -list_del (&dst->lru);post_alloc_hook (&dst->page, order, __GFP_MOVABLE);if (order)prep_compound_page (&dst->page, order);
_
Patches currently in -mm which might be from [email protected] are