Test6661247.java revision 11707:ad7af1afda7a
1/* 2 * Copyright (c) 1997, 2008, 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/* 26 * @test 27 * @bug 6661247 28 * @summary Internal bug in 32-bit HotSpot optimizer while bit manipulations 29 * 30 * @run main compiler.c2.Test6661247 31 */ 32 33package compiler.c2; 34 35import java.nio.LongBuffer; 36import java.util.Random; 37 38// This isn't a completely reliable test for 6661247 since the results 39// depend on what the local schedule looks like but it does reproduce 40// the issue in current builds. 41 42public class Test6661247 { 43 44 public static void test(boolean[] src, int srcPos, LongBuffer dest, long destPos, int count) { 45 int countStart = (destPos & 63) == 0 ? 0 : 64 - (int)(destPos & 63); 46 if (countStart > count) 47 countStart = count; 48 for (int srcPosMax = srcPos + countStart; srcPos < srcPosMax; srcPos++, destPos++) { 49 if (src[srcPos]) 50 dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) | 1L << (destPos & 63)); 51 else 52 dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) & ~(1L << (destPos & 63))); 53 } 54 count -= countStart; 55 int cnt = count >>> 6; 56 for (int k = (int)(destPos >>> 6), kMax = k + cnt; k < kMax; k++) { 57 int low = (src[srcPos] ? 1 : 0) 58 | (src[srcPos + 1] ? 1 << 1 : 0) 59 | (src[srcPos + 2] ? 1 << 2 : 0) 60 | (src[srcPos + 3] ? 1 << 3 : 0) 61 | (src[srcPos + 4] ? 1 << 4 : 0) 62 | (src[srcPos + 5] ? 1 << 5 : 0) 63 | (src[srcPos + 6] ? 1 << 6 : 0) 64 | (src[srcPos + 7] ? 1 << 7 : 0) 65 | (src[srcPos + 8] ? 1 << 8 : 0) 66 | (src[srcPos + 9] ? 1 << 9 : 0) 67 | (src[srcPos + 10] ? 1 << 10 : 0) 68 | (src[srcPos + 11] ? 1 << 11 : 0) 69 | (src[srcPos + 12] ? 1 << 12 : 0) 70 | (src[srcPos + 13] ? 1 << 13 : 0) 71 | (src[srcPos + 14] ? 1 << 14 : 0) 72 | (src[srcPos + 15] ? 1 << 15 : 0) 73 | (src[srcPos + 16] ? 1 << 16 : 0) 74 | (src[srcPos + 17] ? 1 << 17 : 0) 75 | (src[srcPos + 18] ? 1 << 18 : 0) 76 | (src[srcPos + 19] ? 1 << 19 : 0) 77 | (src[srcPos + 20] ? 1 << 20 : 0) 78 | (src[srcPos + 21] ? 1 << 21 : 0) 79 | (src[srcPos + 22] ? 1 << 22 : 0) 80 | (src[srcPos + 23] ? 1 << 23 : 0) 81 | (src[srcPos + 24] ? 1 << 24 : 0) 82 | (src[srcPos + 25] ? 1 << 25 : 0) 83 | (src[srcPos + 26] ? 1 << 26 : 0) 84 | (src[srcPos + 27] ? 1 << 27 : 0) 85 | (src[srcPos + 28] ? 1 << 28 : 0) 86 | (src[srcPos + 29] ? 1 << 29 : 0) 87 | (src[srcPos + 30] ? 1 << 30 : 0) 88 | (src[srcPos + 31] ? 1 << 31 : 0) 89 ; 90 srcPos += 32; 91 int high = (src[srcPos] ? 1 : 0) // PROBLEM! 92 | (src[srcPos + 1] ? 1 << 1 : 0) 93 | (src[srcPos + 2] ? 1 << 2 : 0) 94 | (src[srcPos + 3] ? 1 << 3 : 0) 95 | (src[srcPos + 4] ? 1 << 4 : 0) 96 | (src[srcPos + 5] ? 1 << 5 : 0) 97 | (src[srcPos + 6] ? 1 << 6 : 0) 98 | (src[srcPos + 7] ? 1 << 7 : 0) 99 | (src[srcPos + 8] ? 1 << 8 : 0) 100 | (src[srcPos + 9] ? 1 << 9 : 0) 101 | (src[srcPos + 10] ? 1 << 10 : 0) 102 | (src[srcPos + 11] ? 1 << 11 : 0) 103 | (src[srcPos + 12] ? 1 << 12 : 0) 104 | (src[srcPos + 13] ? 1 << 13 : 0) 105 | (src[srcPos + 14] ? 1 << 14 : 0) 106 | (src[srcPos + 15] ? 1 << 15 : 0) 107 | (src[srcPos + 16] ? 1 << 16 : 0) 108 | (src[srcPos + 17] ? 1 << 17 : 0) 109 | (src[srcPos + 18] ? 1 << 18 : 0) 110 | (src[srcPos + 19] ? 1 << 19 : 0) 111 | (src[srcPos + 20] ? 1 << 20 : 0) 112 | (src[srcPos + 21] ? 1 << 21 : 0) 113 | (src[srcPos + 22] ? 1 << 22 : 0) 114 | (src[srcPos + 23] ? 1 << 23 : 0) 115 | (src[srcPos + 24] ? 1 << 24 : 0) 116 | (src[srcPos + 25] ? 1 << 25 : 0) 117 | (src[srcPos + 26] ? 1 << 26 : 0) 118 | (src[srcPos + 27] ? 1 << 27 : 0) 119 | (src[srcPos + 28] ? 1 << 28 : 0) 120 | (src[srcPos + 29] ? 1 << 29 : 0) 121 | (src[srcPos + 30] ? 1 << 30 : 0) 122 | (src[srcPos + 31] ? 1 << 31 : 0) 123 ; 124 srcPos += 32; 125 dest.put(k, ((long)low & 0xFFFFFFFFL) | (((long)high) << 32)); 126 destPos += 64; 127 } 128 int countFinish = count & 63; 129 for (int srcPosMax = srcPos + countFinish; srcPos < srcPosMax; srcPos++, destPos++) { 130 if (src[srcPos]) 131 dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) | 1L << (destPos & 63)); 132 else 133 dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) & ~(1L << (destPos & 63))); 134 } 135 } 136 public static void main(String[] args) { 137 Random r = new Random(); 138 int entries = 1000; 139 boolean[] src = new boolean[entries * 64]; 140 long[] dest = new long[entries]; 141 long[] result = new long[entries]; 142 143 for (int c = 0; c < 2000; c++) { 144 for (int i = 0; i < entries; i++) { 145 long l = r.nextLong(); 146 for (int bit = 0; bit < 64; bit++) { 147 src[i * 64 + bit] = (l & (1L << bit)) != 0; 148 } 149 dest[i] = 0; 150 result[i] = l; 151 } 152 test(src, 0, LongBuffer.wrap(dest, 0, dest.length), 0, src.length); 153 for (int i = 0; i < entries; i++) { 154 if (dest[i] != result[i]) { 155 throw new InternalError(i + ": " + Long.toHexString(dest[i]) + " != " + Long.toHexString(result[i])); 156 } 157 } 158 } 159 } 160} 161