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; 26 27 import java.lang.reflect.Array; 28 29 import org.graalvm.compiler.api.replacements.ClassSubstitution; 30 import org.graalvm.compiler.api.replacements.MethodSubstitution; 31 import org.graalvm.compiler.nodes.DeoptimizeNode; 32 import org.graalvm.compiler.nodes.extended.BranchProbabilityNode; 33 import org.graalvm.compiler.nodes.java.ArrayLengthNode; 34 35 import jdk.vm.ci.meta.DeoptimizationAction; 36 import jdk.vm.ci.meta.DeoptimizationReason; 37 38 // JaCoCo Exclude 39 40 /** 41 * Substitutions for {@link java.lang.reflect.Array} methods. 42 */ 43 @ClassSubstitution(Array.class) 44 public class ArraySubstitutions { 45 46 @MethodSubstitution 47 public static int getLength(Object array) { 48 if (BranchProbabilityNode.probability(BranchProbabilityNode.DEOPT_PROBABILITY, !array.getClass().isArray())) { 49 DeoptimizeNode.deopt(DeoptimizationAction.None, DeoptimizationReason.RuntimeConstraint); 50 } 51 return ArrayLengthNode.arrayLength(array); 52 } 53 54 }