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