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  * @bug 8055494
  28  * @summary Add C2 x86 intrinsic for BigInteger::multiplyToLen() method
  29  *
  30  * @run main/othervm/timeout=600 -XX:-TieredCompilation -Xbatch
  31  *      -XX:CompileCommand=exclude,TestMultiplyToLen::main
  32  *      -XX:CompileCommand=option,TestMultiplyToLen::base_multiply,ccstr,DisableIntrinsic,_multiplyToLen
  33  *      -XX:CompileCommand=option,java.math.BigInteger::multiply,ccstr,DisableIntrinsic,_multiplyToLen
  34  *      -XX:CompileCommand=inline,java.math.BigInteger::multiply TestMultiplyToLen
  35  */
  36 
  37 import java.util.Arrays;
  38 import java.util.Random;
  39 import java.math.*;
  40 
  41 public class TestMultiplyToLen {
  42 
  43     // Avoid intrinsic by preventing inlining multiply() and multiplyToLen().
  44     public static BigInteger base_multiply(BigInteger op1, BigInteger op2) {
  45       return op1.multiply(op2);
  46     }
  47 
  48     // Generate multiplyToLen() intrinsic by inlining multiply().
  49     public static BigInteger new_multiply(BigInteger op1, BigInteger op2) {
  50       return op1.multiply(op2);
  51     }
  52 
  53     public static boolean bytecompare(BigInteger b1, BigInteger b2) {
  54       byte[] data1 = b1.toByteArray();
  55       byte[] data2 = b2.toByteArray();
  56       if (data1.length != data2.length)
  57         return false;
  58       for (int i = 0; i < data1.length; i++) {
  59         if (data1[i] != data2[i])
  60           return false;
  61       }
  62       return true;
  63     }
  64 
  65     public static String stringify(BigInteger b) {
  66       String strout= "";
  67       byte [] data = b.toByteArray();
  68       for (int i = 0; i < data.length; i++) {
  69         strout += (String.format("%02x",data[i]) + " ");
  70       }
  71       return strout;
  72     }
  73 
  74     public static void main(String args[]) throws Exception {
  75 
  76       BigInteger oldsum = new BigInteger("0");
  77       BigInteger newsum = new BigInteger("0");
  78 
  79       BigInteger b1, b2, oldres, newres;
  80 
  81       Random rand = new Random();
  82       long seed = System.nanoTime();
  83       Random rand1 = new Random();
  84       long seed1 = System.nanoTime();
  85       rand.setSeed(seed);
  86       rand1.setSeed(seed1);
  87 
  88       for (int j = 0; j < 1000000; j++) {
  89         int rand_int = rand1.nextInt(3136)+32;
  90         int rand_int1 = rand1.nextInt(3136)+32;
  91         b1 = new BigInteger(rand_int, rand);
  92         b2 = new BigInteger(rand_int1, rand);
  93 
  94         oldres = base_multiply(b1,b2);
  95         newres = new_multiply(b1,b2);
  96 
  97         oldsum = oldsum.add(oldres);
  98         newsum = newsum.add(newres);
  99 
 100         if (!bytecompare(oldres,newres)) {
 101           System.out.println(b1);
 102           System.out.println(b2);
 103           System.out.print("mismatch for:b1:" + stringify(b1) + " :b2:" + stringify(b2) + " :oldres:" + stringify(oldres) + " :newres:" + stringify(newres));
 104           throw new Exception("Failed");
 105         }
 106       }
 107 
 108       // Test carry propagation.  Multiple carries during bignum
 109       // multiplication are rare (especially when using 64-bit
 110       // arithmetic) so we have to provoke them deliberately.
 111       for (int j = 4; j <= 396; j += 4) {
 112         byte[] bytes = new byte[j];
 113         Arrays.fill(bytes, (byte)255);
 114         b1 = new BigInteger(bytes);
 115         b2 = new BigInteger(bytes);
 116 
 117         oldres = base_multiply(b1,b2);
 118         newres = new_multiply(b1,b2);
 119 
 120         oldsum = oldsum.add(oldres);
 121         newsum = newsum.add(newres);
 122 
 123         if (!bytecompare(oldres,newres)) {
 124           System.out.print("mismatch for:b1:" + stringify(b1) + " :b2:" + stringify(b2) + " :oldres:" + stringify(oldres) + " :newres:" + stringify(newres));
 125           System.out.println(b1);
 126           System.out.println(b2);
 127           throw new Exception("Failed");
 128         }
 129       }
 130 
 131       if (!bytecompare(oldsum,newsum))  {
 132         System.out.println("Failure: oldsum:" + stringify(oldsum) + " newsum:" + stringify(newsum));
 133         throw new Exception("Failed");
 134       } else {
 135         System.out.println("Success");
 136       }
 137    }
 138 }