Mercurial > hg > graal-jvmci-8
comparison test/compiler/intrinsics/squaretolen/TestSquareToLen.java @ 23885:51c505229e71
8081778: Use Intel x64 CPU instructions for RSA acceleration
Summary: Add intrinsics for BigInteger squareToLen and mulAdd methods.
Reviewed-by: kvn, jrose
author | igerasim |
---|---|
date | Wed, 17 Feb 2016 13:40:12 +0300 |
parents | |
children | 0cd040567d60 |
comparison
equal
deleted
inserted
replaced
23884:0d5597f44603 | 23885:51c505229e71 |
---|---|
1 /* | |
2 * Copyright (c) 2015, 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 /** | |
26 * @test | |
27 * @bug 8081778 | |
28 * @summary Add C2 x86 intrinsic for BigInteger::squareToLen() method | |
29 * | |
30 * @run main/othervm/timeout=600 -XX:-TieredCompilation -Xbatch | |
31 * -XX:CompileCommand=exclude,TestSquareToLen::main | |
32 * -XX:CompileCommand=option,TestSquareToLen::base_multiply,ccstr,DisableIntrinsic,_squareToLen | |
33 * -XX:CompileCommand=option,java.math.BigInteger::multiply,ccstr,DisableIntrinsic,_squareToLen | |
34 * -XX:CompileCommand=option,java.math.BigInteger::square,ccstr,DisableIntrinsic,_squareToLen | |
35 * -XX:CompileCommand=option,java.math.BigInteger::squareToLen,ccstr,DisableIntrinsic,_squareToLen | |
36 * -XX:CompileCommand=inline,java.math.BigInteger::multiply | |
37 * -XX:CompileCommand=inline,java.math.BigInteger::square | |
38 * -XX:CompileCommand=inline,java.math.BigInteger::squareToLen TestSquareToLen | |
39 */ | |
40 | |
41 import java.util.Random; | |
42 import java.math.*; | |
43 | |
44 public class TestSquareToLen { | |
45 | |
46 // Avoid intrinsic by preventing inlining multiply() and squareToLen(). | |
47 public static BigInteger base_multiply(BigInteger op1) { | |
48 return op1.multiply(op1); | |
49 } | |
50 | |
51 // Generate squareToLen() intrinsic by inlining multiply(). | |
52 public static BigInteger new_multiply(BigInteger op1) { | |
53 return op1.multiply(op1); | |
54 } | |
55 | |
56 public static boolean bytecompare(BigInteger b1, BigInteger b2) { | |
57 byte[] data1 = b1.toByteArray(); | |
58 byte[] data2 = b2.toByteArray(); | |
59 if (data1.length != data2.length) | |
60 return false; | |
61 for (int i = 0; i < data1.length; i++) { | |
62 if (data1[i] != data2[i]) | |
63 return false; | |
64 } | |
65 return true; | |
66 } | |
67 | |
68 public static String stringify(BigInteger b) { | |
69 String strout= ""; | |
70 byte [] data = b.toByteArray(); | |
71 for (int i = 0; i < data.length; i++) { | |
72 strout += (String.format("%02x",data[i]) + " "); | |
73 } | |
74 return strout; | |
75 } | |
76 | |
77 public static void main(String args[]) throws Exception { | |
78 | |
79 BigInteger oldsum = new BigInteger("0"); | |
80 BigInteger newsum = new BigInteger("0"); | |
81 | |
82 BigInteger b1, b2, oldres, newres; | |
83 | |
84 Random rand = new Random(); | |
85 long seed = System.nanoTime(); | |
86 Random rand1 = new Random(); | |
87 long seed1 = System.nanoTime(); | |
88 rand.setSeed(seed); | |
89 rand1.setSeed(seed1); | |
90 | |
91 for (int j = 0; j < 100000; j++) { | |
92 int rand_int = rand1.nextInt(3136)+32; | |
93 b1 = new BigInteger(rand_int, rand); | |
94 | |
95 oldres = base_multiply(b1); | |
96 newres = new_multiply(b1); | |
97 | |
98 oldsum = oldsum.add(oldres); | |
99 newsum = newsum.add(newres); | |
100 | |
101 if (!bytecompare(oldres,newres)) { | |
102 System.out.print("mismatch for:b1:" + stringify(b1) + " :oldres:" + stringify(oldres) + " :newres:" + stringify(newres)); | |
103 System.out.println(b1); | |
104 throw new Exception("Failed"); | |
105 } | |
106 } | |
107 if (!bytecompare(oldsum,newsum)) { | |
108 System.out.println("Failure: oldsum:" + stringify(oldsum) + " newsum:" + stringify(newsum)); | |
109 throw new Exception("Failed"); | |
110 } else { | |
111 System.out.println("Success"); | |
112 } | |
113 } | |
114 } |