aoqi@0: /*
aoqi@0:  * Copyright (c) 2009, Oracle and/or its affiliates. All rights reserved.
aoqi@0:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0:  *
aoqi@0:  * This code is free software; you can redistribute it and/or modify it
aoqi@0:  * under the terms of the GNU General Public License version 2 only, as
aoqi@0:  * published by the Free Software Foundation.
aoqi@0:  *
aoqi@0:  * This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
aoqi@0:  * version 2 for more details (a copy is included in the LICENSE file that
aoqi@0:  * accompanied this code).
aoqi@0:  *
aoqi@0:  * You should have received a copy of the GNU General Public License version
aoqi@0:  * 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0:  *
aoqi@0:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0:  * or visit www.oracle.com if you need additional information or have any
aoqi@0:  * questions.
aoqi@0:  */
aoqi@0: 
aoqi@0: /**
aoqi@0:  * @test
aoqi@0:  * @bug 6378821
aoqi@0:  * @summary where available, bitCount() should use POPC on SPARC processors and AMD+10h
aoqi@0:  *
aoqi@0:  * @run main/othervm -Xcomp -XX:CompileOnly=Test6378821.fcomp Test6378821
aoqi@0:  */
aoqi@0: 
aoqi@0: public class Test6378821 {
aoqi@0:     static final int[]  ia = new int[]  { 0x12345678 };
aoqi@0:     static final long[] la = new long[] { 0x12345678abcdefL };
aoqi@0: 
aoqi@0:     public static void main(String [] args) {
aoqi@0:         // Resolve the class and the method.
aoqi@0:         Integer.bitCount(1);
aoqi@0:         Long.bitCount(1);
aoqi@0: 
aoqi@0:         sub(ia[0]);
aoqi@0:         sub(la[0]);
aoqi@0:         sub(ia);
aoqi@0:         sub(la);
aoqi@0:     }
aoqi@0: 
aoqi@0:     static void check(int i, int expected, int result) {
aoqi@0:         if (result != expected) {
aoqi@0:             throw new InternalError("Wrong population count for " + i + ": " + result + " != " + expected);
aoqi@0:         }
aoqi@0:     }
aoqi@0: 
aoqi@0:     static void check(long l, int expected, int result) {
aoqi@0:         if (result != expected) {
aoqi@0:             throw new InternalError("Wrong population count for " + l + ": " + result + " != " + expected);
aoqi@0:         }
aoqi@0:     }
aoqi@0: 
aoqi@0:     static void sub(int i)     { check(i,     fint(i),  fcomp(i) ); }
aoqi@0:     static void sub(int[] ia)  { check(ia[0], fint(ia), fcomp(ia)); }
aoqi@0:     static void sub(long l)    { check(l,     fint(l),  fcomp(l) ); }
aoqi@0:     static void sub(long[] la) { check(la[0], fint(la), fcomp(la)); }
aoqi@0: 
aoqi@0:     static int fint (int i)     { return Integer.bitCount(i); }
aoqi@0:     static int fcomp(int i)     { return Integer.bitCount(i); }
aoqi@0: 
aoqi@0:     static int fint (int[] ia)  { return Integer.bitCount(ia[0]); }
aoqi@0:     static int fcomp(int[] ia)  { return Integer.bitCount(ia[0]); }
aoqi@0: 
aoqi@0:     static int fint (long l)    { return Long.bitCount(l); }
aoqi@0:     static int fcomp(long l)    { return Long.bitCount(l); }
aoqi@0: 
aoqi@0:     static int fint (long[] la) { return Long.bitCount(la[0]); }
aoqi@0:     static int fcomp(long[] la) { return Long.bitCount(la[0]); }
aoqi@0: }