Better typing and type verification

test/compiler-unittests/change-lowering-unittest.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/change-lowering.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-properties-inl.h"
 #include "src/compiler/simplified-operator.h"
-#include "src/compiler/typer.h"
 #include "test/compiler-unittests/graph-unittest.h"
 #include "testing/gmock-support.h"
 
 using testing::_;
 using testing::AllOf;
 using testing::Capture;
 using testing::CaptureEq;
 
 namespace v8 {
 namespace internal {
@@ skipping 57 matching lines @@
     STATIC_ASSERT(SmiTagging<4>::kSmiValueSize == 31);
     STATIC_ASSERT(SmiTagging<8>::kSmiValueSize == 32);
     return Is32() ? 31 : 32;
   }
 
   Node* Parameter(int32_t index = 0) {
     return graph()->NewNode(common()->Parameter(index), graph()->start());
   }
 
   Reduction Reduce(Node* node) {
-    Typer typer(zone());
-    JSGraph jsgraph(graph(), common(), &typer);
+    JSGraph jsgraph(graph(), common());
     CompilationInfo info(isolate(), zone());
     Linkage linkage(&info);
     MachineOperatorBuilder machine(zone(), WordRepresentation());
     ChangeLowering reducer(&jsgraph, &linkage, &machine);
     return reducer.Reduce(node);
   }
 
   SimplifiedOperatorBuilder* simplified() { return &simplified_; }
 
   Matcher<Node*> IsAllocateHeapNumber(const Matcher<Node*>& effect_matcher,
@@ skipping 370 matching lines @@
               IsIfTrue(AllOf(CaptureEq(&branch),
                              IsBranch(IsUint32LessThanOrEqual(
                                           val, IsInt32Constant(SmiMaxValue())),
                                       graph()->start()))),
               AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch))))));
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8