Mercurial > hg > graal-jvmci-8

comparison graal/com.oracle.max.graal.compiler/src/com/oracle/max/graal/compiler/ir/MemoryMergeNode.java @ 3069:6202a6bb6726

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Restructure memory lowering code.
author Thomas Wuerthinger <thomas@wuerthinger.net>
date Fri, 24 Jun 2011 14:21:12 +0200
parents
children 16043c211a98
comparison
equal deleted inserted replaced
3068:ea778c37bdae 3069:6202a6bb6726
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.oracle.max.graal.compiler.ir;
24
25 import java.util.*;
26
27 import com.oracle.max.graal.compiler.gen.*;
28 import com.oracle.max.graal.graph.*;
29 import com.sun.cri.ci.*;
30
31
32 public final class MemoryMergeNode extends AbstractMemoryMergeNode {
33
34 private static final int SUCCESSOR_COUNT = 0;
35 private static final int INPUT_COUNT = 0;
36
37 public MemoryMergeNode(Graph graph) {
38 this(CiKind.Illegal, 0, 0, graph);
39 }
40
41 public MemoryMergeNode(CiKind result, int inputCount, int successorCount, Graph graph) {
42 super(result, inputCount + INPUT_COUNT, successorCount + SUCCESSOR_COUNT, graph);
43 }
44
45 @Override
46 public <T extends Op> T lookup(Class<T> clazz) {
47 if (clazz == LIRGenerator.LIRGeneratorOp.class) {
48 return null;
49 }
50 return super.lookup(clazz);
51 }
52
53 @Override
54 public Node copy(Graph into) {
55 return new MemoryMergeNode(into);
56 }
57 }