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.hotspot.nodes; |
|
26 |
|
27 import org.graalvm.compiler.graph.NodeClass; |
|
28 import org.graalvm.compiler.nodeinfo.InputType; |
|
29 import org.graalvm.compiler.nodeinfo.NodeInfo; |
|
30 import org.graalvm.compiler.nodes.ValueNode; |
|
31 import org.graalvm.compiler.nodes.memory.address.AddressNode; |
|
32 import org.graalvm.compiler.nodes.spi.Lowerable; |
|
33 |
|
34 @NodeInfo |
|
35 public abstract class ArrayRangeWriteBarrier extends WriteBarrier implements Lowerable { |
|
36 |
|
37 public static final NodeClass<ArrayRangeWriteBarrier> TYPE = NodeClass.create(ArrayRangeWriteBarrier.class); |
|
38 @Input(InputType.Association) AddressNode address; |
|
39 @Input ValueNode length; |
|
40 |
|
41 private final int elementStride; |
|
42 |
|
43 protected ArrayRangeWriteBarrier(NodeClass<? extends ArrayRangeWriteBarrier> c, AddressNode address, ValueNode length, int elementStride) { |
|
44 super(c); |
|
45 this.address = address; |
|
46 this.length = length; |
|
47 this.elementStride = elementStride; |
|
48 } |
|
49 |
|
50 public AddressNode getAddress() { |
|
51 return address; |
|
52 } |
|
53 |
|
54 public ValueNode getLength() { |
|
55 return length; |
|
56 } |
|
57 |
|
58 public int getElementStride() { |
|
59 return elementStride; |
|
60 } |
|
61 } |
|