Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
PojavLauncherTeam
GitHub Repository: PojavLauncherTeam/mobile
Path: blob/master/test/hotspot/jtreg/compiler/codegen/Test6378821.java
41149 views
1
/*
2
* Copyright (c) 2009, 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
* @test
26
* @bug 6378821
27
* @summary where available, bitCount() should use POPC on SPARC processors and AMD+10h
28
*
29
* @run main/othervm -Xcomp
30
* -XX:CompileCommand=compileonly,compiler.codegen.Test6378821::fcomp
31
* compiler.codegen.Test6378821
32
*/
33
34
package compiler.codegen;
35
36
public class Test6378821 {
37
static final int[] ia = new int[] { 0x12345678 };
38
static final long[] la = new long[] { 0x12345678abcdefL };
39
40
public static void main(String [] args) {
41
// Resolve the class and the method.
42
Integer.bitCount(1);
43
Long.bitCount(1);
44
45
sub(ia[0]);
46
sub(la[0]);
47
sub(ia);
48
sub(la);
49
}
50
51
static void check(int i, int expected, int result) {
52
if (result != expected) {
53
throw new InternalError("Wrong population count for " + i + ": " + result + " != " + expected);
54
}
55
}
56
57
static void check(long l, int expected, int result) {
58
if (result != expected) {
59
throw new InternalError("Wrong population count for " + l + ": " + result + " != " + expected);
60
}
61
}
62
63
static void sub(int i) { check(i, fint(i), fcomp(i) ); }
64
static void sub(int[] ia) { check(ia[0], fint(ia), fcomp(ia)); }
65
static void sub(long l) { check(l, fint(l), fcomp(l) ); }
66
static void sub(long[] la) { check(la[0], fint(la), fcomp(la)); }
67
68
static int fint (int i) { return Integer.bitCount(i); }
69
static int fcomp(int i) { return Integer.bitCount(i); }
70
71
static int fint (int[] ia) { return Integer.bitCount(ia[0]); }
72
static int fcomp(int[] ia) { return Integer.bitCount(ia[0]); }
73
74
static int fint (long l) { return Long.bitCount(l); }
75
static int fcomp(long l) { return Long.bitCount(l); }
76
77
static int fint (long[] la) { return Long.bitCount(la[0]); }
78
static int fcomp(long[] la) { return Long.bitCount(la[0]); }
79
}
80
81