comparison graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/spi/LoweringProvider.java @ 12045:0fc653a9e019

made GraalCodeCacheProvider independent of CodeCacheProvider and renamed the former to LoweringProvider (GRAAL-511)
author Doug Simon <doug.simon@oracle.com>
date Thu, 10 Oct 2013 20:50:54 +0200
parents graal/com.oracle.graal.nodes/src/com/oracle/graal/nodes/spi/GraalCodeCacheProvider.java@e6fd83e09082
children d138867d61c4
comparison
equal deleted inserted replaced
12044:6aef5b6bbdd8 12045:0fc653a9e019
1 /*
2 * Copyright (c) 2011, 2011, 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 package com.oracle.graal.nodes.spi;
24
25 import com.oracle.graal.graph.*;
26 import com.oracle.graal.nodes.*;
27 import com.oracle.graal.nodes.extended.*;
28
29 /**
30 * Provides a capability for replacing a higher node with one or more lower level nodes.
31 */
32 public interface LoweringProvider {
33
34 void lower(Node n, LoweringTool tool);
35
36 /**
37 * Reconstructs the array index from a location node that was created as a lowering of an
38 * indexed access to an array.
39 *
40 * @param location a location pointing to an element in an array
41 * @return a node that gives the index of the element
42 */
43 ValueNode reconstructArrayIndex(LocationNode location);
44 }