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