[turbofan] Optimize remainder of integer division by unknown power of two.

test/mjsunit/asm/int32mod-constant.js

Index: test/mjsunit/asm/int32mod-constant.js
diff --git a/test/mjsunit/asm/int32mod.js b/test/mjsunit/asm/int32mod-constant.js
similarity index 99%
copy from test/mjsunit/asm/int32mod.js
copy to test/mjsunit/asm/int32mod-constant.js
index ec3e887ce4408aabb191f2dccab575c73a90070a..fdbdc5de108d94bb24b34be9b53958cd9c720025 100644
--- a/test/mjsunit/asm/int32mod.js
+++ b/test/mjsunit/asm/int32mod-constant.js
@@ -22,7 +22,7 @@ function Int32Mod(divisor) {
   return m(stdlib, foreign, heap).f;
 }
 
-var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1,
+var divisors = [-2147483648, -32 * 1024, -1000, -16, -7, -2, -1, 0,
                 1, 3, 4, 10, 64, 100, 1024, 2147483647];
 for (var i in divisors) {
   var divisor = divisors[i];