]> git.baikalelectronics.ru Git - kernel.git/commit
projects / kernel.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: cc054d0) | patch
[PATCH] md: use ffz instead of find_first_set to convert multiplier to shift
authorPaul Clements <paul.clements@steeleye.com>
Tue, 3 Oct 2006 08:16:01 +0000 (01:16 -0700)
committerLinus Torvalds <torvalds@g5.osdl.org>
Tue, 3 Oct 2006 15:04:18 +0000 (08:04 -0700)
commit5cfa9750ec10c8d219368c3ab142b2ae2c5eda76
tree73c1c2135a117290308b5807b6ede21389e3264ctree | snapshot
parentcc054d05d09dd2acc10cdf47c808de21dce0e3a3commit | diff
[PATCH] md: use ffz instead of find_first_set to convert multiplier to shift

find_first_set doesn't find the least-significant bit on bigendian machines,
so it is really wrong to use it.

ffs is closer, but takes an 'int' and we have a 'unsigned long'.  So use
ffz(~X) to convert a chunksize into a chunkshift.

Signed-off-by: Neil Brown <neilb@suse.de>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
drivers/md/bitmap.c diff | blob | history
Linux Kernel Source Tree.