/* * Copyright (c) 1998, 2019, 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.
*/
try { // ClassArray.length;
maxClassIndex = Math.abs(Integer.parseInt(line));
} catch (NumberFormatException e) { thrownew Error("TESTBUG: Error reading Classlist - first number must be number of methods defined", e);
}
ClassArray = new String[maxClassIndex];
ClassInstanceArray = newClass[maxClassIndex];
MethodName_Array = new String[maxClassIndex];
MethodInstance_Array = new Method[maxClassIndex];
MethodID_Array = newint[maxClassIndex];
int i; for (i = 0; i < maxClassIndex; i++) { try {
line = classList.readLine();
} catch (IOException e) { thrownew Error("TESTBUG: Error reading ClasslistFile: testListPath", e);
}
StringTokenizer lineTokens = new StringTokenizer(line, "\t "); if (lineTokens.countTokens() < 3) { thrownew Error("TESTBUG: ClasslistFile: unexpected line:" + line);
} else {
ClassArray[i] = lineTokens.nextToken();
MethodName_Array[i] = lineTokens.nextToken();
MethodID_Array[i] = Integer.parseInt(lineTokens.nextToken());
}
}
maxClassIndex = i;
} finally { if (classList != null) { try {
classList.close();
} catch (IOException e) { thrownew Error("can't close file", e);
}
}
}
// does a binary search to find the index for the ID of a method privatestaticint ID_BinSearch(int begin, int end, int ID) { if (end < begin) { return (-1);
}
int mid = (begin + end) / 2; int midvalue = MethodID_Array[mid];
if (ID == midvalue) { return (mid);
} elseif (ID < midvalue) { return (ID_BinSearch(begin, mid - 1, ID));
} else { return (ID_BinSearch(mid + 1, end, ID));
}
}
// based off a static index, this function selects the method to be called publicstatic MethodData returnNextStaticMethod(int Method_ID) { //int i = ID_BinSearch(0, MethodID_Array.length - 1, Method_ID); int i = ID_BinSearch(0, maxClassIndex - 1, Method_ID);
return (nextStaticMethod((i == -1) ? 0 : i));
}
// this function randomly selects the next method to be called by the test class publicstatic MethodData nextRandomMethod() { int i = indexGenerator.nextInt(maxClassIndex); return (nextStaticMethod(i));
}
/* These two functions are used to verify that all function were called in the proper order */
// called by "parent" function to add childs ID to vector publicstaticvoid addFunctionIDToVector(int FunctionIndex, Vector IDVector) {
IDVector.addElement(FunctionIndex);
}
// called by "child" to add Function Index to Vector publicstaticvoid appendSumToSummationVector(int FunctionIndex, Vector SummationVector) { if (SummationVector.isEmpty()) {
SummationVector.addElement((long) FunctionIndex);
} else {
SummationVector.addElement((Long) SummationVector.lastElement() + FunctionIndex);
}
}
// This function calls a method based off of MethodData publicstaticvoid callMethod(MethodData methodCallStr,
Vector summation, Vector ID, Long numFcalls, Integer staticFcalls) throws InvocationTargetException { try {
methodCallStr.nextMethod.invoke(methodCallStr.instance,
summation, ID, numFcalls, staticFcalls);
} catch (IllegalAccessException e) { // should never happen with a valid testfile thrownew TestFailure("Illegal Access Exception", e);
}
}
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.