Mercurial > hg > truffle
changeset 7767:4a6646d8eb87
separate BooleanNode and ConstantNode hierarchy, rename BooleanNode to LogicNode and LogicNode to BitLogicNode
line wrap: on
line diff
--- a/graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/gen/LIRGenerator.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/gen/LIRGenerator.java Mon Feb 11 15:55:27 2013 +0100 @@ -585,10 +585,10 @@ } @Override - public void emitGuardCheck(BooleanNode comp, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated) { + public void emitGuardCheck(LogicNode comp, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated) { if (comp instanceof IsNullNode && negated) { emitNullCheckGuard(((IsNullNode) comp).object()); - } else if (comp instanceof ConstantNode && (comp.asConstant().asBoolean() != negated)) { + } else if (comp instanceof LogicConstantNode && ((LogicConstantNode) comp).getValue() != negated) { // True constant, nothing to emit. // False constants are handled within emitBranch. } else { @@ -605,13 +605,13 @@ protected abstract void emitNullCheckGuard(ValueNode object); - public void emitBranch(BooleanNode node, LabelRef trueSuccessor, LabelRef falseSuccessor, LIRFrameState info) { + public void emitBranch(LogicNode node, LabelRef trueSuccessor, LabelRef falseSuccessor, LIRFrameState info) { if (node instanceof IsNullNode) { emitNullCheckBranch((IsNullNode) node, trueSuccessor, falseSuccessor, info); } else if (node instanceof CompareNode) { emitCompareBranch((CompareNode) node, trueSuccessor, falseSuccessor, info); - } else if (node instanceof ConstantNode) { - emitConstantBranch(((ConstantNode) node).asConstant().asBoolean(), trueSuccessor, falseSuccessor, info); + } else if (node instanceof LogicConstantNode) { + emitConstantBranch(((LogicConstantNode) node).getValue(), trueSuccessor, falseSuccessor, info); } else if (node instanceof IntegerTestNode) { emitIntegerTestBranch((IntegerTestNode) node, trueSuccessor, falseSuccessor, info); } else { @@ -666,16 +666,15 @@ setResult(conditional, emitConditional(conditional.condition(), tVal, fVal)); } - public Variable emitConditional(BooleanNode node, Value trueValue, Value falseValue) { + public Variable emitConditional(LogicNode node, Value trueValue, Value falseValue) { if (node instanceof IsNullNode) { IsNullNode isNullNode = (IsNullNode) node; return emitConditionalMove(operand(isNullNode.object()), Constant.NULL_OBJECT, Condition.EQ, false, trueValue, falseValue); } else if (node instanceof CompareNode) { CompareNode compare = (CompareNode) node; return emitConditionalMove(operand(compare.x()), operand(compare.y()), compare.condition(), compare.unorderedIsTrue(), trueValue, falseValue); - } else if (node instanceof ConstantNode) { - ConstantNode constantNode = (ConstantNode) node; - return emitMove(constantNode.asConstant().asBoolean() ? trueValue : falseValue); + } else if (node instanceof LogicConstantNode) { + return emitMove(((LogicConstantNode) node).getValue() ? trueValue : falseValue); } else if (node instanceof IntegerTestNode) { IntegerTestNode test = (IntegerTestNode) node; return emitIntegerTestMove(operand(test.x()), operand(test.y()), trueValue, falseValue);
--- a/graal/com.oracle.graal.java/src/com/oracle/graal/java/GraphBuilderPhase.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.java/src/com/oracle/graal/java/GraphBuilderPhase.java Mon Feb 11 15:55:27 2013 +0100 @@ -512,7 +512,7 @@ private void genLogicOp(Kind kind, int opcode) { ValueNode y = frameState.pop(kind); ValueNode x = frameState.pop(kind); - LogicNode v; + BitLogicNode v; switch (opcode) { case IAND: case LAND:
--- a/graal/com.oracle.graal.loop/src/com/oracle/graal/loop/LoopsData.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.loop/src/com/oracle/graal/loop/LoopsData.java Mon Feb 11 15:55:27 2013 +0100 @@ -102,7 +102,7 @@ } negated = true; } - BooleanNode ifTest = ifNode.condition(); + LogicNode ifTest = ifNode.condition(); if (!(ifTest instanceof IntegerLessThanNode)) { if (ifTest instanceof IntegerBelowThanNode) { Debug.log("Ignored potential Counted loop at %s with |<|", loopBegin);
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/BooleanNode.java Mon Feb 11 10:46:48 2013 +0100 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000 @@ -1,50 +0,0 @@ -/* - * Copyright (c) 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.graal.nodes; - -import com.oracle.graal.graph.*; -import com.oracle.graal.nodes.calc.*; -import com.oracle.graal.nodes.spi.*; -import com.oracle.graal.nodes.type.*; - -public abstract class BooleanNode extends FloatingNode { - - public BooleanNode(Stamp stamp) { - super(stamp); - } - - public BooleanNode(Stamp stamp, ValueNode... dependencies) { - super(stamp, dependencies); - } - - /** - * Tells all usages of this node to negate their effect. For example, IfNodes should switch - * their true and false successors. - */ - public void negateUsages() { - for (Node n : usages().snapshot()) { - assert n instanceof Negatable; - ((Negatable) n).negate(); - } - } -}
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/ConstantNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/ConstantNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -27,6 +27,7 @@ import com.oracle.graal.api.meta.*; import com.oracle.graal.graph.*; import com.oracle.graal.graph.iterators.*; +import com.oracle.graal.nodes.calc.*; import com.oracle.graal.nodes.spi.*; import com.oracle.graal.nodes.type.*; @@ -35,7 +36,7 @@ * reference, address, etc. */ @NodeInfo(shortName = "Const", nameTemplate = "Const({p#rawvalue})") -public class ConstantNode extends BooleanNode implements LIRLowerable { +public class ConstantNode extends FloatingNode implements LIRLowerable { public final Constant value;
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/FixedGuardNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/FixedGuardNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -31,25 +31,25 @@ @NodeInfo(nameTemplate = "FixedGuard(!={p#negated}) {p#reason/s}") public final class FixedGuardNode extends FixedWithNextNode implements Simplifiable, Lowerable, LIRLowerable, Node.IterableNodeType, Negatable { - @Input private BooleanNode condition; + @Input private LogicNode condition; private final DeoptimizationReason reason; private final DeoptimizationAction action; private boolean negated; - public BooleanNode condition() { + public LogicNode condition() { return condition; } - public void setCondition(BooleanNode x) { + public void setCondition(LogicNode x) { updateUsages(condition, x); condition = x; } - public FixedGuardNode(BooleanNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action) { + public FixedGuardNode(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action) { this(condition, deoptReason, action, false); } - public FixedGuardNode(BooleanNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated) { + public FixedGuardNode(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated) { super(StampFactory.forVoid()); this.action = action; this.negated = negated; @@ -85,9 +85,9 @@ @Override public void simplify(SimplifierTool tool) { - if (condition instanceof ConstantNode) { - ConstantNode c = (ConstantNode) condition; - if (c.asConstant().asBoolean() != negated) { + if (condition instanceof LogicConstantNode) { + LogicConstantNode c = (LogicConstantNode) condition; + if (c.getValue() != negated) { ((StructuredGraph) graph()).removeFixed(this); } else { FixedNode next = this.next();
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/GuardNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/GuardNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -44,12 +44,12 @@ @NodeInfo(nameTemplate = "Guard(!={p#negated}) {p#reason/s}") public final class GuardNode extends FloatingNode implements Canonicalizable, LIRLowerable, Node.IterableNodeType, Negatable { - @Input private BooleanNode condition; + @Input private LogicNode condition; private final DeoptimizationReason reason; private final DeoptimizationAction action; private boolean negated; - public GuardNode(BooleanNode condition, FixedNode anchor, DeoptimizationReason reason, DeoptimizationAction action, boolean negated) { + public GuardNode(LogicNode condition, FixedNode anchor, DeoptimizationReason reason, DeoptimizationAction action, boolean negated) { super(StampFactory.dependency(), anchor); this.condition = condition; this.reason = reason; @@ -60,11 +60,11 @@ /** * The instruction that produces the tested boolean value. */ - public BooleanNode condition() { + public LogicNode condition() { return condition; } - public void setCondition(BooleanNode x) { + public void setCondition(LogicNode x) { updateUsages(condition, x); condition = x; } @@ -97,9 +97,9 @@ @Override public ValueNode canonical(CanonicalizerTool tool) { - if (condition() instanceof ConstantNode) { - ConstantNode c = (ConstantNode) condition(); - if (c.asConstant().asBoolean() != negated) { + if (condition() instanceof LogicConstantNode) { + LogicConstantNode c = (LogicConstantNode) condition(); + if (c.getValue() != negated) { if (!dependencies().isEmpty()) { for (Node usage : usages()) { if (usage instanceof ValueNode) {
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/IfNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/IfNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -41,23 +41,23 @@ @Successor private BeginNode trueSuccessor; @Successor private BeginNode falseSuccessor; - @Input private BooleanNode condition; + @Input private LogicNode condition; private double trueSuccessorProbability; - public BooleanNode condition() { + public LogicNode condition() { return condition; } - public void setCondition(BooleanNode x) { + public void setCondition(LogicNode x) { updateUsages(condition, x); condition = x; } - public IfNode(BooleanNode condition, FixedNode trueSuccessor, FixedNode falseSuccessor, double trueSuccessorProbability) { + public IfNode(LogicNode condition, FixedNode trueSuccessor, FixedNode falseSuccessor, double trueSuccessorProbability) { this(condition, BeginNode.begin(trueSuccessor), BeginNode.begin(falseSuccessor), trueSuccessorProbability); } - public IfNode(BooleanNode condition, BeginNode trueSuccessor, BeginNode falseSuccessor, double trueSuccessorProbability) { + public IfNode(LogicNode condition, BeginNode trueSuccessor, BeginNode falseSuccessor, double trueSuccessorProbability) { super(StampFactory.forVoid()); this.condition = condition; this.falseSuccessor = falseSuccessor; @@ -140,9 +140,9 @@ @Override public void simplify(SimplifierTool tool) { - if (condition() instanceof ConstantNode) { - ConstantNode c = (ConstantNode) condition(); - if (c.asConstant().asBoolean()) { + if (condition() instanceof LogicConstantNode) { + LogicConstantNode c = (LogicConstantNode) condition(); + if (c.getValue()) { tool.deleteBranch(falseSuccessor()); tool.addToWorkList(trueSuccessor()); ((StructuredGraph) graph()).removeSplit(this, trueSuccessor());
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/LogicConstantNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -0,0 +1,74 @@ +/* + * 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.graal.nodes; + +import com.oracle.graal.graph.*; +import com.oracle.graal.nodes.spi.*; + +/** + * The {@code ConstantNode} represents a constant such as an integer value, long, float, object + * reference, address, etc. + */ +@NodeInfo(nameTemplate = "{p#value}") +public class LogicConstantNode extends LogicNode implements LIRLowerable { + + public final boolean value; + + protected LogicConstantNode(boolean value) { + super(); + this.value = value; + } + + /** + * Returns a node for a boolean constant. + * + * @param v the boolean value for which to create the instruction + * @param graph + * @return a node representing the boolean + */ + public static LogicConstantNode forBoolean(boolean v, Graph graph) { + return graph.unique(new LogicConstantNode(v)); + } + + public static LogicConstantNode tautology(Graph graph) { + return forBoolean(true, graph); + } + + public static LogicConstantNode contradiction(Graph graph) { + return forBoolean(false, graph); + } + + public boolean getValue() { + return value; + } + + @Override + public LogicNode canonical(CanonicalizerTool tool) { + throw new GraalInternalError("shouldn't call canonical on LogicConstantNode"); + } + + @Override + public void generate(LIRGeneratorTool generator) { + // nothing to do + } +}
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/LogicNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -0,0 +1,49 @@ +/* + * Copyright (c) 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.graal.nodes; + +import com.oracle.graal.graph.*; +import com.oracle.graal.nodes.calc.*; +import com.oracle.graal.nodes.spi.*; +import com.oracle.graal.nodes.type.*; + +public abstract class LogicNode extends FloatingNode { + + public LogicNode(ValueNode... dependencies) { + super(StampFactory.condition(), dependencies); + } + + /** + * Tells all usages of this node to negate their effect. For example, IfNodes should switch + * their true and false successors. + */ + public void negateUsages() { + for (Node n : usages().snapshot()) { + assert n instanceof Negatable; + ((Negatable) n).negate(); + } + } + + // forces all subclasses to canonicalize to BooleanNode instances + public abstract LogicNode canonical(CanonicalizerTool tool); +}
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/AndNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/AndNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -29,7 +29,7 @@ import com.oracle.graal.nodes.type.*; @NodeInfo(shortName = "&") -public final class AndNode extends LogicNode implements Canonicalizable, LIRLowerable { +public final class AndNode extends BitLogicNode implements Canonicalizable, LIRLowerable { public AndNode(Kind kind, ValueNode x, ValueNode y) { super(kind, x, y);
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/BinaryNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/BinaryNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -175,11 +175,11 @@ } else if (node instanceof IntegerMulNode) { return IntegerArithmeticNode.mul(a, IntegerAddNode.mul(m1, m2)); } else if (node instanceof AndNode) { - return LogicNode.and(a, LogicNode.and(m1, m2)); + return BitLogicNode.and(a, BitLogicNode.and(m1, m2)); } else if (node instanceof OrNode) { - return LogicNode.or(a, LogicNode.or(m1, m2)); + return BitLogicNode.or(a, BitLogicNode.or(m1, m2)); } else if (node instanceof XorNode) { - return LogicNode.xor(a, LogicNode.xor(m1, m2)); + return BitLogicNode.xor(a, BitLogicNode.xor(m1, m2)); } else { throw GraalInternalError.shouldNotReachHere(); }
--- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/BitLogicNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -0,0 +1,83 @@ +/* + * 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.graal.nodes.calc; + +import com.oracle.graal.api.meta.*; +import com.oracle.graal.graph.*; +import com.oracle.graal.nodes.*; + +/** + * The {@code LogicNode} class definition. + */ +public abstract class BitLogicNode extends BinaryNode { + + /** + * Constructs a new logic operation node. + * + * @param x the first input into this node + * @param y the second input into this node + */ + public BitLogicNode(Kind kind, ValueNode x, ValueNode y) { + super(kind, x, y); + assert kind == Kind.Int || kind == Kind.Long; + } + + public static BitLogicNode and(ValueNode v1, ValueNode v2) { + assert v1.kind() == v2.kind() && v1.graph() == v2.graph(); + Graph graph = v1.graph(); + switch (v1.kind()) { + case Int: + return graph.unique(new AndNode(Kind.Int, v1, v2)); + case Long: + return graph.unique(new AndNode(Kind.Long, v1, v2)); + default: + throw ValueNodeUtil.shouldNotReachHere(); + } + } + + public static BitLogicNode or(ValueNode v1, ValueNode v2) { + assert v1.kind() == v2.kind() && v1.graph() == v2.graph(); + Graph graph = v1.graph(); + switch (v1.kind()) { + case Int: + return graph.unique(new OrNode(Kind.Int, v1, v2)); + case Long: + return graph.unique(new OrNode(Kind.Long, v1, v2)); + default: + throw ValueNodeUtil.shouldNotReachHere(); + } + } + + public static BitLogicNode xor(ValueNode v1, ValueNode v2) { + assert v1.kind() == v2.kind() && v1.graph() == v2.graph(); + Graph graph = v1.graph(); + switch (v1.kind()) { + case Int: + return graph.unique(new XorNode(Kind.Int, v1, v2)); + case Long: + return graph.unique(new XorNode(Kind.Long, v1, v2)); + default: + throw ValueNodeUtil.shouldNotReachHere(); + } + } +}
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/CompareNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/CompareNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -26,7 +26,6 @@ import com.oracle.graal.graph.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.spi.*; -import com.oracle.graal.nodes.type.*; /* TODO (thomaswue/gdub) For high-level optimization purpose the compare node should be a boolean *value* (it is currently only a helper node) * But in the back-end the comparison should not always be materialized (for example in x86 the comparison result will not be in a register but in a flag) @@ -34,7 +33,7 @@ * Compare should probably be made a value (so that it can be canonicalized for example) and in later stages some Compare usage should be transformed * into variants that do not materialize the value (CompareIf, CompareGuard...) */ -public abstract class CompareNode extends BooleanNode implements Canonicalizable, LIRLowerable { +public abstract class CompareNode extends LogicNode implements Canonicalizable, LIRLowerable { @Input private ValueNode x; @Input private ValueNode y; @@ -54,7 +53,6 @@ * @param y the instruction that produces the second input to this instruction */ public CompareNode(ValueNode x, ValueNode y) { - super(StampFactory.condition()); assert (x == null && y == null) || x.kind() == y.kind(); this.x = x; this.y = y; @@ -78,7 +76,7 @@ public void generate(LIRGeneratorTool gen) { } - private ValueNode optimizeConditional(Constant constant, ConditionalNode conditionalNode, MetaAccessProvider runtime, Condition cond) { + private LogicNode optimizeConditional(Constant constant, ConditionalNode conditionalNode, MetaAccessProvider runtime, Condition cond) { Constant trueConstant = conditionalNode.trueValue().asConstant(); Constant falseConstant = conditionalNode.falseValue().asConstant(); @@ -87,7 +85,7 @@ boolean falseResult = cond.foldCondition(falseConstant, constant, runtime, unorderedIsTrue()); if (trueResult == falseResult) { - return ConstantNode.forBoolean(trueResult, graph()); + return LogicConstantNode.forBoolean(trueResult, graph()); } else { if (trueResult) { assert falseResult == false; @@ -103,13 +101,14 @@ return this; } - protected ValueNode optimizeNormalizeCmp(Constant constant, NormalizeCompareNode normalizeNode, boolean mirrored) { + protected LogicNode optimizeNormalizeCmp(Constant constant, NormalizeCompareNode normalizeNode, boolean mirrored) { throw new GraalInternalError("NormalizeCompareNode connected to %s (%s %s %s)", this, constant, normalizeNode, mirrored); } - public ValueNode canonical(CanonicalizerTool tool) { + @Override + public LogicNode canonical(CanonicalizerTool tool) { if (x().isConstant() && y().isConstant() && tool.runtime() != null) { - return ConstantNode.forBoolean(condition().foldCondition(x().asConstant(), y().asConstant(), tool.runtime(), unorderedIsTrue()), graph()); + return LogicConstantNode.forBoolean(condition().foldCondition(x().asConstant(), y().asConstant(), tool.runtime(), unorderedIsTrue()), graph()); } if (x().isConstant()) { if (y() instanceof ConditionalNode) {
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/ConditionalNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/ConditionalNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -35,13 +35,13 @@ */ public final class ConditionalNode extends BinaryNode implements Canonicalizable, LIRLowerable, Negatable { - @Input private BooleanNode condition; + @Input private LogicNode condition; - public BooleanNode condition() { + public LogicNode condition() { return condition; } - public ConditionalNode(BooleanNode condition, ValueNode trueValue, ValueNode falseValue) { + public ConditionalNode(LogicNode condition, ValueNode trueValue, ValueNode falseValue) { super(trueValue.kind(), trueValue, falseValue); assert trueValue.kind() == falseValue.kind(); this.condition = condition; @@ -73,9 +73,9 @@ } } } - if (condition instanceof ConstantNode) { - ConstantNode c = (ConstantNode) condition; - if (c.asConstant().asBoolean()) { + if (condition instanceof LogicConstantNode) { + LogicConstantNode c = (LogicConstantNode) condition; + if (c.getValue()) { return trueValue(); } else { return falseValue();
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/FloatLessThanNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/FloatLessThanNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -58,9 +58,9 @@ } @Override - public ValueNode canonical(CanonicalizerTool tool) { + public LogicNode canonical(CanonicalizerTool tool) { if (x() == y() && !unorderedIsTrue()) { - return ConstantNode.forBoolean(false, graph()); + return LogicConstantNode.contradiction(graph()); } return super.canonical(tool); }
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerBelowThanNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerBelowThanNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -54,17 +54,17 @@ } @Override - public ValueNode canonical(CanonicalizerTool tool) { + public LogicNode canonical(CanonicalizerTool tool) { if (x() == y()) { - return ConstantNode.forBoolean(false, graph()); + return LogicConstantNode.contradiction(graph()); } else { IntegerStamp xStamp = x().integerStamp(); IntegerStamp yStamp = y().integerStamp(); if (yStamp.isPositive()) { if (xStamp.isPositive() && xStamp.upperBound() < yStamp.lowerBound()) { - return ConstantNode.forBoolean(true, graph()); + return LogicConstantNode.tautology(graph()); } else if (xStamp.isStrictlyNegative() || xStamp.lowerBound() >= yStamp.upperBound()) { - return ConstantNode.forBoolean(false, graph()); + return LogicConstantNode.contradiction(graph()); } } }
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerEqualsNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerEqualsNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -53,7 +53,7 @@ } @Override - protected ValueNode optimizeNormalizeCmp(Constant constant, NormalizeCompareNode normalizeNode, boolean mirrored) { + protected LogicNode optimizeNormalizeCmp(Constant constant, NormalizeCompareNode normalizeNode, boolean mirrored) { if (constant.getKind() == Kind.Int && constant.asInt() == 0) { ValueNode a = mirrored ? normalizeNode.y() : normalizeNode.x(); ValueNode b = mirrored ? normalizeNode.x() : normalizeNode.y(); @@ -68,11 +68,11 @@ } @Override - public ValueNode canonical(CanonicalizerTool tool) { + public LogicNode canonical(CanonicalizerTool tool) { if (x() == y()) { - return ConstantNode.forBoolean(true, graph()); + return LogicConstantNode.tautology(graph()); } else if (x().integerStamp().alwaysDistinct(y().integerStamp())) { - return ConstantNode.forBoolean(false, graph()); + return LogicConstantNode.contradiction(graph()); } if (x() instanceof AndNode && y().isConstant() && y().asConstant().asLong() == 0) {
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerLessThanNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerLessThanNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -54,7 +54,7 @@ } @Override - protected ValueNode optimizeNormalizeCmp(Constant constant, NormalizeCompareNode normalizeNode, boolean mirrored) { + protected LogicNode optimizeNormalizeCmp(Constant constant, NormalizeCompareNode normalizeNode, boolean mirrored) { assert condition() == Condition.LT; if (constant.getKind() == Kind.Int && constant.asInt() == 0) { ValueNode a = mirrored ? normalizeNode.y() : normalizeNode.x(); @@ -70,13 +70,13 @@ } @Override - public ValueNode canonical(CanonicalizerTool tool) { + public LogicNode canonical(CanonicalizerTool tool) { if (x() == y()) { - return ConstantNode.forBoolean(false, graph()); + return LogicConstantNode.contradiction(graph()); } else if (x().integerStamp().upperBound() < y().integerStamp().lowerBound()) { - return ConstantNode.forBoolean(true, graph()); + return LogicConstantNode.tautology(graph()); } else if (x().integerStamp().lowerBound() >= y().integerStamp().upperBound()) { - return ConstantNode.forBoolean(false, graph()); + return LogicConstantNode.contradiction(graph()); } if (IntegerStamp.sameSign(x().integerStamp(), y().integerStamp())) { return graph().unique(new IntegerBelowThanNode(x(), y()));
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerTestNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerTestNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -24,14 +24,13 @@ import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.spi.*; -import com.oracle.graal.nodes.type.*; /** * This node will perform a "test" operation on its arguments. Its result is equivalent to the * expression "(x & y) == 0", meaning that it will return true if (and only if) no bit is set in * both x and y. */ -public class IntegerTestNode extends BooleanNode implements Canonicalizable, LIRLowerable { +public class IntegerTestNode extends LogicNode implements Canonicalizable, LIRLowerable { @Input private ValueNode x; @Input private ValueNode y; @@ -51,7 +50,6 @@ * @param y the instruction that produces the second input to this instruction */ public IntegerTestNode(ValueNode x, ValueNode y) { - super(StampFactory.condition()); assert (x == null && y == null) || x.kind() == y.kind(); this.x = x; this.y = y; @@ -61,12 +59,13 @@ public void generate(LIRGeneratorTool gen) { } - public ValueNode canonical(CanonicalizerTool tool) { + @Override + public LogicNode canonical(CanonicalizerTool tool) { if (x().isConstant() && y().isConstant()) { - return ConstantNode.forBoolean((x().asConstant().asLong() & y().asConstant().asLong()) == 0, graph()); + return LogicConstantNode.forBoolean((x().asConstant().asLong() & y().asConstant().asLong()) == 0, graph()); } if ((x().integerStamp().mask() & y().integerStamp().mask()) == 0) { - return ConstantNode.forBoolean(true, graph()); + return LogicConstantNode.tautology(graph()); } return this; }
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IsNullNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IsNullNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -25,12 +25,11 @@ import com.oracle.graal.api.meta.*; import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.spi.*; -import com.oracle.graal.nodes.type.*; /** * An IsNullNode will be true if the supplied value is null, and false if it is non-null. */ -public final class IsNullNode extends BooleanNode implements Canonicalizable, LIRLowerable, Virtualizable { +public final class IsNullNode extends LogicNode implements Canonicalizable, LIRLowerable, Virtualizable { @Input private ValueNode object; @@ -44,7 +43,6 @@ * @param object the instruction producing the object to check against null */ public IsNullNode(ValueNode object) { - super(StampFactory.condition()); assert object.kind() == Kind.Object : object; this.object = object; } @@ -62,14 +60,14 @@ } @Override - public ValueNode canonical(CanonicalizerTool tool) { + public LogicNode canonical(CanonicalizerTool tool) { Constant constant = object().asConstant(); if (constant != null) { assert constant.getKind() == Kind.Object; - return ConstantNode.forBoolean(constant.isNull(), graph()); + return LogicConstantNode.forBoolean(constant.isNull(), graph()); } if (object.objectStamp().nonNull()) { - return ConstantNode.forBoolean(false, graph()); + return LogicConstantNode.contradiction(graph()); } return this; } @@ -77,7 +75,7 @@ @Override public void virtualize(VirtualizerTool tool) { if (tool.getObjectState(object) != null) { - tool.replaceWithValue(ConstantNode.forBoolean(false, graph())); + tool.replaceWithValue(LogicConstantNode.contradiction(graph())); } } }
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/LogicNode.java Mon Feb 11 10:46:48 2013 +0100 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000 @@ -1,83 +0,0 @@ -/* - * 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.graal.nodes.calc; - -import com.oracle.graal.api.meta.*; -import com.oracle.graal.graph.*; -import com.oracle.graal.nodes.*; - -/** - * The {@code LogicNode} class definition. - */ -public abstract class LogicNode extends BinaryNode { - - /** - * Constructs a new logic operation node. - * - * @param x the first input into this node - * @param y the second input into this node - */ - public LogicNode(Kind kind, ValueNode x, ValueNode y) { - super(kind, x, y); - assert kind == Kind.Int || kind == Kind.Long; - } - - public static LogicNode and(ValueNode v1, ValueNode v2) { - assert v1.kind() == v2.kind() && v1.graph() == v2.graph(); - Graph graph = v1.graph(); - switch (v1.kind()) { - case Int: - return graph.unique(new AndNode(Kind.Int, v1, v2)); - case Long: - return graph.unique(new AndNode(Kind.Long, v1, v2)); - default: - throw ValueNodeUtil.shouldNotReachHere(); - } - } - - public static LogicNode or(ValueNode v1, ValueNode v2) { - assert v1.kind() == v2.kind() && v1.graph() == v2.graph(); - Graph graph = v1.graph(); - switch (v1.kind()) { - case Int: - return graph.unique(new OrNode(Kind.Int, v1, v2)); - case Long: - return graph.unique(new OrNode(Kind.Long, v1, v2)); - default: - throw ValueNodeUtil.shouldNotReachHere(); - } - } - - public static LogicNode xor(ValueNode v1, ValueNode v2) { - assert v1.kind() == v2.kind() && v1.graph() == v2.graph(); - Graph graph = v1.graph(); - switch (v1.kind()) { - case Int: - return graph.unique(new XorNode(Kind.Int, v1, v2)); - case Long: - return graph.unique(new XorNode(Kind.Long, v1, v2)); - default: - throw ValueNodeUtil.shouldNotReachHere(); - } - } -}
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/NormalizeCompareNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/NormalizeCompareNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -51,8 +51,8 @@ public void lower(LoweringTool tool) { StructuredGraph graph = (StructuredGraph) graph(); - BooleanNode equalComp; - BooleanNode lessComp; + LogicNode equalComp; + LogicNode lessComp; if (x().kind() == Kind.Double || x().kind() == Kind.Float) { equalComp = graph.unique(new FloatEqualsNode(x(), y())); lessComp = graph.unique(new FloatLessThanNode(x(), y(), isUnorderedLess));
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/ObjectEqualsNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/ObjectEqualsNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -53,9 +53,9 @@ } @Override - public ValueNode canonical(CanonicalizerTool tool) { + public LogicNode canonical(CanonicalizerTool tool) { if (x() == y()) { - return ConstantNode.forBoolean(true, graph()); + return LogicConstantNode.tautology(graph()); } if (x().objectStamp().alwaysNull()) { @@ -64,7 +64,7 @@ return graph().unique(new IsNullNode(x())); } if (x().stamp().alwaysDistinct(y().stamp())) { - return ConstantNode.forBoolean(false, graph()); + return LogicConstantNode.contradiction(graph()); } return super.canonical(tool); @@ -79,10 +79,10 @@ if (xVirtual ^ yVirtual) { // one of them is virtual: they can never be the same objects - tool.replaceWithValue(ConstantNode.forBoolean(false, graph())); + tool.replaceWithValue(LogicConstantNode.contradiction(graph())); } else if (xVirtual && yVirtual) { // both are virtual: check if they refer to the same object - tool.replaceWithValue(ConstantNode.forBoolean(stateX == stateY, graph())); + tool.replaceWithValue(LogicConstantNode.forBoolean(stateX == stateY, graph())); } } }
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/OrNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/OrNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -29,7 +29,7 @@ import com.oracle.graal.nodes.type.*; @NodeInfo(shortName = "|") -public final class OrNode extends LogicNode implements Canonicalizable, LIRLowerable { +public final class OrNode extends BitLogicNode implements Canonicalizable, LIRLowerable { public OrNode(Kind kind, ValueNode x, ValueNode y) { super(kind, x, y);
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/XorNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/XorNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -29,7 +29,7 @@ import com.oracle.graal.nodes.type.*; @NodeInfo(shortName = "^") -public final class XorNode extends LogicNode implements Canonicalizable, LIRLowerable { +public final class XorNode extends BitLogicNode implements Canonicalizable, LIRLowerable { public XorNode(Kind kind, ValueNode x, ValueNode y) { super(kind, x, y);
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/java/InstanceOfDynamicNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/java/InstanceOfDynamicNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -27,14 +27,13 @@ import com.oracle.graal.nodes.*; import com.oracle.graal.nodes.calc.*; import com.oracle.graal.nodes.spi.*; -import com.oracle.graal.nodes.type.*; /** * The {@code InstanceOfDynamicNode} represents a type check where the type being checked is not * known at compile time. This is used, for instance, to intrinsify {@link Class#isInstance(Object)} * . */ -public final class InstanceOfDynamicNode extends BooleanNode implements Canonicalizable, Lowerable { +public final class InstanceOfDynamicNode extends LogicNode implements Canonicalizable, Lowerable { @Input private ValueNode object; @Input private ValueNode mirror; @@ -47,7 +46,6 @@ * @param object the object being tested by the instanceof */ public InstanceOfDynamicNode(ValueNode mirror, ValueNode object) { - super(StampFactory.condition()); this.mirror = mirror; this.object = object; assert mirror.kind() == Kind.Object; @@ -61,7 +59,7 @@ } @Override - public ValueNode canonical(CanonicalizerTool tool) { + public LogicNode canonical(CanonicalizerTool tool) { assert object() != null : this; if (mirror().isConstant()) { Class clazz = (Class) mirror().asConstant().asObject();
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/java/InstanceOfNode.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/java/InstanceOfNode.java Mon Feb 11 15:55:27 2013 +0100 @@ -32,7 +32,7 @@ /** * The {@code InstanceOfNode} represents an instanceof test. */ -public final class InstanceOfNode extends BooleanNode implements Canonicalizable, Lowerable, Virtualizable { +public final class InstanceOfNode extends LogicNode implements Canonicalizable, Lowerable, Virtualizable { @Input private ValueNode object; private final ResolvedJavaType type; @@ -45,7 +45,6 @@ * @param object the object being tested by the instanceof */ public InstanceOfNode(ResolvedJavaType type, ValueNode object, JavaTypeProfile profile) { - super(StampFactory.condition()); this.type = type; this.object = object; this.profile = profile; @@ -58,7 +57,7 @@ } @Override - public ValueNode canonical(CanonicalizerTool tool) { + public LogicNode canonical(CanonicalizerTool tool) { assert object() != null : this; ObjectStamp stamp = object().objectStamp(); @@ -70,7 +69,7 @@ if (subType) { if (stamp.nonNull()) { // the instanceOf matches, so return true - return ConstantNode.forBoolean(true, graph()); + return LogicConstantNode.tautology(graph()); } else { // the instanceof matches if the object is non-null, so return true depending on // the null-ness. @@ -81,7 +80,7 @@ // since this type check failed for an exact type we know that it can never succeed // at run time. // we also don't care about null values, since they will also make the check fail. - return ConstantNode.forBoolean(false, graph()); + return LogicConstantNode.contradiction(graph()); } } else if (stampType != null) { boolean subType = type().isAssignableFrom(stampType); @@ -89,7 +88,7 @@ if (subType) { if (stamp.nonNull()) { // the instanceOf matches, so return true - return ConstantNode.forBoolean(true, graph()); + return LogicConstantNode.tautology(graph()); } else { // the instanceof matches if the object is non-null, so return true depending on // the null-ness. @@ -102,7 +101,7 @@ } } if (object().objectStamp().alwaysNull()) { - return ConstantNode.forBoolean(false, graph()); + return LogicConstantNode.contradiction(graph()); } return this; } @@ -134,7 +133,7 @@ public void virtualize(VirtualizerTool tool) { State state = tool.getObjectState(object); if (state != null) { - tool.replaceWithValue(ConstantNode.forBoolean(type().isAssignableFrom(state.getVirtualObject().type()), graph())); + tool.replaceWithValue(LogicConstantNode.forBoolean(type().isAssignableFrom(state.getVirtualObject().type()), graph())); } } }
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/spi/LIRGeneratorTool.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/spi/LIRGeneratorTool.java Mon Feb 11 15:55:27 2013 +0100 @@ -117,7 +117,7 @@ public abstract void emitConditional(ConditionalNode i); - public abstract void emitGuardCheck(BooleanNode comp, DeoptimizationReason deoptReason, DeoptimizationAction deoptAction, boolean negated); + public abstract void emitGuardCheck(LogicNode comp, DeoptimizationReason deoptReason, DeoptimizationAction deoptAction, boolean negated); public abstract void emitSwitch(SwitchNode i);
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/spi/LoweringTool.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/spi/LoweringTool.java Mon Feb 11 15:55:27 2013 +0100 @@ -36,9 +36,9 @@ ValueNode createNullCheckGuard(ValueNode object); - ValueNode createGuard(BooleanNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action); + ValueNode createGuard(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action); - ValueNode createGuard(BooleanNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated); + ValueNode createGuard(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated); Assumptions assumptions();
--- a/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/ConditionalEliminationPhase.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/ConditionalEliminationPhase.java Mon Feb 11 15:55:27 2013 +0100 @@ -68,8 +68,8 @@ private IdentityHashMap<ValueNode, ResolvedJavaType> knownTypes; private HashSet<ValueNode> knownNonNull; private HashSet<ValueNode> knownNull; - private IdentityHashMap<BooleanNode, ValueNode> trueConditions; - private IdentityHashMap<BooleanNode, ValueNode> falseConditions; + private IdentityHashMap<LogicNode, ValueNode> trueConditions; + private IdentityHashMap<LogicNode, ValueNode> falseConditions; public State() { this.knownTypes = new IdentityHashMap<>(); @@ -90,8 +90,8 @@ @Override public boolean merge(MergeNode merge, List<State> withStates) { IdentityHashMap<ValueNode, ResolvedJavaType> newKnownTypes = new IdentityHashMap<>(); - IdentityHashMap<BooleanNode, ValueNode> newTrueConditions = new IdentityHashMap<>(); - IdentityHashMap<BooleanNode, ValueNode> newFalseConditions = new IdentityHashMap<>(); + IdentityHashMap<LogicNode, ValueNode> newTrueConditions = new IdentityHashMap<>(); + IdentityHashMap<LogicNode, ValueNode> newFalseConditions = new IdentityHashMap<>(); HashSet<ValueNode> newKnownNull = new HashSet<>(knownNull); HashSet<ValueNode> newKnownNonNull = new HashSet<>(knownNonNull); @@ -116,8 +116,8 @@ } } - for (Map.Entry<BooleanNode, ValueNode> entry : trueConditions.entrySet()) { - BooleanNode check = entry.getKey(); + for (Map.Entry<LogicNode, ValueNode> entry : trueConditions.entrySet()) { + LogicNode check = entry.getKey(); ValueNode guard = entry.getValue(); for (State other : withStates) { @@ -134,8 +134,8 @@ newTrueConditions.put(check, guard); } } - for (Map.Entry<BooleanNode, ValueNode> entry : falseConditions.entrySet()) { - BooleanNode check = entry.getKey(); + for (Map.Entry<LogicNode, ValueNode> entry : falseConditions.entrySet()) { + LogicNode check = entry.getKey(); ValueNode guard = entry.getValue(); for (State other : withStates) { @@ -225,7 +225,7 @@ * Adds information about a condition. If isTrue is true then the condition is known to * hold, otherwise the condition is known not to hold. */ - public void addCondition(boolean isTrue, BooleanNode condition, ValueNode anchor) { + public void addCondition(boolean isTrue, LogicNode condition, ValueNode anchor) { if (isTrue) { if (!trueConditions.containsKey(condition)) { trueConditions.put(condition, anchor); @@ -294,16 +294,16 @@ public class ConditionalElimination extends PostOrderNodeIterator<State> { - private final BooleanNode trueConstant; - private final BooleanNode falseConstant; + private final LogicNode trueConstant; + private final LogicNode falseConstant; public ConditionalElimination(FixedNode start, State initialState) { super(start, initialState); - this.trueConstant = ConstantNode.forBoolean(true, graph); - this.falseConstant = ConstantNode.forBoolean(false, graph); + this.trueConstant = LogicConstantNode.tautology(graph); + this.falseConstant = LogicConstantNode.contradiction(graph); } - private void registerCondition(boolean isTrue, BooleanNode condition, ValueNode anchor) { + private void registerCondition(boolean isTrue, LogicNode condition, ValueNode anchor) { state.addCondition(isTrue, condition, anchor); if (isTrue && condition instanceof InstanceOfNode) { @@ -351,7 +351,7 @@ if (pred instanceof IfNode) { IfNode ifNode = (IfNode) pred; - if (!(ifNode.condition() instanceof ConstantNode)) { + if (!(ifNode.condition() instanceof LogicConstantNode)) { registerCondition(begin == ifNode.trueSuccessor(), ifNode.condition(), begin); } } else if (pred instanceof TypeSwitchNode) { @@ -378,7 +378,7 @@ } private void registerGuard(GuardNode guard) { - BooleanNode condition = guard.condition(); + LogicNode condition = guard.condition(); ValueNode existingGuards = guard.negated() ? state.falseConditions.get(condition) : state.trueConditions.get(condition); if (existingGuards != null) { @@ -386,7 +386,7 @@ GraphUtil.killWithUnusedFloatingInputs(guard); metricGuardsRemoved.increment(); } else { - BooleanNode replacement = evaluateCondition(condition, trueConstant, falseConstant); + LogicNode replacement = evaluateCondition(condition, trueConstant, falseConstant); if (replacement != null) { guard.setCondition(replacement); if (condition.usages().isEmpty()) { @@ -404,7 +404,7 @@ * true, false or unknown. In case of true or false the corresponding value is returned, * otherwise null. */ - private <T extends ValueNode> T evaluateCondition(BooleanNode condition, T trueValue, T falseValue) { + private <T extends ValueNode> T evaluateCondition(LogicNode condition, T trueValue, T falseValue) { if (state.trueConditions.containsKey(condition)) { return trueValue; } else if (state.falseConditions.containsKey(condition)) { @@ -482,8 +482,8 @@ } } else if (node instanceof IfNode) { IfNode ifNode = (IfNode) node; - BooleanNode compare = ifNode.condition(); - BooleanNode replacement = evaluateCondition(compare, trueConstant, falseConstant); + LogicNode compare = ifNode.condition(); + LogicNode replacement = evaluateCondition(compare, trueConstant, falseConstant); if (replacement != null) { ifNode.setCondition(replacement); @@ -498,7 +498,7 @@ ValueNode value = phi.valueAt(index); if (value instanceof ConditionalNode) { ConditionalNode materialize = (ConditionalNode) value; - BooleanNode compare = materialize.condition(); + LogicNode compare = materialize.condition(); ValueNode replacement = evaluateCondition(compare, materialize.trueValue(), materialize.falseValue()); if (replacement != null) {
--- a/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/ConvertDeoptimizeToGuardPhase.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/ConvertDeoptimizeToGuardPhase.java Mon Feb 11 15:55:27 2013 +0100 @@ -79,7 +79,7 @@ } else if (deoptBegin.predecessor() instanceof IfNode) { IfNode ifNode = (IfNode) deoptBegin.predecessor(); BeginNode otherBegin = ifNode.trueSuccessor(); - BooleanNode conditionNode = ifNode.condition(); + LogicNode conditionNode = ifNode.condition(); if (conditionNode instanceof InstanceOfNode) { // TODO The lowering currently does not support a FixedGuard as the usage of an // InstanceOfNode. Relax this restriction.
--- a/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/EliminatePartiallyRedundantGuardsPhase.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/EliminatePartiallyRedundantGuardsPhase.java Mon Feb 11 15:55:27 2013 +0100 @@ -49,10 +49,10 @@ private static class Condition { - final BooleanNode conditionNode; + final LogicNode conditionNode; final boolean negated; - public Condition(BooleanNode conditionNode, boolean negated) { + public Condition(LogicNode conditionNode, boolean negated) { this.conditionNode = conditionNode; this.negated = negated; }
--- a/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/LoweringPhase.java Mon Feb 11 10:46:48 2013 +0100 +++ b/graal/com.oracle.graal.phases.common/src/com/oracle/graal/phases/common/LoweringPhase.java Mon Feb 11 15:55:27 2013 +0100 @@ -70,7 +70,7 @@ } @Override - public ValueNode createGuard(BooleanNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action) { + public ValueNode createGuard(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action) { return createGuard(condition, deoptReason, action, false); } @@ -80,7 +80,7 @@ } @Override - public ValueNode createGuard(BooleanNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated) { + public ValueNode createGuard(LogicNode condition, DeoptimizationReason deoptReason, DeoptimizationAction action, boolean negated) { if (GraalOptions.OptEliminateGuards) { for (Node usage : condition.usages()) { if (!activeGuards.isNew(usage) && activeGuards.isMarked(usage)) {