comparison graal/GraalCompiler/src/com/sun/c1x/ir/LoopEnd.java @ 2799:e1dad0edd57a

first part of loop reworking
author Lukas Stadler <lukas.stadler@jku.at>
date Fri, 27 May 2011 17:48:28 +0200
parents
children bd17ac598c6e
comparison
equal deleted inserted replaced
2798:58e65eb6bb5d 2799:e1dad0edd57a
1 /*
2 * Copyright (c) 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
28
29 public class LoopEnd extends Merge {
30
31 private static final int INPUT_COUNT = 1;
32 private static final int INPUT_LOOP_BEGIN = 0;
33
34 private static final int SUCCESSOR_COUNT = 0;
35
36 @Override
37 protected int inputCount() {
38 return super.inputCount() + INPUT_COUNT;
39 }
40
41 @Override
42 protected int successorCount() {
43 return super.successorCount() + SUCCESSOR_COUNT;
44 }
45
46 /**
47 * The instruction which produces the input value to this instruction.
48 */
49 public LoopBegin loopBegin() {
50 return (LoopBegin) inputs().get(super.inputCount() + INPUT_LOOP_BEGIN);
51 }
52
53 public LoopBegin setLoopBegin(LoopBegin n) {
54 return (LoopBegin) inputs().set(super.inputCount() + INPUT_LOOP_BEGIN, n);
55 }
56
57 public LoopEnd(Graph graph) {
58 super(INPUT_COUNT, SUCCESSOR_COUNT, graph);
59 }
60
61 @Override
62 public void accept(ValueVisitor v) {
63 v.visitLoopEnd(this);
64 }
65
66 @Override
67 public void print(LogStream out) {
68 out.print("loopEnd ").print(loopBegin());
69 }
70
71
72 }