这个函数是返回整形的最低位1的位置
自己写是这个样子的:/* Find the first bit set in I. */int lx_ffs(int i){ int index = 0, ret = -1; for(index = 0; index < sizeof(int) * 8; index ++) { if((1 << index) & i) { ret = index + 1; break; } } return ret;}
人家库函数牛B,比较一次就可以得到其工作原理1=>位置12=>位置24=>位置38=>位置416=>位置532=>位置664=>位置7128=>位置8在得到最低位1的整数值后,根据数值得到所在位置/* Find the first bit set in I. */int lx_ffs(int i){ static const unsigned char table[] = { 0,1,2,2,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8, 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8 }; unsigned int a; unsigned int x = i & -i;//这一步直接得到最低位1的整数值 a = x <= 0xffff ? (x <= 0xff ? 0 : 8) : (x <= 0xffffff ? 16 : 24); return table[x >> a] + a;}