Mercurial > hg > graal-jvmci-8
view graal/com.oracle.max.graal.compiler/src/com/oracle/max/graal/compiler/nodes/base/PhiNode.java @ 3529:d683f8a40c05
Second round of refactoring.
author | Thomas Wuerthinger <thomas@wuerthinger.net> |
---|---|
date | Wed, 10 Aug 2011 00:34:29 +0200 |
parents | |
children |
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.oracle.max.graal.compiler.nodes.base; import java.util.*; import com.oracle.max.graal.compiler.*; import com.oracle.max.graal.compiler.debug.*; import com.oracle.max.graal.compiler.nodes.base.StateSplit.FilteringIterator; import com.oracle.max.graal.compiler.nodes.calc.*; import com.oracle.max.graal.compiler.nodes.spi.*; import com.oracle.max.graal.graph.*; import com.sun.cri.ci.*; /** * The {@code Phi} instruction represents the merging of dataflow in the instruction graph. It refers to a join block * and a variable. */ public final class PhiNode extends FloatingNode implements Canonicalizable { @Input private MergeNode merge; @Input private final NodeInputList<ValueNode> values = new NodeInputList<ValueNode>(this); public MergeNode merge() { return merge; } public void setMerge(MergeNode x) { updateUsages(merge, x); merge = x; } public static enum PhiType { Value, // normal value phis Memory, // memory phis Virtual // phis used for VirtualObjectField merges } private final PhiType type; public PhiNode(CiKind kind, MergeNode merge, PhiType type, Graph graph) { super(kind, graph); this.type = type; setMerge(merge); } private PhiNode(CiKind kind, PhiType type, Graph graph) { super(kind, graph); this.type = type; } public PhiType type() { return type; } @Override public boolean verify() { assertTrue(merge() != null); assertTrue(merge().phiPredecessorCount() == valueCount(), merge().phiPredecessorCount() + "==" + valueCount()); return true; } /** * Get the instruction that produces the value associated with the i'th predecessor of the join block. * * @param i the index of the predecessor * @return the instruction that produced the value in the i'th predecessor */ public ValueNode valueAt(int i) { return values.get(i); } public void setValueAt(int i, ValueNode x) { values.set(i, x); } /** * Get the number of inputs to this phi (i.e. the number of predecessors to the join block). * * @return the number of inputs in this phi */ public int valueCount() { return values.size(); } @Override public void accept(ValueVisitor v) { v.visitPhi(this); } @Override public String shortName() { StringBuilder str = new StringBuilder(); for (int i = 0; i < valueCount(); ++i) { if (i != 0) { str.append(' '); } str.append(valueAt(i) == null ? "-" : valueAt(i).id()); } if (type == PhiType.Value) { return "Phi: (" + str + ")"; } else { return type + "Phi: (" + str + ")"; } } public void addInput(ValueNode x) { values.add(x); } public void removeInput(int index) { values.remove(index); } @Override public Iterable< ? extends Node> dataInputs() { final Iterator< ? extends Node> input = super.dataInputs().iterator(); return new Iterable<Node>() { @Override public Iterator<Node> iterator() { return new FilteringIterator(input, MergeNode.class); } }; } @Override public Node canonical(NotifyReProcess reProcess) { if (valueCount() != 2 || merge().endCount() != 2) { return this; } if (merge().phis().size() > 1) { // XXX (gd) disable canonicalization of multiple conditional while we are not able to fuse them and the potentially leftover If in the backend return this; } Node end0 = merge().endAt(0); Node end1 = merge().endAt(1); Node endPred0 = end0.predecessor(); Node endPred1 = end1.predecessor(); if (endPred0 != endPred1 || !(endPred0 instanceof IfNode)) { return this; } IfNode ifNode = (IfNode) endPred0; boolean inverted = ifNode.trueSuccessor() == end1; ValueNode trueValue = valueAt(inverted ? 1 : 0); ValueNode falseValue = valueAt(inverted ? 0 : 1); if ((trueValue.kind != CiKind.Int && trueValue.kind != CiKind.Long) || (falseValue.kind != CiKind.Int && falseValue.kind != CiKind.Long)) { return this; } if ((!(trueValue instanceof ConstantNode) && trueValue.usages().size() == 1) || (!(falseValue instanceof ConstantNode) && falseValue.usages().size() == 1)) { return this; } BooleanNode compare = ifNode.compare(); while (compare instanceof NegateBooleanNode) { compare = ((NegateBooleanNode) compare).value(); } if (!(compare instanceof CompareNode || compare instanceof IsNonNullNode || compare instanceof NegateBooleanNode || compare instanceof ConstantNode)) { return this; } if (GraalOptions.TraceCanonicalizer) { TTY.println("> Phi canon'ed to Conditional"); } reProcess.reProccess(ifNode); return new ConditionalNode(ifNode.compare(), trueValue, falseValue, graph()); } }