Improve integer division on ARM in favor of power of 2 constant divisor

test/mjsunit/math-floor-of-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 166 matching lines @@
       assertEquals(Math.floor(div(-(values[i] | 0), -(values[j] | 0))),
                    Math.floor(-(values[i] | 0) / -(values[j] | 0)));
     }
   }
 }
 
 test_div();
 %OptimizeFunctionOnNextCall(test_div);
 test_div();
 
-// Test for ia32/x64 flooring correctness.
+// Test for flooring correctness.
 var values2 = [1, 3, 10, 99, 100, 101, 0x7fffffff];
 function test_div2() {
   for (var i = 0; i < values2.length; i++) {
     for (var j = 0; j < values2.length; j++) {
       assertEquals(Math.floor(div((values2[i] | 0), (values2[j] | 0))),
                    Math.floor((values2[i] | 0) / (values2[j] | 0)));
       assertEquals(Math.floor(div(-(values2[i] | 0), (values2[j] | 0))),
                    Math.floor(-(values2[i] | 0) / (values2[j] | 0)));
       assertEquals(Math.floor(div((values2[i] | 0), -(values2[j] | 0))),
                    Math.floor((values2[i] | 0) / -(values2[j] | 0)));
@@ skipping 81 matching lines @@
 
 test_div_deopt_minus_zero_v();
 test_div_deopt_overflow_v();
 test_div_deopt_div_by_zero_v();
 %OptimizeFunctionOnNextCall(test_div_deopt_minus_zero_v);
 %OptimizeFunctionOnNextCall(test_div_deopt_overflow_v);
 %OptimizeFunctionOnNextCall(test_div_deopt_div_by_zero_v);
 test_div_deopt_minus_zero_v();
 test_div_deopt_overflow_v();
 test_div_deopt_div_by_zero_v();