igerasim@8307: /* igerasim@8307: * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved. igerasim@8307: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. igerasim@8307: * igerasim@8307: * This code is free software; you can redistribute it and/or modify it igerasim@8307: * under the terms of the GNU General Public License version 2 only, as igerasim@8307: * published by the Free Software Foundation. igerasim@8307: * igerasim@8307: * This code is distributed in the hope that it will be useful, but WITHOUT igerasim@8307: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or igerasim@8307: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License igerasim@8307: * version 2 for more details (a copy is included in the LICENSE file that igerasim@8307: * accompanied this code). igerasim@8307: * igerasim@8307: * You should have received a copy of the GNU General Public License version igerasim@8307: * 2 along with this work; if not, write to the Free Software Foundation, igerasim@8307: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. igerasim@8307: * igerasim@8307: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA igerasim@8307: * or visit www.oracle.com if you need additional information or have any igerasim@8307: * questions. igerasim@8307: * igerasim@8307: */ igerasim@8307: igerasim@8307: /** igerasim@8307: * @test igerasim@8307: * @bug 8081778 igerasim@8307: * @summary Add C2 x86 intrinsic for BigInteger::squareToLen() method igerasim@8307: * igerasim@8307: * @run main/othervm/timeout=600 -XX:-TieredCompilation -Xbatch vkempik@8319: * -XX:+UseSquareToLenIntrinsic igerasim@8307: * -XX:CompileCommand=exclude,TestSquareToLen::main igerasim@8307: * -XX:CompileCommand=option,TestSquareToLen::base_multiply,ccstr,DisableIntrinsic,_squareToLen igerasim@8307: * -XX:CompileCommand=option,java.math.BigInteger::multiply,ccstr,DisableIntrinsic,_squareToLen igerasim@8307: * -XX:CompileCommand=option,java.math.BigInteger::square,ccstr,DisableIntrinsic,_squareToLen igerasim@8307: * -XX:CompileCommand=option,java.math.BigInteger::squareToLen,ccstr,DisableIntrinsic,_squareToLen igerasim@8307: * -XX:CompileCommand=inline,java.math.BigInteger::multiply igerasim@8307: * -XX:CompileCommand=inline,java.math.BigInteger::square igerasim@8307: * -XX:CompileCommand=inline,java.math.BigInteger::squareToLen TestSquareToLen igerasim@8307: */ igerasim@8307: igerasim@8307: import java.util.Random; igerasim@8307: import java.math.*; igerasim@8307: igerasim@8307: public class TestSquareToLen { igerasim@8307: igerasim@8307: // Avoid intrinsic by preventing inlining multiply() and squareToLen(). igerasim@8307: public static BigInteger base_multiply(BigInteger op1) { igerasim@8307: return op1.multiply(op1); igerasim@8307: } igerasim@8307: igerasim@8307: // Generate squareToLen() intrinsic by inlining multiply(). igerasim@8307: public static BigInteger new_multiply(BigInteger op1) { igerasim@8307: return op1.multiply(op1); igerasim@8307: } igerasim@8307: igerasim@8307: public static boolean bytecompare(BigInteger b1, BigInteger b2) { igerasim@8307: byte[] data1 = b1.toByteArray(); igerasim@8307: byte[] data2 = b2.toByteArray(); igerasim@8307: if (data1.length != data2.length) igerasim@8307: return false; igerasim@8307: for (int i = 0; i < data1.length; i++) { igerasim@8307: if (data1[i] != data2[i]) igerasim@8307: return false; igerasim@8307: } igerasim@8307: return true; igerasim@8307: } igerasim@8307: igerasim@8307: public static String stringify(BigInteger b) { igerasim@8307: String strout= ""; igerasim@8307: byte [] data = b.toByteArray(); igerasim@8307: for (int i = 0; i < data.length; i++) { igerasim@8307: strout += (String.format("%02x",data[i]) + " "); igerasim@8307: } igerasim@8307: return strout; igerasim@8307: } igerasim@8307: igerasim@8307: public static void main(String args[]) throws Exception { igerasim@8307: igerasim@8307: BigInteger oldsum = new BigInteger("0"); igerasim@8307: BigInteger newsum = new BigInteger("0"); igerasim@8307: igerasim@8307: BigInteger b1, b2, oldres, newres; igerasim@8307: igerasim@8307: Random rand = new Random(); igerasim@8307: long seed = System.nanoTime(); igerasim@8307: Random rand1 = new Random(); igerasim@8307: long seed1 = System.nanoTime(); igerasim@8307: rand.setSeed(seed); igerasim@8307: rand1.setSeed(seed1); igerasim@8307: igerasim@8307: for (int j = 0; j < 100000; j++) { igerasim@8307: int rand_int = rand1.nextInt(3136)+32; igerasim@8307: b1 = new BigInteger(rand_int, rand); igerasim@8307: igerasim@8307: oldres = base_multiply(b1); igerasim@8307: newres = new_multiply(b1); igerasim@8307: igerasim@8307: oldsum = oldsum.add(oldres); igerasim@8307: newsum = newsum.add(newres); igerasim@8307: igerasim@8307: if (!bytecompare(oldres,newres)) { igerasim@8307: System.out.print("mismatch for:b1:" + stringify(b1) + " :oldres:" + stringify(oldres) + " :newres:" + stringify(newres)); igerasim@8307: System.out.println(b1); igerasim@8307: throw new Exception("Failed"); igerasim@8307: } igerasim@8307: } igerasim@8307: if (!bytecompare(oldsum,newsum)) { igerasim@8307: System.out.println("Failure: oldsum:" + stringify(oldsum) + " newsum:" + stringify(newsum)); igerasim@8307: throw new Exception("Failed"); igerasim@8307: } else { igerasim@8307: System.out.println("Success"); igerasim@8307: } igerasim@8307: } igerasim@8307: }