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