1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246
|
/*
* Copyright (c) 2007, 2016, 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.
*/
/*
* This is not a regression test, but a micro-benchmark.
* To exercise swap, run with filter=LITTLE_ENDIAN on sparc,
* filter=BIG_ENDIAN on x86.
*
* I have run this as follows:
*
* for f in -client -server; do mergeBench dolphin . jr -dsa -da $f SwapMicroBenchmark.java filter=LITTLE_ENDIAN; done
*
* @author Martin Buchholz
*/
import java.util.*;
import java.nio.*;
import java.util.regex.Pattern;
public class SwapMicroBenchmark {
abstract static class Job {
private final String name;
public Job(String name) { this.name = name; }
public String name() { return name; }
public abstract void work() throws Throwable;
}
private static void collectAllGarbage() {
final java.util.concurrent.CountDownLatch drained
= new java.util.concurrent.CountDownLatch(1);
try {
System.gc(); // enqueue finalizable objects
new Object() { protected void finalize() {
drained.countDown(); }};
System.gc(); // enqueue detector
drained.await(); // wait for finalizer queue to drain
System.gc(); // cleanup finalized objects
} catch (InterruptedException e) { throw new Error(e); }
}
/**
* Runs each job for long enough that all the runtime compilers
* have had plenty of time to warm up, i.e. get around to
* compiling everything worth compiling.
* Returns array of average times per job per run.
*/
private static long[] time0(Job ... jobs) throws Throwable {
final long warmupNanos = 10L * 1000L * 1000L * 1000L;
long[] nanoss = new long[jobs.length];
for (int i = 0; i < jobs.length; i++) {
collectAllGarbage();
long t0 = System.nanoTime();
long t;
int j = 0;
do { jobs[i].work(); j++; }
while ((t = System.nanoTime() - t0) < warmupNanos);
nanoss[i] = t/j;
}
return nanoss;
}
private static void time(Job ... jobs) throws Throwable {
long[] warmup = time0(jobs); // Warm up run
long[] nanoss = time0(jobs); // Real timing run
long[] milliss = new long[jobs.length];
double[] ratios = new double[jobs.length];
final String nameHeader = "Method";
final String millisHeader = "Millis";
final String ratioHeader = "Ratio";
int nameWidth = nameHeader.length();
int millisWidth = millisHeader.length();
int ratioWidth = ratioHeader.length();
for (int i = 0; i < jobs.length; i++) {
nameWidth = Math.max(nameWidth, jobs[i].name().length());
milliss[i] = nanoss[i]/(1000L * 1000L);
millisWidth = Math.max(millisWidth,
String.format("%d", milliss[i]).length());
ratios[i] = (double) nanoss[i] / (double) nanoss[0];
ratioWidth = Math.max(ratioWidth,
String.format("%.3f", ratios[i]).length());
}
String format = String.format("%%-%ds %%%dd %%%d.3f%%n",
nameWidth, millisWidth, ratioWidth);
String headerFormat = String.format("%%-%ds %%%ds %%%ds%%n",
nameWidth, millisWidth, ratioWidth);
System.out.printf(headerFormat, "Method", "Millis", "Ratio");
// Print out absolute and relative times, calibrated against first job
for (int i = 0; i < jobs.length; i++)
System.out.printf(format, jobs[i].name(), milliss[i], ratios[i]);
}
private static String keywordValue(String[] args, String keyword) {
for (String arg : args)
if (arg.startsWith(keyword))
return arg.substring(keyword.length() + 1);
return null;
}
private static int intArg(String[] args, String keyword, int defaultValue) {
String val = keywordValue(args, keyword);
return val == null ? defaultValue : Integer.parseInt(val);
}
private static Pattern patternArg(String[] args, String keyword) {
String val = keywordValue(args, keyword);
return val == null ? null : Pattern.compile(val);
}
private static Job[] filter(Pattern filter, Job[] jobs) {
if (filter == null) return jobs;
Job[] newJobs = new Job[jobs.length];
int n = 0;
for (Job job : jobs)
if (filter.matcher(job.name()).find())
newJobs[n++] = job;
// Arrays.copyOf not available in JDK 5
Job[] ret = new Job[n];
System.arraycopy(newJobs, 0, ret, 0, n);
return ret;
}
private static void deoptimize(int sum) {
if (sum == 42)
System.out.println("the answer");
}
/**
* Usage: [iterations=N] [size=N] [filter=REGEXP]
*/
public static void main(String[] args) throws Throwable {
final int iterations = intArg(args, "iterations", 10000);
final int size = intArg(args, "size", 1024);
final Pattern filter = patternArg(args, "filter");
final Random rnd = new Random();
final ByteBuffer b = ByteBuffer.allocateDirect(8*size);
for (int i = 0; i < b.limit(); i++)
b.put(i, (byte) rnd.nextInt());
Job[] jobs = {
new Job("swap char BIG_ENDIAN") {
public void work() throws Throwable {
b.order(ByteOrder.BIG_ENDIAN);
CharBuffer x = b.asCharBuffer();
for (int i = 0; i < iterations; i++) {
int sum = 0;
for (int j = 0, end = x.limit(); j < end; j++)
sum += x.get(j);
deoptimize(sum);}}},
new Job("swap char LITTLE_ENDIAN") {
public void work() throws Throwable {
b.order(ByteOrder.LITTLE_ENDIAN);
CharBuffer x = b.asCharBuffer();
for (int i = 0; i < iterations; i++) {
int sum = 0;
for (int j = 0, end = x.limit(); j < end; j++)
sum += x.get(j);
deoptimize(sum);}}},
new Job("swap short BIG_ENDIAN") {
public void work() throws Throwable {
b.order(ByteOrder.BIG_ENDIAN);
ShortBuffer x = b.asShortBuffer();
for (int i = 0; i < iterations; i++) {
int sum = 0;
for (int j = 0, end = x.limit(); j < end; j++)
sum += x.get(j);
deoptimize(sum);}}},
new Job("swap short LITTLE_ENDIAN") {
public void work() throws Throwable {
b.order(ByteOrder.LITTLE_ENDIAN);
ShortBuffer x = b.asShortBuffer();
for (int i = 0; i < iterations; i++) {
int sum = 0;
for (int j = 0, end = x.limit(); j < end; j++)
sum += x.get(j);
deoptimize(sum);}}},
new Job("swap int BIG_ENDIAN") {
public void work() throws Throwable {
b.order(ByteOrder.BIG_ENDIAN);
IntBuffer x = b.asIntBuffer();
for (int i = 0; i < iterations; i++) {
int sum = 0;
for (int j = 0, end = x.limit(); j < end; j++)
sum += x.get(j);
deoptimize(sum);}}},
new Job("swap int LITTLE_ENDIAN") {
public void work() throws Throwable {
b.order(ByteOrder.LITTLE_ENDIAN);
IntBuffer x = b.asIntBuffer();
for (int i = 0; i < iterations; i++) {
int sum = 0;
for (int j = 0, end = x.limit(); j < end; j++)
sum += x.get(j);
deoptimize(sum);}}},
new Job("swap long BIG_ENDIAN") {
public void work() throws Throwable {
b.order(ByteOrder.BIG_ENDIAN);
LongBuffer x = b.asLongBuffer();
for (int i = 0; i < iterations; i++) {
int sum = 0;
for (int j = 0, end = x.limit(); j < end; j++)
sum += x.get(j);
deoptimize(sum);}}},
new Job("swap long LITTLE_ENDIAN") {
public void work() throws Throwable {
b.order(ByteOrder.LITTLE_ENDIAN);
LongBuffer x = b.asLongBuffer();
for (int i = 0; i < iterations; i++) {
int sum = 0;
for (int j = 0, end = x.limit(); j < end; j++)
sum += x.get(j);
deoptimize(sum);}}}
};
time(filter(filter, jobs));
}
}
|