1 /* 2 * Copyright (c) 2011, 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 /** 26 * @test 27 * @bug 7100757 28 * @summary The BitSet.nextSetBit() produces incorrect result in 32bit VM on Sparc 29 * @library /testlibrary 30 * @modules java.base/jdk.internal.misc 31 * java.management 32 * 33 * @run main/timeout=300 compiler.codegen.Test7100757 34 */ 35 36 package compiler.codegen; 37 38 import jdk.test.lib.Utils; 39 40 import java.util.BitSet; 41 import java.util.Random; 42 43 public class Test7100757 { 44 45 public static final int NBITS = 256; 46 47 public static void main(String[] args) { 48 49 BitSet bs = new BitSet(NBITS); 50 Random rnd = Utils.getRandomInstance(); 51 long[] ra = new long[(NBITS+63)/64]; 52 53 for(int l=0; l < 5000000; l++) { 54 55 for(int r = 0; r < ra.length; r++) { 56 ra[r] = rnd.nextLong(); 57 } 58 test(ra, bs); 59 } 60 } 61 62 static void test(long[] ra, BitSet bs) { 63 bs.clear(); 64 int bits_set = 0; 65 for(int i = 0, t = 0, b = 0; i < NBITS; i++) { 66 long bit = 1L << b++; 67 if((ra[t]&bit) != 0) { 68 bs.set(i); 69 bits_set++; 70 } 71 if(b == 64) { 72 t++; 73 b = 0; 74 } 75 } 76 // Test Long.bitCount() 77 int check_bits = bs.cardinality(); 78 if (check_bits != bits_set) { 79 String bs_str = bs.toString(); 80 System.err.printf("cardinality bits: %d != %d bs: %s\n", check_bits, bits_set, bs_str); 81 System.exit(97); 82 } 83 // Test Long.numberOfTrailingZeros() 84 check_bits = 0; 85 for (int i = bs.nextSetBit(0); i >= 0; i = bs.nextSetBit(i+1)) { 86 check_bits++; 87 } 88 if (check_bits != bits_set) { 89 String bs_str = bs.toString(); 90 System.err.printf("nextSetBit bits: %d != %d bs: %s\n", check_bits, bits_set, bs_str); 91 System.exit(97); 92 } 93 // Test Long.numberOfLeadingZeros() 94 for(int i = bs.length(); i > 0; i = bs.length()) { 95 bs.clear(i-1); 96 } 97 // Test Long.bitCount() 98 check_bits = bs.cardinality(); 99 if (check_bits != 0) { 100 String bs_str = bs.toString(); 101 System.err.printf("after clear bits: %d != 0 bs: %s\n", check_bits, bs_str); 102 System.exit(97); 103 } 104 } 105 106 };