Use Chrome compatible naming for compiler specifics.

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 84 matching lines @@
         CHECK_EQ(2, node->InputCount());
         node->set_op(&OPC2);
         return Replace(node);
     }
     return NoChange();
   }
 };
 
 
 // Wraps all "OPA0" nodes in "OPB1" operators by allocating new nodes.
-class A0Wrapper V8_FINAL : public Reducer {
+class A0Wrapper FINAL : public Reducer {
  public:
   explicit A0Wrapper(Graph* graph) : graph_(graph) {}
-  virtual Reduction Reduce(Node* node) V8_OVERRIDE {
+  virtual Reduction Reduce(Node* node) OVERRIDE {
     switch (node->op()->opcode()) {
       case OPCODE_A0:
         CHECK_EQ(0, node->InputCount());
         return Replace(graph_->NewNode(&OPB1, node));
     }
     return NoChange();
   }
   Graph* graph_;
 };
 
 
 // Wraps all "OPB0" nodes in two "OPC1" operators by allocating new nodes.
-class B0Wrapper V8_FINAL : public Reducer {
+class B0Wrapper FINAL : public Reducer {
  public:
   explicit B0Wrapper(Graph* graph) : graph_(graph) {}
-  virtual Reduction Reduce(Node* node) V8_OVERRIDE {
+  virtual Reduction Reduce(Node* node) OVERRIDE {
     switch (node->op()->opcode()) {
       case OPCODE_B0:
         CHECK_EQ(0, node->InputCount());
         return Replace(graph_->NewNode(&OPC1, graph_->NewNode(&OPC1, node)));
     }
     return NoChange();
   }
   Graph* graph_;
 };
 
@@ skipping 517 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));
 }