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

Side by Side 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 5 years, 12 months 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 unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file 1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file
2 // for details. All rights reserved. Use of this source code is governed by a 2 // for details. All rights reserved. Use of this source code is governed by a
3 // BSD-style license that can be found in the LICENSE file. 3 // BSD-style license that can be found in the LICENSE file.
4 4
5 #include "vm/globals.h" // Needed here to get TARGET_ARCH_ARM64. 5 #include "vm/globals.h" // Needed here to get TARGET_ARCH_ARM64.
6 #if defined(TARGET_ARCH_ARM64) 6 #if defined(TARGET_ARCH_ARM64)
7 7
8 #include "vm/intrinsifier.h" 8 #include "vm/intrinsifier.h"
9 9
10 #include "vm/assembler.h" 10 #include "vm/assembler.h"
(...skipping 910 matching lines...) Expand 10 before | Expand all | Expand 10 after
921 __ cbnz(&carry_loop, R9); 921 __ cbnz(&carry_loop, R9);
922 922
923 __ Bind(&done); 923 __ Bind(&done);
924 // Returning Object::null() is not required, since this method is private. 924 // Returning Object::null() is not required, since this method is private.
925 __ ret(); 925 __ ret();
926 } 926 }
927 927
928 928
929 void Intrinsifier::Bigint_mulAdd(Assembler* assembler) { 929 void Intrinsifier::Bigint_mulAdd(Assembler* assembler) {
930 // Pseudo code: 930 // Pseudo code:
931 // static void _mulAdd(Uint32List x_digits, int xi, 931 // static int _mulAdd(Uint32List x_digits, int xi,
932 // Uint32List m_digits, int i, 932 // Uint32List m_digits, int i,
933 // Uint32List a_digits, int j, int n) { 933 // Uint32List a_digits, int j, int n) {
934 // uint32_t x = x_digits[xi >> 1]; // xi is Smi. 934 // uint32_t x = x_digits[xi >> 1]; // xi is Smi.
935 // if (x == 0 || n == 0) { 935 // if (x == 0 || n == 0) {
936 // return; 936 // return 1;
937 // } 937 // }
938 // uint32_t* mip = &m_digits[i >> 1]; // i is Smi. 938 // uint32_t* mip = &m_digits[i >> 1]; // i is Smi.
939 // uint32_t* ajp = &a_digits[j >> 1]; // j is Smi. 939 // uint32_t* ajp = &a_digits[j >> 1]; // j is Smi.
940 // uint32_t c = 0; 940 // uint32_t c = 0;
941 // SmiUntag(n); 941 // SmiUntag(n);
942 // do { 942 // do {
943 // uint32_t mi = *mip++; 943 // uint32_t mi = *mip++;
944 // uint32_t aj = *ajp; 944 // uint32_t aj = *ajp;
945 // uint64_t t = x*mi + aj + c; // 32-bit * 32-bit -> 64-bit. 945 // uint64_t t = x*mi + aj + c; // 32-bit * 32-bit -> 64-bit.
946 // *ajp++ = low32(t); 946 // *ajp++ = low32(t);
947 // c = high32(t); 947 // c = high32(t);
948 // } while (--n > 0); 948 // } while (--n > 0);
949 // while (c != 0) { 949 // while (c != 0) {
950 // uint64_t t = *ajp + c; 950 // uint64_t t = *ajp + c;
951 // *ajp++ = low32(t); 951 // *ajp++ = low32(t);
952 // c = high32(t); // c == 0 or 1. 952 // c = high32(t); // c == 0 or 1.
953 // } 953 // }
954 // return 1;
954 // } 955 // }
955 956
956 Label done; 957 Label done;
957 // R3 = x, no_op if x == 0 958 // R3 = x, no_op if x == 0
958 // R0 = xi as Smi, R1 = x_digits. 959 // R0 = xi as Smi, R1 = x_digits.
959 __ ldp(R0, R1, Address(SP, 5 * kWordSize, Address::PairOffset)); 960 __ ldp(R0, R1, Address(SP, 5 * kWordSize, Address::PairOffset));
960 __ add(R1, R1, Operand(R0, LSL, 1)); 961 __ add(R1, R1, Operand(R0, LSL, 1));
961 __ ldr(R3, FieldAddress(R1, TypedData::data_offset()), kUnsignedWord); 962 __ ldr(R3, FieldAddress(R1, TypedData::data_offset()), kUnsignedWord);
962 __ tst(R3, Operand(R3)); 963 __ tst(R3, Operand(R3));
963 __ b(&done, EQ); 964 __ b(&done, EQ);
(...skipping 60 matching lines...) Expand 10 before | Expand all | Expand 10 after
1024 1025
1025 Label propagate_carry_loop; 1026 Label propagate_carry_loop;
1026 __ Bind(&propagate_carry_loop); 1027 __ Bind(&propagate_carry_loop);
1027 __ ldr(R0, Address(R5, 0), kUnsignedWord); 1028 __ ldr(R0, Address(R5, 0), kUnsignedWord);
1028 __ addsw(R0, R0, Operand(1)); 1029 __ addsw(R0, R0, Operand(1));
1029 __ str(R0, Address(R5, Bigint::kBytesPerDigit, Address::PostIndex), 1030 __ str(R0, Address(R5, Bigint::kBytesPerDigit, Address::PostIndex),
1030 kUnsignedWord); 1031 kUnsignedWord);
1031 __ b(&propagate_carry_loop, CS); 1032 __ b(&propagate_carry_loop, CS);
1032 1033
1033 __ Bind(&done); 1034 __ Bind(&done);
1034 // Returning Object::null() is not required, since this method is private. 1035 __ LoadImmediate(R0, Smi::RawValue(1), kNoPP); // One digit processed.
1035 __ ret(); 1036 __ ret();
1036 } 1037 }
1037 1038
1038 1039
1039 void Intrinsifier::Bigint_sqrAdd(Assembler* assembler) { 1040 void Intrinsifier::Bigint_sqrAdd(Assembler* assembler) {
1040 // Pseudo code: 1041 // Pseudo code:
1041 // static void _sqrAdd(Uint32List x_digits, int i, 1042 // static int _sqrAdd(Uint32List x_digits, int i,
1042 // Uint32List a_digits, int used) { 1043 // Uint32List a_digits, int used) {
1043 // uint32_t* xip = &x_digits[i >> 1]; // i is Smi. 1044 // uint32_t* xip = &x_digits[i >> 1]; // i is Smi.
1044 // uint32_t x = *xip++; 1045 // uint32_t x = *xip++;
1045 // if (x == 0) return; 1046 // if (x == 0) return 1;
1046 // uint32_t* ajp = &a_digits[i]; // j == 2*i, i is Smi. 1047 // uint32_t* ajp = &a_digits[i]; // j == 2*i, i is Smi.
1047 // uint32_t aj = *ajp; 1048 // uint32_t aj = *ajp;
1048 // uint64_t t = x*x + aj; 1049 // uint64_t t = x*x + aj;
1049 // *ajp++ = low32(t); 1050 // *ajp++ = low32(t);
1050 // uint64_t c = high32(t); 1051 // uint64_t c = high32(t);
1051 // int n = ((used - i) >> 1) - 1; // used and i are Smi. 1052 // int n = ((used - i) >> 1) - 1; // used and i are Smi.
1052 // while (--n >= 0) { 1053 // while (--n >= 0) {
1053 // uint32_t xi = *xip++; 1054 // uint32_t xi = *xip++;
1054 // uint32_t aj = *ajp; 1055 // uint32_t aj = *ajp;
1055 // uint96_t t = 2*x*xi + aj + c; // 2-bit * 32-bit * 32-bit -> 65-bit. 1056 // uint96_t t = 2*x*xi + aj + c; // 2-bit * 32-bit * 32-bit -> 65-bit.
1056 // *ajp++ = low32(t); 1057 // *ajp++ = low32(t);
1057 // c = high64(t); // 33-bit. 1058 // c = high64(t); // 33-bit.
1058 // } 1059 // }
1059 // uint32_t aj = *ajp; 1060 // uint32_t aj = *ajp;
1060 // uint64_t t = aj + c; // 32-bit + 33-bit -> 34-bit. 1061 // uint64_t t = aj + c; // 32-bit + 33-bit -> 34-bit.
1061 // *ajp++ = low32(t); 1062 // *ajp++ = low32(t);
1062 // *ajp = high32(t); 1063 // *ajp = high32(t);
1064 // return 1;
1063 // } 1065 // }
1064 1066
1065 // R4 = xip = &x_digits[i >> 1] 1067 // R4 = xip = &x_digits[i >> 1]
1066 // R2 = i as Smi, R3 = x_digits 1068 // R2 = i as Smi, R3 = x_digits
1067 __ ldp(R2, R3, Address(SP, 2 * kWordSize, Address::PairOffset)); 1069 __ ldp(R2, R3, Address(SP, 2 * kWordSize, Address::PairOffset));
1068 __ add(R3, R3, Operand(R2, LSL, 1)); 1070 __ add(R3, R3, Operand(R2, LSL, 1));
1069 __ add(R4, R3, Operand(TypedData::data_offset() - kHeapObjectTag)); 1071 __ add(R4, R3, Operand(TypedData::data_offset() - kHeapObjectTag));
1070 1072
1071 // R3 = x = *xip++, return if x == 0 1073 // R3 = x = *xip++, return if x == 0
1072 Label x_zero; 1074 Label x_zero;
(...skipping 70 matching lines...) Expand 10 before | Expand all | Expand 10 after
1143 __ add(R6, R6, Operand(R0)); 1145 __ add(R6, R6, Operand(R0));
1144 1146
1145 // R7 = R6 >> 32. 1147 // R7 = R6 >> 32.
1146 __ LsrImmediate(R7, R6, 32); 1148 __ LsrImmediate(R7, R6, 32);
1147 1149
1148 // *ajp = low32(t) = low32(R6) 1150 // *ajp = low32(t) = low32(R6)
1149 // *(ajp + 1) = high32(t) = low32(R7) 1151 // *(ajp + 1) = high32(t) = low32(R7)
1150 __ stp(R6, R7, Address(R5, 0, Address::PairOffset), kUnsignedWord); 1152 __ stp(R6, R7, Address(R5, 0, Address::PairOffset), kUnsignedWord);
1151 1153
1152 __ Bind(&x_zero); 1154 __ Bind(&x_zero);
1153 // Returning Object::null() is not required, since this method is private. 1155 __ LoadImmediate(R0, Smi::RawValue(1), kNoPP); // One digit processed.
1154 __ ret(); 1156 __ ret();
1155 } 1157 }
1156 1158
1157 1159
1158 void Intrinsifier::Bigint_estQuotientDigit(Assembler* assembler) { 1160 void Intrinsifier::Bigint_estQuotientDigit(Assembler* assembler) {
1159 // Pseudo code: 1161 // Pseudo code:
1160 // static void _estQuotientDigit(Uint32List args, Uint32List digits, int i) { 1162 // static int _estQuotientDigit(Uint32List args, Uint32List digits, int i) {
1161 // uint32_t yt = args[_YT]; // _YT == 0. 1163 // uint32_t yt = args[_YT]; // _YT == 1.
1162 // uint32_t* dp = &digits[i >> 1]; // i is Smi. 1164 // uint32_t* dp = &digits[i >> 1]; // i is Smi.
1163 // uint32_t dh = dp[0]; // dh == digits[i >> 1]. 1165 // uint32_t dh = dp[0]; // dh == digits[i >> 1].
1164 // uint32_t qd; 1166 // uint32_t qd;
1165 // if (dh == yt) { 1167 // if (dh == yt) {
1166 // qd = DIGIT_MASK; 1168 // qd = DIGIT_MASK;
1167 // } else { 1169 // } else {
1168 // dl = dp[-1]; // dl == digits[(i - 1) >> 1]. 1170 // dl = dp[-1]; // dl == digits[(i - 1) >> 1].
1169 // qd = dh:dl / yt; // No overflow possible, because dh < yt. 1171 // qd = dh:dl / yt; // No overflow possible, because dh < yt.
1170 // } 1172 // }
1171 // args[_QD] = qd; // _QD == 1; 1173 // args[_QD] = qd; // _QD == 2.
1174 // return 1;
1172 // } 1175 // }
1173 1176
1174 // R4 = args 1177 // R4 = args
1175 __ ldr(R4, Address(SP, 2 * kWordSize)); // args 1178 __ ldr(R4, Address(SP, 2 * kWordSize)); // args
1176 1179
1177 // R3 = yt = args[0] 1180 // R3 = yt = args[1]
1178 __ ldr(R3, FieldAddress(R4, TypedData::data_offset()), kUnsignedWord); 1181 __ ldr(R3, FieldAddress(R4,
1182 TypedData::data_offset() + Bigint::kBytesPerDigit),
1183 kUnsignedWord);
1179 1184
1180 // R2 = dh = digits[i >> 1] 1185 // R2 = dh = digits[i >> 1]
1181 // R0 = i as Smi, R1 = digits 1186 // R0 = i as Smi, R1 = digits
1182 __ ldp(R0, R1, Address(SP, 0 * kWordSize, Address::PairOffset)); 1187 __ ldp(R0, R1, Address(SP, 0 * kWordSize, Address::PairOffset));
1183 __ add(R1, R1, Operand(R0, LSL, 1)); 1188 __ add(R1, R1, Operand(R0, LSL, 1));
1184 __ ldr(R2, FieldAddress(R1, TypedData::data_offset()), kUnsignedWord); 1189 __ ldr(R2, FieldAddress(R1, TypedData::data_offset()), kUnsignedWord);
1185 1190
1186 // R0 = qd = DIGIT_MASK = -1 1191 // R0 = qd = DIGIT_MASK = -1
1187 __ movn(R0, Immediate(0), 0); 1192 __ movn(R0, Immediate(0), 0);
1188 1193
1189 // Return qd if dh == yt 1194 // Return qd if dh == yt
1190 Label return_qd; 1195 Label return_qd;
1191 __ cmp(R2, Operand(R3)); 1196 __ cmp(R2, Operand(R3));
1192 __ b(&return_qd, EQ); 1197 __ b(&return_qd, EQ);
1193 1198
1194 // R1 = dl = digits[(i - 1) >> 1] 1199 // R1 = dl = digits[(i - 1) >> 1]
1195 __ ldr(R1, 1200 __ ldr(R1,
1196 FieldAddress(R1, TypedData::data_offset() - Bigint::kBytesPerDigit), 1201 FieldAddress(R1, TypedData::data_offset() - Bigint::kBytesPerDigit),
1197 kUnsignedWord); 1202 kUnsignedWord);
1198 1203
1199 // R1 = dh:dl 1204 // R1 = dh:dl
1200 __ orr(R1, R1, Operand(R2, LSL, 32)); 1205 __ orr(R1, R1, Operand(R2, LSL, 32));
1201 1206
1202 // R0 = qd = dh:dl / yt = R1 / R3 1207 // R0 = qd = dh:dl / yt = R1 / R3
1203 __ udiv(R0, R1, R3); 1208 __ udiv(R0, R1, R3);
1204 1209
1205 __ Bind(&return_qd); 1210 __ Bind(&return_qd);
1206 // args[1] = qd 1211 // args[2] = qd
1207 __ str(R0, 1212 __ str(R0,
1208 FieldAddress(R4, TypedData::data_offset() + Bigint::kBytesPerDigit), 1213 FieldAddress(R4, TypedData::data_offset() + 2*Bigint::kBytesPerDigit),
1209 kUnsignedWord); 1214 kUnsignedWord);
1210 1215
1211 // Returning Object::null() is not required, since this method is private. 1216 __ LoadImmediate(R0, Smi::RawValue(1), kNoPP); // One digit processed.
1212 __ ret(); 1217 __ ret();
1213 } 1218 }
1214 1219
1215 1220
1216 void Intrinsifier::Montgomery_mulMod(Assembler* assembler) { 1221 void Intrinsifier::Montgomery_mulMod(Assembler* assembler) {
1217 // Pseudo code: 1222 // Pseudo code:
1218 // static void _mulMod(Uint32List args, Uint32List digits, int i) { 1223 // static int _mulMod(Uint32List args, Uint32List digits, int i) {
1219 // uint32_t rho = args[_RHO]; // _RHO == 0. 1224 // uint32_t rho = args[_RHO]; // _RHO == 2.
1220 // uint32_t d = digits[i >> 1]; // i is Smi. 1225 // uint32_t d = digits[i >> 1]; // i is Smi.
1221 // uint64_t t = rho*d; 1226 // uint64_t t = rho*d;
1222 // args[_MU] = t mod DIGIT_BASE; // _MU == 1. 1227 // args[_MU] = t mod DIGIT_BASE; // _MU == 4.
1228 // args[_MU_HI] = 0; // _MU_HI == 3.
1229 // return 1;
1223 // } 1230 // }
1224 1231
1225 // R4 = args 1232 // R4 = args
1226 __ ldr(R4, Address(SP, 2 * kWordSize)); // args 1233 __ ldr(R4, Address(SP, 2 * kWordSize)); // args
1227 1234
1228 // R3 = rho = args[0] 1235 // R3 = rho = args[2]
1229 __ ldr(R3, FieldAddress(R4, TypedData::data_offset()), kUnsignedWord); 1236 __ ldr(R3,
1237 FieldAddress(R4, TypedData::data_offset() + 2*Bigint::kBytesPerDigit),
1238 kUnsignedWord);
1230 1239
1231 // R2 = digits[i >> 1] 1240 // R2 = digits[i >> 1]
1232 // R0 = i as Smi, R1 = digits 1241 // R0 = i as Smi, R1 = digits
1233 __ ldp(R0, R1, Address(SP, 0 * kWordSize, Address::PairOffset)); 1242 __ ldp(R0, R1, Address(SP, 0 * kWordSize, Address::PairOffset));
1234 __ add(R1, R1, Operand(R0, LSL, 1)); 1243 __ add(R1, R1, Operand(R0, LSL, 1));
1235 __ ldr(R2, FieldAddress(R1, TypedData::data_offset()), kUnsignedWord); 1244 __ ldr(R2, FieldAddress(R1, TypedData::data_offset()), kUnsignedWord);
1236 1245
1237 // X0 = t = rho*d 1246 // X0 = t = rho*d
1238 __ umaddl(R0, R2, R3, ZR); // X0 = W2*W3 + 0. 1247 __ umaddl(R0, R2, R3, ZR); // X0 = W2*W3 + 0.
1239 1248
1240 // args[1] = t mod DIGIT_BASE = low32(t) 1249 // args[4] = t mod DIGIT_BASE = low32(t)
1241 __ str(R0, 1250 __ str(R0,
1242 FieldAddress(R4, TypedData::data_offset() + Bigint::kBytesPerDigit), 1251 FieldAddress(R4, TypedData::data_offset() + 4*Bigint::kBytesPerDigit),
1243 kWord); 1252 kUnsignedWord);
1244 1253
1245 // Returning Object::null() is not required, since this method is private. 1254 __ LoadImmediate(R0, Smi::RawValue(1), kNoPP); // One digit processed.
1246 __ ret(); 1255 __ ret();
1247 } 1256 }
1248 1257
1249 1258
1250 // Check if the last argument is a double, jump to label 'is_smi' if smi 1259 // Check if the last argument is a double, jump to label 'is_smi' if smi
1251 // (easy to convert to double), otherwise jump to label 'not_double_smi', 1260 // (easy to convert to double), otherwise jump to label 'not_double_smi',
1252 // Returns the last argument in R0. 1261 // Returns the last argument in R0.
1253 static void TestLastArgumentIsDouble(Assembler* assembler, 1262 static void TestLastArgumentIsDouble(Assembler* assembler,
1254 Label* is_smi, 1263 Label* is_smi,
1255 Label* not_double_smi) { 1264 Label* not_double_smi) {
(...skipping 747 matching lines...) Expand 10 before | Expand all | Expand 10 after
2003 Isolate* isolate = Isolate::Current(); 2012 Isolate* isolate = Isolate::Current();
2004 __ LoadImmediate(R1, reinterpret_cast<uword>(isolate), kNoPP); 2013 __ LoadImmediate(R1, reinterpret_cast<uword>(isolate), kNoPP);
2005 // Set return value to Isolate::current_tag_. 2014 // Set return value to Isolate::current_tag_.
2006 __ ldr(R0, Address(R1, Isolate::current_tag_offset())); 2015 __ ldr(R0, Address(R1, Isolate::current_tag_offset()));
2007 __ ret(); 2016 __ ret();
2008 } 2017 }
2009 2018
2010 } // namespace dart 2019 } // namespace dart
2011 2020
2012 #endif // defined TARGET_ARCH_ARM64 2021 #endif // defined TARGET_ARCH_ARM64
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698