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

src/compiler/node.h

Index: src/compiler/node.h
diff --git a/src/compiler/node.h b/src/compiler/node.h
index e4bd0d0bdc5b7fedbd239f64b9cc8c865eb4f624..54c01aa3b8d6e1537992133d635c5f951b2a4d04 100644
--- a/src/compiler/node.h
+++ b/src/compiler/node.h
@@ -39,7 +39,7 @@ typedef int32_t NodeId;
 // compilation, e.g. during lowering passes. Other information that needs to be
 // associated with Nodes during compilation must be stored out-of-line indexed
 // by the Node's id.
-class Node FINAL {
+class Node final {
  public:
   static Node* New(Zone* zone, NodeId id, const Operator* op, int input_count,
                    Node** inputs, bool has_extensible_inputs);
@@ -69,7 +69,7 @@ class Node FINAL {
   int UseCount() const;
   void ReplaceUses(Node* replace_to);
 
-  class InputEdges FINAL {
+  class InputEdges final {
    public:
     typedef Edge value_type;
 
@@ -87,7 +87,7 @@ class Node FINAL {
 
   InputEdges input_edges() { return InputEdges(this); }
 
-  class Inputs FINAL {
+  class Inputs final {
    public:
     typedef Node* value_type;
 
@@ -105,7 +105,7 @@ class Node FINAL {
 
   Inputs inputs() { return Inputs(this); }
 
-  class UseEdges FINAL {
+  class UseEdges final {
    public:
     typedef Edge value_type;
 
@@ -123,7 +123,7 @@ class Node FINAL {
 
   UseEdges use_edges() { return UseEdges(this); }
 
-  class Uses FINAL {
+  class Uses final {
    public:
     typedef Node* value_type;
 
@@ -147,14 +147,14 @@ class Node FINAL {
   }
 
  private:
-  struct Use FINAL : public ZoneObject {
+  struct Use final : public ZoneObject {
     Node* from;
     Use* next;
     Use* prev;
     int input_index;
   };
 
-  class Input FINAL {
+  class Input final {
    public:
     Node* to;
     Use* use;
@@ -262,7 +262,7 @@ static inline const T& OpParameter(const Node* node) {
 // An encapsulation for information associated with a single use of node as a
 // input from another node, allowing access to both the defining node and
 // the node having the input.
-class Edge FINAL {
+class Edge final {
  public:
   Node* from() const { return input_->use->from; }
   Node* to() const { return input_->to; }
@@ -288,7 +288,7 @@ class Edge FINAL {
 
 
 // A forward iterator to visit the edges for the input dependencies of a node.
-class Node::InputEdges::iterator FINAL {
+class Node::InputEdges::iterator final {
  public:
   typedef std::forward_iterator_tag iterator_category;
   typedef int difference_type;
@@ -341,7 +341,7 @@ Node::InputEdges::iterator Node::InputEdges::end() const {
 
 
 // A forward iterator to visit the inputs of a node.
-class Node::Inputs::const_iterator FINAL {
+class Node::Inputs::const_iterator final {
  public:
   typedef std::forward_iterator_tag iterator_category;
   typedef int difference_type;
@@ -386,7 +386,7 @@ Node::Inputs::const_iterator Node::Inputs::end() const {
 // A forward iterator to visit the uses edges of a node. The edges are returned
 // in
 // the order in which they were added as inputs.
-class Node::UseEdges::iterator FINAL {
+class Node::UseEdges::iterator final {
  public:
   iterator(const iterator& other)
       : current_(other.current_), next_(other.next_) {}
@@ -432,7 +432,7 @@ Node::UseEdges::iterator Node::UseEdges::end() const {
 
 // A forward iterator to visit the uses of a node. The uses are returned in
 // the order in which they were added as inputs.
-class Node::Uses::const_iterator FINAL {
+class Node::Uses::const_iterator final {
  public:
   typedef std::forward_iterator_tag iterator_category;
   typedef int difference_type;