mirror of
https://github.com/openjdk/jdk.git
synced 2025-08-27 06:45:07 +02:00
8138732: Rename @HotSpotIntrinsicCandidate to @IntrinsicCandidate and move it to the jdk.internal.vm.annotation package
Reviewed-by: dholmes, alanb, psandoz, kvn, egahlin
This commit is contained in:
parent
4b16f8ab94
commit
2a406f3ce5
64 changed files with 488 additions and 488 deletions
|
@ -40,9 +40,9 @@ import java.util.concurrent.ThreadLocalRandom;
|
|||
|
||||
import jdk.internal.math.DoubleConsts;
|
||||
import jdk.internal.math.FloatConsts;
|
||||
import jdk.internal.HotSpotIntrinsicCandidate;
|
||||
import jdk.internal.vm.annotation.Stable;
|
||||
import jdk.internal.vm.annotation.ForceInline;
|
||||
import jdk.internal.vm.annotation.IntrinsicCandidate;
|
||||
import jdk.internal.vm.annotation.Stable;
|
||||
|
||||
/**
|
||||
* Immutable arbitrary-precision integers. All operations behave as if
|
||||
|
@ -1740,7 +1740,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
|||
return implMultiplyToLen(x, xlen, y, ylen, z);
|
||||
}
|
||||
|
||||
@HotSpotIntrinsicCandidate
|
||||
@IntrinsicCandidate
|
||||
private static int[] implMultiplyToLen(int[] x, int xlen, int[] y, int ylen, int[] z) {
|
||||
int xstart = xlen - 1;
|
||||
int ystart = ylen - 1;
|
||||
|
@ -2133,7 +2133,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
|||
/**
|
||||
* Java Runtime may use intrinsic for this method.
|
||||
*/
|
||||
@HotSpotIntrinsicCandidate
|
||||
@IntrinsicCandidate
|
||||
private static final int[] implSquareToLen(int[] x, int len, int[] z, int zlen) {
|
||||
/*
|
||||
* The algorithm used here is adapted from Colin Plumb's C library.
|
||||
|
@ -2836,13 +2836,13 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
|||
|
||||
// These methods are intended to be replaced by virtual machine
|
||||
// intrinsics.
|
||||
@HotSpotIntrinsicCandidate
|
||||
@IntrinsicCandidate
|
||||
private static int[] implMontgomeryMultiply(int[] a, int[] b, int[] n, int len,
|
||||
long inv, int[] product) {
|
||||
product = multiplyToLen(a, len, b, len, product);
|
||||
return montReduce(product, n, len, (int)inv);
|
||||
}
|
||||
@HotSpotIntrinsicCandidate
|
||||
@IntrinsicCandidate
|
||||
private static int[] implMontgomerySquare(int[] a, int[] n, int len,
|
||||
long inv, int[] product) {
|
||||
product = squareToLen(a, len, product);
|
||||
|
@ -3174,7 +3174,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
|||
/**
|
||||
* Java Runtime may use intrinsic for this method.
|
||||
*/
|
||||
@HotSpotIntrinsicCandidate
|
||||
@IntrinsicCandidate
|
||||
private static int implMulAdd(int[] out, int[] in, int offset, int len, int k) {
|
||||
long kLong = k & LONG_MASK;
|
||||
long carry = 0;
|
||||
|
@ -3355,7 +3355,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
|||
}
|
||||
|
||||
@ForceInline
|
||||
@HotSpotIntrinsicCandidate
|
||||
@IntrinsicCandidate
|
||||
private static void shiftLeftImplWorker(int[] newArr, int[] oldArr, int newIdx, int shiftCount, int numIter) {
|
||||
int shiftCountRight = 32 - shiftCount;
|
||||
int oldIdx = 0;
|
||||
|
@ -3440,7 +3440,7 @@ public class BigInteger extends Number implements Comparable<BigInteger> {
|
|||
}
|
||||
|
||||
@ForceInline
|
||||
@HotSpotIntrinsicCandidate
|
||||
@IntrinsicCandidate
|
||||
private static void shiftRightImplWorker(int[] newArr, int[] oldArr, int newIdx, int shiftCount, int numIter) {
|
||||
int shiftCountLeft = 32 - shiftCount;
|
||||
int idx = numIter;
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue