Mercurial > hg > graal-compiler
view graal/com.oracle.graal.virtual/src/com/oracle/graal/virtual/phases/ea/EffectsPhase.java @ 11881:da9db8331658
moved Canonicalizable and Simplifiable to the com.oracle.graal.graph project (GRAAL-506)
author | Doug Simon <doug.simon@oracle.com> |
---|---|
date | Tue, 01 Oct 2013 20:38:25 +0200 |
parents | 5bbc028f4507 |
children | 8569b9e047cd |
line wrap: on
line source
/* * Copyright (c) 2011, 2012, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.oracle.graal.virtual.phases.ea; import java.util.concurrent.*; import com.oracle.graal.debug.*; import com.oracle.graal.graph.*; import com.oracle.graal.graph.spi.*; import com.oracle.graal.nodes.*; import com.oracle.graal.phases.*; import com.oracle.graal.phases.common.*; import com.oracle.graal.phases.common.util.*; import com.oracle.graal.phases.graph.*; import com.oracle.graal.phases.schedule.*; import com.oracle.graal.phases.tiers.*; public abstract class EffectsPhase<PhaseContextT extends PhaseContext> extends BasePhase<PhaseContextT> { public abstract static class Closure<T> extends ReentrantBlockIterator.BlockIteratorClosure<T> { public abstract boolean hasChanged(); public abstract void applyEffects(); } private final int maxIterations; private final CanonicalizerPhase canonicalizer; public EffectsPhase(int maxIterations, CanonicalizerPhase canonicalizer) { this.maxIterations = maxIterations; this.canonicalizer = canonicalizer; } @Override protected void run(StructuredGraph graph, PhaseContextT context) { runAnalysis(graph, context); } public boolean runAnalysis(final StructuredGraph graph, final PhaseContextT context) { boolean changed = false; for (int iteration = 0; iteration < maxIterations; iteration++) { boolean currentChanged = Debug.scope("iteration " + iteration, new Callable<Boolean>() { @Override public Boolean call() { SchedulePhase schedule = new SchedulePhase(); schedule.apply(graph, false); Closure<?> closure = createEffectsClosure(context, schedule); ReentrantBlockIterator.apply(closure, schedule.getCFG().getStartBlock()); if (!closure.hasChanged()) { return false; } // apply the effects collected during this iteration HashSetNodeChangeListener listener = new HashSetNodeChangeListener(); graph.trackInputChange(listener); graph.trackUsagesDroppedZero(listener); closure.applyEffects(); graph.stopTrackingInputChange(); graph.stopTrackingUsagesDroppedZero(); Debug.dump(graph, "after " + getName() + " iteration"); new DeadCodeEliminationPhase().apply(graph); for (Node node : graph.getNodes()) { if (node instanceof Simplifiable) { listener.getChangedNodes().add(node); } } canonicalizer.applyIncremental(graph, context, listener.getChangedNodes()); return true; } }); if (!currentChanged) { break; } changed |= currentChanged; } return changed; } protected abstract Closure<?> createEffectsClosure(PhaseContextT context, SchedulePhase schedule); }