Mercurial > hg > graal-compiler
view graal/GraalCompiler/src/com/sun/c1x/ir/NegateOp.java @ 2834:bfce42cd9c07
Graph duplication now passes all tests
author | Lukas Stadler <lukas.stadler@jku.at> |
---|---|
date | Tue, 31 May 2011 13:34:52 +0200 |
parents | bd17ac598c6e |
children | c061a6be3728 |
line wrap: on
line source
/* * Copyright (c) 2009, 2011, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ package com.sun.c1x.ir; import com.oracle.graal.graph.*; import com.sun.c1x.debug.*; import com.sun.c1x.util.*; import com.sun.cri.bytecode.*; import com.sun.cri.ci.*; /** * The {@code NegateOp} instruction negates its operand. */ public final class NegateOp extends Value { private static final int INPUT_COUNT = 2; private static final int INPUT_X = 0; private static final int INPUT_Y = 1; private static final int SUCCESSOR_COUNT = 0; @Override protected int inputCount() { return super.inputCount() + INPUT_COUNT; } @Override protected int successorCount() { return super.successorCount() + SUCCESSOR_COUNT; } /** * The instruction producing input to this instruction. */ public Value x() { return (Value) inputs().get(super.inputCount() + INPUT_X); } public Value setX(Value n) { return (Value) inputs().set(super.inputCount() + INPUT_X, n); } /** * Creates new NegateOp instance. * @param x the instruction producing the value that is input to this instruction */ public NegateOp(Value x, Graph graph) { super(x.kind, INPUT_COUNT, SUCCESSOR_COUNT, graph); setX(x); } // for copying private NegateOp(CiKind kind, Graph graph) { super(kind, INPUT_COUNT, SUCCESSOR_COUNT, graph); } @Override public void accept(ValueVisitor v) { v.visitNegateOp(this); } @Override public int valueNumber() { return Util.hash1(Bytecodes.INEG, x()); } @Override public boolean valueEqual(Node i) { if (i instanceof NegateOp) { NegateOp o = (NegateOp) i; return x() == o.x(); } return false; } @Override public void print(LogStream out) { out.print("- ").print(x()); } @Override public Node copy(Graph into) { NegateOp x = new NegateOp(kind, into); x.setNonNull(isNonNull()); return x; } }