Add inlining for intrinsics.

src/compiler/verifier.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 "src/compiler/verifier.h"
 
 #include <deque>
 #include <queue>
 
 #include "src/compiler/generic-algorithm.h"
@@ skipping 468 matching lines @@
         CHECK(bounds(node).upper->Is(Type::String()));
         break;
       case IrOpcode::kReferenceEqual: {
         // (Unique, Any) -> Boolean  and
         // (Any, Unique) -> Boolean
         CHECK(bounds(Operand(node, 0)).upper->Is(Type::Unique()) ||
               bounds(Operand(node, 1)).upper->Is(Type::Unique()));
         CHECK(bounds(node).upper->Is(Type::Boolean()));
         break;
       }
+      case IrOpcode::kIsSmi:
+        CHECK(bounds(Operand(node)).upper->Is(Type::Any()));
+        CHECK(bounds(node).upper->Is(Type::Boolean()));
+        break;
+      case IrOpcode::kIsNonNegativeSmi:
+        CHECK(bounds(Operand(node)).upper->Is(Type::Any()));
+        CHECK(bounds(node).upper->Is(Type::Boolean()));
+        break;
 
       case IrOpcode::kChangeTaggedToInt32: {
         // Signed32 /\ Tagged -> Signed32 /\ UntaggedInt32
         // TODO(neis): Activate once ChangeRepresentation works in typer.
         // Type* from = Type::Intersect(Type::Signed32(), Type::Tagged());
         // Type* to = Type::Intersect(Type::Signed32(), Type::UntaggedInt32());
         // CHECK(bounds(Operand(node)).upper->Is(from));
         // CHECK(bounds(node).upper->Is(to));
         break;
       }
@@ skipping 403 matching lines @@
     // Check inputs for all nodes in the block.
     for (size_t i = 0; i < block->NodeCount(); i++) {
       Node* node = block->NodeAt(i);
       CheckInputsDominate(schedule, block, node, static_cast<int>(i) - 1);
     }
   }
 }
 }
 }
 }  // namespace v8::internal::compiler