[turbofan] Speed up structural graph verification.

test/unittests/compiler/node-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 "src/compiler/node.h"
 #include "src/compiler/operator.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gmock-support.h"
 
+using testing::Contains;
 using testing::ElementsAre;
+using testing::ElementsAreArray;
 using testing::UnorderedElementsAre;
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
 typedef TestWithZone NodeTest;
 
 
 namespace {
@@ skipping 224 matching lines @@
     inputs[i] = i & 1 ? n0 : n1;
   }
 
   for (int size = 13; size <= kMaxSize; size += 9) {
     Node* node = Node::New(zone(), 12345, &kOp0, size, inputs, false);
     EXPECT_EQ(size, node->InputCount());
 
     for (int i = 0; i < size; i++) {
       EXPECT_EQ(inputs[i], node->InputAt(i));
     }
+
+    EXPECT_THAT(n0->uses(), Contains(node));
+    EXPECT_THAT(n1->uses(), Contains(node));
+    EXPECT_THAT(node->inputs(), ElementsAreArray(inputs, size));
   }
 }
 
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8