Mercurial > hg > graal-compiler

comparison graal/GraalCompiler/src/com/sun/c1x/ir/Arithmetic.java @ 2852:c6bdec623ef9

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Move TypeCHeck to floating nodes, rename Nodes to aboid using an *Op suffix
author Gilles Duboscq <gilles.duboscq@oracle.com>
date Tue, 07 Jun 2011 12:10:27 +0200
parents graal/GraalCompiler/src/com/sun/c1x/ir/ArithmeticOp.java@14708c03abba
children 7d7cf33f8466
comparison
equal deleted inserted replaced
2851:14708c03abba 2852:c6bdec623ef9
1 /*
2 * Copyright (c) 2009, 2011, 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 com.sun.c1x.ir;
24
25 import com.oracle.graal.graph.*;
26 import com.sun.c1x.debug.*;
27 import com.sun.cri.bytecode.*;
28 import com.sun.cri.ci.*;
29
30 /**
31 * The {@code ArithmeticOp} class represents arithmetic operations such as addition, subtraction, etc.
32 */
33 public final class Arithmetic extends Binary {
34
35 private static final int INPUT_COUNT = 0;
36 private static final int SUCCESSOR_COUNT = 0;
37
38 private final boolean canTrap;
39 private final boolean isStrictFP;
40
41 /**
42 * Creates a new arithmetic operation.
43 * @param opcode the bytecode opcode
44 * @param kind the result kind of the operation
45 * @param x the first input instruction
46 * @param y the second input instruction
47 * @param isStrictFP indicates this operation has strict rounding semantics
48 * @param stateBefore the state for instructions that may trap
49 */
50 public Arithmetic(int opcode, CiKind kind, Value x, Value y, boolean isStrictFP, boolean canTrap, Graph graph) {
51 super(kind, opcode, x, y, INPUT_COUNT, SUCCESSOR_COUNT, graph);
52 this.isStrictFP = isStrictFP;
53 this.canTrap = canTrap;
54 }
55
56 /**
57 * Checks whether this instruction has strict fp semantics.
58 * @return {@code true} if this instruction has strict fp semantics
59 */
60 public boolean isStrictFP() {
61 return isStrictFP;
62 }
63
64 @Override
65 public void accept(ValueVisitor v) {
66 v.visitArithmetic(this);
67 }
68
69 public boolean isCommutative() {
70 return Bytecodes.isCommutative(opcode);
71 }
72
73 @Override
74 public void print(LogStream out) {
75 out.print(x()).print(' ').print(Bytecodes.operator(opcode)).print(' ').print(y());
76 }
77
78 @Override
79 public String shortName() {
80 return Bytecodes.operator(opcode);
81 }
82
83 @Override
84 public Node copy(Graph into) {
85 Arithmetic x = new Arithmetic(opcode, kind, null, null, isStrictFP, canTrap, into);
86 return x;
87 }
88 }