Mercurial > hg > graal-compiler
view graal/GraalCompiler/src/com/sun/c1x/ir/LoopEnd.java @ 2849:463657856f86
add files
author | Gilles Duboscq <gilles.duboscq@oracle.com> |
---|---|
date | Tue, 07 Jun 2011 11:18:18 +0200 |
parents | bd17ac598c6e |
children | 7596ae867a7b |
line wrap: on
line source
/* * Copyright (c) 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.*; public class LoopEnd extends Merge { private static final int INPUT_COUNT = 1; private static final int INPUT_LOOP_BEGIN = 0; 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 which produces the input value to this instruction. */ public LoopBegin loopBegin() { return (LoopBegin) inputs().get(super.inputCount() + INPUT_LOOP_BEGIN); } public LoopBegin setLoopBegin(LoopBegin n) { return (LoopBegin) inputs().set(super.inputCount() + INPUT_LOOP_BEGIN, n); } public LoopEnd(Graph graph) { super(INPUT_COUNT, SUCCESSOR_COUNT, graph); } @Override public void accept(ValueVisitor v) { v.visitLoopEnd(this); } @Override public void print(LogStream out) { out.print("loopEnd ").print(loopBegin()); } @Override public Node copy(Graph into) { LoopEnd x = new LoopEnd(into); x.setNonNull(isNonNull()); return x; } }