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