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.memory.address.RawAddressNode; 31 import org.graalvm.compiler.nodes.util.GraphUtil; 32 import org.graalvm.compiler.phases.Phase; 33 34 public class AddressLoweringPhase extends Phase { 35 36 public abstract static class AddressLowering { 37 38 public abstract AddressNode lower(ValueNode address); 39 40 public abstract AddressNode lower(ValueNode base, ValueNode offset); 41 } 42 43 private final AddressLowering lowering; 44 45 public AddressLoweringPhase(AddressLowering lowering) { 46 this.lowering = lowering; 47 assert lowering != null; 48 } 49 50 @Override 51 protected void run(StructuredGraph graph) { 52 for (Node node : graph.getNodes()) { 53 AddressNode lowered; 54 if (node instanceof RawAddressNode) { 55 RawAddressNode address = (RawAddressNode) node; 56 lowered = lowering.lower(address.getAddress()); 57 } else if (node instanceof OffsetAddressNode) { 58 OffsetAddressNode address = (OffsetAddressNode) node; 59 lowered = lowering.lower(address.getBase(), address.getOffset()); 60 } else { 61 continue; 62 } 63 node.replaceAtUsages(lowered); 64 GraphUtil.killWithUnusedFloatingInputs(node); 65 } 66 } 67 }