Masking a bit in C returning unexpected result

Posted by Eamorr on Stack Overflow See other posts from Stack Overflow or by Eamorr
Published on 2011-01-14T19:43:03Z Indexed on 2011/01/14 19:53 UTC
Read the original article Hit count: 208

Filed under:

c

|

bit-manipulation

|

mask

0x7F000000 is 0111 1111 0000 0000 0000 0000 0000 0000 in 32 bit binary.
0x01000058 is 0000 0001 0000 0000 0000 0000 0101 1000.

When I AND the two numbers together I expect 0000 0001 0000 0000 0000 0000 0000 0000, but for some reason I get 0.

Here is my code:

#define MASK_binop     0x80000000
#define MASK_operation 0x7F000000

int instruction=atoi(line);
if((MASK_binop & instruction)>0)
    printf("binop\n");
else if((MASK_operation & instruction)>0)
    printf("operation\n");

Each of the above comparisons keeps returning zero. Is it something to do with 32/64 bits? I'm using 64-bit compiler.

Related posts about bit-manipulation

Find three numbers appeared only once using bit manipulation

as seen on Stack Overflow - Search for 'Stack Overflow'
In a sequence of length n, where n=2k+3, that is there are k unique numbers appeared twice, how to find the three unique numbers that appeared only once using bit manipulation? for example, in sequence 1 1 2 6 3 6 5 7 7 the three unique numbers are 2 3 5. >>> More
Learning C bit manipulation

as seen on Stack Overflow - Search for 'Stack Overflow'
I didn't know any better name for a title of the question. For ex: on one of my previous questions one answered ((a)-(b))&0x80000000) 31 - this is kind of a too advanced for me and i can't really get what it means. I am not looking just for an answer of that, but i need someone to tell me some… >>> More
Bit manipulation, permutate bits

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi. I am trying to make a loop that loops through all different integers where exactly 10 of the last 40 bits are set high, the rest set low. The reason is that I have a map with 40 different values, and I want to sum all different ways ten of these values can be multiplied. (This is just out of… >>> More
bit manipulation in java

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a fragment of bytes in a byte[]. The total size of the array is 4 and I want to convert this into a positive long number. For example if the byte array is having four bytes 101, 110, 10, 1 then i want to get the long number represented by binary sequence 00000000 00000000 00000000 00000000… >>> More
Doing 64 bit manipulation using 32 bit data in Fixed point arithmetic using C.

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I am stuck with a problem. I am working on a hardware which only does support 32 bit operations. sizeof(int64_t) is 4. Sizeof(int) is 4. and I am porting an application which assumes size of int64_t to be 8 bytes. The problem is it has this macro BIG_MULL(a,b) ( (int64_t)(a) *… >>> More

Developer IT

Masking a bit in C returning unexpected result - Developer IT

Masking a bit in C returning unexpected result

c

bit-manipulation

mask

Related posts about c

Related posts about bit-manipulation

Find three numbers appeared only once using bit manipulation

Learning C bit manipulation

Bit manipulation, permutate bits

bit manipulation in java

Doing 64 bit manipulation using 32 bit data in Fixed point arithmetic using C.

Categories cloud