Fixed and improved code for integral division. Fixed and extended tests.

test/mjsunit/shift-for-integer-div.js

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 42 matching lines @@
 // Check for (kMinInt / -1)
 function divn1(x) {
   return x / (-1);
 }
 
 var two_31 = 1 << 31;
 divn1(2);
 divn1(2);
 %OptimizeFunctionOnNextCall(divn1);
 assertEquals(-2, divn1(2));
-assertEquals(two_31, divn1(-two_31));
+assertEquals(-two_31, divn1(two_31));
 
 
 //Check for truncating to int32 case
 function divp4t(x) {
   return (x / 4) | 0;
 }
 
 divp4t(8);
 divp4t(8);
 %OptimizeFunctionOnNextCall(divp4t);
 assertEquals(-1, divp4t(-5));
 assertEquals(1, divp4t(5));
 assertOptimized(divp4t);
 
 function divn4t(x) {
   return (x / -4) | 0;
 }
 
 divn4t(8);
 divn4t(8);
 %OptimizeFunctionOnNextCall(divn4t);
 assertEquals(1, divn4t(-5));
 assertEquals(-1, divn4t(5));
 assertOptimized(divn4t);
+
+// Check kMinInt case.
+function div_by_two(x) {
+  return (x / 2) | 0;
+}
+
+div_by_two(12);
+div_by_two(34);
+%OptimizeFunctionOnNextCall(div_by_two);
+div_by_two(56);
+assertEquals(-(1 << 30), div_by_two(1 << 31));