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