On Thu, Apr 10, 2008 at 01:48:55PM +0200, Andreas Schwab wrote:
"Aneesh Kumar K.V" <aneesh.kumar@xxxxxxxxxxxxxxxxxx> writes:
But m68k doesn't want to use the GENERIC_FIND_NEXT_BIT. Can I request
somebody knowledgeable about m68k to give a try in implementing
generic_find_next_le_bit equivalent on m68k ?
What's the exact semantic of generic_find_next_le_bit? Why is it not
documented?
Should be same ext2_find_next_zero_bit except that it find the next
set bit rather than the zero bit. The API is used to find the set bit
in bitmap. To explain the little endian dependency, what we have is
0 x n
[.......1.......]
Now we read this as (char *) and try to find the first set bit which
in the above example is x. To speed up most of the architectures would
like to consider it as an array of long. That implies that the value
in the array should be considered as a little endian long, hence the
*_le_bit.
-aneesh
--
To unsubscribe from this list: send the line "unsubscribe linux-m68k" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
