__ffs 用于找到一个int或者long行最高哪位是1,例如0x8000,就会返回15.代表从第8个bit开始不为0.其源码如下;
static __always_inline unsigned long __ffs(unsigned long word)
{
int num = 0;
#if BITS_PER_LONG == 64
if ((word & 0xffffffff) == 0) {
num += 32;
word >>= 32;
}
#endif
if ((word & 0xffff) == 0) {
num += 16;
word >>= 16;
}
if ((word & 0xff) == 0) {
num += 8;
word >>= 8;
}
if ((word & 0xf) == 0) {
num += 4;
word >>= 4;
}
if ((word & 0x3) == 0) {
num += 2;
word >>= 2;
}
if ((word & 0x1) == 0)
num += 1;
return num;
}
以0x8000,假定没有定义BITS_PER_LONG。
第一步word & 0xffff 不为0,word = b1000,0000,0000,0000 。则num =0.
第二步word & 0xff) 为0,word = b1000,0000 。则num =8.
第三步word & 0xf为 为0 ,word = b1000 则num+=4.则num=12
第四部word & 0x3 为0 ,word = b10则num +=2,则num=14
第五步word & 0x1为0,word = b1则num+=1.则num=15
static __always_inline unsigned long __ffs(unsigned long word)
{
int num = 0;
#if BITS_PER_LONG == 64
if ((word & 0xffffffff) == 0) {
num += 32;
word >>= 32;
}
#endif
if ((word & 0xffff) == 0) {
num += 16;
word >>= 16;
}
if ((word & 0xff) == 0) {
num += 8;
word >>= 8;
}
if ((word & 0xf) == 0) {
num += 4;
word >>= 4;
}
if ((word & 0x3) == 0) {
num += 2;
word >>= 2;
}
if ((word & 0x1) == 0)
num += 1;
return num;
}
以0x8000,假定没有定义BITS_PER_LONG。
第一步word & 0xffff 不为0,word = b1000,0000,0000,0000 。则num =0.
第二步word & 0xff) 为0,word = b1000,0000 。则num =8.
第三步word & 0xf为 为0 ,word = b1000 则num+=4.则num=12
第四部word & 0x3 为0 ,word = b10则num +=2,则num=14
第五步word & 0x1为0,word = b1则num+=1.则num=15