linux-kernel - Re: [RFC PATCH] mm: migrate: Add new node demotion strategy

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Date:   Sun, 7 Nov 2021 07:20:38 -0800
From:   Dave Hansen <dave.hansen@...el.com>
To:     Baolin Wang <baolin.wang@...ux.alibaba.com>,
        "Huang, Ying" <ying.huang@...el.com>
Cc:     akpm@...ux-foundation.org, dave.hansen@...ux.intel.com,
        ziy@...dia.com, osalvador@...e.de, shy828301@...il.com,
        linux-mm@...ck.org, linux-kernel@...r.kernel.org
Subject: Re: [RFC PATCH] mm: migrate: Add new node demotion strategy

On 11/7/21 1:33 AM, Baolin Wang wrote:
> Thanks for your suggestion. After some thinking, can we change the
> node_demotion[] structure like below? Which means one source node can be
> demoted to mutiple target node, and we can set up the target node mask
> according to the node distance. How do you think? Thanks.
> 
> static nodemask_t node_demotion[MAX_NUMNODES] __read_mostly =
>         {[0 ...  MAX_NUMNODES - 1] = NODE_MASK_NONE};

How large is that in the worst case?