1 /* 2 * Copyright (c) 2012, 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 static org.graalvm.compiler.graph.Graph.NodeEvent.NODE_ADDED; 26 import static org.graalvm.compiler.graph.Graph.NodeEvent.ZERO_USAGES; 27 28 import org.graalvm.compiler.common.RetryableBailoutException; 29 import org.graalvm.compiler.graph.Graph.NodeEventScope; 30 import org.graalvm.compiler.graph.Node; 31 import org.graalvm.compiler.graph.spi.Simplifiable; 32 import org.graalvm.compiler.nodes.StructuredGraph; 33 import org.graalvm.compiler.phases.BasePhase; 34 import org.graalvm.compiler.phases.common.util.HashSetNodeEventListener; 35 import org.graalvm.compiler.phases.tiers.PhaseContext; 36 37 public class IterativeConditionalEliminationPhase extends BasePhase<PhaseContext> { 38 39 private static final int MAX_ITERATIONS = 256; 40 41 private final CanonicalizerPhase canonicalizer; 42 private final boolean fullSchedule; 43 44 public IterativeConditionalEliminationPhase(CanonicalizerPhase canonicalizer, boolean fullSchedule) { 45 this.canonicalizer = canonicalizer; 46 this.fullSchedule = fullSchedule; 47 } 48 49 @Override 50 @SuppressWarnings("try") 51 protected void run(StructuredGraph graph, PhaseContext context) { 52 HashSetNodeEventListener listener = new HashSetNodeEventListener().exclude(NODE_ADDED).exclude(ZERO_USAGES); 53 int count = 0; 54 while (true) { 55 try (NodeEventScope nes = graph.trackNodeEvents(listener)) { 56 new DominatorConditionalEliminationPhase(fullSchedule).apply(graph, context); 57 } 58 if (listener.getNodes().isEmpty()) { 59 break; 60 } 61 for (Node node : graph.getNodes()) { 62 if (node instanceof Simplifiable) { 63 listener.getNodes().add(node); 64 } 65 } 66 canonicalizer.applyIncremental(graph, context, listener.getNodes()); 67 listener.getNodes().clear(); 68 if (++count > MAX_ITERATIONS) { 69 throw new RetryableBailoutException("Number of iterations in ConditionalEliminationPhase phase exceeds %d", MAX_ITERATIONS); 70 } 71 } 72 } 73 74 @Override 75 public float codeSizeIncrease() { 76 return 2.0f; 77 } 78 }