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.
This kind of documentation should be in the kernel tree somewhere. And while we're at it all the routines should be renamed from extN_* to *_le_bit because that describes what they do. -- 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
