Use Chrome compatible naming for compiler specifics.

src/compiler/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/compiler/graph-reducer.h"
 
 #include <functional>
 
 #include "src/compiler/graph-inl.h"
 
@@ skipping 54 matching lines @@
         node = replacement;
         reduce = true;
         break;
       }
     }
   }
 }
 
 
 // A helper class to reuse the node traversal algorithm.
-struct GraphReducerVisitor V8_FINAL : public NullNodeVisitor {
+struct GraphReducerVisitor FINAL : public NullNodeVisitor {
   explicit GraphReducerVisitor(GraphReducer* reducer) : reducer_(reducer) {}
   GenericGraphVisit::Control Post(Node* node) {
     reducer_->ReduceNode(node);
     return GenericGraphVisit::CONTINUE;
   }
   GraphReducer* reducer_;
 };
 
 
 void GraphReducer::ReduceGraph() {
   GraphReducerVisitor visitor(this);
   // Perform a post-order reduction of all nodes starting from the end.
   graph()->VisitNodeInputsFromEnd(&visitor);
 }
 
 
 // TODO(titzer): partial graph reductions.
 }
 }
 }  // namespace v8::internal::compiler