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.nodes.spi;
26
27 import org.graalvm.compiler.core.common.spi.ArrayOffsetProvider;
28 import org.graalvm.compiler.graph.Node;
29 import org.graalvm.compiler.nodes.ValueNode;
30 import org.graalvm.compiler.nodes.memory.address.AddressNode;
31
32 import jdk.vm.ci.meta.JavaKind;
33
34 /**
35 * Provides a capability for replacing a higher node with one or more lower level nodes.
36 */
37 public interface LoweringProvider extends ArrayOffsetProvider {
38
39 void lower(Node n, LoweringTool tool);
40
41 /**
42 * Reconstructs the array index from an address node that was created as a lowering of an
43 * indexed access to an array.
44 *
45 * @param elementKind the {@link JavaKind} of the array elements
46 * @param address an {@link AddressNode} pointing to an element in an array
47 * @return a node that gives the index of the element
48 */
49 ValueNode reconstructArrayIndex(JavaKind elementKind, AddressNode address);
50
51 /**
52 * Indicates the smallest width for comparing an integer value on the target platform.
53 */
54 default Integer smallestCompareWidth() {
55 // most platforms only support 32 and 64 bit compares
56 return 32;
57 }
|
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.nodes.spi;
26
27 import org.graalvm.compiler.graph.Node;
28 import org.graalvm.compiler.nodes.ValueNode;
29 import org.graalvm.compiler.nodes.memory.address.AddressNode;
30
31 import jdk.vm.ci.meta.JavaKind;
32
33 /**
34 * Provides a capability for replacing a higher node with one or more lower level nodes.
35 */
36 public interface LoweringProvider {
37
38 void lower(Node n, LoweringTool tool);
39
40 /**
41 * Reconstructs the array index from an address node that was created as a lowering of an
42 * indexed access to an array.
43 *
44 * @param elementKind the {@link JavaKind} of the array elements
45 * @param address an {@link AddressNode} pointing to an element in an array
46 * @return a node that gives the index of the element
47 */
48 ValueNode reconstructArrayIndex(JavaKind elementKind, AddressNode address);
49
50 /**
51 * Indicates the smallest width for comparing an integer value on the target platform.
52 */
53 default Integer smallestCompareWidth() {
54 // most platforms only support 32 and 64 bit compares
55 return 32;
56 }
|