1 /*
2 * Copyright (c) 2014, 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 * @test
26 * @bug 8058744
27 * @summary Invalid pattern-matching of address computations in raw unsafe
28 * @library /testlibrary
29 * @build com.oracle.java.testlibrary.*
30 * @run main/othervm -Xbatch UnsafeRaw
31 */
32
33 import com.oracle.java.testlibrary.Utils;
34 import java.util.Random;
35
36 public class UnsafeRaw {
37 public static class Tests {
38 public static int int_index(sun.misc.Unsafe unsafe, long base, int index) throws Exception {
39 return unsafe.getInt(base + (index << 2));
40 }
41 public static int long_index(sun.misc.Unsafe unsafe, long base, long index) throws Exception {
42 return unsafe.getInt(base + (index << 2));
43 }
44 public static int int_index_back_ashift(sun.misc.Unsafe unsafe, long base, int index) throws Exception {
45 return unsafe.getInt(base + (index >> 2));
46 }
47 public static int int_index_back_lshift(sun.misc.Unsafe unsafe, long base, int index) throws Exception {
48 return unsafe.getInt(base + (index >>> 2));
49 }
50 public static int long_index_back_ashift(sun.misc.Unsafe unsafe, long base, long index) throws Exception {
51 return unsafe.getInt(base + (index >> 2));
52 }
53 public static int long_index_back_lshift(sun.misc.Unsafe unsafe, long base, long index) throws Exception {
54 return unsafe.getInt(base + (index >>> 2));
55 }
56 public static int int_const_12345678_index(sun.misc.Unsafe unsafe, long base) throws Exception {
57 int idx4 = 0x12345678;
58 return unsafe.getInt(base + idx4);
59 }
60 public static int long_const_1234567890abcdef_index(sun.misc.Unsafe unsafe, long base) throws Exception {
61 long idx5 = 0x1234567890abcdefL;
62 return unsafe.getInt(base + idx5);
63 }
64 public static int int_index_mul(sun.misc.Unsafe unsafe, long base, int index) throws Exception {
65 return unsafe.getInt(base + (index * 4));
66 }
67 public static int long_index_mul(sun.misc.Unsafe unsafe, long base, long index) throws Exception {
68 return unsafe.getInt(base + (index * 4));
69 }
70 public static int int_index_mul_scale_16(sun.misc.Unsafe unsafe, long base, int index) throws Exception {
71 return unsafe.getInt(base + (index * 16));
72 }
73 public static int long_index_mul_scale_16(sun.misc.Unsafe unsafe, long base, long index) throws Exception {
74 return unsafe.getInt(base + (index * 16));
75 }
76 }
77
78 public static void main(String[] args) throws Exception {
79 sun.misc.Unsafe unsafe = Utils.getUnsafe();
80 final int array_size = 128;
81 final int element_size = 4;
82 final int magic = 0x12345678;
83
84 Random rnd = Utils.getRandomInstance();
85
86 long array = unsafe.allocateMemory(array_size * element_size); // 128 ints
87 long addr = array + array_size * element_size / 2; // something in the middle to work with
88 unsafe.putInt(addr, magic);
89 for (int j = 0; j < 100000; j++) {
90 if (Tests.int_index(unsafe, addr, 0) != magic) throw new Exception();
91 if (Tests.long_index(unsafe, addr, 0) != magic) throw new Exception();
92 if (Tests.int_index_mul(unsafe, addr, 0) != magic) throw new Exception();
93 if (Tests.long_index_mul(unsafe, addr, 0) != magic) throw new Exception();
94 {
95 long idx1 = rnd.nextLong();
96 long addr1 = addr - (idx1 << 2);
97 if (Tests.long_index(unsafe, addr1, idx1) != magic) throw new Exception();
98 }
99 {
100 long idx2 = rnd.nextLong();
101 long addr2 = addr - (idx2 >> 2);
102 if (Tests.long_index_back_ashift(unsafe, addr2, idx2) != magic) throw new Exception();
103 }
104 {
105 long idx3 = rnd.nextLong();
106 long addr3 = addr - (idx3 >>> 2);
107 if (Tests.long_index_back_lshift(unsafe, addr3, idx3) != magic) throw new Exception();
108 }
109 {
110 long idx4 = 0x12345678;
111 long addr4 = addr - idx4;
112 if (Tests.int_const_12345678_index(unsafe, addr4) != magic) throw new Exception();
113 }
114 {
115 long idx5 = 0x1234567890abcdefL;
116 long addr5 = addr - idx5;
117 if (Tests.long_const_1234567890abcdef_index(unsafe, addr5) != magic) throw new Exception();
118 }
119 {
120 int idx6 = rnd.nextInt();
121 long addr6 = addr - (idx6 >> 2);
122 if (Tests.int_index_back_ashift(unsafe, addr6, idx6) != magic) throw new Exception();
123 }
124 {
125 int idx7 = rnd.nextInt();
126 long addr7 = addr - (idx7 >>> 2);
127 if (Tests.int_index_back_lshift(unsafe, addr7, idx7) != magic) throw new Exception();
128 }
129 {
130 int idx8 = rnd.nextInt();
131 long addr8 = addr - (idx8 * 16);
132 if (Tests.int_index_mul_scale_16(unsafe, addr8, idx8) != magic) throw new Exception();
133 }
134 {
135 long idx9 = rnd.nextLong();
136 long addr9 = addr - (idx9 * 16);
137 if (Tests.long_index_mul_scale_16(unsafe, addr9, idx9) != magic) throw new Exception();
138 }
139 }
140 }
141 }