organicmaps/icu
13
Fork 0
mirror of https://github.com/unicode-org/icu.git synced 2025-04-07 22:44:49 +00:00
Code Issues 1 Projects Releases Wiki Activity Actions 2

ICU-3895 default arguments for PerfTest

Browse source 
X-SVN-Rev: 15986
This commit is contained in:
Doug Felt 2004-07-08 21:31:25 +00:00
parent 8cdece1fec
commit a8baad21f1
1 changed files with 16 additions and 15 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

31
icu4j/src/com/ibm/icu/dev/test/perf/PerfTest.java
View file

@ -246,13 +246,15 @@ public abstract class PerfTest {
//bufferLen = 0;
verbose = false;
bulk_mode = false;
passes = iterations = time = 0;
passes = 3; // default
iterations = 0;
time = 3; // default
locale = null;
UOption[] options = getOptions();
int remainingArgc = UOption.parseArgs(args, options);
if(args.length==0 || options[HELP1].doesOccur || options[HELP2].doesOccur) {
if(options[HELP1].doesOccur || options[HELP2].doesOccur) {
throw new UsageException();
}
@ -318,7 +320,6 @@ public abstract class PerfTest {
int i, j;
for (i=0; i<remainingArgc; ++i) {
// is args[i] a method name?
Method m = getTestMethod(args[i]);
if (m != null) {
@ -332,7 +333,12 @@ public abstract class PerfTest {
break;
}
if (methodList.size() < 1 || options[LIST].doesOccur) {
if (methodList.size() < 1) { // default to all methods
System.out.println("running all methods");
methodList.addAll(getAvailableTests().values());
}
if (options[LIST].doesOccur) {
System.err.println("Available tests:");
Iterator methods = getAvailableTests().values().iterator();
TreeSet methodNames = new TreeSet();
@ -343,10 +349,7 @@ public abstract class PerfTest {
while (tests.hasNext()) {
System.err.println(" " + tests.next());
}
if (options[LIST].doesOccur) {
System.exit(0);
}
throw new UsageException("Must specify at least one method name");
return;
}
// Pass remaining arguments, if any, through to the subclass
@ -378,6 +381,7 @@ public abstract class PerfTest {
throw new RuntimeException(meth.getName() + " returned an illegal operations/iteration()");
}
// System.out.println("passes: " + passes + " iterations: " + iterations);
int n;
long t;
for (j=0; j<passes; ++j) {
@ -394,16 +398,13 @@ public abstract class PerfTest {
int loops = 0;
int failsafe = 1; // last resort for very fast methods
t = 0;
while (t < (int)(n * 0.9)) { // 90% is close enough
if (loops == 0 || t == 0) {
while (t < n) {
if (t < 100) {
loops = failsafe;
failsafe *= 10;
failsafe *= 2;
} else {
//System.out.println("# " + meth.getName() + " x " + loops + " = " + t);
loops = (int)((double)n / t * loops + 0.5);
if (loops == 0) {
throw new RuntimeException("Unable to converge on desired duration");
}
loops = Math.max(loops+1, (int)((double)n / t * loops + 0.5));
}
//System.out.println("# " + meth.getName() + " x " + loops);
t = testFunction.time(loops);