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

Issues Search
    My Issues | Starred     Open | Closed | All

Unified Diff: test/codegen/corelib/big_integer_arith_vm_test.dart

Issue 1945153002: Add corelib tests (Closed) Base URL: https://github.com/dart-lang/dev_compiler@master
Patch Set: error_test and range_error_test now pass Created 4 years, 7 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 side-by-side diff with in-line comments
Download patch
« no previous file with comments | « test/codegen/corelib/apply_test.dart ('k') | test/codegen/corelib/big_integer_huge_mul_vm_test.dart » ('j') | no next file with comments »
Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
Index: test/codegen/corelib/big_integer_arith_vm_test.dart
diff --git a/test/codegen/corelib/big_integer_arith_vm_test.dart b/test/codegen/corelib/big_integer_arith_vm_test.dart
new file mode 100644
index 0000000000000000000000000000000000000000..b9696b427beff4e6b92b5feff445f7dc2923496a
--- /dev/null
+++ b/test/codegen/corelib/big_integer_arith_vm_test.dart
@@ -0,0 +1,443 @@
+// Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file
+// for details. All rights reserved. Use of this source code is governed by a
+// BSD-style license that can be found in the LICENSE file.
+
+// Testing Bigints with and without intrinsics.
+// VMOptions=
+// VMOptions=--no_intrinsify
+// VMOptions=--optimization_counter_threshold=10 --no-background_compilation
+
+library big_integer_test;
+import "package:expect/expect.dart";
+
+foo() => 1234567890123456789;
+bar() => 12345678901234567890;
+
+testSmiOverflow() {
+ var a = 1073741823;
+ var b = 1073741822;
+ Expect.equals(2147483645, a + b);
+ a = -1000000000;
+ b = 1000000001;
+ Expect.equals(-2000000001, a - b);
+ Expect.equals(-1000000001000000000, a * b);
+}
+
+testBigintAdd() {
+ // Bigint and Smi.
+ var a = 12345678901234567890;
+ var b = 2;
+ Expect.equals(12345678901234567892, a + b);
+ Expect.equals(12345678901234567892, b + a);
+ // Bigint and Bigint.
+ a = 10000000000000000001;
+ Expect.equals(20000000000000000002, a + a);
+ // Bigint and double.
+ a = 100000000000000000000.0;
+ b = 200000000000000000000;
+ Expect.isTrue((a + b) is double);
+ Expect.equals(300000000000000000000.0, a + b);
+ Expect.isTrue((b + a) is double);
+ Expect.equals(300000000000000000000.0, b + a);
+}
+
+testBigintSub() {
+ // Bigint and Smi.
+ var a = 12345678901234567890;
+ var b = 2;
+ Expect.equals(12345678901234567888, a - b);
+ Expect.equals(-12345678901234567888, b - a);
+ // Bigint and Bigint.
+ a = 10000000000000000001;
+ Expect.equals(20000000000000000002, a + a);
+ // Bigint and double.
+ a = 100000000000000000000.0;
+ b = 200000000000000000000;
+ Expect.isTrue((a + b) is double);
+ Expect.equals(-100000000000000000000.0, a - b);
+ Expect.isTrue((b + a) is double);
+ Expect.equals(100000000000000000000.0, b - a);
+ Expect.equals(-1, 0xF00000000 - 0xF00000001);
+}
+
+testBigintMul() {
+ // Bigint and Smi.
+ var a = 12345678901234567890;
+ var b = 10;
+ Expect.equals(123456789012345678900, a * b);
+ Expect.equals(123456789012345678900, b * a);
+ // Bigint and Bigint.
+ a = 12345678901234567890;
+ b = 10000000000000000;
+ Expect.equals(123456789012345678900000000000000000, a * b);
+ // Bigint and double.
+ a = 2.0;
+ b = 200000000000000000000;
+ Expect.isTrue((a * b) is double);
+ Expect.equals(400000000000000000000.0, a * b);
+ Expect.isTrue((b * a) is double);
+ Expect.equals(400000000000000000000.0, b * a);
+}
+
+testBigintTruncDiv() {
+ var a = 12345678901234567890;
+ var b = 10;
+ // Bigint and Smi.
+ Expect.equals(1234567890123456789, a ~/ b);
+ Expect.equals(0, b ~/ a);
+ Expect.equals(123456789, 123456789012345678 ~/ 1000000000);
+ // Bigint and Bigint.
+ a = 12345678901234567890;
+ b = 10000000000000000;
+ Expect.equals(1234, a ~/ b);
+ // Bigint and double.
+ a = 100000000000000000000.0;
+ b = 200000000000000000000;
+ Expect.equals(0, a ~/ b);
+ Expect.equals(2, b ~/ a);
+}
+
+testBigintDiv() {
+ // Bigint and Smi.
+ Expect.equals(1234567890123456789.1, 12345678901234567891 / 10);
+ Expect.equals(0.000000001234, 1234 / 1000000000000);
+ Expect.equals(12345678901234000000.0, 123456789012340000000 / 10);
+ // Bigint and Bigint.
+ var a = 12345670000000000000;
+ var b = 10000000000000000;
+ Expect.equals(1234.567, a / b);
+ // Bigint and double.
+ a = 400000000000000000000.0;
+ b = 200000000000000000000;
+ Expect.equals(2.0, a / b);
+ Expect.equals(0.5, b / a);
+}
+
+testBigintModulo() {
+ // Bigint and Smi.
+ var a = 1000000000005;
+ var b = 10;
+ Expect.equals(5, a % b);
+ Expect.equals(10, b % a);
+ // Bigint & Bigint
+ a = 10000000000000000001;
+ b = 10000000000000000000;
+ Expect.equals(1, a % b);
+ Expect.equals(10000000000000000000, b % a);
+ // Bigint & double.
+ a = 10000000100000000.0;
+ b = 10000000000000000;
+ Expect.equals(100000000.0, a % b);
+ Expect.equals(10000000000000000.0, b % a);
+ // Transitioning from Mint to Bigint.
+ var iStart = 4611686018427387900;
+ var prevX = -23 % iStart;
+ for (int i = iStart + 1; i < iStart + 10; i++) {
+ var x = -23 % i;
+ Expect.equals(1, x - prevX);
+ Expect.isTrue(x > 0);
+ prevX = x;
+ }
+}
+
+testBigintModPow() {
+ var x, e, m;
+ x = 1234567890;
+ e = 1000000001;
+ m = 19;
+ Expect.equals(11, x.modPow(e, m));
+ x = 1234567890;
+ e = 19;
+ m = 1000000001;
+ Expect.equals(122998977, x.modPow(e, m));
+ x = 19;
+ e = 1234567890;
+ m = 1000000001;
+ Expect.equals(619059596, x.modPow(e, m));
+ x = 19;
+ e = 1000000001;
+ m = 1234567890;
+ Expect.equals(84910879, x.modPow(e, m));
+ x = 1000000001;
+ e = 19;
+ m = 1234567890;
+ Expect.equals(872984351, x.modPow(e, m));
+ x = 1000000001;
+ e = 1234567890;
+ m = 19;
+ Expect.equals(0, x.modPow(e, m));
+ x = 12345678901234567890;
+ e = 10000000000000000001;
+ m = 19;
+ Expect.equals(2, x.modPow(e, m));
+ x = 12345678901234567890;
+ e = 19;
+ m = 10000000000000000001;
+ Expect.equals(3239137215315834625, x.modPow(e, m));
+ x = 19;
+ e = 12345678901234567890;
+ m = 10000000000000000001;
+ Expect.equals(4544207837373941034, x.modPow(e, m));
+ x = 19;
+ e = 10000000000000000001;
+ m = 12345678901234567890;
+ Expect.equals(11135411705397624859, x.modPow(e, m));
+ x = 10000000000000000001;
+ e = 19;
+ m = 12345678901234567890;
+ Expect.equals(2034013733189773841, x.modPow(e, m));
+ x = 10000000000000000001;
+ e = 12345678901234567890;
+ m = 19;
+ Expect.equals(1, x.modPow(e, m));
+ x = 12345678901234567890;
+ e = 19;
+ m = 10000000000000000001;
+ Expect.equals(3239137215315834625, x.modPow(e, m));
+ x = 12345678901234567890;
+ e = 10000000000000000001;
+ m = 19;
+ Expect.equals(2, x.modPow(e, m));
+ x = 123456789012345678901234567890;
+ e = 123456789012345678901234567891;
+ m = 123456789012345678901234567899;
+ Expect.equals(116401406051033429924651549616, x.modPow(e, m));
+ x = 123456789012345678901234567890;
+ e = 123456789012345678901234567899;
+ m = 123456789012345678901234567891;
+ Expect.equals(123456789012345678901234567890, x.modPow(e, m));
+ x = 123456789012345678901234567899;
+ e = 123456789012345678901234567890;
+ m = 123456789012345678901234567891;
+ Expect.equals(35088523091000351053091545070, x.modPow(e, m));
+ x = 123456789012345678901234567899;
+ e = 123456789012345678901234567891;
+ m = 123456789012345678901234567890;
+ Expect.equals(18310047270234132455316941949, x.modPow(e, m));
+ x = 123456789012345678901234567891;
+ e = 123456789012345678901234567899;
+ m = 123456789012345678901234567890;
+ Expect.equals(1, x.modPow(e, m));
+ x = 123456789012345678901234567891;
+ e = 123456789012345678901234567890;
+ m = 123456789012345678901234567899;
+ Expect.equals(40128068573873018143207285483, x.modPow(e, m));
+}
+
+testBigintModInverse() {
+ var x, m;
+ x = 1;
+ m = 1;
+ Expect.equals(0, x.modInverse(m));
+ x = 0;
+ m = 1000000001;
+ Expect.throws(() => x.modInverse(m), (e) => e is Exception); // Not coprime.
+ x = 1234567890;
+ m = 19;
+ Expect.equals(11, x.modInverse(m));
+ x = 1234567890;
+ m = 1000000001;
+ Expect.equals(189108911, x.modInverse(m));
+ x = 19;
+ m = 1000000001;
+ Expect.throws(() => x.modInverse(m), (e) => e is Exception); // Not coprime.
+ x = 19;
+ m = 1234567890;
+ Expect.equals(519818059, x.modInverse(m));
+ x = 1000000001;
+ m = 1234567890;
+ Expect.equals(1001100101, x.modInverse(m));
+ x = 1000000001;
+ m = 19;
+ Expect.throws(() => x.modInverse(m), (e) => e is Exception); // Not coprime.
+ x = 12345678901234567890;
+ m = 19;
+ Expect.equals(3, x.modInverse(m));
+ x = 12345678901234567890;
+ m = 10000000000000000001;
+ Expect.equals(9736746307686209582, x.modInverse(m));
+ x = 19;
+ m = 10000000000000000001;
+ Expect.equals(6315789473684210527, x.modInverse(m));
+ x = 19;
+ m = 12345678901234567890;
+ Expect.equals(10396361179987004539, x.modInverse(m));
+ x = 10000000000000000001;
+ m = 12345678901234567890;
+ Expect.equals(325004555487045911, x.modInverse(m));
+ x = 10000000000000000001;
+ m = 19;
+ Expect.equals(7, x.modInverse(m));
+ x = 12345678901234567890;
+ m = 10000000000000000001;
+ Expect.equals(9736746307686209582, x.modInverse(m));
+ x = 12345678901234567890;
+ m = 19;
+ Expect.equals(3, x.modInverse(m));
+ x = 123456789012345678901234567890;
+ m = 123456789012345678901234567899;
+ Expect.throws(() => x.modInverse(m), (e) => e is Exception); // Not coprime.
+ x = 123456789012345678901234567890;
+ m = 123456789012345678901234567891;
+ Expect.equals(123456789012345678901234567890, x.modInverse(m));
+ x = 123456789012345678901234567899;
+ m = 123456789012345678901234567891;
+ Expect.equals(77160493132716049313271604932, x.modInverse(m));
+ x = 123456789012345678901234567899;
+ m = 123456789012345678901234567890;
+ Expect.throws(() => x.modInverse(m), (e) => e is Exception); // Not coprime.
+ x = 123456789012345678901234567891;
+ m = 123456789012345678901234567890;
+ Expect.equals(1, x.modInverse(m));
+ x = 123456789012345678901234567891;
+ m = 123456789012345678901234567899;
+ Expect.equals(46296295879629629587962962962, x.modInverse(m));
+}
+
+testBigintGcd() {
+ var x, m;
+ x = 1;
+ m = 1;
+ Expect.equals(1, x.gcd(m));
+ x = 693;
+ m = 609;
+ Expect.equals(21, x.gcd(m));
+ x = 693 << 40;
+ m = 609 << 40;
+ Expect.equals(21 << 40, x.gcd(m));
+ x = 609 << 40;;
+ m = 693 << 40;;
+ Expect.equals(21 <<40, x.gcd(m));
+ x = 0;
+ m = 1000000001;
+ Expect.equals(m, x.gcd(m));
+ x = 1000000001;
+ m = 0;
+ Expect.equals(x, x.gcd(m));
+ x = 0;
+ m = -1000000001;
+ Expect.equals(-m, x.gcd(m));
+ x = -1000000001;
+ m = 0;
+ Expect.equals(-x, x.gcd(m));
+ x = 0;
+ m = 0;
+ Expect.equals(0, x.gcd(m));
+ x = 0;
+ m = 123456789012345678901234567890;
+ Expect.equals(m, x.gcd(m));
+ x = 123456789012345678901234567890;
+ m = 0;
+ Expect.equals(x, x.gcd(m));
+ x = 0;
+ m = -123456789012345678901234567890;
+ Expect.equals(-m, x.gcd(m));
+ x = -123456789012345678901234567890;
+ m = 0;
+ Expect.equals(-x, x.gcd(m));
+ x = 1234567890;
+ m = 19;
+ Expect.equals(1, x.gcd(m));
+ x = 1234567890;
+ m = 1000000001;
+ Expect.equals(1, x.gcd(m));
+ x = 19;
+ m = 1000000001;
+ Expect.equals(19, x.gcd(m));
+ x = 19;
+ m = 1234567890;
+ Expect.equals(1, x.gcd(m));
+ x = 1000000001;
+ m = 1234567890;
+ Expect.equals(1, x.gcd(m));
+ x = 1000000001;
+ m = 19;
+ Expect.equals(19, x.gcd(m));
+ x = 12345678901234567890;
+ m = 19;
+ Expect.equals(1, x.gcd(m));
+ x = 12345678901234567890;
+ m = 10000000000000000001;
+ Expect.equals(1, x.gcd(m));
+ x = 19;
+ m = 10000000000000000001;
+ Expect.equals(1, x.gcd(m));
+ x = 19;
+ m = 12345678901234567890;
+ Expect.equals(1, x.gcd(m));
+ x = 10000000000000000001;
+ m = 12345678901234567890;
+ Expect.equals(1, x.gcd(m));
+ x = 10000000000000000001;
+ m = 19;
+ Expect.equals(1, x.gcd(m));
+ x = 12345678901234567890;
+ m = 10000000000000000001;
+ Expect.equals(1, x.gcd(m));
+ x = 12345678901234567890;
+ m = 19;
+ Expect.equals(1, x.gcd(m));
+ x = 123456789012345678901234567890;
+ m = 123456789012345678901234567899;
+ Expect.equals(9, x.gcd(m));
+ x = 123456789012345678901234567890;
+ m = 123456789012345678901234567891;
+ Expect.equals(1, x.gcd(m));
+ x = 123456789012345678901234567899;
+ m = 123456789012345678901234567891;
+ Expect.equals(1, x.gcd(m));
+ x = 123456789012345678901234567899;
+ m = 123456789012345678901234567890;
+ Expect.equals(9, x.gcd(m));
+ x = 123456789012345678901234567891;
+ m = 123456789012345678901234567890;
+ Expect.equals(1, x.gcd(m));
+ x = 123456789012345678901234567891;
+ m = 123456789012345678901234567899;
+ Expect.equals(1, x.gcd(m));
+}
+
+testBigintNegate() {
+ var a = 0xF000000000000000F;
+ var b = ~a; // negate.
+ Expect.equals(-0xF0000000000000010, b);
+ Expect.equals(0, a & b);
+ Expect.equals(-1, a | b);
+}
+
+testShiftAmount() {
+ Expect.equals(0, 12 >> 111111111111111111111111111111);
+ Expect.equals(-1, -12 >> 111111111111111111111111111111);
+ bool exceptionCaught = false;
+ try {
+ var a = 1 << 1111111111111111111111111111;
+ } on OutOfMemoryError catch (e) {
+ exceptionCaught = true;
+ }
+ Expect.equals(true, exceptionCaught);
+}
+
+main() {
+ for (int i = 0; i < 10; i++) {
+ Expect.equals(1234567890123456789, foo());
+ Expect.equals(12345678901234567890, bar());
+ testSmiOverflow(); /// overflow: ok
+ testBigintAdd(); /// add: ok
+ testBigintSub(); /// sub: ok
+ testBigintMul(); /// mul: ok
+ testBigintTruncDiv(); /// trunDiv: ok
+ testBigintDiv(); /// div: ok
+ testBigintModulo(); /// mod: ok
+ testBigintModPow(); /// modPow: ok
+ testBigintModInverse(); /// modInv: ok
+ testBigintGcd(); /// gcd: ok
+ testBigintNegate(); /// negate: ok
+ testShiftAmount(); /// shift: ok
+ Expect.equals(12345678901234567890, (12345678901234567890).abs());
+ Expect.equals(12345678901234567890, (-12345678901234567890).abs());
+ var a = 10000000000000000000;
+ var b = 10000000000000000001;
+ Expect.equals(false, a.hashCode == b.hashCode);
+ Expect.equals(true, a.hashCode == (b - 1).hashCode);
+ }
+}
« no previous file with comments | « test/codegen/corelib/apply_test.dart ('k') | test/codegen/corelib/big_integer_huge_mul_vm_test.dart » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698