[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-Id: <20171025152841.6746-1-courbet@google.com>
Date: Wed, 25 Oct 2017 17:28:41 +0200
From: Clement Courbet <courbet@...gle.com>
To: Arnd Bergmann <arnd@...db.de>,
Rasmus Villemoes <linux@...musvillemoes.dk>,
Andrew Morton <akpm@...ux-foundation.org>,
Matthew Wilcox <mawilcox@...rosoft.com>,
Yury Norov <ynorov@...iumnetworks.com>
Cc: Clement Courbet <courbet@...gle.com>,
Ingo Molnar <mingo@...nel.org>, linux-arch@...r.kernel.org,
linux-kernel@...r.kernel.org
Subject: Re [PATCH v2] lib: optimize cpumask_next_and()
Thanks for the comments Yury.
> But I'd like also to keep _find_next_bit() consistent with
> _find_next_bit_le()
Not sure I understand what you're suggesting here: Do you want a
find_next_and_bit_le() or do you want to make _find_next_bit_le() more
like _find_next_bit() ? In the latter case we might just want to merge
it with _find_next_bit() and end up with an extra is_le parameter :)
Powered by blists - more mailing lists