43972
|
1 |
/*
|
52910
|
2 |
* Copyright (c) 2009, 2018, Oracle and/or its affiliates. All rights reserved.
|
43972
|
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 |
*/
|
50858
|
23 |
|
|
24 |
|
43972
|
25 |
package org.graalvm.compiler.nodes;
|
|
26 |
|
|
27 |
import org.graalvm.compiler.graph.NodeClass;
|
|
28 |
import org.graalvm.compiler.nodeinfo.NodeInfo;
|
|
29 |
|
|
30 |
/**
|
|
31 |
* Denotes the merging of multiple control-flow paths.
|
|
32 |
*/
|
|
33 |
@NodeInfo
|
|
34 |
public final class MergeNode extends AbstractMergeNode {
|
|
35 |
|
|
36 |
public static final NodeClass<MergeNode> TYPE = NodeClass.create(MergeNode.class);
|
|
37 |
|
|
38 |
public MergeNode() {
|
|
39 |
super(TYPE);
|
|
40 |
}
|
|
41 |
|
|
42 |
public static void removeMergeIfDegenerated(MergeNode node) {
|
|
43 |
if (node.forwardEndCount() == 1 && node.hasNoUsages()) {
|
|
44 |
FixedNode currentNext = node.next();
|
|
45 |
node.setNext(null);
|
|
46 |
EndNode forwardEnd = node.forwardEndAt(0);
|
|
47 |
forwardEnd.replaceAtPredecessor(currentNext);
|
|
48 |
node.markDeleted();
|
|
49 |
forwardEnd.markDeleted();
|
|
50 |
}
|
|
51 |
}
|
|
52 |
|
|
53 |
@Override
|
|
54 |
public boolean verify() {
|
|
55 |
assertTrue(this.forwardEndCount() > 1, "Must merge more than one end.");
|
|
56 |
return true;
|
|
57 |
}
|
|
58 |
}
|