Speed up mjsunit/div-mod.js test, to avoid timeouts.

test/mjsunit/div-mod.js

 // Copyright 2009 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 30 matching lines @@
 
 function run_tests_for(divisor) {
   print("(function(left) { return left / " + divisor + "; })");
   var div_func = this.eval("(function(left) { return left / " + divisor + "; })");
   var mod_func = this.eval("(function(left) { return left % " + divisor + "; })");
   var exp;
   // Strange number test.
   divmod(div_func, mod_func, 0, divisor);
   divmod(div_func, mod_func, 1 / 0, divisor);
   // Floating point number test.
-  for (exp = -1024; exp <= 1024; exp += 4) {
+  for (exp = -1024; exp <= 1024; exp += 8) {
     divmod(div_func, mod_func, Math.pow(2, exp), divisor);
     divmod(div_func, mod_func, 0.9999999 * Math.pow(2, exp), divisor);
     divmod(div_func, mod_func, 1.0000001 * Math.pow(2, exp), divisor);
   }
   // Integer number test.
   for (exp = 0; exp <= 32; exp++) {
     divmod(div_func, mod_func, 1 << exp, divisor);
     divmod(div_func, mod_func, (1 << exp) + 1, divisor);
     divmod(div_func, mod_func, (1 << exp) - 1, divisor);
   }
   divmod(div_func, mod_func, Math.floor(0x1fffffff / 3), divisor);
   divmod(div_func, mod_func, Math.floor(-0x20000000 / 3), divisor);
 }
 
 
 var divisors = [
   0,
   1,
   2,
   3,
   4,
   5,
   6,
   7,
   8,
   9,
   10,
-  // These ones in the middle don't add much apart from slowness to the test.
   0x1000000,
-  0x2000000,
-  0x4000000,
-  0x8000000,
-  0x10000000,
-  0x20000000,
   0x40000000,
   12,
   60,
   100,
   1000 * 60 * 60 * 24];
 
 for (var i = 0; i < divisors.length; i++) {
   run_tests_for(divisors[i]);
 }
-