< prev index next >

src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements/src/org/graalvm/compiler/replacements/nodes/ArrayEqualsNode.java

Print this page


   1 /*
   2  * Copyright (c) 2013, 2018, 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 
  24 
  25 package org.graalvm.compiler.replacements.nodes;
  26 
  27 import static org.graalvm.compiler.nodeinfo.InputType.Memory;
  28 


  29 import org.graalvm.compiler.core.common.type.StampFactory;
  30 import org.graalvm.compiler.graph.Node;
  31 import org.graalvm.compiler.graph.NodeClass;
  32 import org.graalvm.compiler.graph.spi.Canonicalizable;
  33 import org.graalvm.compiler.graph.spi.CanonicalizerTool;

  34 import org.graalvm.compiler.nodeinfo.NodeCycles;
  35 import org.graalvm.compiler.nodeinfo.NodeInfo;
  36 import org.graalvm.compiler.nodeinfo.NodeSize;
  37 import org.graalvm.compiler.nodes.ConstantNode;
  38 import org.graalvm.compiler.nodes.FixedWithNextNode;
  39 import org.graalvm.compiler.nodes.NamedLocationIdentity;
  40 import org.graalvm.compiler.nodes.NodeView;
  41 import org.graalvm.compiler.nodes.ValueNode;
  42 import org.graalvm.compiler.nodes.ValueNodeUtil;
  43 import org.graalvm.compiler.nodes.memory.MemoryAccess;
  44 import org.graalvm.compiler.nodes.memory.MemoryNode;
  45 import org.graalvm.compiler.nodes.spi.LIRLowerable;
  46 import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;
  47 import org.graalvm.compiler.nodes.spi.Virtualizable;
  48 import org.graalvm.compiler.nodes.spi.VirtualizerTool;
  49 import org.graalvm.compiler.nodes.util.GraphUtil;
  50 import org.graalvm.compiler.nodes.virtual.VirtualObjectNode;


  51 import jdk.internal.vm.compiler.word.LocationIdentity;
  52 
  53 import jdk.vm.ci.meta.ConstantReflectionProvider;
  54 import jdk.vm.ci.meta.JavaConstant;
  55 import jdk.vm.ci.meta.JavaKind;

  56 import jdk.vm.ci.meta.Value;
  57 
  58 // JaCoCo Exclude
  59 
  60 /**
  61  * Compares two arrays with the same length.
  62  */
  63 @NodeInfo(cycles = NodeCycles.CYCLES_UNKNOWN, size = NodeSize.SIZE_128)
  64 public final class ArrayEqualsNode extends FixedWithNextNode implements LIRLowerable, Canonicalizable, Virtualizable, MemoryAccess {
  65 







  66     public static final NodeClass<ArrayEqualsNode> TYPE = NodeClass.create(ArrayEqualsNode.class);
  67     /** {@link JavaKind} of the arrays to compare. */
  68     protected final JavaKind kind;
  69 
  70     /** One array to be tested for equality. */
  71     @Input ValueNode array1;
  72 
  73     /** The other array to be tested for equality. */
  74     @Input ValueNode array2;
  75 
  76     /** Length of both arrays. */
  77     @Input ValueNode length;
  78 
  79     @OptionalInput(Memory) MemoryNode lastLocationAccess;
  80 
  81     public ArrayEqualsNode(ValueNode array1, ValueNode array2, ValueNode length, @ConstantNodeParameter JavaKind kind) {
  82         super(TYPE, StampFactory.forKind(JavaKind.Boolean));
  83         this.kind = kind;
  84         this.array1 = array1;
  85         this.array2 = array2;


 161                             }
 162                         } else {
 163                             // the contents might be different
 164                             allEqual = false;
 165                         }
 166                     }
 167                     if (entry1.stamp(NodeView.DEFAULT).alwaysDistinct(entry2.stamp(NodeView.DEFAULT))) {
 168                         // the contents are different
 169                         tool.replaceWithValue(ConstantNode.forBoolean(false, graph()));
 170                         return;
 171                     }
 172                 }
 173                 if (allEqual) {
 174                     tool.replaceWithValue(ConstantNode.forBoolean(true, graph()));
 175                 }
 176             }
 177         }
 178     }
 179 
 180     @NodeIntrinsic
 181     static native boolean equals(Object array1, Object array2, int length, @ConstantNodeParameter JavaKind kind);
 182 
 183     public static boolean equals(boolean[] array1, boolean[] array2, int length) {
 184         return equals(array1, array2, length, JavaKind.Boolean);
 185     }
 186 
 187     public static boolean equals(byte[] array1, byte[] array2, int length) {
 188         return equals(array1, array2, length, JavaKind.Byte);
 189     }
 190 
 191     public static boolean equals(char[] array1, char[] array2, int length) {
 192         return equals(array1, array2, length, JavaKind.Char);
 193     }
 194 
 195     public static boolean equals(short[] array1, short[] array2, int length) {
 196         return equals(array1, array2, length, JavaKind.Short);
 197     }
 198 
 199     public static boolean equals(int[] array1, int[] array2, int length) {
 200         return equals(array1, array2, length, JavaKind.Int);
 201     }
 202 
 203     public static boolean equals(long[] array1, long[] array2, int length) {
 204         return equals(array1, array2, length, JavaKind.Long);
 205     }
 206 
 207     public static boolean equals(float[] array1, float[] array2, int length) {
 208         return equals(array1, array2, length, JavaKind.Float);
 209     }
 210 
 211     public static boolean equals(double[] array1, double[] array2, int length) {
 212         return equals(array1, array2, length, JavaKind.Double);
 213     }
 214 
 215     @Override
 216     public void generate(NodeLIRBuilderTool gen) {

 217         int constantLength = -1;
 218         if (length.isConstant()) {
 219             constantLength = length.asJavaConstant().asInt();
 220         }
 221         Value result = gen.getLIRGeneratorTool().emitArrayEquals(kind, gen.operand(array1), gen.operand(array2), gen.operand(length), constantLength, false);













 222         gen.setResult(this, result);
 223     }
 224 
 225     @Override
 226     public LocationIdentity getLocationIdentity() {
 227         return NamedLocationIdentity.getArrayLocation(kind);
 228     }
 229 
 230     @Override
 231     public MemoryNode getLastLocationAccess() {
 232         return lastLocationAccess;
 233     }
 234 
 235     @Override
 236     public void setLastLocationAccess(MemoryNode lla) {
 237         updateUsages(ValueNodeUtil.asNode(lastLocationAccess), ValueNodeUtil.asNode(lla));
 238         lastLocationAccess = lla;
 239     }
 240 }
   1 /*
   2  * Copyright (c) 2013, 2019, 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 
  24 
  25 package org.graalvm.compiler.replacements.nodes;
  26 
  27 import static org.graalvm.compiler.nodeinfo.InputType.Memory;
  28 
  29 import org.graalvm.compiler.api.replacements.Snippet;
  30 import org.graalvm.compiler.core.common.spi.ForeignCallLinkage;
  31 import org.graalvm.compiler.core.common.type.StampFactory;
  32 import org.graalvm.compiler.graph.Node;
  33 import org.graalvm.compiler.graph.NodeClass;
  34 import org.graalvm.compiler.graph.spi.Canonicalizable;
  35 import org.graalvm.compiler.graph.spi.CanonicalizerTool;
  36 import org.graalvm.compiler.lir.gen.LIRGeneratorTool;
  37 import org.graalvm.compiler.nodeinfo.NodeCycles;
  38 import org.graalvm.compiler.nodeinfo.NodeInfo;
  39 import org.graalvm.compiler.nodeinfo.NodeSize;
  40 import org.graalvm.compiler.nodes.ConstantNode;
  41 import org.graalvm.compiler.nodes.FixedWithNextNode;
  42 import org.graalvm.compiler.nodes.NamedLocationIdentity;
  43 import org.graalvm.compiler.nodes.NodeView;
  44 import org.graalvm.compiler.nodes.ValueNode;
  45 import org.graalvm.compiler.nodes.ValueNodeUtil;
  46 import org.graalvm.compiler.nodes.memory.MemoryAccess;
  47 import org.graalvm.compiler.nodes.memory.MemoryNode;
  48 import org.graalvm.compiler.nodes.spi.LIRLowerable;
  49 import org.graalvm.compiler.nodes.spi.NodeLIRBuilderTool;
  50 import org.graalvm.compiler.nodes.spi.Virtualizable;
  51 import org.graalvm.compiler.nodes.spi.VirtualizerTool;
  52 import org.graalvm.compiler.nodes.util.GraphUtil;
  53 import org.graalvm.compiler.nodes.virtual.VirtualObjectNode;
  54 import org.graalvm.compiler.options.Option;
  55 import org.graalvm.compiler.options.OptionKey;
  56 import jdk.internal.vm.compiler.word.LocationIdentity;
  57 
  58 import jdk.vm.ci.meta.ConstantReflectionProvider;
  59 import jdk.vm.ci.meta.JavaConstant;
  60 import jdk.vm.ci.meta.JavaKind;
  61 import jdk.vm.ci.meta.ResolvedJavaMethod;
  62 import jdk.vm.ci.meta.Value;
  63 
  64 // JaCoCo Exclude
  65 
  66 /**
  67  * Compares two arrays with the same length.
  68  */
  69 @NodeInfo(cycles = NodeCycles.CYCLES_UNKNOWN, size = NodeSize.SIZE_128)
  70 public final class ArrayEqualsNode extends FixedWithNextNode implements LIRLowerable, Canonicalizable, Virtualizable, MemoryAccess {
  71 
  72     public static class Options {
  73         // @formatter:off
  74         @Option(help = "Use Array equals stubs instead of embedding all the emitted code.")
  75         public static final OptionKey<Boolean> ArrayEqualsStubs = new OptionKey<>(true);
  76         // @formatter:on
  77     }
  78 
  79     public static final NodeClass<ArrayEqualsNode> TYPE = NodeClass.create(ArrayEqualsNode.class);
  80     /** {@link JavaKind} of the arrays to compare. */
  81     protected final JavaKind kind;
  82 
  83     /** One array to be tested for equality. */
  84     @Input ValueNode array1;
  85 
  86     /** The other array to be tested for equality. */
  87     @Input ValueNode array2;
  88 
  89     /** Length of both arrays. */
  90     @Input ValueNode length;
  91 
  92     @OptionalInput(Memory) MemoryNode lastLocationAccess;
  93 
  94     public ArrayEqualsNode(ValueNode array1, ValueNode array2, ValueNode length, @ConstantNodeParameter JavaKind kind) {
  95         super(TYPE, StampFactory.forKind(JavaKind.Boolean));
  96         this.kind = kind;
  97         this.array1 = array1;
  98         this.array2 = array2;


 174                             }
 175                         } else {
 176                             // the contents might be different
 177                             allEqual = false;
 178                         }
 179                     }
 180                     if (entry1.stamp(NodeView.DEFAULT).alwaysDistinct(entry2.stamp(NodeView.DEFAULT))) {
 181                         // the contents are different
 182                         tool.replaceWithValue(ConstantNode.forBoolean(false, graph()));
 183                         return;
 184                     }
 185                 }
 186                 if (allEqual) {
 187                     tool.replaceWithValue(ConstantNode.forBoolean(true, graph()));
 188                 }
 189             }
 190         }
 191     }
 192 
 193     @NodeIntrinsic
 194     public static native boolean equals(Object array1, Object array2, int length, @ConstantNodeParameter JavaKind kind);
 195 
 196     public static boolean equals(boolean[] array1, boolean[] array2, int length) {
 197         return equals(array1, array2, length, JavaKind.Boolean);
 198     }
 199 
 200     public static boolean equals(byte[] array1, byte[] array2, int length) {
 201         return equals(array1, array2, length, JavaKind.Byte);
 202     }
 203 
 204     public static boolean equals(char[] array1, char[] array2, int length) {
 205         return equals(array1, array2, length, JavaKind.Char);
 206     }
 207 
 208     public static boolean equals(short[] array1, short[] array2, int length) {
 209         return equals(array1, array2, length, JavaKind.Short);
 210     }
 211 
 212     public static boolean equals(int[] array1, int[] array2, int length) {
 213         return equals(array1, array2, length, JavaKind.Int);
 214     }
 215 
 216     public static boolean equals(long[] array1, long[] array2, int length) {
 217         return equals(array1, array2, length, JavaKind.Long);
 218     }
 219 
 220     public static boolean equals(float[] array1, float[] array2, int length) {
 221         return equals(array1, array2, length, JavaKind.Float);
 222     }
 223 
 224     public static boolean equals(double[] array1, double[] array2, int length) {
 225         return equals(array1, array2, length, JavaKind.Double);
 226     }
 227 
 228     @Override
 229     public void generate(NodeLIRBuilderTool gen) {
 230         LIRGeneratorTool tool = gen.getLIRGeneratorTool();
 231         int constantLength = -1;
 232         if (length.isConstant()) {
 233             constantLength = length.asJavaConstant().asInt();
 234         }
 235 
 236         if (Options.ArrayEqualsStubs.getValue(graph().getOptions())) {
 237             ResolvedJavaMethod method = graph().method();
 238             if (method != null && method.getAnnotation(Snippet.class) == null) {
 239                 ForeignCallLinkage linkage = tool.lookupArrayEqualsStub(kind, constantLength);
 240                 if (linkage != null) {
 241                     Value result = tool.emitForeignCall(linkage, null, gen.operand(array1), gen.operand(array2), gen.operand(length));
 242                     gen.setResult(this, result);
 243                     return;
 244                 }
 245             }
 246         }
 247 
 248         Value result = tool.emitArrayEquals(kind, gen.operand(array1), gen.operand(array2), gen.operand(length), constantLength, false);
 249         gen.setResult(this, result);
 250     }
 251 
 252     @Override
 253     public LocationIdentity getLocationIdentity() {
 254         return NamedLocationIdentity.getArrayLocation(kind);
 255     }
 256 
 257     @Override
 258     public MemoryNode getLastLocationAccess() {
 259         return lastLocationAccess;
 260     }
 261 
 262     @Override
 263     public void setLastLocationAccess(MemoryNode lla) {
 264         updateUsages(ValueNodeUtil.asNode(lastLocationAccess), ValueNodeUtil.asNode(lla));
 265         lastLocationAccess = lla;
 266     }
 267 }
< prev index next >