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

src/compiler/control-equivalence.h

 // 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.
 
 #ifndef V8_COMPILER_CONTROL_EQUIVALENCE_H_
 #define V8_COMPILER_CONTROL_EQUIVALENCE_H_
 
 #include "src/compiler/graph.h"
 #include "src/compiler/node.h"
 #include "src/zone-containers.h"
@@ skipping 10 matching lines @@
 //
 // Note that this implementation actually uses cycle equivalence to establish
 // class numbers. Any two nodes are cycle equivalent if they occur in the same
 // set of cycles. It can be shown that control dependence equivalence reduces
 // to undirected cycle equivalence for strongly connected control flow graphs.
 //
 // The algorithm is based on the paper, "The program structure tree: computing
 // control regions in linear time" by Johnson, Pearson & Pingali (PLDI94) which
 // also contains proofs for the aforementioned equivalence. References to line
 // numbers in the algorithm from figure 4 have been added [line:x].
-class ControlEquivalence FINAL : public ZoneObject {
+class ControlEquivalence final : public ZoneObject {
  public:
   ControlEquivalence(Zone* zone, Graph* graph)
       : zone_(zone),
         graph_(graph),
         dfs_number_(0),
         class_number_(1),
         node_data_(graph->NodeCount(), EmptyData(), zone) {}
 
   // Run the main algorithm starting from the {exit} control node. This causes
   // the following iterations over control edges of the graph:
@@ skipping 120 matching lines @@
   int dfs_number_;    // Generates new DFS pre-order numbers on demand.
   int class_number_;  // Generates new equivalence class numbers on demand.
   Data node_data_;    // Per-node data stored as a side-table.
 };
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_COMPILER_CONTROL_EQUIVALENCE_H_