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]
Message-Id: <1F8C5EE3-4F07-4B23-9612-25FA265557C5@redhat.com>
Date:   Wed, 27 Nov 2019 20:05:52 +0100
From:   David Hildenbrand <david@...hat.com>
To:     Qian Cai <cai@....pw>
Cc:     David Hildenbrand <david@...hat.com>, linux-kernel@...r.kernel.org,
        linux-mm@...ck.org, Andrew Morton <akpm@...ux-foundation.org>,
        Michal Hocko <mhocko@...nel.org>,
        Oscar Salvador <osalvador@...e.de>
Subject: Re: [PATCH v1] mm/memory_hotplug: don't check the nid in find_(smallest|biggest)_section_pfn



> Am 27.11.2019 um 20:03 schrieb Qian Cai <cai@....pw>:
> 
> 
> 
>> On Nov 27, 2019, at 12:42 PM, David Hildenbrand <david@...hat.com> wrote:
>> 
>> Now that we always check against a zone, we can stop checking against
>> the nid, it is implicitly covered by the zone.
>> 
>> Cc: Andrew Morton <akpm@...ux-foundation.org>
>> Cc: Michal Hocko <mhocko@...nel.org>
>> Cc: Oscar Salvador <osalvador@...e.de>
>> Signed-off-by: David Hildenbrand <david@...hat.com>
>> ---
>> mm/memory_hotplug.c | 23 ++++++++---------------
>> 1 file changed, 8 insertions(+), 15 deletions(-)
>> 
>> diff --git a/mm/memory_hotplug.c b/mm/memory_hotplug.c
>> index 46b2e056a43f..602f753c662c 100644
>> --- a/mm/memory_hotplug.c
>> +++ b/mm/memory_hotplug.c
>> @@ -344,17 +344,14 @@ int __ref __add_pages(int nid, unsigned long pfn, unsigned long nr_pages,
>> }
>> 
>> /* find the smallest valid pfn in the range [start_pfn, end_pfn) */
>> -static unsigned long find_smallest_section_pfn(int nid, struct zone *zone,
>> -                     unsigned long start_pfn,
>> -                     unsigned long end_pfn)
>> +static unsigned long find_smallest_section_pfn(struct zone *zone,
>> +                           unsigned long start_pfn,
>> +                           unsigned long end_pfn)
>> {
>>   for (; start_pfn < end_pfn; start_pfn += PAGES_PER_SUBSECTION) {
>>       if (unlikely(!pfn_to_online_page(start_pfn)))
>>           continue;
>> 
>> -        if (unlikely(pfn_to_nid(start_pfn) != nid))
>> -            continue;
> 
> Are you sure? I thought this is to check against machines with odd layouts, no? 

The zone pointer is unique for every node. (in contrast to the zone index).

Thanks!

> 
>            /*
>             * Nodes's pfns can be overlapping.
>             * We know some arch can have a nodes layout such as
>             * -------------pfn-------------->
>             * N0 | N1 | N2 | N0 | N1 | N2|....
>             */
> 

Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ