From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mail-pl0-f70.google.com (mail-pl0-f70.google.com [209.85.160.70]) by kanga.kvack.org (Postfix) with ESMTP id 6E8296B0009 for ; Thu, 5 Apr 2018 08:51:07 -0400 (EDT) Received: by mail-pl0-f70.google.com with SMTP id o2-v6so16516848plk.14 for ; Thu, 05 Apr 2018 05:51:07 -0700 (PDT) Received: from bombadil.infradead.org (bombadil.infradead.org. [198.137.202.133]) by mx.google.com with ESMTPS id k185si979400pgk.2.2018.04.05.05.51.06 for (version=TLS1_2 cipher=ECDHE-RSA-CHACHA20-POLY1305 bits=256/256); Thu, 05 Apr 2018 05:51:06 -0700 (PDT) Date: Thu, 5 Apr 2018 05:50:54 -0700 From: Matthew Wilcox Subject: Re: [PATCH v7 2/5] arm: arm64: page_alloc: reduce unnecessary binary search in memblock_next_valid_pfn() Message-ID: <20180405125054.GC2647@bombadil.infradead.org> References: <1522915478-5044-1-git-send-email-hejianet@gmail.com> <1522915478-5044-3-git-send-email-hejianet@gmail.com> <20180405113444.GB2647@bombadil.infradead.org> <1f809296-e88d-1090-0027-890782b91d6e@gmail.com> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <1f809296-e88d-1090-0027-890782b91d6e@gmail.com> Sender: owner-linux-mm@kvack.org List-ID: To: Jia He Cc: Russell King , Catalin Marinas , Will Deacon , Mark Rutland , Ard Biesheuvel , Andrew Morton , Michal Hocko , Wei Yang , Kees Cook , Laura Abbott , Vladimir Murzin , Philip Derrin , AKASHI Takahiro , James Morse , Steve Capper , Pavel Tatashin , Gioh Kim , Vlastimil Babka , Mel Gorman , Johannes Weiner , Kemi Wang , Petr Tesarik , YASUAKI ISHIMATSU , Andrey Ryabinin , Nikolay Borisov , Daniel Jordan , Daniel Vacek , Eugeniu Rosca , linux-arm-kernel@lists.infradead.org, linux-kernel@vger.kernel.org, linux-mm@kvack.org, Jia He On Thu, Apr 05, 2018 at 08:44:12PM +0800, Jia He wrote: > > > On 4/5/2018 7:34 PM, Matthew Wilcox Wrote: > > On Thu, Apr 05, 2018 at 01:04:35AM -0700, Jia He wrote: > > > Commit b92df1de5d28 ("mm: page_alloc: skip over regions of invalid pfns > > > where possible") optimized the loop in memmap_init_zone(). But there is > > > still some room for improvement. E.g. if pfn and pfn+1 are in the same > > > memblock region, we can simply pfn++ instead of doing the binary search > > > in memblock_next_valid_pfn. > > Sure, but I bet if we are >end_pfn, we're almost certainly going to the > > start_pfn of the next block, so why not test that as well? > > > > > + /* fast path, return pfn+1 if next pfn is in the same region */ > > > + if (early_region_idx != -1) { > > > + start_pfn = PFN_DOWN(regions[early_region_idx].base); > > > + end_pfn = PFN_DOWN(regions[early_region_idx].base + > > > + regions[early_region_idx].size); > > > + > > > + if (pfn >= start_pfn && pfn < end_pfn) > > > + return pfn; > > early_region_idx++; > > start_pfn = PFN_DOWN(regions[early_region_idx].base); > > if (pfn >= end_pfn && pfn <= start_pfn) > > return start_pfn; > Thanks, thus the binary search in next step can be discarded? I don't know all the circumstances in which this is called. Maybe a linear search with memo is more appropriate than a binary search.