[compiler] Add even more tests for monotonicity of typing.

test/unittests/compiler/typer-unittest.cc

 // Copyright 2015 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/js-operator.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/operator-properties.h"
@@ skipping 47 matching lines @@
   OperationTyper operation_typer_;
   Types types_;
   JSOperatorBuilder javascript_;
   SimplifiedOperatorBuilder simplified_;
   BinaryOperationHint const hints_ = BinaryOperationHint::kAny;
   Node* context_node_;
   v8::base::RandomNumberGenerator* rng_;
   std::vector<double> integers;
   std::vector<double> int32s;
 
+  Type* TypeUnaryOp(const Operator* op, Type* type0) {
+    Node* p0 = Parameter(0);
+    NodeProperties::SetType(p0, type0);
+    std::vector<Node*> inputs;
+    inputs.push_back(p0);
+    if (OperatorProperties::HasContextInput(op)) {
+      inputs.push_back(context_node_);
+    }
+    for (int i = 0; i < OperatorProperties::GetFrameStateInputCount(op); i++) {
+      inputs.push_back(EmptyFrameState());
+    }
+    for (int i = 0; i < op->EffectInputCount(); i++) {
+      inputs.push_back(graph()->start());
+    }
+    for (int i = 0; i < op->ControlInputCount(); i++) {
+      inputs.push_back(graph()->start());
+    }
+    Node* n = graph()->NewNode(op, static_cast<int>(inputs.size()),
+                               &(inputs.front()));
+    return NodeProperties::GetType(n);
+  }
+
   Type* TypeBinaryOp(const Operator* op, Type* lhs, Type* rhs) {
     Node* p0 = Parameter(0);
     Node* p1 = Parameter(1);
     NodeProperties::SetType(p0, lhs);
     NodeProperties::SetType(p1, rhs);
     std::vector<Node*> inputs;
     inputs.push_back(p0);
     inputs.push_back(p1);
     if (OperatorProperties::HasContextInput(op)) {
       inputs.push_back(context_node_);
@@ skipping 169 matching lines @@
     DCHECK(type2->Is(upper2));
     Type* type = typer(type1, type2);
 
     Type* subtype1 = RandomSubtype(type1);
     Type* subtype2 = RandomSubtype(type2);
     Type* subtype = typer(subtype1, subtype2);
 
     EXPECT_TRUE(subtype->Is(type));
   }
 
+  void TestUnaryMonotonicity(const Operator* op, Type* upper1 = Type::Any()) {
+    UnaryTyper typer = [&](Type* type1) { return TypeUnaryOp(op, type1); };
+    for (int i = 0; i < kRepetitions; ++i) {
+      TestUnaryMonotonicity(typer, upper1);
+    }
+  }
+
   void TestBinaryMonotonicity(const Operator* op, Type* upper1 = Type::Any(),
                               Type* upper2 = Type::Any()) {
     BinaryTyper typer = [&](Type* type1, Type* type2) {
       return TypeBinaryOp(op, type1, type2);
     };
     for (int i = 0; i < kRepetitions; ++i) {
       TestBinaryMonotonicity(typer, upper1, upper2);
     }
   }
 };
@@ skipping 116 matching lines @@
 
 // For numbers there's no difference between strict and non-strict equality.
 TEST_F(TyperTest, TypeJSStrictEqual) {
   TestBinaryCompareOp(javascript_.StrictEqual(CompareOperationHint::kAny),
                       std::equal_to<double>());
 }
 
 //------------------------------------------------------------------------------
 // Typer Monotonicity
 
+// JS UNOPs without hint
+#define TEST_MONOTONICITY(name)                \
+  TEST_F(TyperTest, Monotonicity_##name) {     \
+    TestUnaryMonotonicity(javascript_.name()); \
+  }
+TEST_MONOTONICITY(ToInteger)
+TEST_MONOTONICITY(ToLength)
+TEST_MONOTONICITY(ToName)
+TEST_MONOTONICITY(ToNumber)
+TEST_MONOTONICITY(ToObject)
+TEST_MONOTONICITY(ToString)
+TEST_MONOTONICITY(ClassOf)
+TEST_MONOTONICITY(TypeOf)
+#undef TEST_MONOTONICITY
+
+// JS UNOPs with ToBooleanHint
+#define TEST_MONOTONICITY(name)                               \
+  TEST_F(TyperTest, Monotonicity_##name) {                    \
+    TestUnaryMonotonicity(javascript_.name(ToBooleanHint())); \
+  }
+TEST_MONOTONICITY(ToBoolean)
+#undef TEST_MONOTONICITY
+
 // JS BINOPs with CompareOperationHint
 #define TEST_MONOTONICITY(name)                                           \
   TEST_F(TyperTest, Monotonicity_##name) {                                \
     TestBinaryMonotonicity(javascript_.name(CompareOperationHint::kAny)); \
   }
 TEST_MONOTONICITY(Equal)
 TEST_MONOTONICITY(StrictEqual)
 TEST_MONOTONICITY(LessThan)
 TEST_MONOTONICITY(GreaterThan)
 TEST_MONOTONICITY(LessThanOrEqual)
@@ skipping 16 matching lines @@
 TEST_MONOTONICITY(BitwiseOr)
 TEST_MONOTONICITY(BitwiseXor)
 TEST_MONOTONICITY(BitwiseAnd)
 TEST_MONOTONICITY(ShiftLeft)
 TEST_MONOTONICITY(ShiftRight)
 TEST_MONOTONICITY(ShiftRightLogical)
 TEST_MONOTONICITY(Subtract)
 TEST_MONOTONICITY(Multiply)
 TEST_MONOTONICITY(Divide)
 TEST_MONOTONICITY(Modulus)
+TEST_MONOTONICITY(InstanceOf)
+TEST_MONOTONICITY(OrdinaryHasInstance)
 #undef TEST_MONOTONICITY
 
 // SIMPLIFIED BINOPs without hint, with Number input restriction
 #define TEST_MONOTONICITY(name)                                \
   TEST_F(TyperTest, Monotonicity_##name) {                     \
     TestBinaryMonotonicity(simplified_.name(), Type::Number(), \
                            Type::Number());                    \
   }
 SIMPLIFIED_NUMBER_BINOP_LIST(TEST_MONOTONICITY);
 #undef TEST_MONOTONICITY
@@ skipping 64 matching lines @@
     for (int i = 0; i < kRepetitions; ++i) {            \
       TestBinaryMonotonicity(typer);                    \
     }                                                   \
   }
 SIMPLIFIED_SPECULATIVE_NUMBER_BINOP_LIST(TEST_MONOTONICITY)
 #undef TEST_MONOTONICITY
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8