[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <3B456200-E7A1-454E-A70B-92B4A72743C4@redhat.com>
Date: Fri, 1 Nov 2019 23:47:49 +0100
From: David Hildenbrand <david@...hat.com>
To: Rick Lindsley <ricklind@...ux.vnet.ibm.com>
Cc: Scott Cheloha <cheloha@...ux.vnet.ibm.com>,
linux-kernel@...r.kernel.org,
"Rafael J. Wysocki" <rafael@...nel.org>,
Greg Kroah-Hartman <gregkh@...uxfoundation.org>,
nathanl@...ux.ibm.com
Subject: Re: [PATCH] drivers/base/memory.c: memory subsys init: skip search for missing blocks
> Am 01.11.2019 um 23:32 schrieb Rick Lindsley <ricklind@...ux.vnet.ibm.com>:
>
> On 11/1/19 12:00 PM, David Hildenbrand wrote:
>> No, I don't really like that. Can we please speed up the lookup via a radix tree as noted in the comment of "find_memory_block()".
>
> I agree with the general sentiment that a redesign is the correct long term action - it has been for some time now - but implementing a new storage and retrieval method and verifying that it introduces no new problems itself is non-trivial. There's a reason it remains a comment.
>
> I don't see any issues with the patch itself. Do we really want to forego the short term, low-hanging, low risk fruit in favor of waiting indefinitely for that well-tested long-term solution?
The low hanging fruit for me is to convert it to a simple VM_BUG_ON(). As I said, this should never really happen with current code.
Also, I don‘t think adding a radix tree here is rocket science and takes indefinitely ;) feel free to prove me wrong.
>
> Rick
Powered by blists - more mailing lists