never@505: /*
trims@1907:  * Copyright (c) 1997, 2008, Oracle and/or its affiliates. All rights reserved.
kamg@612:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
never@505:  *
kamg@612:  * This code is free software; you can redistribute it and/or modify it
kamg@612:  * under the terms of the GNU General Public License version 2 only, as
kamg@612:  * published by the Free Software Foundation.
never@505:  *
kamg@612:  * This code is distributed in the hope that it will be useful, but WITHOUT
kamg@612:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
kamg@612:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
kamg@612:  * version 2 for more details (a copy is included in the LICENSE file that
kamg@612:  * accompanied this code).
never@505:  *
kamg@612:  * You should have received a copy of the GNU General Public License version
kamg@612:  * 2 along with this work; if not, write to the Free Software Foundation,
kamg@612:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
never@505:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
never@505:  *
never@505:  */
never@505: 
never@505: /*
never@505:  * @test
never@505:  * @bug 6661247
never@505:  * @summary Internal bug in 32-bit HotSpot optimizer while bit manipulations
never@505:  */
never@505: 
never@505: import java.util.Random;
never@505: import java.nio.*;
never@505: 
never@505: // This isn't a completely reliable test for 6661247 since the results
never@505: // depend on what the local schedule looks like but it does reproduce
never@505: // the issue in current builds.
never@505: 
never@505: public class Test {
never@505: 
never@505:     public static void test(boolean[] src, int srcPos, LongBuffer dest, long destPos, int count) {
never@505:         int countStart = (destPos & 63) == 0 ? 0 : 64 - (int)(destPos & 63);
never@505:         if (countStart > count)
never@505:             countStart = count;
never@505:         for (int srcPosMax = srcPos + countStart; srcPos < srcPosMax; srcPos++, destPos++) {
never@505:             if (src[srcPos])
never@505:                 dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) | 1L << (destPos & 63));
never@505:             else
never@505:                 dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) & ~(1L << (destPos & 63)));
never@505:         }
never@505:         count -= countStart;
never@505:         int cnt = count >>> 6;
never@505:         for (int k = (int)(destPos >>> 6), kMax = k + cnt; k < kMax; k++) {
never@505:             int low = (src[srcPos] ? 1 : 0)
never@505:                 | (src[srcPos + 1] ? 1 << 1 : 0)
never@505:                 | (src[srcPos + 2] ? 1 << 2 : 0)
never@505:                 | (src[srcPos + 3] ? 1 << 3 : 0)
never@505:                 | (src[srcPos + 4] ? 1 << 4 : 0)
never@505:                 | (src[srcPos + 5] ? 1 << 5 : 0)
never@505:                 | (src[srcPos + 6] ? 1 << 6 : 0)
never@505:                 | (src[srcPos + 7] ? 1 << 7 : 0)
never@505:                 | (src[srcPos + 8] ? 1 << 8 : 0)
never@505:                 | (src[srcPos + 9] ? 1 << 9 : 0)
never@505:                 | (src[srcPos + 10] ? 1 << 10 : 0)
never@505:                 | (src[srcPos + 11] ? 1 << 11 : 0)
never@505:                 | (src[srcPos + 12] ? 1 << 12 : 0)
never@505:                 | (src[srcPos + 13] ? 1 << 13 : 0)
never@505:                 | (src[srcPos + 14] ? 1 << 14 : 0)
never@505:                 | (src[srcPos + 15] ? 1 << 15 : 0)
never@505:                 | (src[srcPos + 16] ? 1 << 16 : 0)
never@505:                 | (src[srcPos + 17] ? 1 << 17 : 0)
never@505:                 | (src[srcPos + 18] ? 1 << 18 : 0)
never@505:                 | (src[srcPos + 19] ? 1 << 19 : 0)
never@505:                 | (src[srcPos + 20] ? 1 << 20 : 0)
never@505:                 | (src[srcPos + 21] ? 1 << 21 : 0)
never@505:                 | (src[srcPos + 22] ? 1 << 22 : 0)
never@505:                 | (src[srcPos + 23] ? 1 << 23 : 0)
never@505:                 | (src[srcPos + 24] ? 1 << 24 : 0)
never@505:                 | (src[srcPos + 25] ? 1 << 25 : 0)
never@505:                 | (src[srcPos + 26] ? 1 << 26 : 0)
never@505:                 | (src[srcPos + 27] ? 1 << 27 : 0)
never@505:                 | (src[srcPos + 28] ? 1 << 28 : 0)
never@505:                 | (src[srcPos + 29] ? 1 << 29 : 0)
never@505:                 | (src[srcPos + 30] ? 1 << 30 : 0)
never@505:                 | (src[srcPos + 31] ? 1 << 31 : 0)
never@505:                 ;
never@505:             srcPos += 32;
never@505:             int high = (src[srcPos] ? 1 : 0)        // PROBLEM!
never@505:                 | (src[srcPos + 1] ? 1 << 1 : 0)
never@505:                 | (src[srcPos + 2] ? 1 << 2 : 0)
never@505:                 | (src[srcPos + 3] ? 1 << 3 : 0)
never@505:                 | (src[srcPos + 4] ? 1 << 4 : 0)
never@505:                 | (src[srcPos + 5] ? 1 << 5 : 0)
never@505:                 | (src[srcPos + 6] ? 1 << 6 : 0)
never@505:                 | (src[srcPos + 7] ? 1 << 7 : 0)
never@505:                 | (src[srcPos + 8] ? 1 << 8 : 0)
never@505:                 | (src[srcPos + 9] ? 1 << 9 : 0)
never@505:                 | (src[srcPos + 10] ? 1 << 10 : 0)
never@505:                 | (src[srcPos + 11] ? 1 << 11 : 0)
never@505:                 | (src[srcPos + 12] ? 1 << 12 : 0)
never@505:                 | (src[srcPos + 13] ? 1 << 13 : 0)
never@505:                 | (src[srcPos + 14] ? 1 << 14 : 0)
never@505:                 | (src[srcPos + 15] ? 1 << 15 : 0)
never@505:                 | (src[srcPos + 16] ? 1 << 16 : 0)
never@505:                 | (src[srcPos + 17] ? 1 << 17 : 0)
never@505:                 | (src[srcPos + 18] ? 1 << 18 : 0)
never@505:                 | (src[srcPos + 19] ? 1 << 19 : 0)
never@505:                 | (src[srcPos + 20] ? 1 << 20 : 0)
never@505:                 | (src[srcPos + 21] ? 1 << 21 : 0)
never@505:                 | (src[srcPos + 22] ? 1 << 22 : 0)
never@505:                 | (src[srcPos + 23] ? 1 << 23 : 0)
never@505:                 | (src[srcPos + 24] ? 1 << 24 : 0)
never@505:                 | (src[srcPos + 25] ? 1 << 25 : 0)
never@505:                 | (src[srcPos + 26] ? 1 << 26 : 0)
never@505:                 | (src[srcPos + 27] ? 1 << 27 : 0)
never@505:                 | (src[srcPos + 28] ? 1 << 28 : 0)
never@505:                 | (src[srcPos + 29] ? 1 << 29 : 0)
never@505:                 | (src[srcPos + 30] ? 1 << 30 : 0)
never@505:                 | (src[srcPos + 31] ? 1 << 31 : 0)
never@505:                 ;
never@505:             srcPos += 32;
never@505:             dest.put(k, ((long)low & 0xFFFFFFFFL) | (((long)high) << 32));
never@505:             destPos += 64;
never@505:         }
never@505:         int countFinish = count & 63;
never@505:         for (int srcPosMax = srcPos + countFinish; srcPos < srcPosMax; srcPos++, destPos++) {
never@505:             if (src[srcPos])
never@505:                 dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) | 1L << (destPos & 63));
never@505:             else
never@505:                 dest.put((int)(destPos >>> 6), dest.get((int)(destPos >>> 6)) & ~(1L << (destPos & 63)));
never@505:         }
never@505:     }
never@505:     public static void main(String[] args) {
never@505:         Random r = new Random();
never@505:         int entries = 1000;
never@505:         boolean[] src = new boolean[entries * 64];
never@505:         long[] dest = new long[entries];
never@505:         long[] result = new long[entries];
never@505: 
never@505:         for (int c = 0; c < 2000; c++) {
never@505:             for (int i = 0; i < entries; i++) {
never@505:                 long l = r.nextLong();
never@505:                 for (int bit = 0; bit < 64; bit++) {
never@505:                     src[i * 64 + bit] = (l & (1L << bit)) != 0;
never@505:                 }
never@505:                 dest[i] = 0;
never@505:                 result[i] = l;
never@505:             }
never@505:             test(src, 0, LongBuffer.wrap(dest, 0, dest.length), 0, src.length);
never@505:             for (int i = 0; i < entries; i++) {
never@505:                 if (dest[i] != result[i]) {
never@505:                     throw new InternalError(i + ": " + Long.toHexString(dest[i]) + " != " + Long.toHexString(result[i]));
never@505:                 }
never@505:             }
never@505:         }
never@505:     }
never@505: }