]> bbs.cooldavid.org Git - net-next-2.6.git/commit
git://bbs.cooldavid.org / net-next-2.6.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 1cb3d8e) | patch
alpha: simplify and optimize sched_find_first_bit
authorMatt Turner <mattst88@gmail.com>
Thu, 29 Apr 2010 02:49:36 +0000 (22:49 -0400)
committerMatt Turner <mattst88@monolith.freenet-rz.de>
Tue, 25 May 2010 22:40:28 +0000 (00:40 +0200)
commita75f5f0f0a3676216e0015b3040c785dbfe1e0da
treec6cd7600562dd0d374e4d41a1d558ce96ef6c7e2tree | snapshot (tar.bz2 tar.gz zip)
parent1cb3d8e2c8d30d2cbfe42b696d501d0a016edec1commit | diff
alpha: simplify and optimize sched_find_first_bit

Search only the first 100 bits instead of 140, saving a couple
instructions. The resulting code is about 1/3 faster (40K ticks/1000
iterations down to 30K ticks/1000 iterations).

Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Ingo Molnar <mingo@elte.hu>
Cc: Ivan Kokshaysky <ink@jurassic.park.msu.ru>
Cc: linux-alpha@vger.kernel.org
Acked-by: Richard Henderson <rth@twiddle.net>
Signed-off-by: Matt Turner <mattst88@gmail.com>
arch/alpha/include/asm/bitops.h diff | blob | blame | history
Clone of davem's net-next-2.6 tree