|
43972
|
1 |
/*
|
|
|
2 |
* Copyright (c) 2011, 2015, Oracle and/or its affiliates. All rights reserved.
|
|
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
|
4 |
*
|
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
|
|
7 |
* published by the Free Software Foundation.
|
|
|
8 |
*
|
|
|
9 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
|
10 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
11 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
12 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
|
13 |
* accompanied this code).
|
|
|
14 |
*
|
|
|
15 |
* You should have received a copy of the GNU General Public License version
|
|
|
16 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
|
17 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
18 |
*
|
|
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
|
20 |
* or visit www.oracle.com if you need additional information or have any
|
|
|
21 |
* questions.
|
|
|
22 |
*/
|
|
|
23 |
package org.graalvm.compiler.nodes.calc;
|
|
|
24 |
|
|
|
25 |
import org.graalvm.compiler.core.common.type.ArithmeticOpTable;
|
|
|
26 |
import org.graalvm.compiler.core.common.type.ArithmeticOpTable.ShiftOp.UShr;
|
|
|
27 |
import org.graalvm.compiler.core.common.type.IntegerStamp;
|
|
48190
|
28 |
import org.graalvm.compiler.core.common.type.Stamp;
|
|
43972
|
29 |
import org.graalvm.compiler.graph.NodeClass;
|
|
|
30 |
import org.graalvm.compiler.graph.spi.CanonicalizerTool;
|
|
|
31 |
import org.graalvm.compiler.lir.gen.ArithmeticLIRGeneratorTool;
|
|
|
32 |
import org.graalvm.compiler.nodeinfo.NodeInfo;
|
|
|
33 |
import org.graalvm.compiler.nodes.ConstantNode;
|
|
48190
|
34 |
import org.graalvm.compiler.nodes.NodeView;
|
|
43972
|
35 |
import org.graalvm.compiler.nodes.ValueNode;
|
|
|
36 |
import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;
|
|
|
37 |
|
|
|
38 |
import jdk.vm.ci.meta.JavaKind;
|
|
|
39 |
|
|
|
40 |
@NodeInfo(shortName = ">>>")
|
|
|
41 |
public final class UnsignedRightShiftNode extends ShiftNode<UShr> {
|
|
|
42 |
|
|
|
43 |
public static final NodeClass<UnsignedRightShiftNode> TYPE = NodeClass.create(UnsignedRightShiftNode.class);
|
|
|
44 |
|
|
|
45 |
public UnsignedRightShiftNode(ValueNode x, ValueNode y) {
|
|
|
46 |
super(TYPE, ArithmeticOpTable::getUShr, x, y);
|
|
|
47 |
}
|
|
|
48 |
|
|
48190
|
49 |
public static ValueNode create(ValueNode x, ValueNode y, NodeView view) {
|
|
|
50 |
ArithmeticOpTable.ShiftOp<UShr> op = ArithmeticOpTable.forStamp(x.stamp(view)).getUShr();
|
|
|
51 |
Stamp stamp = op.foldStamp(x.stamp(view), (IntegerStamp) y.stamp(view));
|
|
|
52 |
ValueNode value = ShiftNode.canonical(op, stamp, x, y, view);
|
|
|
53 |
if (value != null) {
|
|
|
54 |
return value;
|
|
|
55 |
}
|
|
|
56 |
|
|
|
57 |
return canonical(null, op, stamp, x, y, view);
|
|
|
58 |
}
|
|
|
59 |
|
|
43972
|
60 |
@Override
|
|
|
61 |
public ValueNode canonical(CanonicalizerTool tool, ValueNode forX, ValueNode forY) {
|
|
48190
|
62 |
NodeView view = NodeView.from(tool);
|
|
43972
|
63 |
ValueNode ret = super.canonical(tool, forX, forY);
|
|
|
64 |
if (ret != this) {
|
|
|
65 |
return ret;
|
|
|
66 |
}
|
|
|
67 |
|
|
48190
|
68 |
return canonical(this, this.getArithmeticOp(), this.stamp(view), forX, forY, view);
|
|
|
69 |
}
|
|
|
70 |
|
|
|
71 |
@SuppressWarnings("unused")
|
|
|
72 |
private static ValueNode canonical(UnsignedRightShiftNode node, ArithmeticOpTable.ShiftOp<UShr> op, Stamp stamp, ValueNode forX, ValueNode forY, NodeView view) {
|
|
43972
|
73 |
if (forY.isConstant()) {
|
|
|
74 |
int amount = forY.asJavaConstant().asInt();
|
|
|
75 |
int originalAmout = amount;
|
|
48190
|
76 |
int mask = op.getShiftAmountMask(stamp);
|
|
43972
|
77 |
amount &= mask;
|
|
|
78 |
if (amount == 0) {
|
|
|
79 |
return forX;
|
|
|
80 |
}
|
|
|
81 |
if (forX instanceof ShiftNode) {
|
|
|
82 |
ShiftNode<?> other = (ShiftNode<?>) forX;
|
|
|
83 |
if (other.getY().isConstant()) {
|
|
|
84 |
int otherAmount = other.getY().asJavaConstant().asInt() & mask;
|
|
|
85 |
if (other instanceof UnsignedRightShiftNode) {
|
|
|
86 |
int total = amount + otherAmount;
|
|
|
87 |
if (total != (total & mask)) {
|
|
48190
|
88 |
return ConstantNode.forIntegerKind(stamp.getStackKind(), 0);
|
|
43972
|
89 |
}
|
|
|
90 |
return new UnsignedRightShiftNode(other.getX(), ConstantNode.forInt(total));
|
|
|
91 |
} else if (other instanceof LeftShiftNode && otherAmount == amount) {
|
|
48190
|
92 |
if (stamp.getStackKind() == JavaKind.Long) {
|
|
43972
|
93 |
return new AndNode(other.getX(), ConstantNode.forLong(-1L >>> amount));
|
|
|
94 |
} else {
|
|
48190
|
95 |
assert stamp.getStackKind() == JavaKind.Int;
|
|
43972
|
96 |
return new AndNode(other.getX(), ConstantNode.forInt(-1 >>> amount));
|
|
|
97 |
}
|
|
|
98 |
}
|
|
|
99 |
}
|
|
|
100 |
}
|
|
|
101 |
if (originalAmout != amount) {
|
|
|
102 |
return new UnsignedRightShiftNode(forX, ConstantNode.forInt(amount));
|
|
|
103 |
}
|
|
|
104 |
}
|
|
48190
|
105 |
|
|
|
106 |
if (node != null) {
|
|
|
107 |
return node;
|
|
|
108 |
}
|
|
|
109 |
return new UnsignedRightShiftNode(forX, forY);
|
|
43972
|
110 |
}
|
|
|
111 |
|
|
|
112 |
@Override
|
|
|
113 |
public void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen) {
|
|
|
114 |
nodeValueMap.setResult(this, gen.emitUShr(nodeValueMap.operand(getX()), nodeValueMap.operand(getY())));
|
|
|
115 |
}
|
|
|
116 |
|
|
|
117 |
@Override
|
|
|
118 |
public boolean isNarrowable(int resultBits) {
|
|
|
119 |
if (super.isNarrowable(resultBits)) {
|
|
|
120 |
/*
|
|
|
121 |
* For unsigned right shifts, the narrow can be done before the shift if the cut off
|
|
|
122 |
* bits are all zero.
|
|
|
123 |
*/
|
|
48190
|
124 |
IntegerStamp inputStamp = (IntegerStamp) getX().stamp(NodeView.DEFAULT);
|
|
43972
|
125 |
return (inputStamp.upMask() & ~(resultBits - 1)) == 0;
|
|
|
126 |
} else {
|
|
|
127 |
return false;
|
|
|
128 |
}
|
|
|
129 |
}
|
|
|
130 |
}
|