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