test/compiler/6378821/Test6378821.java

Tue, 08 Aug 2017 15:57:29 +0800

author
aoqi
date
Tue, 08 Aug 2017 15:57:29 +0800
changeset 6876
710a3c8b516e
parent 1907
c18cbe5936b8
parent 0
f90c822e73f8
permissions
-rw-r--r--

merge

aoqi@0 1 /*
aoqi@0 2 * Copyright (c) 2009, Oracle and/or its affiliates. All rights reserved.
aoqi@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0 4 *
aoqi@0 5 * This code is free software; you can redistribute it and/or modify it
aoqi@0 6 * under the terms of the GNU General Public License version 2 only, as
aoqi@0 7 * published by the Free Software Foundation.
aoqi@0 8 *
aoqi@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0 12 * version 2 for more details (a copy is included in the LICENSE file that
aoqi@0 13 * accompanied this code).
aoqi@0 14 *
aoqi@0 15 * You should have received a copy of the GNU General Public License version
aoqi@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0 18 *
aoqi@0 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0 20 * or visit www.oracle.com if you need additional information or have any
aoqi@0 21 * questions.
aoqi@0 22 */
aoqi@0 23
aoqi@0 24 /**
aoqi@0 25 * @test
aoqi@0 26 * @bug 6378821
aoqi@0 27 * @summary where available, bitCount() should use POPC on SPARC processors and AMD+10h
aoqi@0 28 *
aoqi@0 29 * @run main/othervm -Xcomp -XX:CompileOnly=Test6378821.fcomp Test6378821
aoqi@0 30 */
aoqi@0 31
aoqi@0 32 public class Test6378821 {
aoqi@0 33 static final int[] ia = new int[] { 0x12345678 };
aoqi@0 34 static final long[] la = new long[] { 0x12345678abcdefL };
aoqi@0 35
aoqi@0 36 public static void main(String [] args) {
aoqi@0 37 // Resolve the class and the method.
aoqi@0 38 Integer.bitCount(1);
aoqi@0 39 Long.bitCount(1);
aoqi@0 40
aoqi@0 41 sub(ia[0]);
aoqi@0 42 sub(la[0]);
aoqi@0 43 sub(ia);
aoqi@0 44 sub(la);
aoqi@0 45 }
aoqi@0 46
aoqi@0 47 static void check(int i, int expected, int result) {
aoqi@0 48 if (result != expected) {
aoqi@0 49 throw new InternalError("Wrong population count for " + i + ": " + result + " != " + expected);
aoqi@0 50 }
aoqi@0 51 }
aoqi@0 52
aoqi@0 53 static void check(long l, int expected, int result) {
aoqi@0 54 if (result != expected) {
aoqi@0 55 throw new InternalError("Wrong population count for " + l + ": " + result + " != " + expected);
aoqi@0 56 }
aoqi@0 57 }
aoqi@0 58
aoqi@0 59 static void sub(int i) { check(i, fint(i), fcomp(i) ); }
aoqi@0 60 static void sub(int[] ia) { check(ia[0], fint(ia), fcomp(ia)); }
aoqi@0 61 static void sub(long l) { check(l, fint(l), fcomp(l) ); }
aoqi@0 62 static void sub(long[] la) { check(la[0], fint(la), fcomp(la)); }
aoqi@0 63
aoqi@0 64 static int fint (int i) { return Integer.bitCount(i); }
aoqi@0 65 static int fcomp(int i) { return Integer.bitCount(i); }
aoqi@0 66
aoqi@0 67 static int fint (int[] ia) { return Integer.bitCount(ia[0]); }
aoqi@0 68 static int fcomp(int[] ia) { return Integer.bitCount(ia[0]); }
aoqi@0 69
aoqi@0 70 static int fint (long l) { return Long.bitCount(l); }
aoqi@0 71 static int fcomp(long l) { return Long.bitCount(l); }
aoqi@0 72
aoqi@0 73 static int fint (long[] la) { return Long.bitCount(la[0]); }
aoqi@0 74 static int fcomp(long[] la) { return Long.bitCount(la[0]); }
aoqi@0 75 }

mercurial