1 /*
2  * Copyright (c) 2015, 2020, Oracle and/or its affiliates. All rights reserved.
3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4  *
5  * This code is free software; you can redistribute it and/or modify it
6  * under the terms of the GNU General Public License version 2 only, as
7  * published by the Free Software Foundation.
8  *
9  * This code is distributed in the hope that it will be useful, but WITHOUT
10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
12  * version 2 for more details (a copy is included in the LICENSE file that
13  * accompanied this code).
14  *
15  * You should have received a copy of the GNU General Public License version
16  * 2 along with this work; if not, write to the Free Software Foundation,
17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18  *
19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20  * or visit www.oracle.com if you need additional information or have any
21  * questions.
22  */
23 
24 /**
25  * @test
26  * @key randomness
27  * @bug 8081778
28  * @summary Add C2 x86 intrinsic for BigInteger::mulAdd() method
29  * @comment the test disables intrinsics, so it can't be run w/ AOT'ed java.base
30  * @requires !vm.aot.enabled
31  *
32  * @library /test/lib
33  * @run main/othervm/timeout=600 -XX:-TieredCompilation -Xbatch
34  *      -XX:+IgnoreUnrecognizedVMOptions -XX:+UnlockDiagnosticVMOptions -XX:-UseSquareToLenIntrinsic -XX:-UseMultiplyToLenIntrinsic
35  *      -XX:CompileCommand=dontinline,compiler.intrinsics.bigInteger.TestMulAdd::main
36  *      -XX:CompileCommand=option,compiler.intrinsics.bigInteger.TestMulAdd::base_multiply,ccstr,DisableIntrinsic,_mulAdd
37  *      -XX:CompileCommand=option,java.math.BigInteger::multiply,ccstr,DisableIntrinsic,_mulAdd
38  *      -XX:CompileCommand=option,java.math.BigInteger::square,ccstr,DisableIntrinsic,_mulAdd
39  *      -XX:CompileCommand=option,java.math.BigInteger::squareToLen,ccstr,DisableIntrinsic,_mulAdd
40  *      -XX:CompileCommand=option,java.math.BigInteger::mulAdd,ccstr,DisableIntrinsic,_mulAdd
41  *      -XX:CompileCommand=inline,java.math.BigInteger::multiply
42  *      -XX:CompileCommand=inline,java.math.BigInteger::square
43  *      -XX:CompileCommand=inline,java.math.BigInteger::squareToLen
44  *      -XX:CompileCommand=inline,java.math.BigInteger::mulAdd
45  *      compiler.intrinsics.bigInteger.TestMulAdd
46  */
47 
48 package compiler.intrinsics.bigInteger;
49 
50 import java.math.BigInteger;
51 import java.util.Random;
52 import jdk.test.lib.Utils;
53 
54 public class TestMulAdd {
55 
56     // Avoid intrinsic by preventing inlining multiply() and mulAdd().
base_multiply(BigInteger op1)57     public static BigInteger base_multiply(BigInteger op1) {
58       return op1.multiply(op1);
59     }
60 
61     // Generate mulAdd() intrinsic by inlining multiply().
new_multiply(BigInteger op1)62     public static BigInteger new_multiply(BigInteger op1) {
63       return op1.multiply(op1);
64     }
65 
bytecompare(BigInteger b1, BigInteger b2)66     public static boolean bytecompare(BigInteger b1, BigInteger b2) {
67       byte[] data1 = b1.toByteArray();
68       byte[] data2 = b2.toByteArray();
69       if (data1.length != data2.length)
70         return false;
71       for (int i = 0; i < data1.length; i++) {
72         if (data1[i] != data2[i])
73           return false;
74       }
75       return true;
76     }
77 
stringify(BigInteger b)78     public static String stringify(BigInteger b) {
79       String strout= "";
80       byte [] data = b.toByteArray();
81       for (int i = 0; i < data.length; i++) {
82         strout += (String.format("%02x",data[i]) + " ");
83       }
84       return strout;
85     }
86 
main(String args[])87     public static void main(String args[]) throws Exception {
88 
89       BigInteger oldsum = new BigInteger("0");
90       BigInteger newsum = new BigInteger("0");
91 
92       BigInteger b1, b2, oldres, newres;
93 
94       Random rand = new Random(Utils.getRandomInstance().nextLong());
95       Random rand1 = new Random(Utils.getRandomInstance().nextLong());
96 
97       for (int j = 0; j < 100000; j++) {
98         int rand_int = rand1.nextInt(3136)+32;
99         b1 = new BigInteger(rand_int, rand);
100 
101         oldres = base_multiply(b1);
102         newres = new_multiply(b1);
103 
104         oldsum = oldsum.add(oldres);
105         newsum = newsum.add(newres);
106 
107         if (!bytecompare(oldres,newres)) {
108           System.out.print("mismatch for:b1:" + stringify(b1) + " :oldres:" + stringify(oldres) + " :newres:" + stringify(newres));
109           System.out.println(b1);
110           throw new Exception("Failed");
111         }
112       }
113       if (!bytecompare(oldsum,newsum))  {
114         System.out.println("Failure: oldsum:" + stringify(oldsum) + " newsum:" + stringify(newsum));
115         throw new Exception("Failed");
116       } else {
117         System.out.println("Success");
118       }
119    }
120 }
121