lkml.org 
[lkml]   [2013]   [Sep]   [25]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    Patch in this message
    /
    From
    Subject[RFC PATCH v4 22/40] mm: Propagate the sorted-buddy bias for picking free regions, to region allocator
    Date
    The sorted-buddy page allocator keeps the buddy freelists sorted region-wise,
    and tries to pick lower numbered regions while allocating pages. The idea is
    to allocate regions in the increasing order of region number.

    Propagate the same bias to the region allocator as well. That is, make it
    favor lower numbered regions while allocating regions to the page allocator.
    To do this efficiently, add a bitmap to represent the regions in the region
    allocator, and use bitmap operations to manage these regions and to pick the
    lowest numbered free region efficiently.

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

    include/linux/mmzone.h | 1 +
    mm/page_alloc.c | 19 ++++++++++++++++++-
    2 files changed, 19 insertions(+), 1 deletion(-)

    diff --git a/include/linux/mmzone.h b/include/linux/mmzone.h
    index 7c87518..49c8926 100644
    --- a/include/linux/mmzone.h
    +++ b/include/linux/mmzone.h
    @@ -125,6 +125,7 @@ struct mem_region {
    struct region_allocator {
    struct mem_region region[MAX_NR_ZONE_REGIONS];
    int next_region;
    + DECLARE_BITMAP(ralloc_mask, MAX_NR_ZONE_REGIONS);
    };

    struct pglist_data;
    diff --git a/mm/page_alloc.c b/mm/page_alloc.c
    index ee6c098..d5acea7 100644
    --- a/mm/page_alloc.c
    +++ b/mm/page_alloc.c
    @@ -935,7 +935,7 @@ static void add_to_region_allocator(struct zone *z, struct free_list *free_list,
    struct free_area_region *reg_area;
    struct list_head *ralloc_list;
    unsigned long nr_pages;
    - int order;
    + int order, *next_region;

    if (WARN_ON(list_empty(&free_list->list)))
    return;
    @@ -952,6 +952,13 @@ static void add_to_region_allocator(struct zone *z, struct free_list *free_list,

    WARN_ON(reg_area->nr_free != 0);
    reg_area->nr_free += nr_pages;
    +
    + set_bit(region_id, reg_alloc->ralloc_mask);
    + next_region = &reg_alloc->next_region;
    +
    + if ((*next_region < 0) ||
    + (*next_region > 0 && region_id < *next_region))
    + *next_region = region_id;
    }

    /* Delete freepages from the region allocator and add them to buddy freelists */
    @@ -982,6 +989,16 @@ static int del_from_region_allocator(struct zone *zone, unsigned int order,
    reg_area->nr_free -= nr_pages;
    WARN_ON(reg_area->nr_free != 0);

    + /* Pick a new next_region */
    + clear_bit(next_region, reg_alloc->ralloc_mask);
    + next_region = find_first_bit(reg_alloc->ralloc_mask,
    + MAX_NR_ZONE_REGIONS);
    +
    + if (next_region >= MAX_NR_ZONE_REGIONS)
    + next_region = -1; /* No free regions available */
    +
    + reg_alloc->next_region = next_region;
    +
    return 0;
    }



    \
     
     \ /
      Last update: 2013-09-26 01:41    [W:2.308 / U:0.000 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site