54     Node* improved() const { return _improved; }
  55 
  56     bool operator==(const ReplacedNode& other) {
  57       return _initial == other._initial && _improved == other._improved;
  58     }
  59   };
  60   GrowableArray<ReplacedNode>* _replaced_nodes;
  61 
  62   void allocate_if_necessary();
  63   bool has_node(const ReplacedNode& r) const;
  64   bool has_target_node(Node* n) const;
  65 
  66  public:
  67   ReplacedNodes()
  68     : _replaced_nodes(NULL) {}
  69 
  70   void clone();
  71   void record(Node* initial, Node* improved);
  72   void transfer_from(const ReplacedNodes& other, uint idx);
  73   void reset();
  74   void apply(Node* n);
  75   void merge_with(const ReplacedNodes& other);
  76   bool is_empty() const;
  77   void dump(outputStream *st) const;
  78   void apply(Compile* C, Node* ctl);
  79 };
  80 
  81 #endif // SHARE_VM_OPTO_REPLACEDNODES_HPP

  54     Node* improved() const { return _improved; }
  55 
  56     bool operator==(const ReplacedNode& other) {
  57       return _initial == other._initial && _improved == other._improved;
  58     }
  59   };
  60   GrowableArray<ReplacedNode>* _replaced_nodes;
  61 
  62   void allocate_if_necessary();
  63   bool has_node(const ReplacedNode& r) const;
  64   bool has_target_node(Node* n) const;
  65 
  66  public:
  67   ReplacedNodes()
  68     : _replaced_nodes(NULL) {}
  69 
  70   void clone();
  71   void record(Node* initial, Node* improved);
  72   void transfer_from(const ReplacedNodes& other, uint idx);
  73   void reset();
  74   void apply(Node* n, uint idx);
  75   void merge_with(const ReplacedNodes& other);
  76   bool is_empty() const;
  77   void dump(outputStream *st) const;
  78   void apply(Compile* C, Node* ctl);
  79 };
  80 
  81 #endif // SHARE_VM_OPTO_REPLACEDNODES_HPP