228 lines
8.6 KiB
Java
228 lines
8.6 KiB
Java
/*
|
|
* Copyright (c) 2015, 2023, Oracle and/or its affiliates. All rights reserved.
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
*
|
|
* This code is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License version 2 only, as
|
|
* published by the Free Software Foundation.
|
|
*
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
* accompanied this code).
|
|
*
|
|
* You should have received a copy of the GNU General Public License version
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
*
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
* questions.
|
|
*/
|
|
|
|
/**
|
|
* @test
|
|
* @bug 8132081
|
|
* @summary C2 support for Adler32 on SPARC
|
|
*
|
|
* @run main/othervm/timeout=600 -Xbatch compiler.intrinsics.zip.TestAdler32 -m
|
|
*/
|
|
|
|
package compiler.intrinsics.zip;
|
|
|
|
import java.nio.ByteBuffer;
|
|
import java.util.zip.Adler32;
|
|
import java.util.zip.Checksum;
|
|
|
|
public class TestAdler32 {
|
|
public static void main(String[] args) {
|
|
int offset = Integer.getInteger("offset", 0);
|
|
int msgSize = Integer.getInteger("msgSize", 512);
|
|
boolean multi = false;
|
|
int iters = 20000;
|
|
int warmupIters = 20000;
|
|
|
|
if (args.length > 0) {
|
|
if (args[0].equals("-m")) {
|
|
multi = true;
|
|
} else {
|
|
iters = Integer.valueOf(args[0]);
|
|
}
|
|
if (args.length > 1) {
|
|
warmupIters = Integer.valueOf(args[1]);
|
|
}
|
|
}
|
|
|
|
if (multi) {
|
|
test_multi(warmupIters);
|
|
return;
|
|
}
|
|
|
|
System.out.println(" offset = " + offset);
|
|
System.out.println("msgSize = " + msgSize + " bytes");
|
|
System.out.println(" iters = " + iters);
|
|
|
|
byte[] b = initializedBytes(msgSize, offset);
|
|
|
|
Adler32 adler0 = new Adler32();
|
|
Adler32 adler1 = new Adler32();
|
|
Adler32 adler2 = new Adler32();
|
|
|
|
adler0.update(b, offset, msgSize);
|
|
|
|
System.out.println("-------------------------------------------------------");
|
|
|
|
/* warm up */
|
|
for (int i = 0; i < warmupIters; i++) {
|
|
adler1.reset();
|
|
adler1.update(b, offset, msgSize);
|
|
}
|
|
|
|
/* measure performance */
|
|
long start = System.nanoTime();
|
|
for (int i = 0; i < iters; i++) {
|
|
adler1.reset();
|
|
adler1.update(b, offset, msgSize);
|
|
}
|
|
long end = System.nanoTime();
|
|
double total = (double)(end - start)/1e9; // in seconds
|
|
double thruput = (double)msgSize*iters/1e6/total; // in MB/s
|
|
System.out.println("Adler32.update(byte[]) runtime = " + total + " seconds");
|
|
System.out.println("Adler32.update(byte[]) throughput = " + thruput + " MB/s");
|
|
|
|
/* check correctness */
|
|
for (int i = 0; i < iters; i++) {
|
|
adler1.reset();
|
|
adler1.update(b, offset, msgSize);
|
|
if (!check(adler0, adler1)) break;
|
|
}
|
|
report("Adlers", adler0, adler1);
|
|
|
|
System.out.println("-------------------------------------------------------");
|
|
|
|
ByteBuffer buf = ByteBuffer.allocateDirect(msgSize);
|
|
buf.put(b, offset, msgSize);
|
|
buf.flip();
|
|
|
|
/* warm up */
|
|
for (int i = 0; i < warmupIters; i++) {
|
|
adler2.reset();
|
|
adler2.update(buf);
|
|
buf.rewind();
|
|
}
|
|
|
|
/* measure performance */
|
|
start = System.nanoTime();
|
|
for (int i = 0; i < iters; i++) {
|
|
adler2.reset();
|
|
adler2.update(buf);
|
|
buf.rewind();
|
|
}
|
|
end = System.nanoTime();
|
|
total = (double)(end - start)/1e9; // in seconds
|
|
thruput = (double)msgSize*iters/1e6/total; // in MB/s
|
|
System.out.println("Adler32.update(ByteBuffer) runtime = " + total + " seconds");
|
|
System.out.println("Adler32.update(ByteBuffer) throughput = " + thruput + " MB/s");
|
|
|
|
/* check correctness */
|
|
for (int i = 0; i < iters; i++) {
|
|
adler2.reset();
|
|
adler2.update(buf);
|
|
buf.rewind();
|
|
if (!check(adler0, adler2)) break;
|
|
}
|
|
report("Adlers", adler0, adler1);
|
|
|
|
System.out.println("-------------------------------------------------------");
|
|
}
|
|
|
|
private static void report(String s, Checksum adler0, Checksum adler1) {
|
|
System.out.printf("%s: adler0 = %08x, adler1 = %08x\n",
|
|
s, adler0.getValue(), adler1.getValue());
|
|
}
|
|
|
|
private static boolean check(Checksum adler0, Checksum adler1) {
|
|
if (adler0.getValue() != adler1.getValue()) {
|
|
System.err.printf("ERROR: adler0 = %08x, adler1 = %08x\n",
|
|
adler0.getValue(), adler1.getValue());
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
private static byte[] initializedBytes(int M, int offset) {
|
|
byte[] bytes = new byte[M + offset];
|
|
for (int i = 0; i < offset; i++) {
|
|
bytes[i] = (byte) i;
|
|
}
|
|
for (int i = offset; i < bytes.length; i++) {
|
|
bytes[i] = (byte) (i - offset);
|
|
}
|
|
return bytes;
|
|
}
|
|
|
|
private static void test_multi(int iters) {
|
|
int len1 = 8; // the 8B/iteration loop
|
|
int len2 = 32; // the 32B/iteration loop
|
|
int len3 = 4096; // the 4KB/iteration loop
|
|
int len4 = 5552; // the adler limit
|
|
|
|
byte[] b = initializedBytes(len3*16, 0);
|
|
int[] offsets = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 16, 32, 64, 128, 256, 512 };
|
|
int[] sizes = { 0, 1, 2, 3, 4, 5, 6, 7,
|
|
len1, len1+1, len1+2, len1+3, len1+4, len1+5, len1+6, len1+7,
|
|
len1*2, len1*2+1, len1*2+3, len1*2+5, len1*2+7,
|
|
len2, len2+1, len2+3, len2+5, len2+7,
|
|
len2*2, len2*4, len2*8, len2*16, len2*32, len2*64,
|
|
len3, len3+1, len3+3, len3+5, len3+7,
|
|
len3*2, len3*4, len3*8,
|
|
len4, len4+1, len4+3, len4+5, len4+7, len4+len1, len4+len2, len4+len3,
|
|
len4*2, len4*4, len4*2+1, len4*4+4,
|
|
len1+len2, len1+len2+1, len1+len2+3, len1+len2+5, len1+len2+7,
|
|
len1+len3, len1+len3+1, len1+len3+3, len1+len3+5, len1+len3+7,
|
|
len2+len3, len2+len3+1, len2+len3+3, len2+len3+5, len2+len3+7,
|
|
len1+len2+len3, len1+len2+len3+1, len1+len2+len3+3,
|
|
len1+len2+len3+5, len1+len2+len3+7,
|
|
(len1+len2+len3)*2, (len1+len2+len3)*2+1, (len1+len2+len3)*2+3,
|
|
(len1+len2+len3)*2+5, (len1+len2+len3)*2+7,
|
|
(len1+len2+len3)*3, (len1+len2+len3)*3-1, (len1+len2+len3)*3-3,
|
|
(len1+len2+len3)*3-5, (len1+len2+len3)*3-7 };
|
|
Adler32[] adler0 = new Adler32[offsets.length*sizes.length];
|
|
Adler32[] adler1 = new Adler32[offsets.length*sizes.length];
|
|
int i, j, k;
|
|
|
|
System.out.printf("testing %d cases ...\n", offsets.length*sizes.length);
|
|
|
|
/* set the result from interpreter as reference */
|
|
for (i = 0; i < offsets.length; i++) {
|
|
for (j = 0; j < sizes.length; j++) {
|
|
adler0[i*sizes.length + j] = new Adler32();
|
|
adler1[i*sizes.length + j] = new Adler32();
|
|
adler0[i*sizes.length + j].update(b, offsets[i], sizes[j]);
|
|
}
|
|
}
|
|
|
|
/* warm up the JIT compiler and get result */
|
|
for (k = 0; k < iters; k++) {
|
|
for (i = 0; i < offsets.length; i++) {
|
|
for (j = 0; j < sizes.length; j++) {
|
|
adler1[i*sizes.length + j].reset();
|
|
adler1[i*sizes.length + j].update(b, offsets[i], sizes[j]);
|
|
}
|
|
}
|
|
}
|
|
|
|
/* check correctness */
|
|
for (i = 0; i < offsets.length; i++) {
|
|
for (j = 0; j < sizes.length; j++) {
|
|
if (!check(adler0[i*sizes.length + j], adler1[i*sizes.length + j])) {
|
|
System.out.printf("Failed at: offsets[%d] = %d", i, offsets[i]);
|
|
System.out.printf(", sizes[%d] = %d\n", j, sizes[j]);
|
|
throw new AssertionError("TEST FAILED", null);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|