infernap12/jdk
1
0
Fork 0
mirror of https://github.com/openjdk/jdk.git synced 2026-08-01 13:45:30 +00:00
Code Issues Packages Projects Releases Wiki Activity

8372816: New test sun/security/provider/acvp/ML_DSA_Intrinsic_Test.java succeeds in case of error

Browse Source 
Reviewed-by: azeller, mdoerr
This commit is contained in:
Volodymyr Paprotski 2025-12-03 21:32:29 +00:00
parent 5ea2b64021
commit 70e2bc876a
1 changed files with 11 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
test/jdk/sun/security/provider/acvp/ML_DSA_Intrinsic_Test.java
View File

@ -28,13 +28,6 @@ import java.lang.invoke.MethodHandles;
import java.lang.reflect.Method;
import java.util.HexFormat;
/*
* @test
* @library /test/lib
* @key randomness
* @modules java.base/sun.security.provider:+open
* @run main/othervm ML_DSA_Intrinsic_Test -XX:+UnlockDiagnosticVMOptions -XX:-UseDilithiumIntrinsics
*/
/*
* @test
* @requires os.simpleArch == "x64"
@ -55,7 +48,7 @@ import java.util.HexFormat;
// -XX:+UnlockDiagnosticVMOptions -XX:+UseDilithiumIntrinsics test/jdk/sun/security/provider/acvp/ML_DSA_Intrinsic_Test.java
public class ML_DSA_Intrinsic_Test {
public static void main(String[] args) throws Exception {
public static void main(String[] args) throws Exception, Throwable {
MethodHandles.Lookup lookup = MethodHandles.lookup();
Class<?> kClazz = sun.security.provider.ML_DSA.class;
@ -114,27 +107,23 @@ public class ML_DSA_Intrinsic_Test {
long seed = rnd.nextLong();
rnd.setSeed(seed);
//Note: it might be useful to increase this number during development of new intrinsics
final int repeat = 10000000;
final int repeat = 10000;
int[] coeffs1 = new int[ML_DSA_N];
int[] coeffs2 = new int[ML_DSA_N];
int[] prod1 = new int[ML_DSA_N];
int[] prod2 = new int[ML_DSA_N];
int[] prod3 = new int[ML_DSA_N];
int[] prod4 = new int[ML_DSA_N];
try {
for (int i = 0; i < repeat; i++) {
// Hint: if test fails, you can hardcode the seed to make the test more reproducible:
// rnd.setSeed(seed);
testMult(prod1, prod2, coeffs1, coeffs2, mult, multJava, rnd, seed, i);
testMultConst(prod1, prod2, multConst, multConstJava, rnd, seed, i);
testDecompose(prod1, prod2, prod3, prod4, coeffs1, coeffs2, decompose, decomposeJava, rnd, seed, i);
testAlmostNtt(coeffs1, coeffs2, almostNtt, almostNttJava, rnd, seed, i);
testInverseNtt(coeffs1, coeffs2, inverseNtt, inverseNttJava, rnd, seed, i);
}
System.out.println("Fuzz Success");
} catch (Throwable e) {
System.out.println("Fuzz Failed: " + e);
for (int i = 0; i < repeat; i++) {
// Hint: if test fails, you can hardcode the seed to make the test more reproducible:
// rnd.setSeed(seed);
testMult(prod1, prod2, coeffs1, coeffs2, mult, multJava, rnd, seed, i);
testMultConst(prod1, prod2, multConst, multConstJava, rnd, seed, i);
testDecompose(prod1, prod2, prod3, prod4, coeffs1, coeffs2, decompose, decomposeJava, rnd, seed, i);
testAlmostNtt(coeffs1, coeffs2, almostNtt, almostNttJava, rnd, seed, i);
testInverseNtt(coeffs1, coeffs2, inverseNtt, inverseNttJava, rnd, seed, i);
}
System.out.println("Fuzz Success");
}
private static final int ML_DSA_N = 256;