Logo Questions Linux Laravel Mysql Ubuntu Git Menu
 

Why does left shift and right shift in the same statement yields a different result?

Consider the following Example:

First Case:

short x=255;
x = (x<<8)>>8;
cout<<x<<endl;

Second Case:

short x=255;
x = x<<8;
x = x>>8;
cout<<x<<endl;

The output in the first case is 255 whereas in the second case is -1. -1 as output does makes sense as cpp does a arithmetic right shift. Here are the intermediate values of x to obtain -1 as output.

x: 0000 0000 1111 1111  
x<<8:1111 1111 0000 0000 
x>>8:1111 1111 1111 1111

Why doesn't the same mechanism happen in the first case?

like image 239
router Avatar asked Aug 30 '16 10:08

router


2 Answers

The difference is a result of two factors.

  1. The C++ standard does not specify the maximum values of integral types. The standard only specifies the minimum size of each integer type. On your platform, a short is a 16 bit value, and an ints is at least a 32 bit value.

  2. The second factor is two's complement arithmetic.

In your first example, the short value is naturally promoted to an int, which is at least 32 bits, so the left and the right shift operates on an int, before getting converted back to a short.

In your second example, after the first left shift operation the resulting value is once again converted back to a short, and due to two's complement arithmetic, it ends up being a negative value. The right shift ends up sign-extending the negative value, resulting in the final result of -1.

like image 150
Sam Varshavchik Avatar answered Sep 28 '22 05:09

Sam Varshavchik


What you just observed is sign extension:

Sign extension is the operation, in computer arithmetic, of increasing the number of bits of a binary number while preserving the number's sign (positive/negative) and value. This is done by appending digits to the most significant side of the number, following a procedure dependent on the particular signed number representation used.

For example, if six bits are used to represent the number "00 1010" (decimal positive 10) and the sign extend operation increases the word length to 16 bits, then the new representation is simply "0000 0000 0000 1010". Thus, both the value and the fact that the value was positive are maintained.

If ten bits are used to represent the value "11 1111 0001" (decimal negative 15) using two's complement, and this is sign extended to 16 bits, the new representation is "1111 1111 1111 0001". Thus, by padding the left side with ones, the negative sign and the value of the original number are maintained.

You rigt shift all the way to the point where your short becomes negative, and when you then shift back, you get the sign extension.

This doesn't happen in the first case, as the shift isn't applied to a short. It's applied to 255 which isn't a short, but the default integral type (probably an int). It only gets casted after it's already been shifted back:

on the stack:     0000 0000 0000 0000 0000 0000 1111 1111
<<8
on the stack:     0000 0000 0000 0000 1111 1111 0000 0000
>>8
on the stack:     0000 0000 0000 0000 0000 0000 1111 1111
convert to short: 0000 0000 1111 1111
like image 44
Lanting Avatar answered Sep 28 '22 05:09

Lanting