1 /*
   2  * Copyright (c) 2013, 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 package org.graalvm.compiler.phases.common;
  24 
  25 import org.graalvm.compiler.debug.Debug;
  26 import org.graalvm.compiler.debug.DebugCounter;
  27 import org.graalvm.compiler.graph.Node;
  28 import org.graalvm.compiler.nodes.PiNode;
  29 import org.graalvm.compiler.nodes.StructuredGraph;
  30 import org.graalvm.compiler.nodes.spi.PiPushable;
  31 import org.graalvm.compiler.phases.Phase;
  32 
  33 public class PushThroughPiPhase extends Phase {
  34 
  35     public static final DebugCounter PUSHED_NODES = Debug.counter("NodesPushedThroughPi");
  36 
  37     @Override
  38     protected void run(StructuredGraph graph) {
  39         for (PiNode pi : graph.getNodes(PiNode.TYPE)) {
  40             for (Node n : pi.usages().snapshot()) {
  41                 if (n instanceof PiPushable) {
  42                     PiPushable pip = (PiPushable) n;
  43                     if (pip.push(pi)) {
  44                         PUSHED_NODES.add(1);
  45                     }
  46                 }
  47             }
  48         }
  49     }
  50 }