lkml.org 
[lkml]   [2013]   [Aug]   [30]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
Patch in this message
/
From
Subject[RFC PATCH v3 35/35] mm: Use a cache between page-allocator and region-allocator
Date
Currently, whenever the page allocator notices that it has all the freepages
of a given memory region, it attempts to return it back to the region
allocator. This strategy is needlessly aggressive and can cause a lot of back
and forth between the page-allocator and the region-allocator.

More importantly, it can potentially completely wreck the benefits of having
a region allocator in the first place - if the buddy allocator immediately
returns freepages of memory regions to the region allocator, it goes back to
the generic pool of pages. So, in future, depending on when the next allocation
request arrives for this particular migratetype, the region allocator might not
have any free regions to hand out, and hence we might end up falling back
to freepages of other migratetypes. Instead, if the page allocator retains
a few regions as a cache for every migratetype, we will have higher chances
of avoiding fallbacks to other migratetypes.

So, don't return all free memory regions (in the page allocator) to the
region allocator. Keep atleast one region as a cache, for future use.

Signed-off-by: Srivatsa S. Bhat <srivatsa.bhat@linux.vnet.ibm.com>
---

mm/page_alloc.c | 16 ++++++++++++++--
1 file changed, 14 insertions(+), 2 deletions(-)

diff --git a/mm/page_alloc.c b/mm/page_alloc.c
index 1312546..55e8e65 100644
--- a/mm/page_alloc.c
+++ b/mm/page_alloc.c
@@ -639,9 +639,11 @@ 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)
+static inline int can_return_region(struct mem_region_list *region, int order,
+ struct free_list *free_list)
{
struct zone_mem_region *zone_region;
+ struct page *prev_page, *next_page;

zone_region = region->zone_region;

@@ -659,6 +661,16 @@ static inline int can_return_region(struct mem_region_list *region, int order)
if (likely(order != MAX_ORDER-1))
return 0;

+ /*
+ * Don't return all the regions; retain atleast one region as a
+ * cache for future use.
+ */
+ prev_page = container_of(free_list->list.prev , struct page, lru);
+ next_page = container_of(free_list->list.next , struct page, lru);
+
+ if (page_zone_region_id(prev_page) == page_zone_region_id(next_page))
+ return 0; /* There is only one region in this freelist */
+
if (region->nr_free * (1 << order) == zone_region->nr_free)
return 1;

@@ -728,7 +740,7 @@ try_return_region:
* Try to return the freepages of a memory region to the region
* allocator, if possible.
*/
- if (can_return_region(region, order))
+ if (can_return_region(region, order, free_list))
add_to_region_allocator(page_zone(page), free_list, region_id);
}



\
 
 \ /
  Last update: 2013-08-30 17:21    [W:0.496 / U:0.080 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site