Find most significant bit (left-most) that is set in a bit array

by

GCC has __builtin_clz that translates to BSR on x86/x64, CLZ on ARM, etc. and emulates the instruction if the hardware does not implement it.
Visual C++ 2005 and up has _BitScanReverse.

More Related Contents:

  1. Efficient Algorithm for Bit Reversal (from MSB->LSB to LSB->MSB) in C
  2. Arithmetic bit-shift on a signed integer
  3. Are the shift operators () arithmetic or logical in C?
  4. What is Bit Masking?
  5. Rounding up to next power of 2
  6. Fast computing of log2 for 64-bit integers
  7. Extracting bits with a single multiplication
  8. SIMD signed with unsigned multiplication for 64-bit * 64-bit to 128-bit
  9. Bitwise operators and “endianness”
  10. Explain this snippet which finds the maximum of two integers without using if-else or any other comparison operator?
  11. Bitfield manipulation in C
  12. Casting float to int (bitwise) in C
  13. What does the statement if (counter & (1
  14. Compute fast log base 2 ceiling
  15. Finding consecutive bit string of 1 or 0
  16. Bitshift and integer promotion?
  17. Unexpected C/C++ bitwise shift operators outcome
  18. Bit twiddling: which bit is set?
  19. Encoding int value as an IEEE-754 float (binary32)
  20. C reverse bits in unsigned integer
  21. How to define and work with an array of bits in C?
  22. Implementing Logical Right Shift in C
  23. How do I get bit-by-bit data from an integer value in C?
  24. Algorithm to generate bit mask
  25. How does this bitwise operation check for a power of 2?
  26. Check if a number is non zero using bitwise operators in C
  27. Decimal to Binary
  28. C Programming – XOR Bitwise Operation
  29. Size of pid_t, uid_t, gid_t on Linux
  30. Order of fields when using a bit field in C

Leave a Comment