How do I get bit-by-bit data from an integer value in C?

by

If you want the k-th bit of n, then do 

(n & ( 1 << k )) >> k

Here we create a mask, apply the mask to n, and then right shift the masked value to get just the bit we want. We could write it out more fully as:

    int mask =  1 << k;
    int masked_n = n & mask;
    int thebit = masked_n >> k;

You can read more about bit-masking here.

Here is a program:

#include <stdio.h>
#include <stdlib.h>

int *get_bits(int n, int bitswanted){
  int *bits = malloc(sizeof(int) * bitswanted);

  int k;
  for(k=0; k<bitswanted; k++){
    int mask =  1 << k;
    int masked_n = n & mask;
    int thebit = masked_n >> k;
    bits[k] = thebit;
  }

  return bits;
}

int main(){
  int n=7;

  int  bitswanted = 5;

  int *bits = get_bits(n, bitswanted);

  printf("%d = ", n);

  int i;
  for(i=bitswanted-1; i>=0;i--){
    printf("%d ", bits[i]);
  }

  printf("\n");
}

More Related Contents:

  1. What is the fastest/most efficient way to find the highest set bit (msb) in an integer in C?
  2. Are the shift operators () arithmetic or logical in C?
  3. How can I multiply and divide using only bit shifting and adding?
  4. What is CHAR_BIT?
  5. Rounding up to next power of 2
  6. Catch and compute overflow during multiplication of two large integers
  7. SIMD signed with unsigned multiplication for 64-bit * 64-bit to 128-bit
  8. Bitwise operators and “endianness”
  9. Explain this snippet which finds the maximum of two integers without using if-else or any other comparison operator?
  10. Bitfield manipulation in C
  11. Fastest way to clamp a real (fixed/floating point) value?
  12. What’s bad about shifting a 32-bit variable 32 bits?
  13. Casting float to int (bitwise) in C
  14. What does the statement if (counter & (1
  15. Compute fast log base 2 ceiling
  16. Finding consecutive bit string of 1 or 0
  17. warning: left shift count >= width of type
  18. set the m-bit to n-bit [closed]
  19. Unexpected C/C++ bitwise shift operators outcome
  20. Encoding int value as an IEEE-754 float (binary32)
  21. C reverse bits in unsigned integer
  22. How to define and work with an array of bits in C?
  23. Algorithm to generate bit mask
  24. Check if a number is non zero using bitwise operators in C
  25. How to replace bits in a bitfield without affecting other bits using C
  26. Decimal to Binary
  27. C Programming – XOR Bitwise Operation
  28. Bitwise shifting array of char’s
  29. How to implement Bitcount using only Bitwise operators?
  30. What is bit masking?

Leave a Comment