Mercurial > hg > graal-compiler
view graal/GraalCompiler/src/com/sun/c1x/gen/PhiSimplifier.java @ 2827:bd17ac598c6e
Graph cloning, initial version (not completely working)
author | Lukas Stadler <lukas.stadler@jku.at> |
---|---|
date | Mon, 30 May 2011 18:46:57 +0200 |
parents | 015be60afcf3 |
children | 7f14e6b48a9c |
line wrap: on
line source
/* * Copyright (c) 2009, 2011, 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.sun.c1x.gen; import com.oracle.graal.graph.*; import com.sun.c1x.graph.*; import com.sun.c1x.ir.*; /** * The {@code PhiSimplifier} class is a helper class that can reduce phi instructions. */ public final class PhiSimplifier { private NodeBitMap visited; private NodeBitMap cannotSimplify; public PhiSimplifier(IR ir) { Graph graph = ir.compilation.graph; visited = graph.createNodeBitMap(); cannotSimplify = graph.createNodeBitMap(); for (Node n : graph.getNodes()) { if (n instanceof Phi) { simplify((Phi) n); } } } private Value simplify(Value x) { if (x == null || !(x instanceof Phi)) { return x; } Phi phi = (Phi) x; if (phi.valueCount() == 1 && !cannotSimplify.isMarked(phi)) { return (Value) phi.replace(phi.valueAt(0)); } if (cannotSimplify.isMarked(phi)) { // already tried, cannot simplify this phi return phi; } else if (visited.isMarked(phi)) { // break cycles in phis return phi; } else if (phi.isDead()) { // don't bother with illegals return phi; } else { // attempt to simplify the phi by recursively simplifying its operands visited.mark(phi); Value phiSubst = null; int max = phi.valueCount(); boolean cannotSimplify = false; for (int i = 0; i < max; i++) { Value oldInstr = phi.valueAt(i); if (oldInstr == null || (oldInstr instanceof Phi && ((Phi) oldInstr).isDead())) { // if one operand is illegal, make the entire phi illegal phi.makeDead(); visited.clear(phi); return phi; } Value newInstr = simplify(oldInstr); if (newInstr == null || (newInstr instanceof Phi && ((Phi) newInstr).isDead())) { // if the subst instruction is illegal, make the entire phi illegal phi.makeDead(); visited.clear(phi); return phi; } // attempt to simplify this operand if (!cannotSimplify) { if (newInstr != phi && newInstr != phiSubst) { if (phiSubst == null) { phiSubst = newInstr; continue; } // this phi cannot be simplified cannotSimplify = true; } } } if (cannotSimplify) { this.cannotSimplify.mark(phi); visited.clear(phi); return phi; } // successfully simplified the phi assert phiSubst != null : "illegal phi function"; visited.clear(phi); phi.replace(phiSubst); return phiSubst; } } }