diff options
Diffstat (limited to 'deps/v8/test')
20 files changed, 2839 insertions, 107 deletions
diff --git a/deps/v8/test/cctest/SConscript b/deps/v8/test/cctest/SConscript index 006653c2e8..ba3466deec 100644 --- a/deps/v8/test/cctest/SConscript +++ b/deps/v8/test/cctest/SConscript @@ -41,6 +41,8 @@ SOURCES = { 'test-alloc.cc', 'test-api.cc', 'test-ast.cc', + 'test-bignum.cc', + 'test-bignum-dtoa.cc', 'test-circular-queue.cc', 'test-compiler.cc', 'test-conversions.cc', @@ -50,6 +52,7 @@ SOURCES = { 'test-decls.cc', 'test-diy-fp.cc', 'test-double.cc', + 'test-dtoa.cc', 'test-fast-dtoa.cc', 'test-fixed-dtoa.cc', 'test-flags.cc', diff --git a/deps/v8/test/cctest/test-api.cc b/deps/v8/test/cctest/test-api.cc index 6eb15d8fbf..b4f6914ed7 100644 --- a/deps/v8/test/cctest/test-api.cc +++ b/deps/v8/test/cctest/test-api.cc @@ -38,6 +38,7 @@ #include "utils.h" #include "cctest.h" #include "parser.h" +#include "unicode-inl.h" static const bool kLogThreading = true; @@ -10629,7 +10630,7 @@ THREADED_TEST(IdleNotification) { static uint32_t* stack_limit; static v8::Handle<Value> GetStackLimitCallback(const v8::Arguments& args) { - stack_limit = reinterpret_cast<uint32_t*>(i::StackGuard::climit()); + stack_limit = reinterpret_cast<uint32_t*>(i::StackGuard::real_climit()); return v8::Undefined(); } diff --git a/deps/v8/test/cctest/test-assembler-arm.cc b/deps/v8/test/cctest/test-assembler-arm.cc index 4f90b613a8..0f12f985a3 100644 --- a/deps/v8/test/cctest/test-assembler-arm.cc +++ b/deps/v8/test/cctest/test-assembler-arm.cc @@ -397,4 +397,72 @@ TEST(6) { } } + +static void TestRoundingMode(int32_t mode, double value, int expected) { + InitializeVM(); + v8::HandleScope scope; + + Assembler assm(NULL, 0); + + __ vmrs(r1); + // Set custom FPSCR. + __ bic(r2, r1, Operand(((mode ^ 3) << 22) | 0xf)); + __ orr(r2, r2, Operand(mode << 22)); + __ vmsr(r2); + + // Load value, convert, and move back result to r0. + __ vmov(d1, value); + __ vcvt_s32_f64(s0, d1, Assembler::FPSCRRounding, al); + __ vmov(r0, s0); + + __ mov(pc, Operand(lr)); + + CodeDesc desc; + assm.GetCode(&desc); + Object* code = Heap::CreateCode( + desc, + Code::ComputeFlags(Code::STUB), + Handle<Object>(Heap::undefined_value()))->ToObjectChecked(); + CHECK(code->IsCode()); +#ifdef DEBUG + Code::cast(code)->Print(); +#endif + F1 f = FUNCTION_CAST<F1>(Code::cast(code)->entry()); + int res = reinterpret_cast<int>( + CALL_GENERATED_CODE(f, 0, 0, 0, 0, 0)); + ::printf("res = %d\n", res); + CHECK_EQ(expected, res); +} + + +TEST(7) { + // Test vfp rounding modes. + + // See ARM DDI 0406B Page A2-29. + enum FPSCRRoungingMode { + RN, // Round to Nearest. + RP, // Round towards Plus Infinity. + RM, // Round towards Minus Infinity. + RZ // Round towards zero. + }; + + if (CpuFeatures::IsSupported(VFP3)) { + CpuFeatures::Scope scope(VFP3); + + TestRoundingMode(RZ, 0.5, 0); + TestRoundingMode(RZ, -0.5, 0); + TestRoundingMode(RZ, 123.7, 123); + TestRoundingMode(RZ, -123.7, -123); + TestRoundingMode(RZ, 123456.2, 123456); + TestRoundingMode(RZ, -123456.2, -123456); + + TestRoundingMode(RM, 0.5, 0); + TestRoundingMode(RM, -0.5, -1); + TestRoundingMode(RM, 123.7, 123); + TestRoundingMode(RM, -123.7, -124); + TestRoundingMode(RM, 123456.2, 123456); + TestRoundingMode(RM, -123456.2, -123457); + } +} + #undef __ diff --git a/deps/v8/test/cctest/test-bignum-dtoa.cc b/deps/v8/test/cctest/test-bignum-dtoa.cc new file mode 100644 index 0000000000..51a90574d7 --- /dev/null +++ b/deps/v8/test/cctest/test-bignum-dtoa.cc @@ -0,0 +1,315 @@ +// Copyright 2010 the V8 project authors. All rights reserved. +// Redistribution and use in source and binary forms, with or without +// modification, are permitted provided that the following conditions are +// met: +// +// * Redistributions of source code must retain the above copyright +// notice, this list of conditions and the following disclaimer. +// * Redistributions in binary form must reproduce the above +// copyright notice, this list of conditions and the following +// disclaimer in the documentation and/or other materials provided +// with the distribution. +// * Neither the name of Google Inc. nor the names of its +// contributors may be used to endorse or promote products derived +// from this software without specific prior written permission. +// +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + +#include <stdlib.h> + +#include "v8.h" + +#include "bignum-dtoa.h" + +#include "cctest.h" +#include "double.h" +#include "gay-fixed.h" +#include "gay-precision.h" +#include "gay-shortest.h" +#include "platform.h" + +using namespace v8::internal; + + +// Removes trailing '0' digits. +// Can return the empty string if all digits are 0. +static void TrimRepresentation(Vector<char> representation) { + int len = strlen(representation.start()); + int i; + for (i = len - 1; i >= 0; --i) { + if (representation[i] != '0') break; + } + representation[i + 1] = '\0'; +} + + +static const int kBufferSize = 100; + + +TEST(BignumDtoaVariousDoubles) { + char buffer_container[kBufferSize]; + Vector<char> buffer(buffer_container, kBufferSize); + int length; + int point; + + BignumDtoa(1.0, BIGNUM_DTOA_SHORTEST, 0, buffer, &length, &point); + CHECK_EQ("1", buffer.start()); + CHECK_EQ(1, point); + + BignumDtoa(1.0, BIGNUM_DTOA_FIXED, 3, buffer, &length, &point); + CHECK_GE(3, length - point); + TrimRepresentation(buffer); + CHECK_EQ("1", buffer.start()); + CHECK_EQ(1, point); + + BignumDtoa(1.0, BIGNUM_DTOA_PRECISION, 3, buffer, &length, &point); + CHECK_GE(3, length); + TrimRepresentation(buffer); + CHECK_EQ("1", buffer.start()); + CHECK_EQ(1, point); + + BignumDtoa(1.5, BIGNUM_DTOA_SHORTEST, 0, buffer, &length, &point); + CHECK_EQ("15", buffer.start()); + CHECK_EQ(1, point); + + BignumDtoa(1.5, BIGNUM_DTOA_FIXED, 10, buffer, &length, &point); + CHECK_GE(10, length - point); + TrimRepresentation(buffer); + CHECK_EQ("15", buffer.start()); + CHECK_EQ(1, point); + + BignumDtoa(1.5, BIGNUM_DTOA_PRECISION, 10, buffer, &length, &point); + CHECK_GE(10, length); + TrimRepresentation(buffer); + CHECK_EQ("15", buffer.start()); + CHECK_EQ(1, point); + + double min_double = 5e-324; + BignumDtoa(min_double, BIGNUM_DTOA_SHORTEST, 0, buffer, &length, &point); + CHECK_EQ("5", buffer.start()); + CHECK_EQ(-323, point); + + BignumDtoa(min_double, BIGNUM_DTOA_FIXED, 5, buffer, &length, &point); + CHECK_GE(5, length - point); + TrimRepresentation(buffer); + CHECK_EQ("", buffer.start()); + + BignumDtoa(min_double, BIGNUM_DTOA_PRECISION, 5, buffer, &length, &point); + CHECK_GE(5, length); + TrimRepresentation(buffer); + CHECK_EQ("49407", buffer.start()); + CHECK_EQ(-323, point); + + double max_double = 1.7976931348623157e308; + BignumDtoa(max_double, BIGNUM_DTOA_SHORTEST, 0, buffer, &length, &point); + CHECK_EQ("17976931348623157", buffer.start()); + CHECK_EQ(309, point); + + BignumDtoa(max_double, BIGNUM_DTOA_PRECISION, 7, buffer, &length, &point); + CHECK_GE(7, length); + TrimRepresentation(buffer); + CHECK_EQ("1797693", buffer.start()); + CHECK_EQ(309, point); + + BignumDtoa(4294967272.0, BIGNUM_DTOA_SHORTEST, 0, buffer, &length, &point); + CHECK_EQ("4294967272", buffer.start()); + CHECK_EQ(10, point); + + BignumDtoa(4294967272.0, BIGNUM_DTOA_FIXED, 5, buffer, &length, &point); + CHECK_EQ("429496727200000", buffer.start()); + CHECK_EQ(10, point); + + + BignumDtoa(4294967272.0, BIGNUM_DTOA_PRECISION, 14, buffer, &length, &point); + CHECK_GE(14, length); + TrimRepresentation(buffer); + CHECK_EQ("4294967272", buffer.start()); + CHECK_EQ(10, point); + + BignumDtoa(4.1855804968213567e298, BIGNUM_DTOA_SHORTEST, 0, + buffer, &length, &point); + CHECK_EQ("4185580496821357", buffer.start()); + CHECK_EQ(299, point); + + BignumDtoa(4.1855804968213567e298, BIGNUM_DTOA_PRECISION, 20, + buffer, &length, &point); + CHECK_GE(20, length); + TrimRepresentation(buffer); + CHECK_EQ("41855804968213567225", buffer.start()); + CHECK_EQ(299, point); + + BignumDtoa(5.5626846462680035e-309, BIGNUM_DTOA_SHORTEST, 0, + buffer, &length, &point); + CHECK_EQ("5562684646268003", buffer.start()); + CHECK_EQ(-308, point); + + BignumDtoa(5.5626846462680035e-309, BIGNUM_DTOA_PRECISION, 1, + buffer, &length, &point); + CHECK_GE(1, length); + TrimRepresentation(buffer); + CHECK_EQ("6", buffer.start()); + CHECK_EQ(-308, point); + + BignumDtoa(2147483648.0, BIGNUM_DTOA_SHORTEST, 0, + buffer, &length, &point); + CHECK_EQ("2147483648", buffer.start()); + CHECK_EQ(10, point); + + + BignumDtoa(2147483648.0, BIGNUM_DTOA_FIXED, 2, + buffer, &length, &point); + CHECK_GE(2, length - point); + TrimRepresentation(buffer); + CHECK_EQ("2147483648", buffer.start()); + CHECK_EQ(10, point); + + BignumDtoa(2147483648.0, BIGNUM_DTOA_PRECISION, 5, + buffer, &length, &point); + CHECK_GE(5, length); + TrimRepresentation(buffer); + CHECK_EQ("21475", buffer.start()); + CHECK_EQ(10, point); + + BignumDtoa(3.5844466002796428e+298, BIGNUM_DTOA_SHORTEST, 0, + buffer, &length, &point); + CHECK_EQ("35844466002796428", buffer.start()); + CHECK_EQ(299, point); + + BignumDtoa(3.5844466002796428e+298, BIGNUM_DTOA_PRECISION, 10, + buffer, &length, &point); + CHECK_GE(10, length); + TrimRepresentation(buffer); + CHECK_EQ("35844466", buffer.start()); + CHECK_EQ(299, point); + + uint64_t smallest_normal64 = V8_2PART_UINT64_C(0x00100000, 00000000); + double v = Double(smallest_normal64).value(); + BignumDtoa(v, BIGNUM_DTOA_SHORTEST, 0, buffer, &length, &point); + CHECK_EQ("22250738585072014", buffer.start()); + CHECK_EQ(-307, point); + + BignumDtoa(v, BIGNUM_DTOA_PRECISION, 20, buffer, &length, &point); + CHECK_GE(20, length); + TrimRepresentation(buffer); + CHECK_EQ("22250738585072013831", buffer.start()); + CHECK_EQ(-307, point); + + uint64_t largest_denormal64 = V8_2PART_UINT64_C(0x000FFFFF, FFFFFFFF); + v = Double(largest_denormal64).value(); + BignumDtoa(v, BIGNUM_DTOA_SHORTEST, 0, buffer, &length, &point); + CHECK_EQ("2225073858507201", buffer.start()); + CHECK_EQ(-307, point); + + BignumDtoa(v, BIGNUM_DTOA_PRECISION, 20, buffer, &length, &point); + CHECK_GE(20, length); + TrimRepresentation(buffer); + CHECK_EQ("2225073858507200889", buffer.start()); + CHECK_EQ(-307, point); + + BignumDtoa(4128420500802942e-24, BIGNUM_DTOA_SHORTEST, 0, + buffer, &length, &point); + CHECK_EQ("4128420500802942", buffer.start()); + CHECK_EQ(-8, point); + + v = 3.9292015898194142585311918e-10; + BignumDtoa(v, BIGNUM_DTOA_SHORTEST, 0, buffer, &length, &point); + CHECK_EQ("39292015898194143", buffer.start()); + + v = 4194304.0; + BignumDtoa(v, BIGNUM_DTOA_FIXED, 5, buffer, &length, &point); + CHECK_GE(5, length - point); + TrimRepresentation(buffer); + CHECK_EQ("4194304", buffer.start()); + + v = 3.3161339052167390562200598e-237; + BignumDtoa(v, BIGNUM_DTOA_PRECISION, 19, buffer, &length, &point); + CHECK_GE(19, length); + TrimRepresentation(buffer); + CHECK_EQ("3316133905216739056", buffer.start()); + CHECK_EQ(-236, point); + + v = 7.9885183916008099497815232e+191; + BignumDtoa(v, BIGNUM_DTOA_PRECISION, 4, buffer, &length, &point); + CHECK_GE(4, length); + TrimRepresentation(buffer); + CHECK_EQ("7989", buffer.start()); + CHECK_EQ(192, point); + + v = 1.0000000000000012800000000e+17; + BignumDtoa(v, BIGNUM_DTOA_FIXED, 1, buffer, &length, &point); + CHECK_GE(1, length - point); + TrimRepresentation(buffer); + CHECK_EQ("100000000000000128", buffer.start()); + CHECK_EQ(18, point); +} + + +TEST(BignumDtoaGayShortest) { + char buffer_container[kBufferSize]; + Vector<char> buffer(buffer_container, kBufferSize); + int length; + int point; + + Vector<const PrecomputedShortest> precomputed = + PrecomputedShortestRepresentations(); + for (int i = 0; i < precomputed.length(); ++i) { + const PrecomputedShortest current_test = precomputed[i]; + double v = current_test.v; + BignumDtoa(v, BIGNUM_DTOA_SHORTEST, 0, buffer, &length, &point); + CHECK_EQ(current_test.decimal_point, point); + CHECK_EQ(current_test.representation, buffer.start()); + } +} + + +TEST(BignumDtoaGayFixed) { + char buffer_container[kBufferSize]; + Vector<char> buffer(buffer_container, kBufferSize); + int length; + int point; + + Vector<const PrecomputedFixed> precomputed = + PrecomputedFixedRepresentations(); + for (int i = 0; i < precomputed.length(); ++i) { + const PrecomputedFixed current_test = precomputed[i]; + double v = current_test.v; + int number_digits = current_test.number_digits; + BignumDtoa(v, BIGNUM_DTOA_FIXED, number_digits, buffer, &length, &point); + CHECK_EQ(current_test.decimal_point, point); + CHECK_GE(number_digits, length - point); + TrimRepresentation(buffer); + CHECK_EQ(current_test.representation, buffer.start()); + } +} + + +TEST(BignumDtoaGayPrecision) { + char buffer_container[kBufferSize]; + Vector<char> buffer(buffer_container, kBufferSize); + int length; + int point; + + Vector<const PrecomputedPrecision> precomputed = + PrecomputedPrecisionRepresentations(); + for (int i = 0; i < precomputed.length(); ++i) { + const PrecomputedPrecision current_test = precomputed[i]; + double v = current_test.v; + int number_digits = current_test.number_digits; + BignumDtoa(v, BIGNUM_DTOA_PRECISION, number_digits, + buffer, &length, &point); + CHECK_EQ(current_test.decimal_point, point); + CHECK_GE(number_digits, length); + TrimRepresentation(buffer); + CHECK_EQ(current_test.representation, buffer.start()); + } +} diff --git a/deps/v8/test/cctest/test-bignum.cc b/deps/v8/test/cctest/test-bignum.cc new file mode 100644 index 0000000000..9aa5ef30d0 --- /dev/null +++ b/deps/v8/test/cctest/test-bignum.cc @@ -0,0 +1,1502 @@ +// Copyright 2010 the V8 project authors. All rights reserved. +// Redistribution and use in source and binary forms, with or without +// modification, are permitted provided that the following conditions are +// met: +// +// * Redistributions of source code must retain the above copyright +// notice, this list of conditions and the following disclaimer. +// * Redistributions in binary form must reproduce the above +// copyright notice, this list of conditions and the following +// disclaimer in the documentation and/or other materials provided +// with the distribution. +// * Neither the name of Google Inc. nor the names of its +// contributors may be used to endorse or promote products derived +// from this software without specific prior written permission. +// +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + +#include <stdlib.h> + +#include "v8.h" + +#include "platform.h" +#include "cctest.h" +#include "bignum.h" + +using namespace v8::internal; + + +static const int kBufferSize = 1024; + +static void AssignHexString(Bignum* bignum, const char* str) { + bignum->AssignHexString(Vector<const char>(str, StrLength(str))); +} + + +static void AssignDecimalString(Bignum* bignum, const char* str) { + bignum->AssignDecimalString(Vector<const char>(str, StrLength(str))); +} + + +TEST(Assign) { + char buffer[kBufferSize]; + Bignum bignum; + Bignum bignum2; + bignum.AssignUInt16(0); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("0", buffer); + bignum.AssignUInt16(0xA); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("A", buffer); + bignum.AssignUInt16(0x20); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("20", buffer); + + + bignum.AssignUInt64(0); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("0", buffer); + bignum.AssignUInt64(0xA); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("A", buffer); + bignum.AssignUInt64(0x20); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("20", buffer); + bignum.AssignUInt64(0x100); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("100", buffer); + + // The first real test, since this will not fit into one bigit. + bignum.AssignUInt64(0x12345678); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("12345678", buffer); + + uint64_t big = V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF); + bignum.AssignUInt64(big); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFFFFFFFFFFF", buffer); + + big = V8_2PART_UINT64_C(0x12345678, 9ABCDEF0); + bignum.AssignUInt64(big); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("123456789ABCDEF0", buffer); + + bignum2.AssignBignum(bignum); + CHECK(bignum2.ToHexString(buffer, kBufferSize)); + CHECK_EQ("123456789ABCDEF0", buffer); + + AssignDecimalString(&bignum, "0"); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("0", buffer); + + AssignDecimalString(&bignum, "1"); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + AssignDecimalString(&bignum, "1234567890"); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("499602D2", buffer); + + AssignHexString(&bignum, "0"); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("0", buffer); + + AssignHexString(&bignum, "123456789ABCDEF0"); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("123456789ABCDEF0", buffer); +} + + +TEST(ShiftLeft) { + char buffer[kBufferSize]; + Bignum bignum; + AssignHexString(&bignum, "0"); + bignum.ShiftLeft(100); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("0", buffer); + + AssignHexString(&bignum, "1"); + bignum.ShiftLeft(1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("2", buffer); + + AssignHexString(&bignum, "1"); + bignum.ShiftLeft(4); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10", buffer); + + AssignHexString(&bignum, "1"); + bignum.ShiftLeft(32); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("100000000", buffer); + + AssignHexString(&bignum, "1"); + bignum.ShiftLeft(64); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000", buffer); + + AssignHexString(&bignum, "123456789ABCDEF"); + bignum.ShiftLeft(64); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("123456789ABCDEF0000000000000000", buffer); + bignum.ShiftLeft(1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("2468ACF13579BDE0000000000000000", buffer); +} + + +TEST(AddUInt64) { + char buffer[kBufferSize]; + Bignum bignum; + AssignHexString(&bignum, "0"); + bignum.AddUInt64(0xA); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("A", buffer); + + AssignHexString(&bignum, "1"); + bignum.AddUInt64(0xA); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("B", buffer); + + AssignHexString(&bignum, "1"); + bignum.AddUInt64(0x100); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("101", buffer); + + AssignHexString(&bignum, "1"); + bignum.AddUInt64(0xFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000", buffer); + + AssignHexString(&bignum, "FFFFFFF"); + bignum.AddUInt64(0x1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000", buffer); + + AssignHexString(&bignum, "10000000000000000000000000000000000000000000"); + bignum.AddUInt64(0xFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1000000000000000000000000000000000000000FFFF", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"); + bignum.AddUInt64(0x1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("100000000000000000000000000000000000000000000", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + bignum.AddUInt64(1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000000000001", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + bignum.AddUInt64(0xFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1000000000000000000000FFFF", buffer); + + AssignHexString(&bignum, "0"); + bignum.AddUInt64(V8_2PART_UINT64_C(0xA, 00000000)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("A00000000", buffer); + + AssignHexString(&bignum, "1"); + bignum.AddUInt64(V8_2PART_UINT64_C(0xA, 00000000)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("A00000001", buffer); + + AssignHexString(&bignum, "1"); + bignum.AddUInt64(V8_2PART_UINT64_C(0x100, 00000000)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000001", buffer); + + AssignHexString(&bignum, "1"); + bignum.AddUInt64(V8_2PART_UINT64_C(0xFFFF, 00000000)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFF00000001", buffer); + + AssignHexString(&bignum, "FFFFFFF"); + bignum.AddUInt64(V8_2PART_UINT64_C(0x1, 00000000)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10FFFFFFF", buffer); + + AssignHexString(&bignum, "10000000000000000000000000000000000000000000"); + bignum.AddUInt64(V8_2PART_UINT64_C(0xFFFF, 00000000)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000000000000000000FFFF00000000", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"); + bignum.AddUInt64(V8_2PART_UINT64_C(0x1, 00000000)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1000000000000000000000000000000000000FFFFFFFF", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + bignum.AddUInt64(V8_2PART_UINT64_C(0x1, 00000000)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000100000000", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + bignum.AddUInt64(V8_2PART_UINT64_C(0xFFFF, 00000000)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000FFFF00000000", buffer); +} + + +TEST(AddBignum) { + char buffer[kBufferSize]; + Bignum bignum; + Bignum other; + + AssignHexString(&other, "1"); + AssignHexString(&bignum, "0"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + AssignHexString(&bignum, "1"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("2", buffer); + + AssignHexString(&bignum, "FFFFFFF"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFF"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("100000000000000", buffer); + + AssignHexString(&bignum, "10000000000000000000000000000000000000000000"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000000000000000000000000000001", buffer); + + AssignHexString(&other, "1000000000000"); + + AssignHexString(&bignum, "1"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1000000000001", buffer); + + AssignHexString(&bignum, "FFFFFFF"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("100000FFFFFFF", buffer); + + AssignHexString(&bignum, "10000000000000000000000000000000000000000000"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000000000000000001000000000000", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1000000000000000000000000000000FFFFFFFFFFFF", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000001000000000000", buffer); + + other.ShiftLeft(64); + // other == "10000000000000000000000000000" + + bignum.AssignUInt16(0x1); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000000000000001", buffer); + + AssignHexString(&bignum, "FFFFFFF"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1000000000000000000000FFFFFFF", buffer); + + AssignHexString(&bignum, "10000000000000000000000000000000000000000000"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000010000000000000000000000000000", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("100000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFF", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + bignum.AddBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10010000000000000000000000000", buffer); +} + + +TEST(SubtractBignum) { + char buffer[kBufferSize]; + Bignum bignum; + Bignum other; + + AssignHexString(&bignum, "1"); + AssignHexString(&other, "0"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + AssignHexString(&bignum, "2"); + AssignHexString(&other, "0"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("2", buffer); + + AssignHexString(&bignum, "10000000"); + AssignHexString(&other, "1"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFF", buffer); + + AssignHexString(&bignum, "100000000000000"); + AssignHexString(&other, "1"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFFFFFFFFF", buffer); + + AssignHexString(&bignum, "10000000000000000000000000000000000000000001"); + AssignHexString(&other, "1"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000000000000000000000000000000", buffer); + + AssignHexString(&bignum, "1000000000001"); + AssignHexString(&other, "1000000000000"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + AssignHexString(&bignum, "100000FFFFFFF"); + AssignHexString(&other, "1000000000000"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFF", buffer); + + AssignHexString(&bignum, "10000000000000000000000000000001000000000000"); + AssignHexString(&other, "1000000000000"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000000000000000000000000000000", buffer); + + AssignHexString(&bignum, "1000000000000000000000000000000FFFFFFFFFFFF"); + AssignHexString(&other, "1000000000000"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + // "10 0000 0000 0000 0000 0000 0000" + AssignHexString(&other, "1000000000000"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFFFFFFFF000000000000", buffer); + + AssignHexString(&other, "1000000000000"); + other.ShiftLeft(48); + // other == "1000000000000000000000000" + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + // bignum == "10000000000000000000000000" + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("F000000000000000000000000", buffer); + + other.AssignUInt16(0x1); + other.ShiftLeft(35); + // other == "800000000" + AssignHexString(&bignum, "FFFFFFF"); + bignum.ShiftLeft(60); + // bignum = FFFFFFF000000000000000 + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFEFFFFFF800000000", buffer); + + AssignHexString(&bignum, "10000000000000000000000000000000000000000000"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF800000000", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"); + bignum.SubtractBignum(other); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF7FFFFFFFF", buffer); +} + + +TEST(MultiplyUInt32) { + char buffer[kBufferSize]; + Bignum bignum; + + AssignHexString(&bignum, "0"); + bignum.MultiplyByUInt32(0x25); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("0", buffer); + + AssignHexString(&bignum, "2"); + bignum.MultiplyByUInt32(0x5); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("A", buffer); + + AssignHexString(&bignum, "10000000"); + bignum.MultiplyByUInt32(0x9); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("90000000", buffer); + + AssignHexString(&bignum, "100000000000000"); + bignum.MultiplyByUInt32(0xFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFF00000000000000", buffer); + + AssignHexString(&bignum, "100000000000000"); + bignum.MultiplyByUInt32(0xFFFFFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFFF00000000000000", buffer); + + AssignHexString(&bignum, "1234567ABCD"); + bignum.MultiplyByUInt32(0xFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("12333335552433", buffer); + + AssignHexString(&bignum, "1234567ABCD"); + bignum.MultiplyByUInt32(0xFFFFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("12345679998A985433", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFF"); + bignum.MultiplyByUInt32(0x2); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1FFFFFFFFFFFFFFFE", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFF"); + bignum.MultiplyByUInt32(0x4); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("3FFFFFFFFFFFFFFFC", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFF"); + bignum.MultiplyByUInt32(0xF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("EFFFFFFFFFFFFFFF1", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFF"); + bignum.MultiplyByUInt32(0xFFFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFEFFFFFFFFFF000001", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + // "10 0000 0000 0000 0000 0000 0000" + bignum.MultiplyByUInt32(2); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("20000000000000000000000000", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + // "10 0000 0000 0000 0000 0000 0000" + bignum.MultiplyByUInt32(0xF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("F0000000000000000000000000", buffer); + + bignum.AssignUInt16(0xFFFF); + bignum.ShiftLeft(100); + // "FFFF0 0000 0000 0000 0000 0000 0000" + bignum.MultiplyByUInt32(0xFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFE00010000000000000000000000000", buffer); + + bignum.AssignUInt16(0xFFFF); + bignum.ShiftLeft(100); + // "FFFF0 0000 0000 0000 0000 0000 0000" + bignum.MultiplyByUInt32(0xFFFFFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFEFFFF00010000000000000000000000000", buffer); + + bignum.AssignUInt16(0xFFFF); + bignum.ShiftLeft(100); + // "FFFF0 0000 0000 0000 0000 0000 0000" + bignum.MultiplyByUInt32(0xFFFFFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFEFFFF00010000000000000000000000000", buffer); + + AssignDecimalString(&bignum, "15611230384529777"); + bignum.MultiplyByUInt32(10000000); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("210EDD6D4CDD2580EE80", buffer); +} + + +TEST(MultiplyUInt64) { + char buffer[kBufferSize]; + Bignum bignum; + + AssignHexString(&bignum, "0"); + bignum.MultiplyByUInt64(0x25); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("0", buffer); + + AssignHexString(&bignum, "2"); + bignum.MultiplyByUInt64(0x5); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("A", buffer); + + AssignHexString(&bignum, "10000000"); + bignum.MultiplyByUInt64(0x9); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("90000000", buffer); + + AssignHexString(&bignum, "100000000000000"); + bignum.MultiplyByUInt64(0xFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFF00000000000000", buffer); + + AssignHexString(&bignum, "100000000000000"); + bignum.MultiplyByUInt64(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFFFFFFFFFFF00000000000000", buffer); + + AssignHexString(&bignum, "1234567ABCD"); + bignum.MultiplyByUInt64(0xFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("12333335552433", buffer); + + AssignHexString(&bignum, "1234567ABCD"); + bignum.MultiplyByUInt64(V8_2PART_UINT64_C(0xFF, FFFFFFFF)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1234567ABCBDCBA985433", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFF"); + bignum.MultiplyByUInt64(0x2); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1FFFFFFFFFFFFFFFE", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFF"); + bignum.MultiplyByUInt64(0x4); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("3FFFFFFFFFFFFFFFC", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFF"); + bignum.MultiplyByUInt64(0xF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("EFFFFFFFFFFFFFFF1", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFFFF"); + bignum.MultiplyByUInt64(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFFFFFFFFFFE0000000000000001", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + // "10 0000 0000 0000 0000 0000 0000" + bignum.MultiplyByUInt64(2); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("20000000000000000000000000", buffer); + + bignum.AssignUInt16(0x1); + bignum.ShiftLeft(100); + // "10 0000 0000 0000 0000 0000 0000" + bignum.MultiplyByUInt64(0xF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("F0000000000000000000000000", buffer); + + bignum.AssignUInt16(0xFFFF); + bignum.ShiftLeft(100); + // "FFFF0 0000 0000 0000 0000 0000 0000" + bignum.MultiplyByUInt64(0xFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFE00010000000000000000000000000", buffer); + + bignum.AssignUInt16(0xFFFF); + bignum.ShiftLeft(100); + // "FFFF0 0000 0000 0000 0000 0000 0000" + bignum.MultiplyByUInt64(0xFFFFFFFF); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFEFFFF00010000000000000000000000000", buffer); + + bignum.AssignUInt16(0xFFFF); + bignum.ShiftLeft(100); + // "FFFF0 0000 0000 0000 0000 0000 0000" + bignum.MultiplyByUInt64(V8_2PART_UINT64_C(0xFFFFFFFF, FFFFFFFF)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFEFFFFFFFFFFFF00010000000000000000000000000", buffer); + + AssignDecimalString(&bignum, "15611230384529777"); + bignum.MultiplyByUInt64(V8_2PART_UINT64_C(0x8ac72304, 89e80000)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1E10EE4B11D15A7F3DE7F3C7680000", buffer); +} + + +TEST(MultiplyPowerOfTen) { + char buffer[kBufferSize]; + Bignum bignum; + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("3034", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(2); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1E208", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(3); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("12D450", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(4); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("BC4B20", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(5); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("75AEF40", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(6); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("498D5880", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(7); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("2DF857500", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(8); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1CBB369200", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(9); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("11F5021B400", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(10); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("B3921510800", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(11); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("703B4D2A5000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(12); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("4625103A72000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(13); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("2BD72A24874000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(14); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1B667A56D488000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(15); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("11200C7644D50000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(16); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("AB407C9EB0520000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(17); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("6B084DE32E3340000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(18); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("42E530ADFCE0080000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(19); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("29CF3E6CBE0C0500000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(20); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1A218703F6C783200000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(21); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1054F4627A3CB1F400000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(22); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("A3518BD8C65EF38800000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(23); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("6612F7677BFB5835000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(24); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("3FCBDAA0AD7D17212000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(25); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("27DF68A46C6E2E74B4000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(26); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("18EBA166C3C4DD08F08000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(27); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("F9344E03A5B0A259650000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(28); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("9BC0B0C2478E6577DF20000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(29); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("61586E796CB8FF6AEB740000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(30); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("3CD7450BE3F39FA2D32880000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(31); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("26068B276E7843C5C3F9500000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(50); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("149D1B4CFED03B23AB5F4E1196EF45C08000000000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(100); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("5827249F27165024FBC47DFCA9359BF316332D1B91ACEECF471FBAB06D9B2" + "0000000000000000000000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(200); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("64C1F5C06C3816AFBF8DAFD5A3D756365BB0FD020E6F084E759C1F7C99E4F" + "55B9ACC667CEC477EB958C2AEEB3C6C19BA35A1AD30B35C51EB72040920000" + "0000000000000000000000000000000000000000000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(500); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("96741A625EB5D7C91039FEB5C5ACD6D9831EDA5B083D800E6019442C8C8223" + "3EAFB3501FE2058062221E15121334928880827DEE1EC337A8B26489F3A40A" + "CB440A2423734472D10BFCE886F41B3AF9F9503013D86D088929CA86EEB4D8" + "B9C831D0BD53327B994A0326227CFD0ECBF2EB48B02387AAE2D4CCCDF1F1A1" + "B8CC4F1FA2C56AD40D0E4DAA9C28CDBF0A549098EA13200000000000000000" + "00000000000000000000000000000000000000000000000000000000000000" + "0000000000000000000000000000000000000000000000", buffer); + + AssignDecimalString(&bignum, "1234"); + bignum.MultiplyByPowerOfTen(1000); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1258040F99B1CD1CC9819C676D413EA50E4A6A8F114BB0C65418C62D399B81" + "6361466CA8E095193E1EE97173553597C96673AF67FAFE27A66E7EF2E5EF2E" + "E3F5F5070CC17FE83BA53D40A66A666A02F9E00B0E11328D2224B8694C7372" + "F3D536A0AD1985911BD361496F268E8B23112500EAF9B88A9BC67B2AB04D38" + "7FEFACD00F5AF4F764F9ABC3ABCDE54612DE38CD90CB6647CA389EA0E86B16" + "BF7A1F34086E05ADBE00BD1673BE00FAC4B34AF1091E8AD50BA675E0381440" + "EA8E9D93E75D816BAB37C9844B1441C38FC65CF30ABB71B36433AF26DD97BD" + "ABBA96C03B4919B8F3515B92826B85462833380DC193D79F69D20DD6038C99" + "6114EF6C446F0BA28CC772ACBA58B81C04F8FFDE7B18C4E5A3ABC51E637FDF" + "6E37FDFF04C940919390F4FF92000000000000000000000000000000000000" + "00000000000000000000000000000000000000000000000000000000000000" + "00000000000000000000000000000000000000000000000000000000000000" + "00000000000000000000000000000000000000000000000000000000000000" + "0000000000000000000000000000", buffer); + + Bignum bignum2; + AssignHexString(&bignum2, "3DA774C07FB5DF54284D09C675A492165B830D5DAAEB2A7501" + "DA17CF9DFA1CA2282269F92A25A97314296B717E3DCBB9FE17" + "41A842FE2913F540F40796F2381155763502C58B15AF7A7F88" + "6F744C9164FF409A28F7FA0C41F89ED79C1BE9F322C8578B97" + "841F1CBAA17D901BE1230E3C00E1C643AF32638B5674E01FEA" + "96FC90864E621B856A9E1CE56E6EB545B9C2F8F0CC10DDA88D" + "CC6D282605F8DB67044F2DFD3695E7BA63877AE16701536AE6" + "567C794D0BFE338DFBB42D92D4215AF3BB22BF0A8B283FDDC2" + "C667A10958EA6D2"); + CHECK(bignum2.ToHexString(buffer, kBufferSize)); + CHECK_EQ("3DA774C07FB5DF54284D09C675A492165B830D5DAAEB2A7501" + "DA17CF9DFA1CA2282269F92A25A97314296B717E3DCBB9FE17" + "41A842FE2913F540F40796F2381155763502C58B15AF7A7F88" + "6F744C9164FF409A28F7FA0C41F89ED79C1BE9F322C8578B97" + "841F1CBAA17D901BE1230E3C00E1C643AF32638B5674E01FEA" + "96FC90864E621B856A9E1CE56E6EB545B9C2F8F0CC10DDA88D" + "CC6D282605F8DB67044F2DFD3695E7BA63877AE16701536AE6" + "567C794D0BFE338DFBB42D92D4215AF3BB22BF0A8B283FDDC2" + "C667A10958EA6D2", buffer); + + bignum.AssignBignum(bignum2); + bignum.MultiplyByPowerOfTen(1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("2688A8F84FD1AB949930261C0986DB4DF931E85A8AD2FA8921284EE1C2BC51" + "E55915823BBA5789E7EC99E326EEE69F543ECE890929DED9AC79489884BE57" + "630AD569E121BB76ED8DAC8FB545A8AFDADF1F8860599AFC47A93B6346C191" + "7237F5BD36B73EB29371F4A4EE7A116CB5E8E5808D1BEA4D7F7E3716090C13" + "F29E5DDA53F0FD513362A2D20F6505314B9419DB967F8A8A89589FC43917C3" + "BB892062B17CBE421DB0D47E34ACCCE060D422CFF60DCBD0277EE038BD509C" + "7BC494D8D854F5B76696F927EA99BC00C4A5D7928434", buffer); + + bignum.AssignBignum(bignum2); + bignum.MultiplyByPowerOfTen(2); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1815699B31E30B3CDFBE17D185F44910BBBF313896C3DC95B4B9314D19B5B32" + "F57AD71655476B630F3E02DF855502394A74115A5BA2B480BCBCD5F52F6F69D" + "E6C5622CB5152A54788BD9D14B896DE8CB73B53C3800DDACC9C51E0C38FAE76" + "2F9964232872F9C2738E7150C4AE3F1B18F70583172706FAEE26DC5A78C77A2" + "FAA874769E52C01DA5C3499F233ECF3C90293E0FB69695D763DAA3AEDA5535B" + "43DAEEDF6E9528E84CEE0EC000C3C8495C1F9C89F6218AF4C23765261CD5ADD" + "0787351992A01E5BB8F2A015807AE7A6BB92A08", buffer); + + bignum.AssignBignum(bignum2); + bignum.MultiplyByPowerOfTen(5); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("5E13A4863ADEE3E5C9FE8D0A73423D695D62D8450CED15A8C9F368952C6DC3" + "F0EE7D82F3D1EFB7AF38A3B3920D410AFCAD563C8F5F39116E141A3C5C14B3" + "58CD73077EA35AAD59F6E24AD98F10D5555ABBFBF33AC361EAF429FD5FBE94" + "17DA9EF2F2956011F9F93646AA38048A681D984ED88127073443247CCC167C" + "B354A32206EF5A733E73CF82D795A1AD598493211A6D613C39515E0E0F6304" + "DCD9C810F3518C7F6A7CB6C81E99E02FCC65E8FDB7B7AE97306CC16A8631CE" + "0A2AEF6568276BE4C176964A73C153FDE018E34CB4C2F40", buffer); + + bignum.AssignBignum(bignum2); + bignum.MultiplyByPowerOfTen(10); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("8F8CB8EB51945A7E815809F6121EF2F4E61EF3405CD9432CAD2709749EEAFD" + "1B81E843F14A3667A7BDCCC9E0BB795F63CDFDB62844AC7438976C885A0116" + "29607DA54F9C023CC366570B7637ED0F855D931752038A614922D0923E382C" + "B8E5F6C975672DB76E0DE471937BB9EDB11E28874F1C122D5E1EF38CECE9D0" + "0723056BCBD4F964192B76830634B1D322B7EB0062F3267E84F5C824343A77" + "4B7DCEE6DD464F01EBDC8C671BB18BB4EF4300A42474A6C77243F2A12B03BF" + "0443C38A1C0D2701EDB393135AE0DEC94211F9D4EB51F990800", buffer); + + bignum.AssignBignum(bignum2); + bignum.MultiplyByPowerOfTen(50); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("107A8BE345E24407372FC1DE442CBA696BC23C4FFD5B4BDFD9E5C39559815" + "86628CF8472D2D589F2FC2BAD6E0816EC72CBF85CCA663D8A1EC6C51076D8" + "2D247E6C26811B7EC4D4300FB1F91028DCB7B2C4E7A60C151161AA7E65E79" + "B40917B12B2B5FBE7745984D4E8EFA31F9AE6062427B068B144A9CB155873" + "E7C0C9F0115E5AC72DC5A73C4796DB970BF9205AB8C77A6996EB1B417F9D1" + "6232431E6313C392203601B9C22CC10DDA88DCC6D282605F8DB67044F2DFD" + "3695E7BA63877AE16701536AE6567C794D0BFE338DFBB42D924CF964BD2C0" + "F586E03A2FCD35A408000000000000", buffer); + + bignum.AssignBignum(bignum2); + bignum.MultiplyByPowerOfTen(100); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("46784A90ACD0ED3E7759CC585FB32D36EB6034A6F78D92604E3BAA5ED3D8B" + "6E60E854439BE448897FB4B7EA5A3D873AA0FCB3CFFD80D0530880E45F511" + "722A50CE7E058B5A6F5464DB7500E34984EE3202A9441F44FA1554C0CEA96" + "B438A36F25E7C9D56D71AE2CD313EC37534DA299AC0854FC48591A7CF3171" + "31265AA4AE62DE32344CE7BEEEF894AE686A2DAAFE5D6D9A10971FFD9C064" + "5079B209E1048F58B5192D41D84336AC4C8C489EEF00939CFC9D55C122036" + "01B9C22CC10DDA88DCC6D282605F8DB67044F2DFD3695E7BA3F67B96D3A32" + "E11FB5561B68744C4035B0800DC166D49D98E3FD1D5BB2000000000000000" + "0000000000", buffer); + + bignum.AssignBignum(bignum2); + bignum.MultiplyByPowerOfTen(200); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("508BD351221DF139D72D88CDC0416845A53EE2D0E6B98352509A9AC312F8C" + "6CB1A144889416201E0B6CE66EA3EBE259B5FD79ECFC1FD77963CE516CC7E" + "2FE73D4B5B710C19F6BCB092C7A2FD76286543B8DBD2C596DFF2C896720BA" + "DFF7BC9C366ACEA3A880AEC287C5E6207DF2739B5326FC19D773BD830B109" + "ED36C7086544BF8FDB9D4B73719C2B5BC2F571A5937EC46876CD428281F6B" + "F287E1E07F25C1B1D46BC37324FF657A8B2E0071DB83B86123CA34004F406" + "001082D7945E90C6E8C9A9FEC2B44BE0DDA46E9F52B152E4D1336D2FCFBC9" + "96E30CA0082256737365158FE36482AA7EB9DAF2AB128F10E7551A3CD5BE6" + "0A922F3A7D5EED38B634A7EC95BCF7021BA6820A292000000000000000000" + "00000000000000000000000000000000", buffer); + + bignum.AssignBignum(bignum2); + bignum.MultiplyByPowerOfTen(500); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("7845F900E475B5086885BAAAE67C8E85185ACFE4633727F82A4B06B5582AC" + "BE933C53357DA0C98C20C5AC900C4D76A97247DF52B79F48F9E35840FB715" + "D392CE303E22622B0CF82D9471B398457DD3196F639CEE8BBD2C146873841" + "F0699E6C41F04FC7A54B48CEB995BEB6F50FE81DE9D87A8D7F849CC523553" + "7B7BBBC1C7CAAFF6E9650BE03B308C6D31012AEF9580F70D3EE2083ADE126" + "8940FA7D6308E239775DFD2F8C97FF7EBD525DAFA6512216F7047A62A93DC" + "38A0165BDC67E250DCC96A0181DE935A70B38704DC71819F02FC5261FF7E1" + "E5F11907678B0A3E519FF4C10A867B0C26CE02BE6960BA8621A87303C101C" + "3F88798BB9F7739655946F8B5744E6B1EAF10B0C5621330F0079209033C69" + "20DE2E2C8D324F0624463735D482BF291926C22A910F5B80FA25170B6B57D" + "8D5928C7BCA3FE87461275F69BD5A1B83181DAAF43E05FC3C72C4E93111B6" + "6205EBF49B28FEDFB7E7526CBDA658A332000000000000000000000000000" + "0000000000000000000000000000000000000000000000000000000000000" + "0000000000000000000000000000000000000", buffer); +} + + +TEST(DivideModuloIntBignum) { + char buffer[kBufferSize]; + Bignum bignum; + Bignum other; + Bignum third; + + bignum.AssignUInt16(10); + other.AssignUInt16(2); + CHECK_EQ(5, bignum.DivideModuloIntBignum(other)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("0", buffer); + + bignum.AssignUInt16(10); + bignum.ShiftLeft(500); + other.AssignUInt16(2); + other.ShiftLeft(500); + CHECK_EQ(5, bignum.DivideModuloIntBignum(other)); + CHECK_EQ("0", buffer); + + bignum.AssignUInt16(11); + other.AssignUInt16(2); + CHECK_EQ(5, bignum.DivideModuloIntBignum(other)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + bignum.AssignUInt16(10); + bignum.ShiftLeft(500); + other.AssignUInt16(1); + bignum.AddBignum(other); + other.AssignUInt16(2); + other.ShiftLeft(500); + CHECK_EQ(5, bignum.DivideModuloIntBignum(other)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + bignum.AssignUInt16(10); + bignum.ShiftLeft(500); + other.AssignBignum(bignum); + bignum.MultiplyByUInt32(0x1234); + third.AssignUInt16(0xFFF); + bignum.AddBignum(third); + CHECK_EQ(0x1234, bignum.DivideModuloIntBignum(other)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFF", buffer); + + bignum.AssignUInt16(10); + AssignHexString(&other, "1234567890"); + CHECK_EQ(0, bignum.DivideModuloIntBignum(other)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("A", buffer); + + AssignHexString(&bignum, "12345678"); + AssignHexString(&other, "3789012"); + CHECK_EQ(5, bignum.DivideModuloIntBignum(other)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("D9861E", buffer); + + AssignHexString(&bignum, "70000001"); + AssignHexString(&other, "1FFFFFFF"); + CHECK_EQ(3, bignum.DivideModuloIntBignum(other)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000004", buffer); + + AssignHexString(&bignum, "28000000"); + AssignHexString(&other, "12A05F20"); + CHECK_EQ(2, bignum.DivideModuloIntBignum(other)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("2BF41C0", buffer); + + bignum.AssignUInt16(10); + bignum.ShiftLeft(500); + other.AssignBignum(bignum); + bignum.MultiplyByUInt32(0x1234); + third.AssignUInt16(0xFFF); + other.SubtractBignum(third); + CHECK_EQ(0x1234, bignum.DivideModuloIntBignum(other)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1232DCC", buffer); + CHECK_EQ(0, bignum.DivideModuloIntBignum(other)); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1232DCC", buffer); +} + + +TEST(Compare) { + Bignum bignum1; + Bignum bignum2; + bignum1.AssignUInt16(1); + bignum2.AssignUInt16(1); + CHECK_EQ(0, Bignum::Compare(bignum1, bignum2)); + CHECK(Bignum::Equal(bignum1, bignum2)); + CHECK(Bignum::LessEqual(bignum1, bignum2)); + CHECK(!Bignum::Less(bignum1, bignum2)); + + bignum1.AssignUInt16(0); + bignum2.AssignUInt16(1); + CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); + CHECK(!Bignum::Equal(bignum1, bignum2)); + CHECK(!Bignum::Equal(bignum2, bignum1)); + CHECK(Bignum::LessEqual(bignum1, bignum2)); + CHECK(!Bignum::LessEqual(bignum2, bignum1)); + CHECK(Bignum::Less(bignum1, bignum2)); + CHECK(!Bignum::Less(bignum2, bignum1)); + + AssignHexString(&bignum1, "1234567890ABCDEF12345"); + AssignHexString(&bignum2, "1234567890ABCDEF12345"); + CHECK_EQ(0, Bignum::Compare(bignum1, bignum2)); + + AssignHexString(&bignum1, "1234567890ABCDEF12345"); + AssignHexString(&bignum2, "1234567890ABCDEF12346"); + CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); + + AssignHexString(&bignum1, "1234567890ABCDEF12345"); + bignum1.ShiftLeft(500); + AssignHexString(&bignum2, "1234567890ABCDEF12345"); + bignum2.ShiftLeft(500); + CHECK_EQ(0, Bignum::Compare(bignum1, bignum2)); + + AssignHexString(&bignum1, "1234567890ABCDEF12345"); + bignum1.ShiftLeft(500); + AssignHexString(&bignum2, "1234567890ABCDEF12346"); + bignum2.ShiftLeft(500); + CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); + + bignum1.AssignUInt16(1); + bignum1.ShiftLeft(64); + AssignHexString(&bignum2, "10000000000000000"); + CHECK_EQ(0, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(0, Bignum::Compare(bignum2, bignum1)); + + bignum1.AssignUInt16(1); + bignum1.ShiftLeft(64); + AssignHexString(&bignum2, "10000000000000001"); + CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); + + bignum1.AssignUInt16(1); + bignum1.ShiftLeft(96); + AssignHexString(&bignum2, "10000000000000001"); + bignum2.ShiftLeft(32); + CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); + + AssignHexString(&bignum1, "FFFFFFFFFFFFFFFF"); + bignum2.AssignUInt16(1); + bignum2.ShiftLeft(64); + CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); + + AssignHexString(&bignum1, "FFFFFFFFFFFFFFFF"); + bignum1.ShiftLeft(32); + bignum2.AssignUInt16(1); + bignum2.ShiftLeft(96); + CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); + + AssignHexString(&bignum1, "FFFFFFFFFFFFFFFF"); + bignum1.ShiftLeft(32); + bignum2.AssignUInt16(1); + bignum2.ShiftLeft(95); + CHECK_EQ(+1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(-1, Bignum::Compare(bignum2, bignum1)); + + AssignHexString(&bignum1, "FFFFFFFFFFFFFFFF"); + bignum1.ShiftLeft(32); + bignum2.AssignUInt16(1); + bignum2.ShiftLeft(100); + CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); + + AssignHexString(&bignum1, "100000000000000"); + bignum2.AssignUInt16(1); + bignum2.ShiftLeft(14*4); + CHECK_EQ(0, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(0, Bignum::Compare(bignum2, bignum1)); + + AssignHexString(&bignum1, "100000000000001"); + bignum2.AssignUInt16(1); + bignum2.ShiftLeft(14*4); + CHECK_EQ(+1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(-1, Bignum::Compare(bignum2, bignum1)); + + AssignHexString(&bignum1, "200000000000000"); + bignum2.AssignUInt16(3); + bignum2.ShiftLeft(14*4); + CHECK_EQ(-1, Bignum::Compare(bignum1, bignum2)); + CHECK_EQ(+1, Bignum::Compare(bignum2, bignum1)); +} + + +TEST(PlusCompare) { + Bignum a; + Bignum b; + Bignum c; + a.AssignUInt16(1); + b.AssignUInt16(0); + c.AssignUInt16(1); + CHECK_EQ(0, Bignum::PlusCompare(a, b, c)); + CHECK(Bignum::PlusEqual(a, b, c)); + CHECK(Bignum::PlusLessEqual(a, b, c)); + CHECK(!Bignum::PlusLess(a, b, c)); + + a.AssignUInt16(0); + b.AssignUInt16(0); + c.AssignUInt16(1); + CHECK_EQ(-1, Bignum::PlusCompare(a, b, c)); + CHECK_EQ(+1, Bignum::PlusCompare(c, b, a)); + CHECK(!Bignum::PlusEqual(a, b, c)); + CHECK(!Bignum::PlusEqual(c, b, a)); + CHECK(Bignum::PlusLessEqual(a, b, c)); + CHECK(!Bignum::PlusLessEqual(c, b, a)); + CHECK(Bignum::PlusLess(a, b, c)); + CHECK(!Bignum::PlusLess(c, b, a)); + + AssignHexString(&a, "1234567890ABCDEF12345"); + b.AssignUInt16(1); + AssignHexString(&c, "1234567890ABCDEF12345"); + CHECK_EQ(+1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890ABCDEF12344"); + b.AssignUInt16(1); + AssignHexString(&c, "1234567890ABCDEF12345"); + CHECK_EQ(0, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4); + AssignHexString(&b, "ABCDEF12345"); + AssignHexString(&c, "1234567890ABCDEF12345"); + CHECK_EQ(0, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4); + AssignHexString(&b, "ABCDEF12344"); + AssignHexString(&c, "1234567890ABCDEF12345"); + CHECK_EQ(-1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4); + AssignHexString(&b, "ABCDEF12346"); + AssignHexString(&c, "1234567890ABCDEF12345"); + CHECK_EQ(1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567891"); + a.ShiftLeft(11*4); + AssignHexString(&b, "ABCDEF12345"); + AssignHexString(&c, "1234567890ABCDEF12345"); + CHECK_EQ(1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567889"); + a.ShiftLeft(11*4); + AssignHexString(&b, "ABCDEF12345"); + AssignHexString(&c, "1234567890ABCDEF12345"); + CHECK_EQ(-1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12345"); + b.ShiftLeft(32); + AssignHexString(&c, "1234567890ABCDEF12345"); + c.ShiftLeft(32); + CHECK_EQ(0, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12344"); + b.ShiftLeft(32); + AssignHexString(&c, "1234567890ABCDEF12345"); + c.ShiftLeft(32); + CHECK_EQ(-1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12346"); + b.ShiftLeft(32); + AssignHexString(&c, "1234567890ABCDEF12345"); + c.ShiftLeft(32); + CHECK_EQ(1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567891"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12345"); + b.ShiftLeft(32); + AssignHexString(&c, "1234567890ABCDEF12345"); + c.ShiftLeft(32); + CHECK_EQ(1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567889"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12345"); + b.ShiftLeft(32); + AssignHexString(&c, "1234567890ABCDEF12345"); + c.ShiftLeft(32); + CHECK_EQ(-1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12345"); + b.ShiftLeft(32); + AssignHexString(&c, "1234567890ABCDEF1234500000000"); + CHECK_EQ(0, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12344"); + b.ShiftLeft(32); + AssignHexString(&c, "1234567890ABCDEF1234500000000"); + CHECK_EQ(-1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12346"); + b.ShiftLeft(32); + AssignHexString(&c, "1234567890ABCDEF1234500000000"); + CHECK_EQ(1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567891"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12345"); + b.ShiftLeft(32); + AssignHexString(&c, "1234567890ABCDEF1234500000000"); + CHECK_EQ(1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567889"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12345"); + b.ShiftLeft(32); + AssignHexString(&c, "1234567890ABCDEF1234500000000"); + CHECK_EQ(-1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12345"); + AssignHexString(&c, "123456789000000000ABCDEF12345"); + CHECK_EQ(0, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12346"); + AssignHexString(&c, "123456789000000000ABCDEF12345"); + CHECK_EQ(1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12344"); + AssignHexString(&c, "123456789000000000ABCDEF12345"); + CHECK_EQ(-1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12345"); + b.ShiftLeft(16); + AssignHexString(&c, "12345678900000ABCDEF123450000"); + CHECK_EQ(0, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12344"); + b.ShiftLeft(16); + AssignHexString(&c, "12345678900000ABCDEF123450000"); + CHECK_EQ(-1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12345"); + b.ShiftLeft(16); + AssignHexString(&c, "12345678900000ABCDEF123450001"); + CHECK_EQ(-1, Bignum::PlusCompare(a, b, c)); + + AssignHexString(&a, "1234567890"); + a.ShiftLeft(11*4 + 32); + AssignHexString(&b, "ABCDEF12346"); + b.ShiftLeft(16); + AssignHexString(&c, "12345678900000ABCDEF123450000"); + CHECK_EQ(+1, Bignum::PlusCompare(a, b, c)); +} + + +TEST(Square) { + Bignum bignum; + char buffer[kBufferSize]; + + bignum.AssignUInt16(1); + bignum.Square(); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + bignum.AssignUInt16(2); + bignum.Square(); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("4", buffer); + + bignum.AssignUInt16(10); + bignum.Square(); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("64", buffer); + + AssignHexString(&bignum, "FFFFFFF"); + bignum.Square(); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFE0000001", buffer); + + AssignHexString(&bignum, "FFFFFFFFFFFFFF"); + bignum.Square(); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FFFFFFFFFFFFFE00000000000001", buffer); +} + + +TEST(AssignPowerUInt16) { + Bignum bignum; + char buffer[kBufferSize]; + + bignum.AssignPowerUInt16(1, 0); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + bignum.AssignPowerUInt16(1, 1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + bignum.AssignPowerUInt16(1, 2); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + bignum.AssignPowerUInt16(2, 0); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + bignum.AssignPowerUInt16(2, 1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("2", buffer); + + bignum.AssignPowerUInt16(2, 2); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("4", buffer); + + bignum.AssignPowerUInt16(16, 1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10", buffer); + + bignum.AssignPowerUInt16(16, 2); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("100", buffer); + + bignum.AssignPowerUInt16(16, 5); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("100000", buffer); + + bignum.AssignPowerUInt16(16, 8); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("100000000", buffer); + + bignum.AssignPowerUInt16(16, 16); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000", buffer); + + bignum.AssignPowerUInt16(16, 30); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1000000000000000000000000000000", buffer); + + bignum.AssignPowerUInt16(10, 0); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + bignum.AssignPowerUInt16(10, 1); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("A", buffer); + + bignum.AssignPowerUInt16(10, 2); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("64", buffer); + + bignum.AssignPowerUInt16(10, 5); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("186A0", buffer); + + bignum.AssignPowerUInt16(10, 8); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("5F5E100", buffer); + + bignum.AssignPowerUInt16(10, 16); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("2386F26FC10000", buffer); + + bignum.AssignPowerUInt16(10, 30); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("C9F2C9CD04674EDEA40000000", buffer); + + bignum.AssignPowerUInt16(10, 31); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("7E37BE2022C0914B2680000000", buffer); + + bignum.AssignPowerUInt16(2, 0); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + bignum.AssignPowerUInt16(2, 100); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("10000000000000000000000000", buffer); + + bignum.AssignPowerUInt16(17, 0); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1", buffer); + + bignum.AssignPowerUInt16(17, 99); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("1942BB9853FAD924A3D4DD92B89B940E0207BEF05DB9C26BC1B757" + "80BE0C5A2C2990E02A681224F34ED68558CE4C6E33760931", + buffer); + + bignum.AssignPowerUInt16(0xFFFF, 99); + CHECK(bignum.ToHexString(buffer, kBufferSize)); + CHECK_EQ("FF9D12F09B886C54E77E7439C7D2DED2D34F669654C0C2B6B8C288250" + "5A2211D0E3DC9A61831349EAE674B11D56E3049D7BD79DAAD6C9FA2BA" + "528E3A794299F2EE9146A324DAFE3E88967A0358233B543E233E575B9" + "DD4E3AA7942146426C328FF55BFD5C45E0901B1629260AF9AE2F310C5" + "50959FAF305C30116D537D80CF6EBDBC15C5694062AF1AC3D956D0A41" + "B7E1B79FF11E21D83387A1CE1F5882B31E4B5D8DE415BDBE6854466DF" + "343362267A7E8833119D31D02E18DB5B0E8F6A64B0ED0D0062FFFF", + buffer); +} diff --git a/deps/v8/test/cctest/test-debug.cc b/deps/v8/test/cctest/test-debug.cc index d59e2f5ad1..748e3e8d91 100644 --- a/deps/v8/test/cctest/test-debug.cc +++ b/deps/v8/test/cctest/test-debug.cc @@ -902,6 +902,7 @@ static void DebugEventBreak(v8::DebugEvent event, // Debug event handler which re-issues a debug break until a limit has been // reached. int max_break_point_hit_count = 0; +bool terminate_after_max_break_point_hit = false; static void DebugEventBreakMax(v8::DebugEvent event, v8::Handle<v8::Object> exec_state, v8::Handle<v8::Object> event_data, @@ -909,12 +910,17 @@ static void DebugEventBreakMax(v8::DebugEvent event, // When hitting a debug event listener there must be a break set. CHECK_NE(v8::internal::Debug::break_id(), 0); - if (event == v8::Break && break_point_hit_count < max_break_point_hit_count) { - // Count the number of breaks. - break_point_hit_count++; + if (event == v8::Break) { + if (break_point_hit_count < max_break_point_hit_count) { + // Count the number of breaks. + break_point_hit_count++; - // Set the break flag again to come back here as soon as possible. - v8::Debug::DebugBreak(); + // Set the break flag again to come back here as soon as possible. + v8::Debug::DebugBreak(); + } else if (terminate_after_max_break_point_hit) { + // Terminate execution after the last break if requested. + v8::V8::TerminateExecution(); + } } } @@ -6892,4 +6898,33 @@ TEST(DebugEventBreakData) { CheckDebuggerUnloaded(); } + +// Test that setting the terminate execution flag during debug break processing. +TEST(DebugBreakLoop) { + v8::HandleScope scope; + DebugLocalContext env; + + // Receive 100 breaks and terminate. + max_break_point_hit_count = 100; + terminate_after_max_break_point_hit = true; + + // Register a debug event listener which sets the break flag and counts. + v8::Debug::SetDebugEventListener(DebugEventBreakMax); + + // Function with infinite loop. + CompileRun("function f() { while (true) { } }"); + + // Set the debug break to enter the debugger as soon as possible. + v8::Debug::DebugBreak(); + + // Call function with infinite loop. + CompileRun("f();"); + CHECK_EQ(100, break_point_hit_count); + + // Get rid of the debug event listener. + v8::Debug::SetDebugEventListener(NULL); + CheckDebuggerUnloaded(); +} + + #endif // ENABLE_DEBUGGER_SUPPORT diff --git a/deps/v8/test/cctest/test-disasm-arm.cc b/deps/v8/test/cctest/test-disasm-arm.cc index 61f5ffc727..c375831f27 100644 --- a/deps/v8/test/cctest/test-disasm-arm.cc +++ b/deps/v8/test/cctest/test-disasm-arm.cc @@ -87,9 +87,9 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) { #define COMPARE(asm_, compare_string) \ { \ int pc_offset = assm.pc_offset(); \ - byte *pc = &buffer[pc_offset]; \ + byte *progcounter = &buffer[pc_offset]; \ assm.asm_; \ - if (!DisassembleAndCompare(pc, compare_string)) failure = true; \ + if (!DisassembleAndCompare(progcounter, compare_string)) failure = true; \ } @@ -499,6 +499,19 @@ TEST(Vfp) { "ed811b01 vstr d1, [r1 + 4*1]"); COMPARE(vstr(d15, r10, 1020), "ed8afbff vstr d15, [r10 + 4*255]"); + + COMPARE(vmsr(r5), + "eee15a10 vmsr FPSCR, r5"); + COMPARE(vmsr(r10, pl), + "5ee1aa10 vmsrpl FPSCR, r10"); + COMPARE(vmsr(pc), + "eee1fa10 vmsr FPSCR, APSR"); + COMPARE(vmrs(r5), + "eef15a10 vmrs r5, FPSCR"); + COMPARE(vmrs(r10, ge), + "aef1aa10 vmrsge r10, FPSCR"); + COMPARE(vmrs(pc), + "eef1fa10 vmrs APSR, FPSCR"); } VERIFY_RUN(); diff --git a/deps/v8/test/cctest/test-double.cc b/deps/v8/test/cctest/test-double.cc index a7a604ea43..3594a4fe32 100644 --- a/deps/v8/test/cctest/test-double.cc +++ b/deps/v8/test/cctest/test-double.cc @@ -202,3 +202,19 @@ TEST(NormalizedBoundaries) { CHECK(diy_fp.f() - boundary_minus.f() == boundary_plus.f() - diy_fp.f()); CHECK((1 << 10) == diy_fp.f() - boundary_minus.f()); // NOLINT } + + +TEST(NextDouble) { + CHECK_EQ(4e-324, Double(0.0).NextDouble()); + CHECK_EQ(0.0, Double(-0.0).NextDouble()); + CHECK_EQ(-0.0, Double(-4e-324).NextDouble()); + Double d0(-4e-324); + Double d1(d0.NextDouble()); + Double d2(d1.NextDouble()); + CHECK_EQ(-0.0, d1.value()); + CHECK_EQ(0.0, d2.value()); + CHECK_EQ(4e-324, d2.NextDouble()); + CHECK_EQ(-1.7976931348623157e308, Double(-V8_INFINITY).NextDouble()); + CHECK_EQ(V8_INFINITY, + Double(V8_2PART_UINT64_C(0x7fefffff, ffffffff)).NextDouble()); +} diff --git a/deps/v8/test/cctest/test-dtoa.cc b/deps/v8/test/cctest/test-dtoa.cc new file mode 100644 index 0000000000..ff0b660745 --- /dev/null +++ b/deps/v8/test/cctest/test-dtoa.cc @@ -0,0 +1,331 @@ +// Copyright 2010 the V8 project authors. All rights reserved. +// Redistribution and use in source and binary forms, with or without +// modification, are permitted provided that the following conditions are +// met: +// +// * Redistributions of source code must retain the above copyright +// notice, this list of conditions and the following disclaimer. +// * Redistributions in binary form must reproduce the above +// copyright notice, this list of conditions and the following +// disclaimer in the documentation and/or other materials provided +// with the distribution. +// * Neither the name of Google Inc. nor the names of its +// contributors may be used to endorse or promote products derived +// from this software without specific prior written permission. +// +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + +#include <stdlib.h> + +#include "v8.h" + +#include "dtoa.h" + +#include "cctest.h" +#include "double.h" +#include "gay-fixed.h" +#include "gay-precision.h" +#include "gay-shortest.h" +#include "platform.h" + + +using namespace v8::internal; + + +// Removes trailing '0' digits. +static void TrimRepresentation(Vector<char> representation) { + int len = strlen(representation.start()); + int i; + for (i = len - 1; i >= 0; --i) { + if (representation[i] != '0') break; + } + representation[i + 1] = '\0'; +} + + +static const int kBufferSize = 100; + + +TEST(DtoaVariousDoubles) { + char buffer_container[kBufferSize]; + Vector<char> buffer(buffer_container, kBufferSize); + int length; + int point; + int sign; + + DoubleToAscii(0.0, DTOA_SHORTEST, 0, buffer, &sign, &length, &point); + CHECK_EQ("0", buffer.start()); + CHECK_EQ(1, point); + + DoubleToAscii(0.0, DTOA_FIXED, 2, buffer, &sign, &length, &point); + CHECK_EQ(1, length); + CHECK_EQ("0", buffer.start()); + CHECK_EQ(1, point); + + DoubleToAscii(0.0, DTOA_PRECISION, 3, buffer, &sign, &length, &point); + CHECK_EQ(1, length); + CHECK_EQ("0", buffer.start()); + CHECK_EQ(1, point); + + DoubleToAscii(1.0, DTOA_SHORTEST, 0, buffer, &sign, &length, &point); + CHECK_EQ("1", buffer.start()); + CHECK_EQ(1, point); + + DoubleToAscii(1.0, DTOA_FIXED, 3, buffer, &sign, &length, &point); + CHECK_GE(3, length - point); + TrimRepresentation(buffer); + CHECK_EQ("1", buffer.start()); + CHECK_EQ(1, point); + + DoubleToAscii(1.0, DTOA_PRECISION, 3, buffer, &sign, &length, &point); + CHECK_GE(3, length); + TrimRepresentation(buffer); + CHECK_EQ("1", buffer.start()); + CHECK_EQ(1, point); + + DoubleToAscii(1.5, DTOA_SHORTEST, 0, buffer, &sign, &length, &point); + CHECK_EQ("15", buffer.start()); + CHECK_EQ(1, point); + + DoubleToAscii(1.5, DTOA_FIXED, 10, buffer, &sign, &length, &point); + CHECK_GE(10, length - point); + TrimRepresentation(buffer); + CHECK_EQ("15", buffer.start()); + CHECK_EQ(1, point); + + DoubleToAscii(1.5, DTOA_PRECISION, 10, buffer, &sign, &length, &point); + CHECK_GE(10, length); + TrimRepresentation(buffer); + CHECK_EQ("15", buffer.start()); + CHECK_EQ(1, point); + + double min_double = 5e-324; + DoubleToAscii(min_double, DTOA_SHORTEST, 0, buffer, &sign, &length, &point); + CHECK_EQ("5", buffer.start()); + CHECK_EQ(-323, point); + + DoubleToAscii(min_double, DTOA_FIXED, 5, buffer, &sign, &length, &point); + CHECK_GE(5, length - point); + TrimRepresentation(buffer); + CHECK_EQ("", buffer.start()); + CHECK_GE(-5, point); + + DoubleToAscii(min_double, DTOA_PRECISION, 5, buffer, &sign, &length, &point); + CHECK_GE(5, length); + TrimRepresentation(buffer); + CHECK_EQ("49407", buffer.start()); + CHECK_EQ(-323, point); + + double max_double = 1.7976931348623157e308; + DoubleToAscii(max_double, DTOA_SHORTEST, 0, buffer, &sign, &length, &point); + CHECK_EQ("17976931348623157", buffer.start()); + CHECK_EQ(309, point); + + DoubleToAscii(max_double, DTOA_PRECISION, 7, buffer, &sign, &length, &point); + CHECK_GE(7, length); + TrimRepresentation(buffer); + CHECK_EQ("1797693", buffer.start()); + CHECK_EQ(309, point); + + DoubleToAscii(4294967272.0, DTOA_SHORTEST, 0, buffer, &sign, &length, &point); + CHECK_EQ("4294967272", buffer.start()); + CHECK_EQ(10, point); + + DoubleToAscii(4294967272.0, DTOA_FIXED, 5, buffer, &sign, &length, &point); + CHECK_GE(5, length - point); + TrimRepresentation(buffer); + CHECK_EQ("4294967272", buffer.start()); + CHECK_EQ(10, point); + + + DoubleToAscii(4294967272.0, DTOA_PRECISION, 14, + buffer, &sign, &length, &point); + CHECK_GE(14, length); + TrimRepresentation(buffer); + CHECK_EQ("4294967272", buffer.start()); + CHECK_EQ(10, point); + + DoubleToAscii(4.1855804968213567e298, DTOA_SHORTEST, 0, + buffer, &sign, &length, &point); + CHECK_EQ("4185580496821357", buffer.start()); + CHECK_EQ(299, point); + + DoubleToAscii(4.1855804968213567e298, DTOA_PRECISION, 20, + buffer, &sign, &length, &point); + CHECK_GE(20, length); + TrimRepresentation(buffer); + CHECK_EQ("41855804968213567225", buffer.start()); + CHECK_EQ(299, point); + + DoubleToAscii(5.5626846462680035e-309, DTOA_SHORTEST, 0, + buffer, &sign, &length, &point); + CHECK_EQ("5562684646268003", buffer.start()); + CHECK_EQ(-308, point); + + DoubleToAscii(5.5626846462680035e-309, DTOA_PRECISION, 1, + buffer, &sign, &length, &point); + CHECK_GE(1, length); + TrimRepresentation(buffer); + CHECK_EQ("6", buffer.start()); + CHECK_EQ(-308, point); + + DoubleToAscii(-2147483648.0, DTOA_SHORTEST, 0, + buffer, &sign, &length, &point); + CHECK_EQ(1, sign); + CHECK_EQ("2147483648", buffer.start()); + CHECK_EQ(10, point); + + + DoubleToAscii(-2147483648.0, DTOA_FIXED, 2, buffer, &sign, &length, &point); + CHECK_GE(2, length - point); + TrimRepresentation(buffer); + CHECK_EQ(1, sign); + CHECK_EQ("2147483648", buffer.start()); + CHECK_EQ(10, point); + + DoubleToAscii(-2147483648.0, DTOA_PRECISION, 5, + buffer, &sign, &length, &point); + CHECK_GE(5, length); + TrimRepresentation(buffer); + CHECK_EQ(1, sign); + CHECK_EQ("21475", buffer.start()); + CHECK_EQ(10, point); + + DoubleToAscii(-3.5844466002796428e+298, DTOA_SHORTEST, 0, + buffer, &sign, &length, &point); + CHECK_EQ(1, sign); + CHECK_EQ("35844466002796428", buffer.start()); + CHECK_EQ(299, point); + + DoubleToAscii(-3.5844466002796428e+298, DTOA_PRECISION, 10, + buffer, &sign, &length, &point); + CHECK_EQ(1, sign); + CHECK_GE(10, length); + TrimRepresentation(buffer); + CHECK_EQ("35844466", buffer.start()); + CHECK_EQ(299, point); + + uint64_t smallest_normal64 = V8_2PART_UINT64_C(0x00100000, 00000000); + double v = Double(smallest_normal64).value(); + DoubleToAscii(v, DTOA_SHORTEST, 0, buffer, &sign, &length, &point); + CHECK_EQ("22250738585072014", buffer.start()); + CHECK_EQ(-307, point); + + DoubleToAscii(v, DTOA_PRECISION, 20, buffer, &sign, &length, &point); + CHECK_GE(20, length); + TrimRepresentation(buffer); + CHECK_EQ("22250738585072013831", buffer.start()); + CHECK_EQ(-307, point); + + uint64_t largest_denormal64 = V8_2PART_UINT64_C(0x000FFFFF, FFFFFFFF); + v = Double(largest_denormal64).value(); + DoubleToAscii(v, DTOA_SHORTEST, 0, buffer, &sign, &length, &point); + CHECK_EQ("2225073858507201", buffer.start()); + CHECK_EQ(-307, point); + + DoubleToAscii(v, DTOA_PRECISION, 20, buffer, &sign, &length, &point); + CHECK_GE(20, length); + TrimRepresentation(buffer); + CHECK_EQ("2225073858507200889", buffer.start()); + CHECK_EQ(-307, point); + + DoubleToAscii(4128420500802942e-24, DTOA_SHORTEST, 0, + buffer, &sign, &length, &point); + CHECK_EQ(0, sign); + CHECK_EQ("4128420500802942", buffer.start()); + CHECK_EQ(-8, point); + + v = -3.9292015898194142585311918e-10; + DoubleToAscii(v, DTOA_SHORTEST, 0, buffer, &sign, &length, &point); + CHECK_EQ("39292015898194143", buffer.start()); + + v = 4194304.0; + DoubleToAscii(v, DTOA_FIXED, 5, buffer, &sign, &length, &point); + CHECK_GE(5, length - point); + TrimRepresentation(buffer); + CHECK_EQ("4194304", buffer.start()); + + v = 3.3161339052167390562200598e-237; + DoubleToAscii(v, DTOA_PRECISION, 19, buffer, &sign, &length, &point); + CHECK_GE(19, length); + TrimRepresentation(buffer); + CHECK_EQ("3316133905216739056", buffer.start()); + CHECK_EQ(-236, point); +} + + +TEST(DtoaGayShortest) { + char buffer_container[kBufferSize]; + Vector<char> buffer(buffer_container, kBufferSize); + int sign; + int length; + int point; + + Vector<const PrecomputedShortest> precomputed = + PrecomputedShortestRepresentations(); + for (int i = 0; i < precomputed.length(); ++i) { + const PrecomputedShortest current_test = precomputed[i]; + double v = current_test.v; + DoubleToAscii(v, DTOA_SHORTEST, 0, buffer, &sign, &length, &point); + CHECK_EQ(0, sign); // All precomputed numbers are positive. + CHECK_EQ(current_test.decimal_point, point); + CHECK_EQ(current_test.representation, buffer.start()); + } +} + + +TEST(DtoaGayFixed) { + char buffer_container[kBufferSize]; + Vector<char> buffer(buffer_container, kBufferSize); + int sign; + int length; + int point; + + Vector<const PrecomputedFixed> precomputed = + PrecomputedFixedRepresentations(); + for (int i = 0; i < precomputed.length(); ++i) { + const PrecomputedFixed current_test = precomputed[i]; + double v = current_test.v; + int number_digits = current_test.number_digits; + DoubleToAscii(v, DTOA_FIXED, number_digits, buffer, &sign, &length, &point); + CHECK_EQ(0, sign); // All precomputed numbers are positive. + CHECK_EQ(current_test.decimal_point, point); + CHECK_GE(number_digits, length - point); + TrimRepresentation(buffer); + CHECK_EQ(current_test.representation, buffer.start()); + } +} + + +TEST(DtoaGayPrecision) { + char buffer_container[kBufferSize]; + Vector<char> buffer(buffer_container, kBufferSize); + int sign; + int length; + int point; + + Vector<const PrecomputedPrecision> precomputed = + PrecomputedPrecisionRepresentations(); + for (int i = 0; i < precomputed.length(); ++i) { + const PrecomputedPrecision current_test = precomputed[i]; + double v = current_test.v; + int number_digits = current_test.number_digits; + DoubleToAscii(v, DTOA_PRECISION, number_digits, + buffer, &sign, &length, &point); + CHECK_EQ(0, sign); // All precomputed numbers are positive. + CHECK_EQ(current_test.decimal_point, point); + CHECK_GE(number_digits, length); + TrimRepresentation(buffer); + CHECK_EQ(current_test.representation, buffer.start()); + } +} diff --git a/deps/v8/test/cctest/test-heap-profiler.cc b/deps/v8/test/cctest/test-heap-profiler.cc index b86a336160..b165190b0a 100644 --- a/deps/v8/test/cctest/test-heap-profiler.cc +++ b/deps/v8/test/cctest/test-heap-profiler.cc @@ -388,14 +388,10 @@ namespace { class NamedEntriesDetector { public: NamedEntriesDetector() - : has_A1(false), has_B1(false), has_C1(false), - has_A2(false), has_B2(false), has_C2(false) { + : has_A2(false), has_B2(false), has_C2(false) { } void Apply(i::HeapEntry** entry_ptr) { - if (IsReachableNodeWithName(*entry_ptr, "A1")) has_A1 = true; - if (IsReachableNodeWithName(*entry_ptr, "B1")) has_B1 = true; - if (IsReachableNodeWithName(*entry_ptr, "C1")) has_C1 = true; if (IsReachableNodeWithName(*entry_ptr, "A2")) has_A2 = true; if (IsReachableNodeWithName(*entry_ptr, "B2")) has_B2 = true; if (IsReachableNodeWithName(*entry_ptr, "C2")) has_C2 = true; @@ -405,9 +401,6 @@ class NamedEntriesDetector { return strcmp(name, entry->name()) == 0 && entry->painted_reachable(); } - bool has_A1; - bool has_B1; - bool has_C1; bool has_A2; bool has_B2; bool has_C2; @@ -464,21 +457,7 @@ static bool HasString(const v8::HeapGraphNode* node, const char* contents) { TEST(HeapSnapshot) { v8::HandleScope scope; - v8::Handle<v8::String> token1 = v8::String::New("token1"); - LocalContext env1; - env1->SetSecurityToken(token1); - - CompileRun( - "function A1() {}\n" - "function B1(x) { this.x = x; }\n" - "function C1(x) { this.x1 = x; this.x2 = x; }\n" - "var a1 = new A1();\n" - "var b1_1 = new B1(a1), b1_2 = new B1(a1);\n" - "var c1 = new C1(a1);"); - - v8::Handle<v8::String> token2 = v8::String::New("token2"); LocalContext env2; - env2->SetSecurityToken(token2); CompileRun( "function A2() {}\n" @@ -498,14 +477,7 @@ TEST(HeapSnapshot) { const_cast<i::HeapEntry*>( reinterpret_cast<const i::HeapEntry*>(global_env2))->PaintAllReachable(); - // Verify, that JS global object of env2 doesn't have '..1' - // properties, but has '..2' properties. - CHECK_EQ(NULL, GetProperty(global_env2, v8::HeapGraphEdge::kProperty, "a1")); - CHECK_EQ( - NULL, GetProperty(global_env2, v8::HeapGraphEdge::kProperty, "b1_1")); - CHECK_EQ( - NULL, GetProperty(global_env2, v8::HeapGraphEdge::kProperty, "b1_2")); - CHECK_EQ(NULL, GetProperty(global_env2, v8::HeapGraphEdge::kProperty, "c1")); + // Verify, that JS global object of env2 has '..2' properties. const v8::HeapGraphNode* a2_node = GetProperty(global_env2, v8::HeapGraphEdge::kProperty, "a2"); CHECK_NE(NULL, a2_node); @@ -518,9 +490,6 @@ TEST(HeapSnapshot) { // Verify that anything related to '[ABC]1' is not reachable. NamedEntriesDetector det; i_snapshot_env2->IterateEntries(&det); - CHECK(!det.has_A1); - CHECK(!det.has_B1); - CHECK(!det.has_C1); CHECK(det.has_A2); CHECK(det.has_B2); CHECK(det.has_C2); diff --git a/deps/v8/test/cctest/test-heap.cc b/deps/v8/test/cctest/test-heap.cc index 94d05555ec..fbe66ecd74 100644 --- a/deps/v8/test/cctest/test-heap.cc +++ b/deps/v8/test/cctest/test-heap.cc @@ -1095,3 +1095,32 @@ TEST(TestInternalWeakListsTraverseWithGC) { ctx[i]->Exit(); } } + + +TEST(TestSizeOfObjectsVsHeapIteratorPrecision) { + InitializeVM(); + intptr_t size_of_objects_1 = Heap::SizeOfObjects(); + HeapIterator iterator(HeapIterator::kPreciseFiltering); + intptr_t size_of_objects_2 = 0; + for (HeapObject* obj = iterator.next(); + obj != NULL; + obj = iterator.next()) { + size_of_objects_2 += obj->Size(); + } + // Delta must be within 1% of the larger result. + if (size_of_objects_1 > size_of_objects_2) { + intptr_t delta = size_of_objects_1 - size_of_objects_2; + PrintF("Heap::SizeOfObjects: %" V8_PTR_PREFIX "d, " + "Iterator: %" V8_PTR_PREFIX "d, " + "delta: %" V8_PTR_PREFIX "d\n", + size_of_objects_1, size_of_objects_2, delta); + CHECK_GT(size_of_objects_1 / 100, delta); + } else { + intptr_t delta = size_of_objects_2 - size_of_objects_1; + PrintF("Heap::SizeOfObjects: %" V8_PTR_PREFIX "d, " + "Iterator: %" V8_PTR_PREFIX "d, " + "delta: %" V8_PTR_PREFIX "d\n", + size_of_objects_1, size_of_objects_2, delta); + CHECK_GT(size_of_objects_2 / 100, delta); + } +} diff --git a/deps/v8/test/cctest/test-mark-compact.cc b/deps/v8/test/cctest/test-mark-compact.cc index ea5afecc1e..994256712f 100644 --- a/deps/v8/test/cctest/test-mark-compact.cc +++ b/deps/v8/test/cctest/test-mark-compact.cc @@ -75,7 +75,7 @@ TEST(Promotion) { // from new space. FLAG_gc_global = true; FLAG_always_compact = true; - Heap::ConfigureHeap(2*256*KB, 4*MB); + Heap::ConfigureHeap(2*256*KB, 4*MB, 4*MB); InitializeVM(); @@ -101,7 +101,7 @@ TEST(Promotion) { TEST(NoPromotion) { - Heap::ConfigureHeap(2*256*KB, 4*MB); + Heap::ConfigureHeap(2*256*KB, 4*MB, 4*MB); // Test the situation that some objects in new space are promoted to // the old space diff --git a/deps/v8/test/cctest/test-parsing.cc b/deps/v8/test/cctest/test-parsing.cc index 02503f225c..d661af6c58 100755 --- a/deps/v8/test/cctest/test-parsing.cc +++ b/deps/v8/test/cctest/test-parsing.cc @@ -26,6 +26,8 @@ // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #include <stdlib.h> +#include <stdio.h> +#include <string.h> #include "v8.h" @@ -34,7 +36,8 @@ #include "parser.h" #include "utils.h" #include "execution.h" - +#include "scanner.h" +#include "preparser.h" #include "cctest.h" namespace i = ::v8::internal; @@ -239,3 +242,89 @@ TEST(Preparsing) { i::Vector<const char*> args = pre_impl->BuildArgs(); CHECK_GT(strlen(message), 0); } + + +TEST(StandAlonePreParser) { + int marker; + i::StackGuard::SetStackLimit( + reinterpret_cast<uintptr_t>(&marker) - 128 * 1024); + + const char* programs[] = { + "{label: 42}", + "var x = 42;", + "function foo(x, y) { return x + y; }", + "native function foo(); return %ArgleBargle(glop);", + "var x = new new Function('this.x = 42');", + NULL + }; + + for (int i = 0; programs[i]; i++) { + const char* program = programs[i]; + unibrow::Utf8InputBuffer<256> stream(program, strlen(program)); + i::CompleteParserRecorder log; + i::Scanner scanner; + scanner.Initialize(i::Handle<i::String>::null(), &stream, i::JAVASCRIPT); + v8::preparser::PreParser<i::Scanner, i::CompleteParserRecorder> preparser; + bool result = preparser.PreParseProgram(&scanner, &log, true); + CHECK(result); + i::ScriptDataImpl data(log.ExtractData()); + CHECK(!data.has_error()); + } +} + + +TEST(RegressChromium62639) { + int marker; + i::StackGuard::SetStackLimit( + reinterpret_cast<uintptr_t>(&marker) - 128 * 1024); + + const char* program = "var x = 'something';\n" + "escape: function() {}"; + // Fails parsing expecting an identifier after "function". + // Before fix, didn't check *ok after Expect(Token::Identifier, ok), + // and then used the invalid currently scanned literal. This always + // failed in debug mode, and sometimes crashed in release mode. + + unibrow::Utf8InputBuffer<256> stream(program, strlen(program)); + i::ScriptDataImpl* data = + i::ParserApi::PreParse(i::Handle<i::String>::null(), &stream, NULL); + CHECK(data->HasError()); + delete data; +} + + +TEST(Regress928) { + // Preparsing didn't consider the catch clause of a try statement + // as with-content, which made it assume that a function inside + // the block could be lazily compiled, and an extra, unexpected, + // entry was added to the data. + int marker; + i::StackGuard::SetStackLimit( + reinterpret_cast<uintptr_t>(&marker) - 128 * 1024); + + const char* program = + "try { } catch (e) { var foo = function () { /* first */ } }" + "var bar = function () { /* second */ }"; + + unibrow::Utf8InputBuffer<256> stream(program, strlen(program)); + i::ScriptDataImpl* data = + i::ParserApi::PartialPreParse(i::Handle<i::String>::null(), + &stream, NULL); + CHECK(!data->HasError()); + + data->Initialize(); + + int first_function = strstr(program, "function") - program; + int first_lbrace = first_function + strlen("function () "); + CHECK_EQ('{', program[first_lbrace]); + i::FunctionEntry entry1 = data->GetFunctionEntry(first_lbrace); + CHECK(!entry1.is_valid()); + + int second_function = strstr(program + first_lbrace, "function") - program; + int second_lbrace = second_function + strlen("function () "); + CHECK_EQ('{', program[second_lbrace]); + i::FunctionEntry entry2 = data->GetFunctionEntry(second_lbrace); + CHECK(entry2.is_valid()); + CHECK_EQ('}', program[entry2.end_pos() - 1]); + delete data; +} diff --git a/deps/v8/test/cctest/test-spaces.cc b/deps/v8/test/cctest/test-spaces.cc index 06f1bfaca2..b399a4ef18 100644 --- a/deps/v8/test/cctest/test-spaces.cc +++ b/deps/v8/test/cctest/test-spaces.cc @@ -91,7 +91,7 @@ TEST(Page) { TEST(MemoryAllocator) { CHECK(Heap::ConfigureHeapDefault()); - CHECK(MemoryAllocator::Setup(Heap::MaxReserved())); + CHECK(MemoryAllocator::Setup(Heap::MaxReserved(), Heap::MaxExecutableSize())); OldSpace faked_space(Heap::MaxReserved(), OLD_POINTER_SPACE, NOT_EXECUTABLE); int total_pages = 0; @@ -147,7 +147,7 @@ TEST(MemoryAllocator) { TEST(NewSpace) { CHECK(Heap::ConfigureHeapDefault()); - CHECK(MemoryAllocator::Setup(Heap::MaxReserved())); + CHECK(MemoryAllocator::Setup(Heap::MaxReserved(), Heap::MaxExecutableSize())); NewSpace new_space; @@ -172,7 +172,7 @@ TEST(NewSpace) { TEST(OldSpace) { CHECK(Heap::ConfigureHeapDefault()); - CHECK(MemoryAllocator::Setup(Heap::MaxReserved())); + CHECK(MemoryAllocator::Setup(Heap::MaxReserved(), Heap::MaxExecutableSize())); OldSpace* s = new OldSpace(Heap::MaxOldGenerationSize(), OLD_POINTER_SPACE, diff --git a/deps/v8/test/cctest/test-strtod.cc b/deps/v8/test/cctest/test-strtod.cc index 56b26ea1eb..f5547dbc03 100644 --- a/deps/v8/test/cctest/test-strtod.cc +++ b/deps/v8/test/cctest/test-strtod.cc @@ -4,7 +4,10 @@ #include "v8.h" +#include "bignum.h" #include "cctest.h" +#include "diy-fp.h" +#include "double.h" #include "strtod.h" using namespace v8::internal; @@ -202,11 +205,14 @@ TEST(Strtod) { CHECK_EQ(1.7976931348623158E+308, StrtodChar("17976931348623158", 292)); CHECK_EQ(V8_INFINITY, StrtodChar("17976931348623159", 292)); - // The following number is the result of 89255.0/1e-22. Both floating-point + // The following number is the result of 89255.0/1e22. Both floating-point // numbers can be accurately represented with doubles. However on Linux,x86 // the floating-point stack is set to 80bits and the double-rounding // introduces an error. CHECK_EQ(89255e-22, StrtodChar("89255", -22)); + + // Some random values. + CHECK_EQ(358416272e-33, StrtodChar("358416272", -33)); CHECK_EQ(104110013277974872254e-225, StrtodChar("104110013277974872254", -225)); @@ -252,4 +258,177 @@ TEST(Strtod) { StrtodChar("1234567890123456789052345", 114)); CHECK_EQ(1234567890123456789052345e115, StrtodChar("1234567890123456789052345", 115)); + + CHECK_EQ(5.445618932859895e-255, + StrtodChar("5445618932859895362967233318697132813618813095743952975" + "4392982234069699615600475529427176366709107287468930197" + "8628345413991790019316974825934906752493984055268219809" + "5012176093045431437495773903922425632551857520884625114" + "6241265881735209066709685420744388526014389929047617597" + "0302268848374508109029268898695825171158085457567481507" + "4162979705098246243690189880319928315307816832576838178" + "2563074014542859888710209237525873301724479666744537857" + "9026553346649664045621387124193095870305991178772256504" + "4368663670643970181259143319016472430928902201239474588" + "1392338901353291306607057623202353588698746085415097902" + "6640064319118728664842287477491068264828851624402189317" + "2769161449825765517353755844373640588822904791244190695" + "2998382932630754670573838138825217065450843010498555058" + "88186560731", -1035)); + + // Boundary cases. Boundaries themselves should round to even. + // + // 0x1FFFFFFFFFFFF * 2^3 = 72057594037927928 + // next: 72057594037927936 + // boundary: 72057594037927932 should round up. + CHECK_EQ(72057594037927928.0, StrtodChar("72057594037927928", 0)); + CHECK_EQ(72057594037927936.0, StrtodChar("72057594037927936", 0)); + CHECK_EQ(72057594037927936.0, StrtodChar("72057594037927932", 0)); + CHECK_EQ(72057594037927928.0, StrtodChar("7205759403792793199999", -5)); + CHECK_EQ(72057594037927936.0, StrtodChar("7205759403792793200001", -5)); + + // 0x1FFFFFFFFFFFF * 2^10 = 9223372036854774784 + // next: 9223372036854775808 + // boundary: 9223372036854775296 should round up. + CHECK_EQ(9223372036854774784.0, StrtodChar("9223372036854774784", 0)); + CHECK_EQ(9223372036854775808.0, StrtodChar("9223372036854775808", 0)); + CHECK_EQ(9223372036854775808.0, StrtodChar("9223372036854775296", 0)); + CHECK_EQ(9223372036854774784.0, StrtodChar("922337203685477529599999", -5)); + CHECK_EQ(9223372036854775808.0, StrtodChar("922337203685477529600001", -5)); + + // 0x1FFFFFFFFFFFF * 2^50 = 10141204801825834086073718800384 + // next: 10141204801825835211973625643008 + // boundary: 10141204801825834649023672221696 should round up. + CHECK_EQ(10141204801825834086073718800384.0, + StrtodChar("10141204801825834086073718800384", 0)); + CHECK_EQ(10141204801825835211973625643008.0, + StrtodChar("10141204801825835211973625643008", 0)); + CHECK_EQ(10141204801825835211973625643008.0, + StrtodChar("10141204801825834649023672221696", 0)); + CHECK_EQ(10141204801825834086073718800384.0, + StrtodChar("1014120480182583464902367222169599999", -5)); + CHECK_EQ(10141204801825835211973625643008.0, + StrtodChar("1014120480182583464902367222169600001", -5)); + + // 0x1FFFFFFFFFFFF * 2^99 = 5708990770823838890407843763683279797179383808 + // next: 5708990770823839524233143877797980545530986496 + // boundary: 5708990770823839207320493820740630171355185152 + // The boundary should round up. + CHECK_EQ(5708990770823838890407843763683279797179383808.0, + StrtodChar("5708990770823838890407843763683279797179383808", 0)); + CHECK_EQ(5708990770823839524233143877797980545530986496.0, + StrtodChar("5708990770823839524233143877797980545530986496", 0)); + CHECK_EQ(5708990770823839524233143877797980545530986496.0, + StrtodChar("5708990770823839207320493820740630171355185152", 0)); + CHECK_EQ(5708990770823838890407843763683279797179383808.0, + StrtodChar("5708990770823839207320493820740630171355185151999", -3)); + CHECK_EQ(5708990770823839524233143877797980545530986496.0, + StrtodChar("5708990770823839207320493820740630171355185152001", -3)); +} + + +static int CompareBignumToDiyFp(const Bignum& bignum_digits, + int bignum_exponent, + DiyFp diy_fp) { + Bignum bignum; + bignum.AssignBignum(bignum_digits); + Bignum other; + other.AssignUInt64(diy_fp.f()); + if (bignum_exponent >= 0) { + bignum.MultiplyByPowerOfTen(bignum_exponent); + } else { + other.MultiplyByPowerOfTen(-bignum_exponent); + } + if (diy_fp.e() >= 0) { + other.ShiftLeft(diy_fp.e()); + } else { + bignum.ShiftLeft(-diy_fp.e()); + } + return Bignum::Compare(bignum, other); +} + + +static bool CheckDouble(Vector<const char> buffer, + int exponent, + double to_check) { + DiyFp lower_boundary; + DiyFp upper_boundary; + Bignum input_digits; + input_digits.AssignDecimalString(buffer); + if (to_check == 0.0) { + const double kMinDouble = 4e-324; + // Check that the buffer*10^exponent < (0 + kMinDouble)/2. + Double d(kMinDouble); + d.NormalizedBoundaries(&lower_boundary, &upper_boundary); + return CompareBignumToDiyFp(input_digits, exponent, lower_boundary) <= 0; + } + if (to_check == V8_INFINITY) { + const double kMaxDouble = 1.7976931348623157e308; + // Check that the buffer*10^exponent >= boundary between kMaxDouble and inf. + Double d(kMaxDouble); + d.NormalizedBoundaries(&lower_boundary, &upper_boundary); + return CompareBignumToDiyFp(input_digits, exponent, upper_boundary) >= 0; + } + Double d(to_check); + d.NormalizedBoundaries(&lower_boundary, &upper_boundary); + if ((d.Significand() & 1) == 0) { + return CompareBignumToDiyFp(input_digits, exponent, lower_boundary) >= 0 && + CompareBignumToDiyFp(input_digits, exponent, upper_boundary) <= 0; + } else { + return CompareBignumToDiyFp(input_digits, exponent, lower_boundary) > 0 && + CompareBignumToDiyFp(input_digits, exponent, upper_boundary) < 0; + } +} + + +// Copied from v8.cc and adapted to make the function deterministic. +static uint32_t DeterministicRandom() { + // Random number generator using George Marsaglia's MWC algorithm. + static uint32_t hi = 0; + static uint32_t lo = 0; + + // Initialization values don't have any special meaning. (They are the result + // of two calls to random().) + if (hi == 0) hi = 0xbfe166e7; + if (lo == 0) lo = 0x64d1c3c9; + + // Mix the bits. + hi = 36969 * (hi & 0xFFFF) + (hi >> 16); + lo = 18273 * (lo & 0xFFFF) + (lo >> 16); + return (hi << 16) + (lo & 0xFFFF); +} + + +static const int kBufferSize = 1024; +static const int kShortStrtodRandomCount = 2; +static const int kLargeStrtodRandomCount = 2; + +TEST(RandomStrtod) { + char buffer[kBufferSize]; + for (int length = 1; length < 15; length++) { + for (int i = 0; i < kShortStrtodRandomCount; ++i) { + int pos = 0; + for (int j = 0; j < length; ++j) { + buffer[pos++] = random() % 10 + '0'; + } + int exponent = DeterministicRandom() % (25*2 + 1) - 25 - length; + buffer[pos] = '\0'; + Vector<const char> vector(buffer, pos); + double strtod_result = Strtod(vector, exponent); + CHECK(CheckDouble(vector, exponent, strtod_result)); + } + } + for (int length = 15; length < 800; length += 2) { + for (int i = 0; i < kLargeStrtodRandomCount; ++i) { + int pos = 0; + for (int j = 0; j < length; ++j) { + buffer[pos++] = random() % 10 + '0'; + } + int exponent = DeterministicRandom() % (308*2 + 1) - 308 - length; + buffer[pos] = '\0'; + Vector<const char> vector(buffer, pos); + double strtod_result = Strtod(vector, exponent); + CHECK(CheckDouble(vector, exponent, strtod_result)); + } + } } diff --git a/deps/v8/test/mjsunit/regress/regress-918.js b/deps/v8/test/mjsunit/regress/regress-918.js new file mode 100644 index 0000000000..4b6ddbacf8 --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-918.js @@ -0,0 +1,33 @@ +// Copyright 2010 the V8 project authors. All rights reserved. +// Redistribution and use in source and binary forms, with or without +// modification, are permitted provided that the following conditions are +// met: +// +// * Redistributions of source code must retain the above copyright +// notice, this list of conditions and the following disclaimer. +// * Redistributions in binary form must reproduce the above +// copyright notice, this list of conditions and the following +// disclaimer in the documentation and/or other materials provided +// with the distribution. +// * Neither the name of Google Inc. nor the names of its +// contributors may be used to endorse or promote products derived +// from this software without specific prior written permission. +// +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + +// Parser should not accept parentheses around labels. +// See http://code.google.com/p/v8/issues/detail?id=918 + +// The label was parsed as an expression and then tested for being a +// single identifier. This threw away the parentheses. +assertThrows("(label):42;"); diff --git a/deps/v8/test/mjsunit/regress/regress-927.js b/deps/v8/test/mjsunit/regress/regress-927.js new file mode 100644 index 0000000000..c671f7d480 --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-927.js @@ -0,0 +1,33 @@ +// Copyright 2010 the V8 project authors. All rights reserved. +// Redistribution and use in source and binary forms, with or without +// modification, are permitted provided that the following conditions are +// met: +// +// * Redistributions of source code must retain the above copyright +// notice, this list of conditions and the following disclaimer. +// * Redistributions in binary form must reproduce the above +// copyright notice, this list of conditions and the following +// disclaimer in the documentation and/or other materials provided +// with the distribution. +// * Neither the name of Google Inc. nor the names of its +// contributors may be used to endorse or promote products derived +// from this software without specific prior written permission. +// +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + +function a1() { + var a2 = -1756315459; + return ((((a2 & a2) ^ 1) * a2) << -10); +} + +assertEquals(a1(), -2147483648); diff --git a/deps/v8/test/mjsunit/regress/regress-931.js b/deps/v8/test/mjsunit/regress/regress-931.js new file mode 100644 index 0000000000..d2fb8cc2b7 --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-931.js @@ -0,0 +1,48 @@ +// Copyright 2009 the V8 project authors. All rights reserved. +// Redistribution and use in source and binary forms, with or without +// modification, are permitted provided that the following conditions are +// met: +// +// * Redistributions of source code must retain the above copyright +// notice, this list of conditions and the following disclaimer. +// * Redistributions in binary form must reproduce the above +// copyright notice, this list of conditions and the following +// disclaimer in the documentation and/or other materials provided +// with the distribution. +// * Neither the name of Google Inc. nor the names of its +// contributors may be used to endorse or promote products derived +// from this software without specific prior written permission. +// +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + +// See http://code.google.com/p/v8/issues/detail?id=931. + +var sequence = ''; + +var o = { f: function (x, y) { return x + y; }, + 2: function (x, y) { return x - y} }; + +function first() { sequence += "1"; return o; } +function second() { sequence += "2"; return "f"; } +function third() { sequence += "3"; return 3; } +function fourth() { sequence += "4"; return 4; } + +var result = (first()[second()](third(), fourth())) +assertEquals(7, result); +assertEquals("1234", sequence); + +function second_prime() { sequence += "2'"; return 2; } + +var result = (first()[second_prime()](third(), fourth())) +assertEquals(-1, result); +assertEquals("123412'34", sequence); diff --git a/deps/v8/test/mjsunit/regress/regress-conditional-position.js b/deps/v8/test/mjsunit/regress/regress-conditional-position.js new file mode 100644 index 0000000000..cd8f7bd745 --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-conditional-position.js @@ -0,0 +1,95 @@ +// Copyright 2010 the V8 project authors. All rights reserved. +// Redistribution and use in source and binary forms, with or without +// modification, are permitted provided that the following conditions are +// met: +// +// * Redistributions of source code must retain the above copyright +// notice, this list of conditions and the following disclaimer. +// * Redistributions in binary form must reproduce the above +// copyright notice, this list of conditions and the following +// disclaimer in the documentation and/or other materials provided +// with the distribution. +// * Neither the name of Google Inc. nor the names of its +// contributors may be used to endorse or promote products derived +// from this software without specific prior written permission. +// +// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS +// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT +// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR +// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT +// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, +// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT +// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, +// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY +// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT +// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE +// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + +// Flags: --always-full-compiler + +var functionToCatch; +var lineNumber; + +function catchLineNumber () { + var x = {}; + + Error.prepareStackTrace = function (error, stackTrace) { + stackTrace.some(function (frame) { + if (frame.getFunction() == functionToCatch) { + lineNumber = frame.getLineNumber(); + return true; + } + return false; + }); + return lineNumber; + }; + + Error.captureStackTrace(x); + return x.stack; +} + +function log() { + catchLineNumber(); +} + +function foo() {} + +function test1() { + log(foo() == foo() + ? 'a' + : 'b'); +} + +function test2() { + var o = { foo: function () {}} + log(o.foo() == o.foo() + ? 'a' + : 'b'); +} + +function test3() { + var o = { log: log, foo: function() { } }; + o.log(o.foo() == o.foo() + ? 'a' + : 'b'); + +} + +function test(f, expectedLineNumber) { + functionToCatch = f; + f(); + + assertEquals(expectedLineNumber, lineNumber); +} + +test(test1, 58); +test(test2, 65); +test(test3, 72); + +eval(test1.toString() + "//@ sourceUrl=foo"); +eval(test2.toString() + "//@ sourceUrl=foo"); +eval(test3.toString() + "//@ sourceUrl=foo"); + +test(test1, 2); +test(test2, 3); +test(test3, 3); diff --git a/deps/v8/test/mjsunit/string-split.js b/deps/v8/test/mjsunit/string-split.js index 59d3ad3ee3..c741f6a3e5 100644 --- a/deps/v8/test/mjsunit/string-split.js +++ b/deps/v8/test/mjsunit/string-split.js @@ -27,76 +27,45 @@ expected = ["A", undefined, "B", "bold", "/", "B", "and", undefined, "CODE", "coded", "/", "CODE", ""]; result = "A<B>bold</B>and<CODE>coded</CODE>".split(/<(\/)?([^<>]+)>/); -assertArrayEquals(expected, result, 1); +assertArrayEquals(expected, result); -expected = ["a", "b"]; -result = "ab".split(/a*?/); -assertArrayEquals(expected, result, 2); -expected = ["", "b"]; -result = "ab".split(/a*/); -assertArrayEquals(expected, result, 3); +assertArrayEquals(["a", "b"], "ab".split(/a*?/)); -expected = ["a"]; -result = "ab".split(/a*?/, 1); -assertArrayEquals(expected, result, 4); +assertArrayEquals(["", "b"], "ab".split(/a*/)); -expected = [""]; -result = "ab".split(/a*/, 1); -assertArrayEquals(expected, result, 5); +assertArrayEquals(["a"], "ab".split(/a*?/, 1)); -expected = ["as","fas","fas","f"]; -result = "asdfasdfasdf".split("d"); -assertArrayEquals(expected, result, 6); +assertArrayEquals([""], "ab".split(/a*/, 1)); -expected = ["as","fas","fas","f"]; -result = "asdfasdfasdf".split("d", -1); -assertArrayEquals(expected, result, 7); +assertArrayEquals(["as","fas","fas","f"], "asdfasdfasdf".split("d")); -expected = ["as", "fas"]; -result = "asdfasdfasdf".split("d", 2); -assertArrayEquals(expected, result, 8); +assertArrayEquals(["as","fas","fas","f"], "asdfasdfasdf".split("d", -1)); -expected = []; -result = "asdfasdfasdf".split("d", 0); -assertArrayEquals(expected, result, 9); +assertArrayEquals(["as", "fas"], "asdfasdfasdf".split("d", 2)); -expected = ["as","fas","fas",""]; -result = "asdfasdfasd".split("d"); -assertArrayEquals(expected, result, 10); +assertArrayEquals([], "asdfasdfasdf".split("d", 0)); -expected = []; -result = "".split(""); -assertArrayEquals(expected, result, 11); +assertArrayEquals(["as","fas","fas",""], "asdfasdfasd".split("d")); -expected = [""] -result = "".split("a"); -assertArrayEquals(expected, result, 12); +assertArrayEquals([], "".split("")); -expected = ["a","b"] -result = "axxb".split(/x*/); -assertArrayEquals(expected, result, 13); +assertArrayEquals([""], "".split("a")); -expected = ["a","b"] -result = "axxb".split(/x+/); -assertArrayEquals(expected, result, 14); +assertArrayEquals(["a","b"], "axxb".split(/x*/)); -expected = ["a","","b"] -result = "axxb".split(/x/); -assertArrayEquals(expected, result, 15); +assertArrayEquals(["a","b"], "axxb".split(/x+/)); + +assertArrayEquals(["a","","b"], "axxb".split(/x/)); // This was http://b/issue?id=1151354 -expected = ["div", "#id", ".class"] -result = "div#id.class".split(/(?=[#.])/); -assertArrayEquals(expected, result, 16); +assertArrayEquals(["div", "#id", ".class"], "div#id.class".split(/(?=[#.])/)); + -expected = ["div", "#i", "d", ".class"] -result = "div#id.class".split(/(?=[d#.])/); -assertArrayEquals(expected, result, 17); +assertArrayEquals(["div", "#i", "d", ".class"], "div#id.class".split(/(?=[d#.])/)); + +assertArrayEquals(["a", "b", "c"], "abc".split(/(?=.)/)); -expected = ["a", "b", "c"] -result = "abc".split(/(?=.)/); -assertArrayEquals(expected, result, 18); /* "ab".split(/((?=.))/) * @@ -108,19 +77,23 @@ assertArrayEquals(expected, result, 18); * * Opera seems to have this right. The others make no sense. */ -expected = ["a", "", "b"] -result = "ab".split(/((?=.))/); -assertArrayEquals(expected, result, 19); +assertArrayEquals(["a", "", "b"], "ab".split(/((?=.))/)); /* "ab".split(/(?=)/) * * KJS: a,b * SM: ab * IE: a,b - * Opera: a,b + * Opera: a,bb * V8: a,b */ -expected = ["a", "b"] -result = "ab".split(/(?=)/); -assertArrayEquals(expected, result, 20); +assertArrayEquals(["a", "b"], "ab".split(/(?=)/)); + +// For issue http://code.google.com/p/v8/issues/detail?id=924 +// Splitting the empty string is a special case. +assertEquals([""], ''.split()); +assertEquals([""], ''.split(/./)); +assertEquals([], ''.split(/.?/)); +assertEquals([], ''.split(/.??/)); +assertEquals([], ''.split(/()()/)); |