Mercurial > hg > graal-compiler

comparison graal/GraalCompiler/src/com/sun/c1x/ir/Compare.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/CompareOp.java@14708c03abba
children c6af2af32b3d
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 CompareOp} instruction represents comparisons such as equals, not equal, etc.
32 */
33 public final class Compare extends Binary {
34
35 private static final int INPUT_COUNT = 0;
36 private static final int SUCCESSOR_COUNT = 0;
37
38 /**
39 * Creates a new compare operation.
40 * @param opcode the bytecode opcode
41 * @param kind the result kind
42 * @param x the first input
43 * @param y the second input
44 */
45 public Compare(int opcode, CiKind kind, Value x, Value y, Graph graph) {
46 super(kind, opcode, x, y, INPUT_COUNT, SUCCESSOR_COUNT, graph);
47 }
48
49 @Override
50 public void accept(ValueVisitor v) {
51 v.visitCompare(this);
52 }
53
54 @Override
55 public void print(LogStream out) {
56 out.print(x()).
57 print(' ').
58 print(Bytecodes.operator(opcode)).
59 print(' ').
60 print(y());
61 }
62
63 @Override
64 public Node copy(Graph into) {
65 Compare x = new Compare(opcode, kind, null, null, into);
66 return x;
67 }
68 }