const unsigned long *p = addr + (offset >> 6); 
const unsigned long *p = addr + (offset >> SHIFT_PER_LONG); 
static __inline__ unsigned long find_next_bit(const unsigned long *addr, unsigned long size, unsigned long offset){	const unsigned long *p = addr + (offset >> 6);	unsigned long result = offset & ~(BITS_PER_LONG-1);	unsigned long tmp;	if (offset >= size)		return size;	size -= result;	offset &= (BITS_PER_LONG-1);	if (offset) {		tmp = *(p++);		tmp &= (~0UL << offset);		if (size < BITS_PER_LONG)			goto found_first;		if (tmp)			goto found_middle;		size -= BITS_PER_LONG;		result += BITS_PER_LONG;	}	while (size & ~(BITS_PER_LONG-1)) {		if ((tmp = *(p++)))			goto found_middle;		result += BITS_PER_LONG;		size -= BITS_PER_LONG;	}	if (!size)		return result;	tmp = *p;found_first:	tmp &= (~0UL >> (BITS_PER_LONG - size));	if (tmp == 0UL)        /* Are any bits set? */		return result + size; /* Nope. */found_middle:	return result + __ffs(tmp);}
4520	/local/tlutelli/issta_data/temp/c/2005_temp/2005/4520/a366064c3ff46c985a3c7243468be197d29874dc/bitops.h/buggy/include/asm-parisc/bitops.h