[turbofan] Compute tighter ranges for modulus in Typer.

test/cctest/compiler/test-typer.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include <functional>
 
+#include "src/codegen.h"
 #include "src/compiler/node-properties-inl.h"
 #include "src/compiler/typer.h"
 #include "test/cctest/cctest.h"
 #include "test/cctest/compiler/graph-builder-tester.h"
 #include "test/cctest/types-fuzz.h"
 
 using namespace v8::internal;
 using namespace v8::internal::compiler;
 
 
@@ skipping 192 matching lines @@
   t.TestBinaryArithOp(t.javascript_.Multiply(), std::multiplies<double>());
 }
 
 
 TEST(TypeJSDivide) {
   TyperTester t;
   t.TestBinaryArithOp(t.javascript_.Divide(), std::divides<double>());
 }
 
 
+TEST(TypeJSModulus) {
+  TyperTester t;
+  t.TestBinaryArithOp(t.javascript_.Modulus(), modulo);
+}
+
+
 TEST(TypeJSBitwiseOr) {
   TyperTester t;
   t.TestBinaryBitOp(t.javascript_.BitwiseOr(), bit_or);
 }
 
 
 TEST(TypeJSBitwiseAnd) {
   TyperTester t;
   t.TestBinaryBitOp(t.javascript_.BitwiseAnd(), bit_and);
 }
@@ skipping 96 matching lines @@
   V(Modulus)
 
 
 TEST(Monotonicity) {
   TyperTester t;
   #define TEST_OP(name) \
       t.TestBinaryMonotonicity(t.javascript_.name());
   JSBINOP_LIST(TEST_OP)
   #undef TEST_OP
 }