Right shifting negative numbers in C

by

It looks like your implementation is probably doing an arithmetic bit shift with two’s complement numbers. In this system, it shifts all of the bits to the right and then fills in the upper bits with a copy of whatever the last bit was. So for your example, treating int as 32-bits here:

nPosVal = 00000000000000001111111111111111
nNegVal = 11111111111111110000000000000001

After the shift, you’ve got: 

nPosVal = 00000000000000000111111111111111
nNegVal = 11111111111111111000000000000000

If you convert this back to decimal, you get 32767 and -32768 respectively.

Effectively, a right shift rounds towards negative infinity.

Edit: According to the Section 6.5.7 of the latest draft standard, this behavior on negative numbers is implementation dependent:

The result of E1 >> E2 is E1 right-shifted E2 bit positions. If E1 has an unsigned type or if E1 has a signed type and a nonnegative value, the value of the result is the integral part of the quotient of E1 / 2E2. If E1 has a signed type and a negative value, the resulting value is implementation-defined.

Their stated rational for this:

The C89 Committee affirmed the freedom in implementation granted by K&R in not requiring the signed right shift operation to sign extend, since such a requirement might slow down fast code and since the usefulness of sign extended shifts is marginal. (Shifting a negative two’s complement
integer arithmetically right one place is not the same as dividing by two!)

So it’s implementation dependent in theory. In practice, I’ve never seen an implementation not do an arithmetic shift right when the left operand is signed.

More Related Contents:

  1. Modulo operation with negative numbers
  2. Arithmetic bit-shift on a signed integer
  3. Are the shift operators () arithmetic or logical in C?
  4. Are there any non-twos-complement implementations of C?
  5. What does the C standard say about bitshifting more bits than the width of type?
  6. Bitwise operators and “endianness”
  7. Representation of negative numbers in C?
  8. bit shifting with unsigned long type produces wrong results
  9. What does the statement if (counter & (1
  10. c get nth byte of integer
  11. C left shift on 64 bits fail
  12. warning: left shift count >= width of type
  13. Why use the Bitwise-Shift operator for values in a C enum definition?
  14. Why does combining two shifts of a uint8_t produce a different result?
  15. Declaring 64-bit variables in C
  16. C – Counting Numbers {making a program} [closed]
  17. How can I check if an element in an array is equal to something in C? [closed]
  18. Having a segmentation fault
  19. Real-world use of X-Macros
  20. Can C arrays contain padding in between elements?
  21. practical examples use dup or dup2
  22. scanf not working as expected
  23. How to convert integer value to Roman numeral string?
  24. C getopt multiple value
  25. How to find the size of an array (from a pointer pointing to the first element array)?
  26. Is while(1); undefined behavior in C?
  27. What is a good reference documenting patterns of use of “.h” files in C? [duplicate]
  28. How to concatenate string and int in C?
  29. why gets() is not working?
  30. QuickSort and Hoare Partition

Leave a Comment