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 
  24 package org.graalvm.compiler.core.amd64;
  25 
  26 import jdk.vm.ci.meta.JavaConstant;
  27 
  28 import org.graalvm.compiler.core.common.NumUtil;
  29 import org.graalvm.compiler.asm.amd64.AMD64Address.Scale;
  30 import org.graalvm.compiler.core.common.type.IntegerStamp;

  31 import org.graalvm.compiler.nodes.ValueNode;
  32 import org.graalvm.compiler.nodes.calc.AddNode;
  33 import org.graalvm.compiler.nodes.calc.LeftShiftNode;
  34 import org.graalvm.compiler.nodes.calc.ZeroExtendNode;
  35 import org.graalvm.compiler.nodes.memory.address.AddressNode;
  36 import org.graalvm.compiler.phases.common.AddressLoweringPhase.AddressLowering;
  37 
  38 public class AMD64AddressLowering extends AddressLowering {
  39 
  40     @Override
  41     public AddressNode lower(ValueNode address) {
  42         return lower(address, null);
  43     }
  44 
  45     @Override
  46     public AddressNode lower(ValueNode base, ValueNode offset) {
  47         AMD64AddressNode ret = new AMD64AddressNode(base, offset);
  48         boolean changed;
  49         do {
  50             changed = improve(ret);
  51         } while (changed);
  52         return base.graph().unique(ret);
  53     }
  54 
  55     protected boolean improve(AMD64AddressNode ret) {



  56         ValueNode newBase = improveInput(ret, ret.getBase(), 0);
  57         if (newBase != ret.getBase()) {
  58             ret.setBase(newBase);
  59             return true;
  60         }
  61 
  62         ValueNode newIdx = improveInput(ret, ret.getIndex(), ret.getScale().log2);
  63         if (newIdx != ret.getIndex()) {
  64             ret.setIndex(newIdx);
  65             return true;
  66         }
  67 
  68         if (ret.getIndex() instanceof LeftShiftNode) {
  69             LeftShiftNode shift = (LeftShiftNode) ret.getIndex();
  70             if (shift.getY().isConstant()) {
  71                 int amount = ret.getScale().log2 + shift.getY().asJavaConstant().asInt();
  72                 Scale scale = Scale.fromShift(amount);
  73                 if (scale != null) {
  74                     ret.setIndex(shift.getX());
  75                     ret.setScale(scale);

  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 
  24 package org.graalvm.compiler.core.amd64;
  25 
  26 import jdk.vm.ci.meta.JavaConstant;
  27 
  28 import org.graalvm.compiler.core.common.NumUtil;
  29 import org.graalvm.compiler.asm.amd64.AMD64Address.Scale;
  30 import org.graalvm.compiler.core.common.type.IntegerStamp;
  31 import org.graalvm.compiler.debug.DebugContext;
  32 import org.graalvm.compiler.nodes.ValueNode;
  33 import org.graalvm.compiler.nodes.calc.AddNode;
  34 import org.graalvm.compiler.nodes.calc.LeftShiftNode;
  35 import org.graalvm.compiler.nodes.calc.ZeroExtendNode;
  36 import org.graalvm.compiler.nodes.memory.address.AddressNode;
  37 import org.graalvm.compiler.phases.common.AddressLoweringPhase.AddressLowering;
  38 
  39 public class AMD64AddressLowering extends AddressLowering {
  40 
  41     @Override
  42     public AddressNode lower(ValueNode address) {
  43         return lower(address, null);
  44     }
  45 
  46     @Override
  47     public AddressNode lower(ValueNode base, ValueNode offset) {
  48         AMD64AddressNode ret = new AMD64AddressNode(base, offset);
  49         boolean changed;
  50         do {
  51             changed = improve(base.getDebug(), ret);
  52         } while (changed);
  53         return base.graph().unique(ret);
  54     }
  55 
  56     /**
  57      * @param debug
  58      */
  59     protected boolean improve(DebugContext debug, AMD64AddressNode ret) {
  60         ValueNode newBase = improveInput(ret, ret.getBase(), 0);
  61         if (newBase != ret.getBase()) {
  62             ret.setBase(newBase);
  63             return true;
  64         }
  65 
  66         ValueNode newIdx = improveInput(ret, ret.getIndex(), ret.getScale().log2);
  67         if (newIdx != ret.getIndex()) {
  68             ret.setIndex(newIdx);
  69             return true;
  70         }
  71 
  72         if (ret.getIndex() instanceof LeftShiftNode) {
  73             LeftShiftNode shift = (LeftShiftNode) ret.getIndex();
  74             if (shift.getY().isConstant()) {
  75                 int amount = ret.getScale().log2 + shift.getY().asJavaConstant().asInt();
  76                 Scale scale = Scale.fromShift(amount);
  77                 if (scale != null) {
  78                     ret.setIndex(shift.getX());
  79                     ret.setScale(scale);