Now that we have built up an infrastructure that forms a "Memory Region
Allocator", connect it with the page allocator. To entities requesting
memory, the page allocator will function as a front-end, whereas the
region allocator will act as a back-end to the page allocator.
(Analogy: page allocator is like free cash, whereas region allocator
is like a bank).
Implement the flow of freepages from the page allocator to the region
allocator. When the buddy freelists notice that they have all the freepages
forming a memory region, they give it back to the region allocator.
Simplification: We assume that the freepages of a memory region can be
completely represented by a set of MAX_ORDER-1 pages. That is, we only
need to consider the buddy freelists corresponding to MAX_ORDER-1, while
interacting with the region allocator. Furthermore, we assume that
pageblock_order == MAX_ORDER-1.
(These assumptions are used to ease the implementation, so that one can
quickly evaluate the benefits of the overall design without getting
bogged down by too many corner cases and constraints. Of course future
implementations will handle more scenarios and will have reduced dependence
on such simplifying assumptions.)
Signed-off-by: Srivatsa S. Bhat <srivatsa.bhat@xxxxxxxxxxxxxxxxxx>
---
mm/page_alloc.c | 42 +++++++++++++++++++++++++++++++++++++++++-
1 file changed, 41 insertions(+), 1 deletion(-)
diff --git a/mm/page_alloc.c b/mm/page_alloc.c
index 9be946e..b8af5a2 100644
--- a/mm/page_alloc.c
+++ b/mm/page_alloc.c
@@ -634,6 +634,37 @@ out:
return prev_region_id;
}
+
+static void add_to_region_allocator(struct zone *z, struct free_list *free_list,
+ int region_id);
+
+
+static inline int can_return_region(struct mem_region_list *region, int order)
+{
+ struct zone_mem_region *zone_region;
+
+ zone_region = region->zone_region;
+
+ if (likely(zone_region->nr_free != zone_region->present_pages))
+ return 0;
+
+ /*
+ * Don't release freepages to the region allocator if some other
+ * buddy pages can potentially merge with our freepages to form
+ * higher order pages.
+ *
+ * Hack: Don't return the region unless all the freepages are of
+ * order MAX_ORDER-1.
+ */
+ if (likely(order != MAX_ORDER-1))
+ return 0;
+
+ if (region->nr_free * (1 << order) == zone_region->nr_free)
+ return 1;
+
+ return 0;
+}
+
static void add_to_freelist(struct page *page, struct free_list *free_list,
int order)
{
@@ -650,7 +681,7 @@ static void add_to_freelist(struct page *page, struct free_list *free_list,
if (region->page_block) {
list_add_tail(lru, region->page_block);
- return;
+ goto try_return_region;
}
#ifdef CONFIG_DEBUG_PAGEALLOC
@@ -690,6 +721,15 @@ out:
/* Save pointer to page block of this region */
region->page_block = lru;
set_region_bit(region_id, free_list);
+
+try_return_region:
+
+ /*
+ * Try to return the freepages of a memory region to the region
+ * allocator, if possible.
+ */
+ if (can_return_region(region, order))
+ add_to_region_allocator(page_zone(page), free_list, region_id);
}
/*
--
To unsubscribe, send a message with 'unsubscribe linux-mm' in
the body to majordomo@xxxxxxxxx. For more info on Linux MM,
see: http://www.linux-mm.org/ .
Don't email: <a href=mailto:"dont@xxxxxxxxx";> email@xxxxxxxxx </a>