[turbofan] Fix the node matchers.

test/cctest/compiler/test-representation-change.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 <limits>
 
 #include "src/v8.h"
 #include "test/cctest/cctest.h"
 #include "test/cctest/compiler/graph-builder-tester.h"
 
@@ skipping 25 matching lines @@
   RepresentationChanger changer_;
 
   Isolate* isolate() { return main_isolate(); }
   Graph* graph() { return main_graph_; }
   CommonOperatorBuilder* common() { return &main_common_; }
   JSGraph* jsgraph() { return &jsgraph_; }
   RepresentationChanger* changer() { return &changer_; }
 
   // TODO(titzer): use ValueChecker / ValueUtil
   void CheckInt32Constant(Node* n, int32_t expected) {
-    ValueMatcher<int32_t> m(n);
+    Int32Matcher m(n);
     CHECK(m.HasValue());
     CHECK_EQ(expected, m.Value());
   }
 
-  void CheckHeapConstant(Node* n, Object* expected) {
-    ValueMatcher<Handle<Object> > m(n);
+  void CheckHeapConstant(Node* n, HeapObject* expected) {
+    HeapObjectMatcher<HeapObject> m(n);
     CHECK(m.HasValue());
-    CHECK_EQ(expected, *m.Value());
+    CHECK_EQ(expected, *m.Value().handle());
   }
 
   void CheckNumberConstant(Node* n, double expected) {
-    ValueMatcher<double> m(n);
+    NumberMatcher m(n);
     CHECK_EQ(IrOpcode::kNumberConstant, n->opcode());
     CHECK(m.HasValue());
     CHECK_EQ(expected, m.Value());
   }
 
   Node* Parameter(int index = 0) {
     return graph()->NewNode(common()->Parameter(index), graph()->start());
   }
 
   void CheckTypeError(MachineTypeUnion from, MachineTypeUnion to) {
@@ skipping 225 matching lines @@
   // rW64
   // tIrW64
   // tUrW64
   // rF64
   // tIrF64
   // tUrF64
   // tArF64
   // rT
   // tArT
 }