Mercurial > hg > graal-compiler
diff graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerAddNode.java @ 5540:a891c53a295b
Renaming RiKind => Kind.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Fri, 08 Jun 2012 23:47:42 +0200 |
parents | bc647d8b0080 |
children | b0f511b40eee |
line wrap: on
line diff
--- a/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerAddNode.java Fri Jun 08 23:44:20 2012 +0200 +++ b/graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/calc/IntegerAddNode.java Fri Jun 08 23:47:42 2012 +0200 @@ -31,7 +31,7 @@ @NodeInfo(shortName = "+") public class IntegerAddNode extends IntegerArithmeticNode implements Canonicalizable, LIRLowerable, TypeFeedbackProvider { - public IntegerAddNode(RiKind kind, ValueNode x, ValueNode y) { + public IntegerAddNode(Kind kind, ValueNode x, ValueNode y) { super(kind, x, y); } @@ -41,20 +41,20 @@ return graph().unique(new IntegerAddNode(kind(), y(), x())); } if (x().isConstant()) { - if (kind() == RiKind.Int) { + if (kind() == Kind.Int) { return ConstantNode.forInt(x().asConstant().asInt() + y().asConstant().asInt(), graph()); } else { - assert kind() == RiKind.Long; + assert kind() == Kind.Long; return ConstantNode.forLong(x().asConstant().asLong() + y().asConstant().asLong(), graph()); } } else if (y().isConstant()) { - if (kind() == RiKind.Int) { + if (kind() == Kind.Int) { int c = y().asConstant().asInt(); if (c == 0) { return x(); } } else { - assert kind() == RiKind.Long; + assert kind() == Kind.Long; long c = y().asConstant().asLong(); if (c == 0) { return x(); @@ -65,10 +65,10 @@ IntegerAddNode other = (IntegerAddNode) x(); if (other.y().isConstant()) { ConstantNode sum; - if (kind() == RiKind.Int) { + if (kind() == Kind.Int) { sum = ConstantNode.forInt(y().asConstant().asInt() + other.y().asConstant().asInt(), graph()); } else { - assert kind() == RiKind.Long; + assert kind() == Kind.Long; sum = ConstantNode.forLong(y().asConstant().asLong() + other.y().asConstant().asLong(), graph()); } return graph().unique(new IntegerAddNode(kind(), other.x(), sum)); @@ -79,7 +79,7 @@ } public static boolean isIntegerAddition(ValueNode result, ValueNode a, ValueNode b) { - RiKind kind = result.kind(); + Kind kind = result.kind(); if (kind != a.kind() || kind != b.kind() || !(kind.isInt() || kind.isLong())) { return false; }