Lines Matching defs:bit
13 * bit depends on the word size.
23 * The main difference is that bit 0-63 in the bit number field needs to be
24 * reversed compared to the LSB0 encoded bit fields. This can be achieved by
249 * Functions which use MSB0 bit numbering.
257 #define for_each_set_bit_inv(bit, addr, size) \
258 for ((bit) = find_first_bit_inv((addr), (size)); \
259 (bit) < (size); \
260 (bit) = find_next_bit_inv((addr), (size), (bit) + 1))
300 * Returns the bit number of the most significant bit set,
301 * where the most significant bit has bit number 0.
302 * If no bit is set this function returns 64.
307 unsigned long bit = 0;
313 bit += 32;
317 bit += 16;
321 bit += 8;
325 bit += 4;
329 bit += 2;
333 bit += 1;
335 return bit;
337 register unsigned long bit asm("4") = word;
341 " flogr %[bit],%[bit]\n"
342 : [bit] "+d" (bit), [out] "=d" (out) : : "cc");
343 return bit;
348 * __ffs - find first bit in word.
351 * Undefined if no bit exists, so code should check against 0 first.
359 * ffs - find first bit set
374 * __fls - find last (most-significant) set bit in a long word
377 * Undefined if no set bit exists, so code should check against 0 first.
385 * fls64 - find last set bit in a 64-bit word
389 * ffsll, but returns the position of the most significant set bit.
392 * set bit if value is nonzero. The last (most significant) bit is
403 * fls - find last (most-significant) bit set