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