org.graalvm.compiler.replacements.NodeStrideUtil Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of compiler Show documentation
Show all versions of compiler Show documentation
The GraalVM compiler and the Graal-truffle optimizer.
/*
* Copyright (c) 2022, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package org.graalvm.compiler.replacements;
import org.graalvm.compiler.core.common.Stride;
import org.graalvm.compiler.core.common.StrideUtil;
import org.graalvm.compiler.nodes.ValueNode;
/**
* This class provides utility methods for "stride-agnostic" intrinsic nodes such as
* {@link org.graalvm.compiler.replacements.nodes.ArrayRegionCompareToNode}. These intrinsics may
* work with fixed strides of 1, 2 or 4 bytes per element, or with a dynamic parameter containing
* the stride in log2 format, i.e. {@code 0 -> 1 byte, 1 -> 2 byte, 2 -> 4 byte}. If an intrinsic
* method has two array parameters with potentially different strides, both log2 stride values are
* encoded into one as follows: {@code (strideA * N_STRIDES) + strideB}. This value is used inside
* the intrinsic as a jump table index to dispatch to separately compiled versions for each possible
* combination of strides.
*/
public final class NodeStrideUtil {
/**
* If the constant stride parameter {@code strideA} is non-null, return it. Otherwise, extract
* {@code strideA} from the constant direct stub call index value {@code dynamicStrides}.
*/
public static Stride getConstantStrideA(ValueNode dynamicStrides, Stride strideA) {
if (strideA != null) {
return strideA;
}
return StrideUtil.getConstantStrideA(dynamicStrides.asJavaConstant().asInt());
}
/**
* If the constant stride parameter {@code strideB} is non-null, return it. Otherwise, extract
* {@code strideB} from the constant direct stub call index value {@code dynamicStrides}.
*/
public static Stride getConstantStrideB(ValueNode dynamicStrides, Stride strideB) {
if (strideB != null) {
return strideB;
}
return StrideUtil.getConstantStrideB(dynamicStrides.asJavaConstant().asInt());
}
/**
* If the constant stride parameters {@code strideA} and {@code strideB} are non-null, construct
* a direct stub call index from them. Otherwise, return the direct stub call index contained in
* {@code dynamicStrides}, if it is constant. If {@code dynamicStrides} is not constant, return
* {@code -1}.
*/
public static int getDirectStubCallIndex(ValueNode dynamicStrides, Stride strideA, Stride strideB) {
if (strideA != null && strideB != null) {
return StrideUtil.getDirectStubCallIndex(strideA.log2, strideB.log2);
}
if (dynamicStrides != null && dynamicStrides.isJavaConstant()) {
return dynamicStrides.asJavaConstant().asInt();
}
return -1;
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy