Fix -Wsign-compare errors in TF tests under GCC 4.9.2

test/unittests/compiler/graph-reducer-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/common-operator.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/node.h"
 #include "src/compiler/operator.h"
 #include "test/unittests/compiler/graph-reducer-unittest.h"
 #include "test/unittests/test-utils.h"
@@ skipping 578 matching lines @@
     EXPECT_EQ(&kOpB1, nn2->op());
     EXPECT_EQ(&kOpB1, nn3->op());
     EXPECT_EQ(&kOpB2, nend->op());
   }
 }
 
 
 TEST_F(GraphReducerTest, Wrapping1) {
   Node* end = graph()->NewNode(&kOpA0);
   graph()->SetEnd(end);
-  EXPECT_EQ(1, graph()->NodeCount());
+  EXPECT_EQ(1U, graph()->NodeCount());
 
   A0Wrapper r(graph());
 
   ReduceGraph(&r);
-  EXPECT_EQ(2, graph()->NodeCount());
+  EXPECT_EQ(2U, graph()->NodeCount());
 
   Node* nend = graph()->end();
   EXPECT_NE(end, nend);
   EXPECT_EQ(&kOpB1, nend->op());
   EXPECT_EQ(1, nend->InputCount());
   EXPECT_EQ(end, nend->InputAt(0));
 }
 
 
 TEST_F(GraphReducerTest, Wrapping2) {
   Node* end = graph()->NewNode(&kOpB0);
   graph()->SetEnd(end);
-  EXPECT_EQ(1, graph()->NodeCount());
+  EXPECT_EQ(1U, graph()->NodeCount());
 
   B0Wrapper r(graph());
 
   ReduceGraph(&r);
-  EXPECT_EQ(3, graph()->NodeCount());
+  EXPECT_EQ(3U, graph()->NodeCount());
 
   Node* nend = graph()->end();
   EXPECT_NE(end, nend);
   EXPECT_EQ(&kOpC1, nend->op());
   EXPECT_EQ(1, nend->InputCount());
 
   Node* n1 = nend->InputAt(0);
   EXPECT_NE(end, n1);
   EXPECT_EQ(&kOpC1, n1->op());
   EXPECT_EQ(1, n1->InputCount());
@@ skipping 217 matching lines @@
       EXPECT_EQ(&kOpC0, n1->op());
       EXPECT_EQ(&kOpC1, end->op());
       EXPECT_EQ(n1, end->InputAt(0));
     }
   }
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8