[asm] Fix lots of invalid asm.js tests

test/mjsunit/asm/uint32mod-constant.js

Index: test/mjsunit/asm/uint32mod-constant.js
diff --git a/test/mjsunit/asm/uint32mod-constant.js b/test/mjsunit/asm/uint32mod-constant.js
index 4ba94dad20393c4a4eebd01492a6a1f5bfc5d627..562dcd11f924a15b85bc562f05be5007dc86fe04 100644
--- a/test/mjsunit/asm/uint32mod-constant.js
+++ b/test/mjsunit/asm/uint32mod-constant.js
@@ -9,13 +9,15 @@ var heap = new ArrayBuffer(64 * 1024);
 function Uint32Mod(divisor) {
   var name = "mod_";
   name += divisor;
-  var m = eval("function Module(stdlib, foreign, heap) {\n"
-      + " \"use asm\";\n"
-      + " function " + name + "(dividend) {\n"
-      + "  return ((dividend >>> 0) % " + divisor + ") >>> 0;\n"
-      + " }\n"
-      + " return { f: " + name + "}\n"
-      + "}; Module");
+  var m = eval(
+      'function Module(stdlib, foreign, heap) {\n' +
+      ' "use asm";\n' +
+      ' function ' + name + '(dividend) {\n' +
+      '  dividend = dividend | 0;\n' +
+      '  return ((dividend >>> 0) % ' + divisor + ') | 0;\n' +
+      ' }\n' +
+      ' return { f: ' + name + '}\n' +
+      '}; Module');
   return m(stdlib, foreign, heap).f;
 }
 
@@ -24,6 +26,6 @@ for (var i in divisors) {
   var divisor = divisors[i];
   var mod = Uint32Mod(divisor);
   for (var dividend = 0; dividend < 4294967296; dividend += 3999773) {
-    assertEquals((dividend % divisor) >>> 0, mod(dividend));
+    assertEquals((dividend % divisor) | 0, mod(dividend));
   }
 }