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