1 /*
   2  * Copyright (c) 2011, 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  *
  30  * @run main Test7100757
  31  */
  32 
  33 import java.util.*;
  34 
  35 public class Test7100757 {
  36 
  37   public static final int NBITS = 256;
  38 
  39   public static void main(String[] args) {
  40 
  41     BitSet bs = new BitSet(NBITS);
  42     Random rnd = new Random();
  43     long[] ra = new long[(NBITS+63)/64];
  44 
  45     for(int l=0; l < 5000000; l++) {
  46 
  47       for(int r = 0; r < ra.length; r++) {
  48         ra[r] = rnd.nextLong();
  49       }
  50       test(ra, bs);
  51     }
  52   }
  53 
  54   static void test(long[] ra, BitSet bs) {
  55       bs.clear();
  56       int bits_set = 0;
  57       for(int i = 0, t = 0, b = 0; i < NBITS; i++) {
  58         long bit = 1L << b++;
  59         if((ra[t]&bit) != 0) {
  60           bs.set(i);
  61           bits_set++;
  62         }
  63         if(b == 64) {
  64           t++;
  65           b = 0;
  66         }
  67       }
  68       for (int i = bs.nextSetBit(0); i >= 0; i = bs.nextSetBit(i+1)) {
  69         bits_set--;
  70       }
  71 
  72       if (bits_set != 0) {
  73         String bs_str = bs.toString();
  74         System.err.printf("bits_set: %d, bs: %s\n", bits_set, bs_str);
  75         System.exit(97);
  76       }
  77   }
  78 
  79 };