lkml.org 
[lkml]   [2012]   [Nov]   [6]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    Date
    From
    SubjectRe: [RFC PATCH 1/8] mm: Introduce memory regions data-structure to capture region boundaries within node
    On 11/06/2012 11:52 AM, Srivatsa S. Bhat wrote:
    > But of course, memory regions are sub-divisions *within* a node, so it makes
    > sense to keep the data-structures in the node's struct pglist_data. (Thus
    > this placement makes memory regions parallel to zones in that node).

    I think it's pretty silly to create *ANOTHER* subdivision of memory
    separate from sparsemem. One that doesn't handle large amounts of
    memory or scale with memory hotplug. As it stands, you can only support
    256*512MB=128GB of address space, which seems pretty puny.

    This node_regions[]:

    > @@ -687,6 +698,8 @@ typedef struct pglist_data {
    > struct zone node_zones[MAX_NR_ZONES];
    > struct zonelist node_zonelists[MAX_ZONELISTS];
    > int nr_zones;
    > + struct node_mem_region node_regions[MAX_NR_REGIONS];
    > + int nr_node_regions;
    > #ifdef CONFIG_FLAT_NODE_MEM_MAP /* means !SPARSEMEM */
    > struct page *node_mem_map;
    > #ifdef CONFIG_MEMCG

    looks like it's indexed the same way regardless of which node it is in.
    In other words, if there are two nodes, at least half of it is wasted,
    and 3/4 if there are four nodes. That seems a bit suboptimal.

    Could you remind us of the logic for leaving sparsemem out of the
    equation here?



    \
     
     \ /
      Last update: 2012-11-07 01:01    [W:4.907 / U:0.424 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site