Mercurial > hg > truffle
comparison graal/GraalCompiler/src/com/sun/c1x/ir/Shift.java @ 2852:c6bdec623ef9
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/ShiftOp.java@14708c03abba |
children | 7a4e6e11877f |
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 ShiftOp} class represents shift operations. | |
32 */ | |
33 public final class Shift 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 shift operation. | |
40 * @param opcode the opcode of the shift | |
41 * @param x the first input value | |
42 * @param y the second input value | |
43 */ | |
44 public Shift(int opcode, Value x, Value y, Graph graph) { | |
45 super(x.kind, opcode, x, y, INPUT_COUNT, SUCCESSOR_COUNT, graph); | |
46 } | |
47 | |
48 private Shift(CiKind kind, int opcode, Graph graph) { | |
49 super(kind, opcode, null, null, INPUT_COUNT, SUCCESSOR_COUNT, graph); | |
50 } | |
51 | |
52 @Override | |
53 public void accept(ValueVisitor v) { | |
54 v.visitShift(this); | |
55 } | |
56 | |
57 @Override | |
58 public void print(LogStream out) { | |
59 out.print(x()).print(' ').print(Bytecodes.operator(opcode)).print(' ').print(y()); | |
60 } | |
61 | |
62 @Override | |
63 public Node copy(Graph into) { | |
64 Shift x = new Shift(kind, opcode, into); | |
65 return x; | |
66 } | |
67 } |