Add a bigint test with --no_intrinsify.

tests/corelib/big_integer_vm_test.dart

 // 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.
 
 library big_integer_test;
 import "package:expect/expect.dart";
 
 foo() => 1234567890123456789;
 bar() => 12345678901234567890;
@@ skipping 1614 matching lines @@
       "0x1234567890123456789012345678901234567890123456789012345678901234567890"
       "123456789012345678901234567890123456789012345678901234567890123456789012"
       "345678901234567890123456789012345678901234567890123456789012345678901234"
       "567890123456789012345678901234567890123456789012345678901234567890123456"
       "789012345678901234567890123456789012345678901234567890123456789012345678"
       "90123456789012345678901234567890",
       "0x1234567890ABCDEF01234567890ABCDEF01234567890ABCDEF01234567890ABCDEF"
       "01234567890ABCDEE");
 }
 
 main() {

[Ivan Posva, 2014/10/06 07:25:29]

We should split this large test into sub pieces to get a handle on the test
execution time.

[regis, 2014/10/06 09:57:51]

Done.

   Expect.equals(1234567890123456789, foo());
   Expect.equals(12345678901234567890, bar());
   testSmiOverflow();
   testBigintAdd();
   testBigintSub();
   testBigintMul();
   testBigintHugeMul();
   testBigintModulo();
   testBigintTruncDiv();
   testBigintDiv();
   testBigintNegate();
   testShiftAmount();
   testBigintAddSub();
   testBigintLeftShift();
   testBigintRightShift();
   testBigintBitAnd();
   testBigintBitOr();
   testBigintBitXor();
   testBigintBitNot();
   testBigintMultiplyDivide();
   testBigintDivideRemainder();
   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);
+  // TODO(regis): Add a test for modPow once it is public.
 }