1 /*
   2  * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"

  26 #include "opto/cfgnode.hpp"
  27 #include "opto/phaseX.hpp"
  28 #include "opto/replacednodes.hpp"
  29 
  30 void ReplacedNodes::allocate_if_necessary() {
  31   if (_replaced_nodes == NULL) {
  32     _replaced_nodes = new GrowableArray<ReplacedNode>();
  33   }
  34 }
  35 
  36 bool ReplacedNodes::is_empty() const {
  37   return _replaced_nodes == NULL || _replaced_nodes->length() == 0;
  38 }
  39 
  40 bool ReplacedNodes::has_node(const ReplacedNode& r) const {
  41   return _replaced_nodes->find(r) != -1;
  42 }
  43 
  44 bool ReplacedNodes::has_target_node(Node* n) const {
  45   for (int i = 0; i < _replaced_nodes->length(); i++) {

   1 /*
   2  * Copyright (c) 2016, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "memory/resourceArea.hpp"
  27 #include "opto/cfgnode.hpp"
  28 #include "opto/phaseX.hpp"
  29 #include "opto/replacednodes.hpp"
  30 
  31 void ReplacedNodes::allocate_if_necessary() {
  32   if (_replaced_nodes == NULL) {
  33     _replaced_nodes = new GrowableArray<ReplacedNode>();
  34   }
  35 }
  36 
  37 bool ReplacedNodes::is_empty() const {
  38   return _replaced_nodes == NULL || _replaced_nodes->length() == 0;
  39 }
  40 
  41 bool ReplacedNodes::has_node(const ReplacedNode& r) const {
  42   return _replaced_nodes->find(r) != -1;
  43 }
  44 
  45 bool ReplacedNodes::has_target_node(Node* n) const {
  46   for (int i = 0; i < _replaced_nodes->length(); i++) {