[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20180529175927.iyea653hpgnow6p2@linux-n805>
Date: Tue, 29 May 2018 10:59:27 -0700
From: Davidlohr Bueso <dave@...olabs.net>
To: Herbert Xu <herbert@...dor.apana.org.au>
Cc: akpm@...ux-foundation.org, torvalds@...ux-foundation.org,
tgraf@...g.ch, manfred@...orfullife.com,
guillaume.knispel@...ersonicimagine.com, linux-api@...r.kernel.org,
linux-kernel@...r.kernel.org, Davidlohr Bueso <dbueso@...e.de>
Subject: Re: [PATCH 2/6] lib/rhashtable: guarantee initial hashtable
allocation
On Wed, 30 May 2018, Herbert Xu wrote:
>It doesn't explain it at all. In fact I don't see why we neeed
>three attempts, just do the GFP_NOFAIL as the second and final step.
Second attempt is reduced size only as we don't want to GFP_NOFAIL
if we can avoid it helping the allocator. We go from an arbitrary
allocation to the smallest possible allocation, if all that fails
ok lets use GFP_NOFAIL. I don't know how this is not clear...
Thanks,
Davidlohr
Powered by blists - more mailing lists