Greenify NaCl build

test/cctest/compiler/test-graph-reducer.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/v8.h"
 
 #include "graph-tester.h"
 #include "src/compiler/generic-node-inl.h"
 #include "src/compiler/graph-reducer.h"
 
@@ skipping 472 matching lines @@
 
 TEST(Sorter1) {
   HandleAndZoneScope scope;
   AB2Sorter r;
   for (int i = 0; i < 6; i++) {
     GraphTester graph;
 
     Node* n1 = graph.NewNode(&OPA0);
     Node* n2 = graph.NewNode(&OPA1, n1);
     Node* n3 = graph.NewNode(&OPA1, n1);
-    Node* end;
+    Node* end = NULL;  // Initialize to please the compiler.
 
     if (i == 0) end = graph.NewNode(&OPA2, n2, n3);
     if (i == 1) end = graph.NewNode(&OPA2, n3, n2);
     if (i == 2) end = graph.NewNode(&OPA2, n2, n1);
     if (i == 3) end = graph.NewNode(&OPA2, n1, n2);
     if (i == 4) end = graph.NewNode(&OPA2, n3, n1);
     if (i == 5) end = graph.NewNode(&OPA2, n1, n3);
 
     graph.SetEnd(end);
 
@@ skipping 148 matching lines @@
   reducer.AddReducer(&once);
 
   // Tests A* => B* with in-place updates. Should only be applied once.
   int before = graph.NodeCount();
   reducer.ReduceGraph();
   CHECK_EQ(before, graph.NodeCount());
   CHECK_EQ(&OPB0, n1->op());
   CHECK_EQ(&OPB1, end->op());
   CHECK_EQ(n1, end->InputAt(0));
 }