test/compiler/intrinsics/muladd/TestMulAdd.java

Wed, 17 Feb 2016 13:40:12 +0300

author
igerasim
date
Wed, 17 Feb 2016 13:40:12 +0300
changeset 8489
51c505229e71
parent 8307
daaf806995b3
child 8319
0cd040567d60
permissions
-rw-r--r--

8081778: Use Intel x64 CPU instructions for RSA acceleration
Summary: Add intrinsics for BigInteger squareToLen and mulAdd methods.
Reviewed-by: kvn, jrose

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

mercurial