[turbofan] Check node input/use consistency for changed operators and new nodes.

test/unittests/compiler/control-equivalence-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/bit-vector.h"
 #include "src/compiler/control-equivalence.h"
 #include "src/compiler/graph-visualizer.h"
 #include "src/compiler/node-properties.h"
 #include "src/zone-containers.h"
 #include "test/unittests/compiler/graph-unittest.h"
@@ skipping 87 matching lines @@
 
 
 TEST_F(ControlEquivalenceTest, Empty1) {
   Node* start = graph()->start();
   ComputeEquivalence(start);
 
   ASSERT_EQUIVALENCE(start);
 }
 
 
-TEST_F(ControlEquivalenceTest, Empty2) {
-  Node* start = graph()->start();
-  Node* end = End(start);

[Michael Starzinger, 2015/09/25 08:06:49]

Removing this is fine with me. If you want to preserve it I suggest to introduce
a {Merge1} helper and build a single-linked chain "Start->Merge->End" instead of
the borked "Start->End->End" here.

[Jarin, 2015/09/25 08:13:33]

Done.

-  ComputeEquivalence(end);
-
-  ASSERT_EQUIVALENCE(start, end);
-}
-
-
 TEST_F(ControlEquivalenceTest, Diamond1) {
   Node* start = graph()->start();
   Node* b = Branch(start);
   Node* t = IfTrue(b);
   Node* f = IfFalse(b);
   Node* m = Merge2(t, f);
   ComputeEquivalence(m);
 
   ASSERT_EQUIVALENCE(b, m, start);
   ASSERT_EQUIVALENCE(f);
@@ skipping 119 matching lines @@
   ASSERT_EQUIVALENCE(t2);
   ASSERT_EQUIVALENCE(f2);
   ASSERT_EQUIVALENCE(f3);
   ASSERT_EQUIVALENCE(lp);
 }
 
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8