Replace OVERRIDE->override and FINAL->final since we now require C++11.

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/graph.h"
 #include "src/compiler/graph-reducer.h"
 #include "src/compiler/node.h"
 #include "src/compiler/operator.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gmock/include/gmock/gmock.h"
@@ skipping 83 matching lines @@
         return Replace(
             graph_->NewNode(&kOpB2, node->InputAt(0), node->InputAt(1)));
     }
     return NoChange();
   }
   Graph* graph_;
 };
 
 
 // Wraps all "kOpA0" nodes in "kOpB1" operators by allocating new nodes.
-class A0Wrapper FINAL : public Reducer {
+class A0Wrapper final : public Reducer {
  public:
   explicit A0Wrapper(Graph* graph) : graph_(graph) {}
-  virtual Reduction Reduce(Node* node) OVERRIDE {
+  virtual Reduction Reduce(Node* node) override {
     switch (node->op()->opcode()) {
       case kOpcodeA0:
         EXPECT_EQ(0, node->InputCount());
         return Replace(graph_->NewNode(&kOpB1, node));
     }
     return NoChange();
   }
   Graph* graph_;
 };
 
 
 // Wraps all "kOpB0" nodes in two "kOpC1" operators by allocating new nodes.
-class B0Wrapper FINAL : public Reducer {
+class B0Wrapper final : public Reducer {
  public:
   explicit B0Wrapper(Graph* graph) : graph_(graph) {}
-  virtual Reduction Reduce(Node* node) OVERRIDE {
+  virtual Reduction Reduce(Node* node) override {
     switch (node->op()->opcode()) {
       case kOpcodeB0:
         EXPECT_EQ(0, node->InputCount());
         return Replace(graph_->NewNode(&kOpC1, graph_->NewNode(&kOpC1, node)));
     }
     return NoChange();
   }
   Graph* graph_;
 };
 
@@ skipping 530 matching lines @@
       EXPECT_EQ(&kOpC1, end->op());
       EXPECT_EQ(n1, end->InputAt(0));
     }
   }
 }
 
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8