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.Random;
  38 import java.math.*;
  39 
  40 public class TestMultiplyToLen {
  41 
  42     // Avoid intrinsic by preventing inlining multiply() and multiplyToLen().
  43     public static BigInteger base_multiply(BigInteger op1, BigInteger op2) {
  44       return op1.multiply(op2);
  45     }
  46 
  47     // Generate multiplyToLen() intrinsic by inlining multiply().
  48     public static BigInteger new_multiply(BigInteger op1, BigInteger op2) {
  49       return op1.multiply(op2);
  50     }
  51 
  52     public static boolean bytecompare(BigInteger b1, BigInteger b2) {
  53       byte[] data1 = b1.toByteArray();
  54       byte[] data2 = b2.toByteArray();
  55       if (data1.length != data2.length)
  56         return false;
  57       for (int i = 0; i < data1.length; i++) {
  58         if (data1[i] != data2[i])
  59           return false;
  60       }
  61       return true;
  62     }
  63 
  64     public static String stringify(BigInteger b) {
  65       String strout= "";
  66       byte [] data = b.toByteArray();
  67       for (int i = 0; i < data.length; i++) {
  68         strout += (String.format("%02x",data[i]) + " ");
  69       }
  70       return strout;
  71     }
  72 
  73     public static void main(String args[]) throws Exception {
  74 
  75       BigInteger oldsum = new BigInteger("0");
  76       BigInteger newsum = new BigInteger("0");
  77 
  78       BigInteger b1, b2, oldres, newres;
  79 
  80       Random rand = new Random();
  81       long seed = System.nanoTime();
  82       Random rand1 = new Random();
  83       long seed1 = System.nanoTime();
  84       rand.setSeed(seed);
  85       rand1.setSeed(seed1);
  86 
  87       for (int j = 0; j < 1000000; j++) {
  88         int rand_int = rand1.nextInt(3136)+32;
  89         int rand_int1 = rand1.nextInt(3136)+32;
  90         b1 = new BigInteger(rand_int, rand);
  91         b2 = new BigInteger(rand_int1, rand);
  92 
  93         oldres = base_multiply(b1,b2);
  94         newres = new_multiply(b1,b2);
  95 
  96         oldsum = oldsum.add(oldres);
  97         newsum = newsum.add(newres);
  98 
  99         if (!bytecompare(oldres,newres)) {
 100           System.out.print("mismatch for:b1:" + stringify(b1) + " :b2:" + stringify(b2) + " :oldres:" + stringify(oldres) + " :newres:" + stringify(newres));
 101           System.out.println(b1);
 102           System.out.println(b2);
 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 }