Revision 436b0f76f2cee6617f27a649637766628909dd5d authored by Linus Torvalds on 04 December 2005, 05:10:42 UTC, committed by Linus Torvalds on 04 December 2005, 05:10:42 UTC
Hey, for no other reason than the fact that I'll be off-line for a week. Of course, I could force everybody to just use git (and when I'm emperor of the world, don't think I won't!), but it seems some people want to just test official releases. Even if they are just -rc's. By the time I'm back, Andrew will have fixed all my bugs, and I'll release it as 2.6.15 and take all the credit. Mwahahahaaa Signed-off-by: Linus Torvalds <torvalds@osdl.org>
1 parent 6015d2c
find_next_bit.c
/* find_next_bit.c: fallback find next bit implementation
*
* Copyright (C) 2004 Red Hat, Inc. All Rights Reserved.
* Written by David Howells (dhowells@redhat.com)
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version
* 2 of the License, or (at your option) any later version.
*/
#include <linux/bitops.h>
int find_next_bit(const unsigned long *addr, int size, int offset)
{
const unsigned long *base;
const int NBITS = sizeof(*addr) * 8;
unsigned long tmp;
base = addr;
if (offset) {
int suboffset;
addr += offset / NBITS;
suboffset = offset % NBITS;
if (suboffset) {
tmp = *addr;
tmp >>= suboffset;
if (tmp)
goto finish;
}
addr++;
}
while ((tmp = *addr) == 0)
addr++;
offset = (addr - base) * NBITS;
finish:
/* count the remaining bits without using __ffs() since that takes a 32-bit arg */
while (!(tmp & 0xff)) {
offset += 8;
tmp >>= 8;
}
while (!(tmp & 1)) {
offset++;
tmp >>= 1;
}
return offset;
}
Computing file changes ...