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