Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(717)

Unified Diff: runtime/vm/intrinsifier_arm64.cc

Issue 811763004: Modify Bigint _mulAdd, _sqrAdd, _estQuotientDigit, and Montgomery _mulMod (Closed) Base URL: http://dart.googlecode.com/svn/branches/bleeding_edge/dart/
Patch Set: Created 6 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
Index: runtime/vm/intrinsifier_arm64.cc
===================================================================
--- runtime/vm/intrinsifier_arm64.cc (revision 42566)
+++ runtime/vm/intrinsifier_arm64.cc (working copy)
@@ -928,12 +928,12 @@
void Intrinsifier::Bigint_mulAdd(Assembler* assembler) {
// Pseudo code:
- // static void _mulAdd(Uint32List x_digits, int xi,
- // Uint32List m_digits, int i,
- // Uint32List a_digits, int j, int n) {
+ // static int _mulAdd(Uint32List x_digits, int xi,
+ // Uint32List m_digits, int i,
+ // Uint32List a_digits, int j, int n) {
// uint32_t x = x_digits[xi >> 1]; // xi is Smi.
// if (x == 0 || n == 0) {
- // return;
+ // return 1;
// }
// uint32_t* mip = &m_digits[i >> 1]; // i is Smi.
// uint32_t* ajp = &a_digits[j >> 1]; // j is Smi.
@@ -951,6 +951,7 @@
// *ajp++ = low32(t);
// c = high32(t); // c == 0 or 1.
// }
+ // return 1;
// }
Label done;
@@ -1031,7 +1032,7 @@
__ b(&propagate_carry_loop, CS);
__ Bind(&done);
- // Returning Object::null() is not required, since this method is private.
+ __ LoadImmediate(R0, Smi::RawValue(1), kNoPP); // One digit processed.
__ ret();
}
@@ -1038,11 +1039,11 @@
void Intrinsifier::Bigint_sqrAdd(Assembler* assembler) {
// Pseudo code:
- // static void _sqrAdd(Uint32List x_digits, int i,
- // Uint32List a_digits, int used) {
+ // static int _sqrAdd(Uint32List x_digits, int i,
+ // Uint32List a_digits, int used) {
// uint32_t* xip = &x_digits[i >> 1]; // i is Smi.
// uint32_t x = *xip++;
- // if (x == 0) return;
+ // if (x == 0) return 1;
// uint32_t* ajp = &a_digits[i]; // j == 2*i, i is Smi.
// uint32_t aj = *ajp;
// uint64_t t = x*x + aj;
@@ -1060,6 +1061,7 @@
// uint64_t t = aj + c; // 32-bit + 33-bit -> 34-bit.
// *ajp++ = low32(t);
// *ajp = high32(t);
+ // return 1;
// }
// R4 = xip = &x_digits[i >> 1]
@@ -1150,7 +1152,7 @@
__ stp(R6, R7, Address(R5, 0, Address::PairOffset), kUnsignedWord);
__ Bind(&x_zero);
- // Returning Object::null() is not required, since this method is private.
+ __ LoadImmediate(R0, Smi::RawValue(1), kNoPP); // One digit processed.
__ ret();
}
@@ -1157,8 +1159,8 @@
void Intrinsifier::Bigint_estQuotientDigit(Assembler* assembler) {
// Pseudo code:
- // static void _estQuotientDigit(Uint32List args, Uint32List digits, int i) {
- // uint32_t yt = args[_YT]; // _YT == 0.
+ // static int _estQuotientDigit(Uint32List args, Uint32List digits, int i) {
+ // uint32_t yt = args[_YT]; // _YT == 1.
// uint32_t* dp = &digits[i >> 1]; // i is Smi.
// uint32_t dh = dp[0]; // dh == digits[i >> 1].
// uint32_t qd;
@@ -1168,14 +1170,17 @@
// dl = dp[-1]; // dl == digits[(i - 1) >> 1].
// qd = dh:dl / yt; // No overflow possible, because dh < yt.
// }
- // args[_QD] = qd; // _QD == 1;
+ // args[_QD] = qd; // _QD == 2.
+ // return 1;
// }
// R4 = args
__ ldr(R4, Address(SP, 2 * kWordSize)); // args
- // R3 = yt = args[0]
- __ ldr(R3, FieldAddress(R4, TypedData::data_offset()), kUnsignedWord);
+ // R3 = yt = args[1]
+ __ ldr(R3, FieldAddress(R4,
+ TypedData::data_offset() + Bigint::kBytesPerDigit),
+ kUnsignedWord);
// R2 = dh = digits[i >> 1]
// R0 = i as Smi, R1 = digits
@@ -1203,12 +1208,12 @@
__ udiv(R0, R1, R3);
__ Bind(&return_qd);
- // args[1] = qd
+ // args[2] = qd
__ str(R0,
- FieldAddress(R4, TypedData::data_offset() + Bigint::kBytesPerDigit),
+ FieldAddress(R4, TypedData::data_offset() + 2*Bigint::kBytesPerDigit),
kUnsignedWord);
- // Returning Object::null() is not required, since this method is private.
+ __ LoadImmediate(R0, Smi::RawValue(1), kNoPP); // One digit processed.
__ ret();
}
@@ -1215,18 +1220,22 @@
void Intrinsifier::Montgomery_mulMod(Assembler* assembler) {
// Pseudo code:
- // static void _mulMod(Uint32List args, Uint32List digits, int i) {
- // uint32_t rho = args[_RHO]; // _RHO == 0.
+ // static int _mulMod(Uint32List args, Uint32List digits, int i) {
+ // uint32_t rho = args[_RHO]; // _RHO == 2.
// uint32_t d = digits[i >> 1]; // i is Smi.
// uint64_t t = rho*d;
- // args[_MU] = t mod DIGIT_BASE; // _MU == 1.
+ // args[_MU] = t mod DIGIT_BASE; // _MU == 4.
+ // args[_MU_HI] = 0; // _MU_HI == 3.
+ // return 1;
// }
// R4 = args
__ ldr(R4, Address(SP, 2 * kWordSize)); // args
- // R3 = rho = args[0]
- __ ldr(R3, FieldAddress(R4, TypedData::data_offset()), kUnsignedWord);
+ // R3 = rho = args[2]
+ __ ldr(R3,
+ FieldAddress(R4, TypedData::data_offset() + 2*Bigint::kBytesPerDigit),
+ kUnsignedWord);
// R2 = digits[i >> 1]
// R0 = i as Smi, R1 = digits
@@ -1237,12 +1246,12 @@
// X0 = t = rho*d
__ umaddl(R0, R2, R3, ZR); // X0 = W2*W3 + 0.
- // args[1] = t mod DIGIT_BASE = low32(t)
+ // args[4] = t mod DIGIT_BASE = low32(t)
__ str(R0,
- FieldAddress(R4, TypedData::data_offset() + Bigint::kBytesPerDigit),
- kWord);
+ FieldAddress(R4, TypedData::data_offset() + 4*Bigint::kBytesPerDigit),
+ kUnsignedWord);
- // Returning Object::null() is not required, since this method is private.
+ __ LoadImmediate(R0, Smi::RawValue(1), kNoPP); // One digit processed.
__ ret();
}

Powered by Google App Engine
This is Rietveld 408576698