43972
|
1 |
/*
|
|
2 |
* Copyright (c) 2015, 2015, 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 org.graalvm.compiler.phases.common;
|
|
24 |
|
|
25 |
import org.graalvm.compiler.graph.Node;
|
|
26 |
import org.graalvm.compiler.nodes.StructuredGraph;
|
|
27 |
import org.graalvm.compiler.nodes.ValueNode;
|
|
28 |
import org.graalvm.compiler.nodes.memory.address.AddressNode;
|
|
29 |
import org.graalvm.compiler.nodes.memory.address.OffsetAddressNode;
|
|
30 |
import org.graalvm.compiler.nodes.util.GraphUtil;
|
|
31 |
import org.graalvm.compiler.phases.Phase;
|
|
32 |
|
|
33 |
public class AddressLoweringPhase extends Phase {
|
|
34 |
|
|
35 |
public abstract static class AddressLowering {
|
48861
|
36 |
|
|
37 |
@SuppressWarnings("unused")
|
|
38 |
public void preProcess(StructuredGraph graph) {
|
|
39 |
}
|
|
40 |
|
|
41 |
@SuppressWarnings("unused")
|
|
42 |
public void postProcess(AddressNode lowered) {
|
|
43 |
}
|
|
44 |
|
43972
|
45 |
public abstract AddressNode lower(ValueNode base, ValueNode offset);
|
|
46 |
}
|
|
47 |
|
|
48 |
private final AddressLowering lowering;
|
|
49 |
|
|
50 |
public AddressLoweringPhase(AddressLowering lowering) {
|
|
51 |
this.lowering = lowering;
|
|
52 |
assert lowering != null;
|
|
53 |
}
|
|
54 |
|
|
55 |
@Override
|
|
56 |
protected void run(StructuredGraph graph) {
|
48861
|
57 |
lowering.preProcess(graph);
|
43972
|
58 |
for (Node node : graph.getNodes()) {
|
|
59 |
AddressNode lowered;
|
48190
|
60 |
if (node instanceof OffsetAddressNode) {
|
43972
|
61 |
OffsetAddressNode address = (OffsetAddressNode) node;
|
|
62 |
lowered = lowering.lower(address.getBase(), address.getOffset());
|
48861
|
63 |
lowering.postProcess(lowered);
|
43972
|
64 |
} else {
|
|
65 |
continue;
|
|
66 |
}
|
|
67 |
node.replaceAtUsages(lowered);
|
|
68 |
GraphUtil.killWithUnusedFloatingInputs(node);
|
|
69 |
}
|
|
70 |
}
|
|
71 |
}
|