|
43972
|
1 |
/*
|
|
|
2 |
* Copyright (c) 2011, 2016, 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 |
|
|
46459
|
25 |
import static org.graalvm.compiler.nodeinfo.NodeCycles.CYCLES_32;
|
|
46393
|
26 |
|
|
43972
|
27 |
import org.graalvm.compiler.core.common.type.ArithmeticOpTable;
|
|
48190
|
28 |
import org.graalvm.compiler.core.common.type.ArithmeticOpTable.BinaryOp;
|
|
43972
|
29 |
import org.graalvm.compiler.core.common.type.ArithmeticOpTable.BinaryOp.Rem;
|
|
48190
|
30 |
import org.graalvm.compiler.core.common.type.Stamp;
|
|
43972
|
31 |
import org.graalvm.compiler.graph.NodeClass;
|
|
|
32 |
import org.graalvm.compiler.lir.gen.ArithmeticLIRGeneratorTool;
|
|
|
33 |
import org.graalvm.compiler.nodeinfo.NodeInfo;
|
|
48190
|
34 |
import org.graalvm.compiler.nodes.ConstantNode;
|
|
|
35 |
import org.graalvm.compiler.nodes.NodeView;
|
|
43972
|
36 |
import org.graalvm.compiler.nodes.ValueNode;
|
|
|
37 |
import org.graalvm.compiler.nodes.spi.Lowerable;
|
|
|
38 |
import org.graalvm.compiler.nodes.spi.LoweringTool;
|
|
|
39 |
import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;
|
|
|
40 |
|
|
46459
|
41 |
@NodeInfo(shortName = "%", cycles = CYCLES_32/* div */)
|
|
43972
|
42 |
public class RemNode extends BinaryArithmeticNode<Rem> implements Lowerable {
|
|
|
43 |
|
|
|
44 |
public static final NodeClass<RemNode> TYPE = NodeClass.create(RemNode.class);
|
|
|
45 |
|
|
48190
|
46 |
protected RemNode(ValueNode x, ValueNode y) {
|
|
43972
|
47 |
this(TYPE, x, y);
|
|
|
48 |
}
|
|
|
49 |
|
|
|
50 |
protected RemNode(NodeClass<? extends RemNode> c, ValueNode x, ValueNode y) {
|
|
|
51 |
super(c, ArithmeticOpTable::getRem, x, y);
|
|
|
52 |
}
|
|
|
53 |
|
|
48190
|
54 |
public static ValueNode create(ValueNode forX, ValueNode forY, NodeView view) {
|
|
|
55 |
BinaryOp<Rem> op = ArithmeticOpTable.forStamp(forX.stamp(view)).getRem();
|
|
|
56 |
Stamp stamp = op.foldStamp(forX.stamp(view), forY.stamp(view));
|
|
|
57 |
ConstantNode tryConstantFold = tryConstantFold(op, forX, forY, stamp, view);
|
|
|
58 |
if (tryConstantFold != null) {
|
|
|
59 |
return tryConstantFold;
|
|
|
60 |
}
|
|
|
61 |
return new RemNode(forX, forY);
|
|
|
62 |
}
|
|
|
63 |
|
|
43972
|
64 |
@Override
|
|
|
65 |
public void lower(LoweringTool tool) {
|
|
|
66 |
tool.getLowerer().lower(this, tool);
|
|
|
67 |
}
|
|
|
68 |
|
|
|
69 |
@Override
|
|
|
70 |
public void generate(NodeLIRBuilderTool nodeValueMap, ArithmeticLIRGeneratorTool gen) {
|
|
|
71 |
nodeValueMap.setResult(this, gen.emitRem(nodeValueMap.operand(getX()), nodeValueMap.operand(getY()), null));
|
|
|
72 |
}
|
|
|
73 |
}
|