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::mulAdd() method 29 * 30 * @run main/othervm/timeout=600 -XX:-TieredCompilation -Xbatch 31 * -XX:+IgnoreUnrecognizedVMOptions -XX:+UnlockDiagnosticVMOptions -XX:-UseSquareToLenIntrinsic -XX:-UseMultiplyToLenIntrinsic 32 * -XX:CompileCommand=dontinline,compiler.intrinsics.bigInteger.TestMulAdd::main 33 * -XX:CompileCommand=option,compiler.intrinsics.bigInteger.TestMulAdd::base_multiply,ccstr,DisableIntrinsic,_mulAdd 34 * -XX:CompileCommand=option,java.math.BigInteger::multiply,ccstr,DisableIntrinsic,_mulAdd 35 * -XX:CompileCommand=option,java.math.BigInteger::square,ccstr,DisableIntrinsic,_mulAdd 36 * -XX:CompileCommand=option,java.math.BigInteger::squareToLen,ccstr,DisableIntrinsic,_mulAdd 37 * -XX:CompileCommand=option,java.math.BigInteger::mulAdd,ccstr,DisableIntrinsic,_mulAdd 38 * -XX:CompileCommand=inline,java.math.BigInteger::multiply 39 * -XX:CompileCommand=inline,java.math.BigInteger::square 40 * -XX:CompileCommand=inline,java.math.BigInteger::squareToLen 41 * -XX:CompileCommand=inline,java.math.BigInteger::mulAdd 42 * compiler.intrinsics.bigInteger.TestMulAdd 43 */ 44 45 package compiler.intrinsics.bigInteger; 46 47 import java.math.BigInteger; 48 import java.util.Random; 49 50 public class TestMulAdd { 51 52 // Avoid intrinsic by preventing inlining multiply() and mulAdd(). 53 public static BigInteger base_multiply(BigInteger op1) { 54 return op1.multiply(op1); 55 } 56 57 // Generate mulAdd() intrinsic by inlining multiply(). 58 public static BigInteger new_multiply(BigInteger op1) { 59 return op1.multiply(op1); 60 } 61 62 public static boolean bytecompare(BigInteger b1, BigInteger b2) { 63 byte[] data1 = b1.toByteArray(); 64 byte[] data2 = b2.toByteArray(); 65 if (data1.length != data2.length) 66 return false; 67 for (int i = 0; i < data1.length; i++) { 68 if (data1[i] != data2[i]) 69 return false; 70 } 71 return true; 72 } 73 74 public static String stringify(BigInteger b) { 75 String strout= ""; 76 byte [] data = b.toByteArray(); 77 for (int i = 0; i < data.length; i++) { 78 strout += (String.format("%02x",data[i]) + " "); 79 } 80 return strout; 81 } 82 83 public static void main(String args[]) throws Exception { 84 85 BigInteger oldsum = new BigInteger("0"); 86 BigInteger newsum = new BigInteger("0"); 87 88 BigInteger b1, b2, oldres, newres; 89 90 Random rand = new Random(); 91 long seed = System.nanoTime(); 92 Random rand1 = new Random(); 93 long seed1 = System.nanoTime(); 94 rand.setSeed(seed); 95 rand1.setSeed(seed1); 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 }