enum class oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2 extends oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester
{
private void <init>(java.lang.String, int)
{
int v;
java.lang.String v;
oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2 v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2;
v := @parameter: java.lang.String;
v := @parameter: int;
specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester: void <init>(java.lang.String,int)>(v, v);
return;
}
private long plusMod(long, long, long)
{
long v, v, v, v, v, v;
byte v;
oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2 v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2;
v := @parameter: long;
v := @parameter: long;
v := @parameter: long;
v = v - v;
v = v cmp v;
if v < 0 goto label;
v = v + v;
v = v - v;
goto label;
label:
v = v + v;
label:
return v;
}
private long times2ToThe32Mod(long, long)
{
int v, v, v;
long v, v, v;
oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2 v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2;
v := @parameter: long;
v := @parameter: long;
v = 32;
label:
v = staticinvoke <java.lang.Long: int numberOfLeadingZeros(long)>(v);
v = staticinvoke <java.lang.Math: int min(int,int)>(v, v);
v = v << v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.primitives.UnsignedLongs: long remainder(long,long)>(v, v);
v = v - v;
if v > 0 goto label;
return v;
}
long mulMod(long, long, long)
{
long v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v, v;
byte v;
oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2 v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2;
v := @parameter: long;
v := @parameter: long;
v := @parameter: long;
v = v >>> 32;
v = v >>> 32;
v = v & 4294967295L;
v = v & 4294967295L;
v = v * v;
v = specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2: long times2ToThe32Mod(long,long)>(v, v);
v = v * v;
v = v + v;
v = v cmp 0L;
if v >= 0 goto label;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.primitives.UnsignedLongs: long remainder(long,long)>(v, v);
label:
v = v * v;
v = v + v;
v = specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2: long times2ToThe32Mod(long,long)>(v, v);
v = v * v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.primitives.UnsignedLongs: long remainder(long,long)>(v, v);
v = specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2: long plusMod(long,long,long)>(v, v, v);
return v;
}
long squareMod(long, long)
{
long v, v, v, v, v, v, v, v, v, v, v, v, v;
byte v;
oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2 v;
v := @this: oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2;
v := @parameter: long;
v := @parameter: long;
v = v >>> 32;
v = v & 4294967295L;
v = v * v;
v = specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2: long times2ToThe32Mod(long,long)>(v, v);
v = v * v;
v = v * 2L;
v = v cmp 0L;
if v >= 0 goto label;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.primitives.UnsignedLongs: long remainder(long,long)>(v, v);
label:
v = v + v;
v = specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2: long times2ToThe32Mod(long,long)>(v, v);
v = v * v;
v = staticinvoke <oadd.org.apache.curator.shaded.com.google.common.primitives.UnsignedLongs: long remainder(long,long)>(v, v);
v = specialinvoke v.<oadd.org.apache.curator.shaded.com.google.common.math.LongMath$MillerRabinTester$2: long plusMod(long,long,long)>(v, v, v);
return v;
}
}