1*77c8554eSFabio Estevam #ifndef _ASM_GENERIC_BITOPS___FLS_H_ 2*77c8554eSFabio Estevam #define _ASM_GENERIC_BITOPS___FLS_H_ 3*77c8554eSFabio Estevam 4*77c8554eSFabio Estevam #include <asm/types.h> 5*77c8554eSFabio Estevam 6*77c8554eSFabio Estevam /** 7*77c8554eSFabio Estevam * __fls - find last (most-significant) set bit in a long word 8*77c8554eSFabio Estevam * @word: the word to search 9*77c8554eSFabio Estevam * 10*77c8554eSFabio Estevam * Undefined if no set bit exists, so code should check against 0 first. 11*77c8554eSFabio Estevam */ __fls(unsigned long word)12*77c8554eSFabio Estevamstatic __always_inline unsigned long __fls(unsigned long word) 13*77c8554eSFabio Estevam { 14*77c8554eSFabio Estevam int num = BITS_PER_LONG - 1; 15*77c8554eSFabio Estevam 16*77c8554eSFabio Estevam #if BITS_PER_LONG == 64 17*77c8554eSFabio Estevam if (!(word & (~0ul << 32))) { 18*77c8554eSFabio Estevam num -= 32; 19*77c8554eSFabio Estevam word <<= 32; 20*77c8554eSFabio Estevam } 21*77c8554eSFabio Estevam #endif 22*77c8554eSFabio Estevam if (!(word & (~0ul << (BITS_PER_LONG-16)))) { 23*77c8554eSFabio Estevam num -= 16; 24*77c8554eSFabio Estevam word <<= 16; 25*77c8554eSFabio Estevam } 26*77c8554eSFabio Estevam if (!(word & (~0ul << (BITS_PER_LONG-8)))) { 27*77c8554eSFabio Estevam num -= 8; 28*77c8554eSFabio Estevam word <<= 8; 29*77c8554eSFabio Estevam } 30*77c8554eSFabio Estevam if (!(word & (~0ul << (BITS_PER_LONG-4)))) { 31*77c8554eSFabio Estevam num -= 4; 32*77c8554eSFabio Estevam word <<= 4; 33*77c8554eSFabio Estevam } 34*77c8554eSFabio Estevam if (!(word & (~0ul << (BITS_PER_LONG-2)))) { 35*77c8554eSFabio Estevam num -= 2; 36*77c8554eSFabio Estevam word <<= 2; 37*77c8554eSFabio Estevam } 38*77c8554eSFabio Estevam if (!(word & (~0ul << (BITS_PER_LONG-1)))) 39*77c8554eSFabio Estevam num -= 1; 40*77c8554eSFabio Estevam return num; 41*77c8554eSFabio Estevam } 42*77c8554eSFabio Estevam 43*77c8554eSFabio Estevam #endif /* _ASM_GENERIC_BITOPS___FLS_H_ */ 44