diff options
Diffstat (limited to 'deps/v8/test')
24 files changed, 1346 insertions, 114 deletions
diff --git a/deps/v8/test/cctest/cctest.status b/deps/v8/test/cctest/cctest.status index 2de0afba1..af28be19d 100644 --- a/deps/v8/test/cctest/cctest.status +++ b/deps/v8/test/cctest/cctest.status @@ -84,10 +84,6 @@ test-debug/DebugBreakLoop: SKIP ############################################################################## -[ $arch == mips ] -test-serialize: SKIP - -############################################################################## [ $arch == mips && $crankshaft ] # Tests that time out with crankshaft. diff --git a/deps/v8/test/cctest/test-api.cc b/deps/v8/test/cctest/test-api.cc index 5137c6563..b1a23c1ef 100644 --- a/deps/v8/test/cctest/test-api.cc +++ b/deps/v8/test/cctest/test-api.cc @@ -5526,6 +5526,17 @@ static int StrNCmp16(uint16_t* a, uint16_t* b, int n) { } +int GetUtf8Length(Handle<String> str) { + int len = str->Utf8Length(); + if (len < 0) { + i::Handle<i::String> istr(v8::Utils::OpenHandle(*str)); + i::FlattenString(istr); + len = str->Utf8Length(); + } + return len; +} + + THREADED_TEST(StringWrite) { LocalContext context; v8::HandleScope scope; @@ -5606,7 +5617,7 @@ THREADED_TEST(StringWrite) { CHECK_EQ(0, strncmp(utf8buf, "ab\1", 3)); memset(utf8buf, 0x1, sizeof(utf8buf)); - len = left_tree->Utf8Length(); + len = GetUtf8Length(left_tree); int utf8_expected = (0x80 + (0x800 - 0x80) * 2 + (0xd800 - 0x800) * 3) / kStride; CHECK_EQ(utf8_expected, len); @@ -5620,7 +5631,7 @@ THREADED_TEST(StringWrite) { CHECK_EQ(1, utf8buf[utf8_expected]); memset(utf8buf, 0x1, sizeof(utf8buf)); - len = right_tree->Utf8Length(); + len = GetUtf8Length(right_tree); CHECK_EQ(utf8_expected, len); len = right_tree->WriteUtf8(utf8buf, utf8_expected, &charlen); CHECK_EQ(utf8_expected, len); @@ -5745,6 +5756,225 @@ THREADED_TEST(StringWrite) { } +static void Utf16Helper( + LocalContext& context, + const char* name, + const char* lengths_name, + int len) { + Local<v8::Array> a = + Local<v8::Array>::Cast(context->Global()->Get(v8_str(name))); + Local<v8::Array> alens = + Local<v8::Array>::Cast(context->Global()->Get(v8_str(lengths_name))); + for (int i = 0; i < len; i++) { + Local<v8::String> string = + Local<v8::String>::Cast(a->Get(i)); + Local<v8::Number> expected_len = + Local<v8::Number>::Cast(alens->Get(i)); + CHECK_EQ(expected_len->Value() != string->Length(), + string->MayContainNonAscii()); + int length = GetUtf8Length(string); + CHECK_EQ(static_cast<int>(expected_len->Value()), length); + } +} + + +static uint16_t StringGet(Handle<String> str, int index) { + i::Handle<i::String> istring = + v8::Utils::OpenHandle(String::Cast(*str)); + return istring->Get(index); +} + + +static void WriteUtf8Helper( + LocalContext& context, + const char* name, + const char* lengths_name, + int len) { + Local<v8::Array> b = + Local<v8::Array>::Cast(context->Global()->Get(v8_str(name))); + Local<v8::Array> alens = + Local<v8::Array>::Cast(context->Global()->Get(v8_str(lengths_name))); + char buffer[1000]; + char buffer2[1000]; + for (int i = 0; i < len; i++) { + Local<v8::String> string = + Local<v8::String>::Cast(b->Get(i)); + Local<v8::Number> expected_len = + Local<v8::Number>::Cast(alens->Get(i)); + int utf8_length = static_cast<int>(expected_len->Value()); + for (int j = utf8_length + 1; j >= 0; j--) { + memset(reinterpret_cast<void*>(&buffer), 42, sizeof(buffer)); + memset(reinterpret_cast<void*>(&buffer2), 42, sizeof(buffer2)); + int nchars; + int utf8_written = + string->WriteUtf8(buffer, j, &nchars, String::NO_OPTIONS); + int utf8_written2 = + string->WriteUtf8(buffer2, j, &nchars, String::NO_NULL_TERMINATION); + CHECK_GE(utf8_length + 1, utf8_written); + CHECK_GE(utf8_length, utf8_written2); + for (int k = 0; k < utf8_written2; k++) { + CHECK_EQ(buffer[k], buffer2[k]); + } + CHECK(nchars * 3 >= utf8_written - 1); + CHECK(nchars <= utf8_written); + if (j == utf8_length + 1) { + CHECK_EQ(utf8_written2, utf8_length); + CHECK_EQ(utf8_written2 + 1, utf8_written); + } + CHECK_EQ(buffer[utf8_written], 42); + if (j > utf8_length) { + if (utf8_written != 0) CHECK_EQ(buffer[utf8_written - 1], 0); + if (utf8_written > 1) CHECK_NE(buffer[utf8_written - 2], 42); + Handle<String> roundtrip = v8_str(buffer); + CHECK(roundtrip->Equals(string)); + } else { + if (utf8_written != 0) CHECK_NE(buffer[utf8_written - 1], 42); + } + if (utf8_written2 != 0) CHECK_NE(buffer[utf8_written - 1], 42); + if (nchars >= 2) { + uint16_t trail = StringGet(string, nchars - 1); + uint16_t lead = StringGet(string, nchars - 2); + if (((lead & 0xfc00) == 0xd800) && + ((trail & 0xfc00) == 0xdc00)) { + unsigned char u1 = buffer2[utf8_written2 - 4]; + unsigned char u2 = buffer2[utf8_written2 - 3]; + unsigned char u3 = buffer2[utf8_written2 - 2]; + unsigned char u4 = buffer2[utf8_written2 - 1]; + CHECK_EQ((u1 & 0xf8), 0xf0); + CHECK_EQ((u2 & 0xc0), 0x80); + CHECK_EQ((u3 & 0xc0), 0x80); + CHECK_EQ((u4 & 0xc0), 0x80); + uint32_t c = 0x10000 + ((lead & 0x3ff) << 10) + (trail & 0x3ff); + CHECK_EQ((u4 & 0x3f), (c & 0x3f)); + CHECK_EQ((u3 & 0x3f), ((c >> 6) & 0x3f)); + CHECK_EQ((u2 & 0x3f), ((c >> 12) & 0x3f)); + CHECK_EQ((u1 & 0x3), c >> 18); + } + } + } + } +} + + +THREADED_TEST(Utf16) { + LocalContext context; + v8::HandleScope scope; + CompileRun( + "var pad = '01234567890123456789';" + "var p = [];" + "var plens = [20, 3, 3];" + "p.push('01234567890123456789');" + "var lead = 0xd800;" + "var trail = 0xdc00;" + "p.push(String.fromCharCode(0xd800));" + "p.push(String.fromCharCode(0xdc00));" + "var a = [];" + "var b = [];" + "var c = [];" + "var alens = [];" + "for (var i = 0; i < 3; i++) {" + " p[1] = String.fromCharCode(lead++);" + " for (var j = 0; j < 3; j++) {" + " p[2] = String.fromCharCode(trail++);" + " a.push(p[i] + p[j]);" + " b.push(p[i] + p[j]);" + " c.push(p[i] + p[j]);" + " alens.push(plens[i] + plens[j]);" + " }" + "}" + "alens[5] -= 2;" // Here the surrogate pairs match up. + "var a2 = [];" + "var b2 = [];" + "var c2 = [];" + "var a2lens = [];" + "for (var m = 0; m < 9; m++) {" + " for (var n = 0; n < 9; n++) {" + " a2.push(a[m] + a[n]);" + " b2.push(b[m] + b[n]);" + " var newc = 'x' + c[m] + c[n] + 'y';" + " c2.push(newc.substring(1, newc.length - 1));" + " var utf = alens[m] + alens[n];" // And here. + // The 'n's that start with 0xdc.. are 6-8 + // The 'm's that end with 0xd8.. are 1, 4 and 7 + " if ((m % 3) == 1 && n >= 6) utf -= 2;" + " a2lens.push(utf);" + " }" + "}"); + Utf16Helper(context, "a", "alens", 9); + Utf16Helper(context, "a2", "a2lens", 81); + WriteUtf8Helper(context, "b", "alens", 9); + WriteUtf8Helper(context, "b2", "a2lens", 81); + WriteUtf8Helper(context, "c2", "a2lens", 81); +} + + +static bool SameSymbol(Handle<String> s1, Handle<String> s2) { + i::Handle<i::String> is1(v8::Utils::OpenHandle(*s1)); + i::Handle<i::String> is2(v8::Utils::OpenHandle(*s2)); + return *is1 == *is2; +} + + +static void SameSymbolHelper(const char* a, const char* b) { + Handle<String> symbol1 = v8::String::NewSymbol(a); + Handle<String> symbol2 = v8::String::NewSymbol(b); + CHECK(SameSymbol(symbol1, symbol2)); +} + + +THREADED_TEST(Utf16Symbol) { + LocalContext context; + v8::HandleScope scope; + + Handle<String> symbol1 = v8::String::NewSymbol("abc"); + Handle<String> symbol2 = v8::String::NewSymbol("abc"); + CHECK(SameSymbol(symbol1, symbol2)); + + SameSymbolHelper("\360\220\220\205", // 4 byte encoding. + "\355\240\201\355\260\205"); // 2 3-byte surrogates. + SameSymbolHelper("\355\240\201\355\260\206", // 2 3-byte surrogates. + "\360\220\220\206"); // 4 byte encoding. + SameSymbolHelper("x\360\220\220\205", // 4 byte encoding. + "x\355\240\201\355\260\205"); // 2 3-byte surrogates. + SameSymbolHelper("x\355\240\201\355\260\206", // 2 3-byte surrogates. + "x\360\220\220\206"); // 4 byte encoding. + CompileRun( + "var sym0 = 'benedictus';" + "var sym0b = 'S\303\270ren';" + "var sym1 = '\355\240\201\355\260\207';" + "var sym2 = '\360\220\220\210';" + "var sym3 = 'x\355\240\201\355\260\207';" + "var sym4 = 'x\360\220\220\210';" + "if (sym1.length != 2) throw sym1;" + "if (sym1.charCodeAt(1) != 0xdc07) throw sym1.charCodeAt(1);" + "if (sym2.length != 2) throw sym2;" + "if (sym2.charCodeAt(1) != 0xdc08) throw sym2.charCodeAt(2);" + "if (sym3.length != 3) throw sym3;" + "if (sym3.charCodeAt(2) != 0xdc07) throw sym1.charCodeAt(2);" + "if (sym4.length != 3) throw sym4;" + "if (sym4.charCodeAt(2) != 0xdc08) throw sym2.charCodeAt(2);"); + Handle<String> sym0 = v8::String::NewSymbol("benedictus"); + Handle<String> sym0b = v8::String::NewSymbol("S\303\270ren"); + Handle<String> sym1 = v8::String::NewSymbol("\355\240\201\355\260\207"); + Handle<String> sym2 = v8::String::NewSymbol("\360\220\220\210"); + Handle<String> sym3 = v8::String::NewSymbol("x\355\240\201\355\260\207"); + Handle<String> sym4 = v8::String::NewSymbol("x\360\220\220\210"); + v8::Local<v8::Object> global = context->Global(); + Local<Value> s0 = global->Get(v8_str("sym0")); + Local<Value> s0b = global->Get(v8_str("sym0b")); + Local<Value> s1 = global->Get(v8_str("sym1")); + Local<Value> s2 = global->Get(v8_str("sym2")); + Local<Value> s3 = global->Get(v8_str("sym3")); + Local<Value> s4 = global->Get(v8_str("sym4")); + CHECK(SameSymbol(sym0, Handle<String>(String::Cast(*s0)))); + CHECK(SameSymbol(sym0b, Handle<String>(String::Cast(*s0b)))); + CHECK(SameSymbol(sym1, Handle<String>(String::Cast(*s1)))); + CHECK(SameSymbol(sym2, Handle<String>(String::Cast(*s2)))); + CHECK(SameSymbol(sym3, Handle<String>(String::Cast(*s3)))); + CHECK(SameSymbol(sym4, Handle<String>(String::Cast(*s4)))); +} + + THREADED_TEST(ToArrayIndex) { v8::HandleScope scope; LocalContext context; @@ -11705,6 +11935,9 @@ THREADED_TEST(MorphCompositeStringTest) { "var slice = lhs.substring(1, lhs.length - 1);" "var slice_on_cons = (lhs + rhs).substring(1, lhs.length *2 - 1);"); + CHECK(!lhs->MayContainNonAscii()); + CHECK(!rhs->MayContainNonAscii()); + MorphAString(*v8::Utils::OpenHandle(*lhs), &ascii_resource, &uc16_resource); MorphAString(*v8::Utils::OpenHandle(*rhs), &ascii_resource, &uc16_resource); diff --git a/deps/v8/test/cctest/test-assembler-mips.cc b/deps/v8/test/cctest/test-assembler-mips.cc index a6c76f03e..6985433d9 100644 --- a/deps/v8/test/cctest/test-assembler-mips.cc +++ b/deps/v8/test/cctest/test-assembler-mips.cc @@ -1,4 +1,4 @@ -// Copyright 2011 the V8 project authors. All rights reserved. +// Copyright 2012 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: @@ -219,21 +219,21 @@ TEST(MIPS2) { // Bit twiddling instructions & conditional moves. // Uses t0-t7 as set above. - __ clz(v0, t0); // 29 - __ clz(v1, t1); // 19 + __ Clz(v0, t0); // 29 + __ Clz(v1, t1); // 19 __ addu(v0, v0, v1); // 48 - __ clz(v1, t2); // 3 + __ Clz(v1, t2); // 3 __ addu(v0, v0, v1); // 51 - __ clz(v1, t7); // 0 + __ Clz(v1, t7); // 0 __ addu(v0, v0, v1); // 51 __ Branch(&error, ne, v0, Operand(51)); - __ movn(a0, t3, t0); // Move a0<-t3 (t0 is NOT 0). + __ Movn(a0, t3, t0); // Move a0<-t3 (t0 is NOT 0). __ Ins(a0, t1, 12, 8); // 0x7ff34fff __ Branch(&error, ne, a0, Operand(0x7ff34fff)); - __ movz(a0, t6, t7); // a0 not updated (t7 is NOT 0). + __ Movz(a0, t6, t7); // a0 not updated (t7 is NOT 0). __ Ext(a1, a0, 8, 12); // 0x34f __ Branch(&error, ne, a1, Operand(0x34f)); - __ movz(a0, t6, v1); // a0<-t6, v0 is 0, from 8 instr back. + __ Movz(a0, t6, v1); // a0<-t6, v0 is 0, from 8 instr back. __ Branch(&error, ne, a0, Operand(t6)); // Everything was correctly executed. Load the expected result. @@ -579,8 +579,13 @@ TEST(MIPS7) { __ bind(&neither_is_nan); - __ c(OLT, D, f6, f4, 2); - __ bc1t(&less_than, 2); + if (kArchVariant == kLoongson) { + __ c(OLT, D, f6, f4); + __ bc1t(&less_than); + } else { + __ c(OLT, D, f6, f4, 2); + __ bc1t(&less_than, 2); + } __ nop(); __ sw(zero_reg, MemOperand(a0, OFFSET_OF(T, result)) ); __ Branch(&outa_here); @@ -774,7 +779,7 @@ TEST(MIPS10) { Assembler assm(Isolate::Current(), NULL, 0); Label L, C; - if (CpuFeatures::IsSupported(FPU) && mips32r2) { + if (CpuFeatures::IsSupported(FPU) && kArchVariant == kMips32r2) { CpuFeatures::Scope scope(FPU); // Load all structure elements to registers. diff --git a/deps/v8/test/cctest/test-disasm-mips.cc b/deps/v8/test/cctest/test-disasm-mips.cc index 8eadc6483..1f8742452 100644 --- a/deps/v8/test/cctest/test-disasm-mips.cc +++ b/deps/v8/test/cctest/test-disasm-mips.cc @@ -1,4 +1,4 @@ -// Copyright 2011 the V8 project authors. All rights reserved. +// Copyright 2012 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: @@ -148,12 +148,14 @@ TEST(Type0) { COMPARE(divu(v0, v1), "0043001b divu v0, v1"); - COMPARE(mul(a0, a1, a2), - "70a62002 mul a0, a1, a2"); - COMPARE(mul(t2, t3, t4), - "716c5002 mul t2, t3, t4"); - COMPARE(mul(v0, v1, s0), - "70701002 mul v0, v1, s0"); + if (kArchVariant != kLoongson) { + COMPARE(mul(a0, a1, a2), + "70a62002 mul a0, a1, a2"); + COMPARE(mul(t2, t3, t4), + "716c5002 mul t2, t3, t4"); + COMPARE(mul(v0, v1, s0), + "70701002 mul v0, v1, s0"); + } COMPARE(addiu(a0, a1, 0x0), "24a40000 addiu a0, a1, 0"); @@ -274,7 +276,7 @@ TEST(Type0) { COMPARE(srav(v0, v1, fp), "03c31007 srav v0, v1, fp"); - if (mips32r2) { + if (kArchVariant == kMips32r2) { COMPARE(rotr(a0, a1, 0), "00252002 rotr a0, a1, 0"); COMPARE(rotr(s0, s1, 8), @@ -377,48 +379,50 @@ TEST(Type0) { COMPARE(sltiu(v0, v1, -1), "2c62ffff sltiu v0, v1, -1"); - COMPARE(movz(a0, a1, a2), - "00a6200a movz a0, a1, a2"); - COMPARE(movz(s0, s1, s2), - "0232800a movz s0, s1, s2"); - COMPARE(movz(t2, t3, t4), - "016c500a movz t2, t3, t4"); - COMPARE(movz(v0, v1, a2), - "0066100a movz v0, v1, a2"); - COMPARE(movn(a0, a1, a2), - "00a6200b movn a0, a1, a2"); - COMPARE(movn(s0, s1, s2), - "0232800b movn s0, s1, s2"); - COMPARE(movn(t2, t3, t4), - "016c500b movn t2, t3, t4"); - COMPARE(movn(v0, v1, a2), - "0066100b movn v0, v1, a2"); - - COMPARE(movt(a0, a1, 1), - "00a52001 movt a0, a1, 1"); - COMPARE(movt(s0, s1, 2), - "02298001 movt s0, s1, 2"); - COMPARE(movt(t2, t3, 3), - "016d5001 movt t2, t3, 3"); - COMPARE(movt(v0, v1, 7), - "007d1001 movt v0, v1, 7"); - COMPARE(movf(a0, a1, 0), - "00a02001 movf a0, a1, 0"); - COMPARE(movf(s0, s1, 4), - "02308001 movf s0, s1, 4"); - COMPARE(movf(t2, t3, 5), - "01745001 movf t2, t3, 5"); - COMPARE(movf(v0, v1, 6), - "00781001 movf v0, v1, 6"); - - COMPARE(clz(a0, a1), - "70a42020 clz a0, a1"); - COMPARE(clz(s6, s7), - "72f6b020 clz s6, s7"); - COMPARE(clz(v0, v1), - "70621020 clz v0, v1"); - - if (mips32r2) { + if (kArchVariant != kLoongson) { + COMPARE(movz(a0, a1, a2), + "00a6200a movz a0, a1, a2"); + COMPARE(movz(s0, s1, s2), + "0232800a movz s0, s1, s2"); + COMPARE(movz(t2, t3, t4), + "016c500a movz t2, t3, t4"); + COMPARE(movz(v0, v1, a2), + "0066100a movz v0, v1, a2"); + COMPARE(movn(a0, a1, a2), + "00a6200b movn a0, a1, a2"); + COMPARE(movn(s0, s1, s2), + "0232800b movn s0, s1, s2"); + COMPARE(movn(t2, t3, t4), + "016c500b movn t2, t3, t4"); + COMPARE(movn(v0, v1, a2), + "0066100b movn v0, v1, a2"); + + COMPARE(movt(a0, a1, 1), + "00a52001 movt a0, a1, 1"); + COMPARE(movt(s0, s1, 2), + "02298001 movt s0, s1, 2"); + COMPARE(movt(t2, t3, 3), + "016d5001 movt t2, t3, 3"); + COMPARE(movt(v0, v1, 7), + "007d1001 movt v0, v1, 7"); + COMPARE(movf(a0, a1, 0), + "00a02001 movf a0, a1, 0"); + COMPARE(movf(s0, s1, 4), + "02308001 movf s0, s1, 4"); + COMPARE(movf(t2, t3, 5), + "01745001 movf t2, t3, 5"); + COMPARE(movf(v0, v1, 6), + "00781001 movf v0, v1, 6"); + + COMPARE(clz(a0, a1), + "70a42020 clz a0, a1"); + COMPARE(clz(s6, s7), + "72f6b020 clz s6, s7"); + COMPARE(clz(v0, v1), + "70621020 clz v0, v1"); + } + + if (kArchVariant == kMips32r2) { COMPARE(ins_(a0, a1, 31, 1), "7ca4ffc4 ins a0, a1, 31, 1"); COMPARE(ins_(s6, s7, 30, 2), diff --git a/deps/v8/test/cctest/test-heap-profiler.cc b/deps/v8/test/cctest/test-heap-profiler.cc index 7a227cdf9..a56f250c2 100644 --- a/deps/v8/test/cctest/test-heap-profiler.cc +++ b/deps/v8/test/cctest/test-heap-profiler.cc @@ -352,6 +352,59 @@ TEST(HeapSnapshotInternalReferences) { #define CHECK_NE_UINT64_T(a, b) \ CHECK((a) != (b)) // NOLINT +TEST(HeapEntryIdsAndArrayShift) { + v8::HandleScope scope; + LocalContext env; + + CompileRun( + "function AnObject() {\n" + " this.first = 'first';\n" + " this.second = 'second';\n" + "}\n" + "var a = new Array();\n" + "for (var i = 0; i < 10; ++i)\n" + " a.push(new AnObject());\n"); + const v8::HeapSnapshot* snapshot1 = + v8::HeapProfiler::TakeSnapshot(v8_str("s1")); + + CompileRun( + "for (var i = 0; i < 1; ++i)\n" + " a.shift();\n"); + + HEAP->CollectAllGarbage(i::Heap::kNoGCFlags); + + const v8::HeapSnapshot* snapshot2 = + v8::HeapProfiler::TakeSnapshot(v8_str("s2")); + + const v8::HeapGraphNode* global1 = GetGlobalObject(snapshot1); + const v8::HeapGraphNode* global2 = GetGlobalObject(snapshot2); + CHECK_NE_UINT64_T(0, global1->GetId()); + CHECK_EQ_UINT64_T(global1->GetId(), global2->GetId()); + + const v8::HeapGraphNode* a1 = + GetProperty(global1, v8::HeapGraphEdge::kProperty, "a"); + CHECK_NE(NULL, a1); + const v8::HeapGraphNode* e1 = + GetProperty(a1, v8::HeapGraphEdge::kHidden, "1"); + CHECK_NE(NULL, e1); + const v8::HeapGraphNode* k1 = + GetProperty(e1, v8::HeapGraphEdge::kInternal, "elements"); + CHECK_NE(NULL, k1); + const v8::HeapGraphNode* a2 = + GetProperty(global2, v8::HeapGraphEdge::kProperty, "a"); + CHECK_NE(NULL, a2); + const v8::HeapGraphNode* e2 = + GetProperty(a2, v8::HeapGraphEdge::kHidden, "1"); + CHECK_NE(NULL, e2); + const v8::HeapGraphNode* k2 = + GetProperty(e2, v8::HeapGraphEdge::kInternal, "elements"); + CHECK_NE(NULL, k2); + + CHECK_EQ_UINT64_T(a1->GetId(), a2->GetId()); + CHECK_EQ_UINT64_T(e1->GetId(), e2->GetId()); + CHECK_EQ_UINT64_T(k1->GetId(), k2->GetId()); +} + TEST(HeapEntryIdsAndGC) { v8::HandleScope scope; LocalContext env; diff --git a/deps/v8/test/cctest/test-log-stack-tracer.cc b/deps/v8/test/cctest/test-log-stack-tracer.cc index f536e6b19..6847ef7ee 100644 --- a/deps/v8/test/cctest/test-log-stack-tracer.cc +++ b/deps/v8/test/cctest/test-log-stack-tracer.cc @@ -307,6 +307,7 @@ TEST(CFromJSStackTrace) { // Stack tracing will start from the first JS function, i.e. "JSFuncDoTrace" int base = 0; CHECK_GT(sample.frames_count, base + 1); + CHECK(IsAddressWithinFuncCode("JSFuncDoTrace", sample.stack[base + 0])); CHECK(IsAddressWithinFuncCode("JSTrace", sample.stack[base + 1])); } diff --git a/deps/v8/test/cctest/test-parsing.cc b/deps/v8/test/cctest/test-parsing.cc index cd8a6aff3..6bcae7c30 100755 --- a/deps/v8/test/cctest/test-parsing.cc +++ b/deps/v8/test/cctest/test-parsing.cc @@ -63,7 +63,7 @@ TEST(ScanKeywords) { int length = i::StrLength(key_token.keyword); CHECK(static_cast<int>(sizeof(buffer)) >= length); { - i::Utf8ToUC16CharacterStream stream(keyword, length); + i::Utf8ToUtf16CharacterStream stream(keyword, length); i::Scanner scanner(&unicode_cache); // The scanner should parse Harmony keywords for this test. scanner.SetHarmonyScoping(true); @@ -74,7 +74,7 @@ TEST(ScanKeywords) { } // Removing characters will make keyword matching fail. { - i::Utf8ToUC16CharacterStream stream(keyword, length - 1); + i::Utf8ToUtf16CharacterStream stream(keyword, length - 1); i::Scanner scanner(&unicode_cache); scanner.Initialize(&stream); CHECK_EQ(i::Token::IDENTIFIER, scanner.Next()); @@ -85,7 +85,7 @@ TEST(ScanKeywords) { for (int j = 0; j < static_cast<int>(ARRAY_SIZE(chars_to_append)); ++j) { memmove(buffer, keyword, length); buffer[length] = chars_to_append[j]; - i::Utf8ToUC16CharacterStream stream(buffer, length + 1); + i::Utf8ToUtf16CharacterStream stream(buffer, length + 1); i::Scanner scanner(&unicode_cache); scanner.Initialize(&stream); CHECK_EQ(i::Token::IDENTIFIER, scanner.Next()); @@ -95,7 +95,7 @@ TEST(ScanKeywords) { { memmove(buffer, keyword, length); buffer[length - 1] = '_'; - i::Utf8ToUC16CharacterStream stream(buffer, length); + i::Utf8ToUtf16CharacterStream stream(buffer, length); i::Scanner scanner(&unicode_cache); scanner.Initialize(&stream); CHECK_EQ(i::Token::IDENTIFIER, scanner.Next()); @@ -255,7 +255,7 @@ TEST(StandAlonePreParser) { uintptr_t stack_limit = i::Isolate::Current()->stack_guard()->real_climit(); for (int i = 0; programs[i]; i++) { const char* program = programs[i]; - i::Utf8ToUC16CharacterStream stream( + i::Utf8ToUtf16CharacterStream stream( reinterpret_cast<const i::byte*>(program), static_cast<unsigned>(strlen(program))); i::CompleteParserRecorder log; @@ -291,7 +291,7 @@ TEST(StandAlonePreParserNoNatives) { uintptr_t stack_limit = i::Isolate::Current()->stack_guard()->real_climit(); for (int i = 0; programs[i]; i++) { const char* program = programs[i]; - i::Utf8ToUC16CharacterStream stream( + i::Utf8ToUtf16CharacterStream stream( reinterpret_cast<const i::byte*>(program), static_cast<unsigned>(strlen(program))); i::CompleteParserRecorder log; @@ -326,8 +326,9 @@ TEST(RegressChromium62639) { // and then used the invalid currently scanned literal. This always // failed in debug mode, and sometimes crashed in release mode. - i::Utf8ToUC16CharacterStream stream(reinterpret_cast<const i::byte*>(program), - static_cast<unsigned>(strlen(program))); + i::Utf8ToUtf16CharacterStream stream( + reinterpret_cast<const i::byte*>(program), + static_cast<unsigned>(strlen(program))); i::ScriptDataImpl* data = i::ParserApi::PreParse(&stream, NULL, false); CHECK(data->HasError()); @@ -360,7 +361,7 @@ TEST(Regress928) { int first_function = static_cast<int>(strstr(program, "function") - program); - int first_lbrace = first_function + static_cast<int>(strlen("function () ")); + int first_lbrace = first_function + i::StrLength("function () "); CHECK_EQ('{', program[first_lbrace]); i::FunctionEntry entry1 = data->GetFunctionEntry(first_lbrace); CHECK(!entry1.is_valid()); @@ -368,7 +369,7 @@ TEST(Regress928) { int second_function = static_cast<int>(strstr(program + first_lbrace, "function") - program); int second_lbrace = - second_function + static_cast<int>(strlen("function () ")); + second_function + i::StrLength("function () "); CHECK_EQ('{', program[second_lbrace]); i::FunctionEntry entry2 = data->GetFunctionEntry(second_lbrace); CHECK(entry2.is_valid()); @@ -392,7 +393,7 @@ TEST(PreParseOverflow) { uintptr_t stack_limit = i::Isolate::Current()->stack_guard()->real_climit(); - i::Utf8ToUC16CharacterStream stream( + i::Utf8ToUtf16CharacterStream stream( reinterpret_cast<const i::byte*>(*program), static_cast<unsigned>(kProgramSize)); i::CompleteParserRecorder log; @@ -449,10 +450,10 @@ void TestCharacterStream(const char* ascii_source, i::Handle<i::String> uc16_string( FACTORY->NewExternalStringFromTwoByte(&resource)); - i::ExternalTwoByteStringUC16CharacterStream uc16_stream( + i::ExternalTwoByteStringUtf16CharacterStream uc16_stream( i::Handle<i::ExternalTwoByteString>::cast(uc16_string), start, end); - i::GenericStringUC16CharacterStream string_stream(ascii_string, start, end); - i::Utf8ToUC16CharacterStream utf8_stream( + i::GenericStringUtf16CharacterStream string_stream(ascii_string, start, end); + i::Utf8ToUtf16CharacterStream utf8_stream( reinterpret_cast<const i::byte*>(ascii_source), end); utf8_stream.SeekForward(start); @@ -575,12 +576,14 @@ TEST(Utf8CharacterStream) { char buffer[kAllUtf8CharsSizeU]; unsigned cursor = 0; for (int i = 0; i <= kMaxUC16Char; i++) { - cursor += unibrow::Utf8::Encode(buffer + cursor, i); + cursor += unibrow::Utf8::Encode(buffer + cursor, + i, + unibrow::Utf16::kNoPreviousCharacter); } ASSERT(cursor == kAllUtf8CharsSizeU); - i::Utf8ToUC16CharacterStream stream(reinterpret_cast<const i::byte*>(buffer), - kAllUtf8CharsSizeU); + i::Utf8ToUtf16CharacterStream stream(reinterpret_cast<const i::byte*>(buffer), + kAllUtf8CharsSizeU); for (int i = 0; i <= kMaxUC16Char; i++) { CHECK_EQU(i, stream.pos()); int32_t c = stream.Advance(); @@ -610,7 +613,7 @@ TEST(Utf8CharacterStream) { #undef CHECK_EQU -void TestStreamScanner(i::UC16CharacterStream* stream, +void TestStreamScanner(i::Utf16CharacterStream* stream, i::Token::Value* expected_tokens, int skip_pos = 0, // Zero means not skipping. int skip_to = 0) { @@ -633,8 +636,8 @@ TEST(StreamScanner) { v8::V8::Initialize(); const char* str1 = "{ foo get for : */ <- \n\n /*foo*/ bib"; - i::Utf8ToUC16CharacterStream stream1(reinterpret_cast<const i::byte*>(str1), - static_cast<unsigned>(strlen(str1))); + i::Utf8ToUtf16CharacterStream stream1(reinterpret_cast<const i::byte*>(str1), + static_cast<unsigned>(strlen(str1))); i::Token::Value expectations1[] = { i::Token::LBRACE, i::Token::IDENTIFIER, @@ -652,8 +655,8 @@ TEST(StreamScanner) { TestStreamScanner(&stream1, expectations1, 0, 0); const char* str2 = "case default const {THIS\nPART\nSKIPPED} do"; - i::Utf8ToUC16CharacterStream stream2(reinterpret_cast<const i::byte*>(str2), - static_cast<unsigned>(strlen(str2))); + i::Utf8ToUtf16CharacterStream stream2(reinterpret_cast<const i::byte*>(str2), + static_cast<unsigned>(strlen(str2))); i::Token::Value expectations2[] = { i::Token::CASE, i::Token::DEFAULT, @@ -683,7 +686,7 @@ TEST(StreamScanner) { for (int i = 0; i <= 4; i++) { expectations3[6 - i] = i::Token::ILLEGAL; expectations3[5 - i] = i::Token::EOS; - i::Utf8ToUC16CharacterStream stream3( + i::Utf8ToUtf16CharacterStream stream3( reinterpret_cast<const i::byte*>(str3), static_cast<unsigned>(strlen(str3))); TestStreamScanner(&stream3, expectations3, 1, 1 + i); @@ -692,7 +695,7 @@ TEST(StreamScanner) { void TestScanRegExp(const char* re_source, const char* expected) { - i::Utf8ToUC16CharacterStream stream( + i::Utf8ToUtf16CharacterStream stream( reinterpret_cast<const i::byte*>(re_source), static_cast<unsigned>(strlen(re_source))); i::Scanner scanner(i::Isolate::Current()->unicode_cache()); @@ -748,6 +751,67 @@ TEST(RegExpScanning) { } +static int Utf8LengthHelper(const char* s) { + int len = i::StrLength(s); + int character_length = len; + for (int i = 0; i < len; i++) { + unsigned char c = s[i]; + int input_offset = 0; + int output_adjust = 0; + if (c > 0x7f) { + if (c < 0xc0) continue; + if (c >= 0xf0) { + if (c >= 0xf8) { + // 5 and 6 byte UTF-8 sequences turn into a kBadChar for each UTF-8 + // byte. + continue; // Handle first UTF-8 byte. + } + if ((c & 7) == 0 && ((s[i + 1] & 0x30) == 0)) { + // This 4 byte sequence could have been coded as a 3 byte sequence. + // Record a single kBadChar for the first byte and continue. + continue; + } + input_offset = 3; + // 4 bytes of UTF-8 turn into 2 UTF-16 code units. + character_length -= 2; + } else if (c >= 0xe0) { + if ((c & 0xf) == 0 && ((s[i + 1] & 0x20) == 0)) { + // This 3 byte sequence could have been coded as a 2 byte sequence. + // Record a single kBadChar for the first byte and continue. + continue; + } + input_offset = 2; + // 3 bytes of UTF-8 turn into 1 UTF-16 code unit. + output_adjust = 2; + } else { + if ((c & 0x1e) == 0) { + // This 2 byte sequence could have been coded as a 1 byte sequence. + // Record a single kBadChar for the first byte and continue. + continue; + } + input_offset = 1; + // 2 bytes of UTF-8 turn into 1 UTF-16 code unit. + output_adjust = 1; + } + bool bad = false; + for (int j = 1; j <= input_offset; j++) { + if ((s[i + j] & 0xc0) != 0x80) { + // Bad UTF-8 sequence turns the first in the sequence into kBadChar, + // which is a single UTF-16 code unit. + bad = true; + break; + } + } + if (!bad) { + i += input_offset; + character_length -= output_adjust; + } + } + } + return character_length; +} + + TEST(ScopePositions) { // Test the parser for correctly setting the start and end positions // of a scope. We check the scope positions of exactly one scope @@ -835,6 +899,91 @@ TEST(ScopePositions) { { " for ", "(let x in {})\n" " statement;", "\n" " more;", i::BLOCK_SCOPE, i::EXTENDED_MODE }, + // Check that 6-byte and 4-byte encodings of UTF-8 strings do not throw + // the preparser off in terms of byte offsets. + // 6 byte encoding. + { " 'foo\355\240\201\355\260\211';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // 4 byte encoding. + { " 'foo\360\220\220\212';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // 3 byte encoding of \u0fff. + { " 'foo\340\277\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Broken 6 byte encoding with missing last byte. + { " 'foo\355\240\201\355\211';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Broken 3 byte encoding of \u0fff with missing last byte. + { " 'foo\340\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Broken 3 byte encoding of \u0fff with missing 2 last bytes. + { " 'foo\340';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Broken 3 byte encoding of \u00ff should be a 2 byte encoding. + { " 'foo\340\203\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Broken 3 byte encoding of \u007f should be a 2 byte encoding. + { " 'foo\340\201\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Unpaired lead surrogate. + { " 'foo\355\240\201';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Unpaired lead surrogate where following code point is a 3 byte sequence. + { " 'foo\355\240\201\340\277\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Unpaired lead surrogate where following code point is a 4 byte encoding + // of a trail surrogate. + { " 'foo\355\240\201\360\215\260\211';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Unpaired trail surrogate. + { " 'foo\355\260\211';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // 2 byte encoding of \u00ff. + { " 'foo\303\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Broken 2 byte encoding of \u00ff with missing last byte. + { " 'foo\303';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Broken 2 byte encoding of \u007f should be a 1 byte encoding. + { " 'foo\301\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Illegal 5 byte encoding. + { " 'foo\370\277\277\277\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Illegal 6 byte encoding. + { " 'foo\374\277\277\277\277\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Illegal 0xfe byte + { " 'foo\376\277\277\277\277\277\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + // Illegal 0xff byte + { " 'foo\377\277\277\277\277\277\277\277';\n" + " (function fun", "(a,b) { infunction; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + { " 'foo';\n" + " (function fun", "(a,b) { 'bar\355\240\201\355\260\213'; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, + { " 'foo';\n" + " (function fun", "(a,b) { 'bar\360\220\220\214'; }", ")();", + i::FUNCTION_SCOPE, i::CLASSIC_MODE }, { NULL, NULL, NULL, i::EVAL_SCOPE, i::CLASSIC_MODE } }; @@ -848,20 +997,24 @@ TEST(ScopePositions) { i::FLAG_harmony_scoping = true; for (int i = 0; source_data[i].outer_prefix; i++) { - int kPrefixLen = i::StrLength(source_data[i].outer_prefix); - int kInnerLen = i::StrLength(source_data[i].inner_source); - int kSuffixLen = i::StrLength(source_data[i].outer_suffix); + int kPrefixLen = Utf8LengthHelper(source_data[i].outer_prefix); + int kInnerLen = Utf8LengthHelper(source_data[i].inner_source); + int kSuffixLen = Utf8LengthHelper(source_data[i].outer_suffix); + int kPrefixByteLen = i::StrLength(source_data[i].outer_prefix); + int kInnerByteLen = i::StrLength(source_data[i].inner_source); + int kSuffixByteLen = i::StrLength(source_data[i].outer_suffix); int kProgramSize = kPrefixLen + kInnerLen + kSuffixLen; - i::Vector<char> program = i::Vector<char>::New(kProgramSize + 1); - int length = i::OS::SNPrintF(program, "%s%s%s", - source_data[i].outer_prefix, - source_data[i].inner_source, - source_data[i].outer_suffix); - CHECK(length == kProgramSize); + int kProgramByteSize = kPrefixByteLen + kInnerByteLen + kSuffixByteLen; + i::Vector<char> program = i::Vector<char>::New(kProgramByteSize + 1); + i::OS::SNPrintF(program, "%s%s%s", + source_data[i].outer_prefix, + source_data[i].inner_source, + source_data[i].outer_suffix); // Parse program source. i::Handle<i::String> source( - FACTORY->NewStringFromAscii(i::CStrVector(program.start()))); + FACTORY->NewStringFromUtf8(i::CStrVector(program.start()))); + CHECK_EQ(source->length(), kProgramSize); i::Handle<i::Script> script = FACTORY->NewScript(source); i::Parser parser(script, i::kAllowLazy | i::EXTENDED_MODE, NULL, NULL); i::CompilationInfo info(script); @@ -894,7 +1047,7 @@ void TestParserSync(i::Handle<i::String> source, int flags) { // Preparse the data. i::CompleteParserRecorder log; i::Scanner scanner(i::Isolate::Current()->unicode_cache()); - i::GenericStringUC16CharacterStream stream(source, 0, source->length()); + i::GenericStringUtf16CharacterStream stream(source, 0, source->length()); scanner.SetHarmonyScoping(harmony_scoping); scanner.Initialize(&stream); v8::preparser::PreParser::PreParseResult result = diff --git a/deps/v8/test/mjsunit/compiler/inline-arguments.js b/deps/v8/test/mjsunit/compiler/inline-arguments.js index 532fc26a1..b6adf7f6c 100644 --- a/deps/v8/test/mjsunit/compiler/inline-arguments.js +++ b/deps/v8/test/mjsunit/compiler/inline-arguments.js @@ -27,11 +27,89 @@ // Flags: --allow-natives-syntax -// Test inlining functions that use arguments. -function f() { return g(1, 2, 3); } +function A() { +} -function g(x, y, z) { return %_ArgumentsLength(); } +A.prototype.X = function (a, b, c) { + assertTrue(this instanceof A); + assertEquals(1, a); + assertEquals(2, b); + assertEquals(3, c); +}; -for (var i = 0; i < 5; ++i) f(); -%OptimizeFunctionOnNextCall(f); -assertEquals(3, f()); +A.prototype.Y = function () { + this.X.apply(this, arguments); +}; + +A.prototype.Z = function () { + this.Y(1,2,3); +}; + +var a = new A(); +a.Z(4,5,6); +a.Z(4,5,6); +%OptimizeFunctionOnNextCall(a.Z); +a.Z(4,5,6); +A.prototype.X.apply = function (receiver, args) { + return Function.prototype.apply.call(this, receiver, args); +}; +a.Z(4,5,6); + + +// Ensure that HArgumentsObject is inserted in a correct place +// and dominates all uses. +function F1() { } +function F2() { F1.apply(this, arguments); } +function F3(x, y) { + if (x) { + F2(y); + } +} + +function F31() { + return F1.apply(this, arguments); +} + +function F4() { + F3(true, false); + return F31(1); +} + +F4(1); +F4(1); +F4(1); +%OptimizeFunctionOnNextCall(F4); +F4(1); + + +// Test correct adapation of arguments. +// Strict mode prevents arguments object from shadowing parameters. +(function () { + "use strict"; + + function G2() { + assertArrayEquals([1,2], arguments); + } + + function G4() { + assertArrayEquals([1,2,3,4], arguments); + } + + function adapt2to4(a, b, c, d) { + G2.apply(this, arguments); + } + + function adapt4to2(a, b) { + G4.apply(this, arguments); + } + + function test_adaptation() { + adapt2to4(1, 2); + adapt4to2(1, 2, 3, 4); + } + + test_adaptation(); + test_adaptation(); + %OptimizeFunctionOnNextCall(test_adaptation); + test_adaptation(); +})(); diff --git a/deps/v8/test/mjsunit/debug-set-script-source.js b/deps/v8/test/mjsunit/debug-set-script-source.js new file mode 100644 index 000000000..34ae8488a --- /dev/null +++ b/deps/v8/test/mjsunit/debug-set-script-source.js @@ -0,0 +1,64 @@ +// Copyright 2012 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: --expose-debug-as debug +// Get the Debug object exposed from the debug context global object. +Debug = debug.Debug + +var script_number = 0; +var script_names = []; +var exception = null; + +function listener(event, exec_state, event_data, data) { + if (event == Debug.DebugEvent.BeforeCompile) { + event_data.script().setSource(event_data.script().source() + + " //@ sourceURL=proper_location_" + (++script_number)); + } else if (event == Debug.DebugEvent.AfterCompile) { + try { + event_data.script().setSource("a=1 //@ sourceURL=wrong_location"); + } catch(e) { + exception = e; + } + script_names.push(event_data.script().name()); + } +}; + + +// Add the debug event listener. +Debug.setListener(listener); + +// Compile different sources. +eval('a=1'); +eval('(function(){})'); + +assertEquals(2, script_names.length); +assertEquals("proper_location_1", script_names[0]); +assertEquals("proper_location_2", script_names[1]); + +assertEquals("illegal access", exception); + +Debug.setListener(null); diff --git a/deps/v8/test/mjsunit/debug-stepin-function-call.js b/deps/v8/test/mjsunit/debug-stepin-function-call.js index 385fcb2f8..3b5240c93 100644 --- a/deps/v8/test/mjsunit/debug-stepin-function-call.js +++ b/deps/v8/test/mjsunit/debug-stepin-function-call.js @@ -135,8 +135,15 @@ function apply4() { var yetAnotherLocal = 10; } +// Test step into bound function. +function bind1() { + var bound = g.bind(null, 3); + debugger; + bound(); +} + var testFunctions = - [call1, call2, call3, call4, apply1, apply2, apply3, apply4]; + [call1, call2, call3, call4, apply1, apply2, apply3, apply4, bind1]; for (var i = 0; i < testFunctions.length; i++) { state = 0; @@ -145,5 +152,13 @@ for (var i = 0; i < testFunctions.length; i++) { assertEquals(3, state); } +// Test global bound function. +state = 0; +var globalBound = g.bind(null, 3); +debugger; +globalBound(); +assertNull(exception); +assertEquals(3, state); + // Get rid of the debug event listener. Debug.setListener(null);
\ No newline at end of file diff --git a/deps/v8/test/mjsunit/getter-in-value-prototype.js b/deps/v8/test/mjsunit/getter-in-value-prototype.js index b55320ac5..abe2cb193 100644 --- a/deps/v8/test/mjsunit/getter-in-value-prototype.js +++ b/deps/v8/test/mjsunit/getter-in-value-prototype.js @@ -31,5 +31,5 @@ // JSObject. String.prototype.__defineGetter__('x', function() { return this; }); -assertEquals('asdf', 'asdf'.x); +assertEquals(Object('asdf'), 'asdf'.x); diff --git a/deps/v8/test/mjsunit/harmony/proxies.js b/deps/v8/test/mjsunit/harmony/proxies.js index 50c8613b6..8d8f83996 100644 --- a/deps/v8/test/mjsunit/harmony/proxies.js +++ b/deps/v8/test/mjsunit/harmony/proxies.js @@ -2257,3 +2257,22 @@ TestIsEnumerableThrow(Proxy.create({ return function(k) { throw "myexn" } } })) + + + +// Constructor functions with proxy prototypes. + +function TestConstructorWithProxyPrototype() { + TestWithProxies(TestConstructorWithProxyPrototype2, {}) +} + +function TestConstructorWithProxyPrototype2(create, handler) { + function C() {}; + C.prototype = create(handler); + + var o = new C; + assertSame(C.prototype, o.__proto__); + assertSame(C.prototype, Object.getPrototypeOf(o)); +} + +TestConstructorWithProxyPrototype(); diff --git a/deps/v8/test/mjsunit/pixel-array-rounding.js b/deps/v8/test/mjsunit/pixel-array-rounding.js new file mode 100644 index 000000000..ef5a10bdf --- /dev/null +++ b/deps/v8/test/mjsunit/pixel-array-rounding.js @@ -0,0 +1,44 @@ +// Copyright 2012 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: --allow-natives-syntax + +var pixels = new PixelArray(8); + +function f() { + for (var i = 0; i < 8; i++) { + pixels[i] = (i * 1.1); + } + return pixels[1] + pixels[6]; +} + +f(); +f(); +assertEquals(6, pixels[5]); +%OptimizeFunctionOnNextCall(f); +f(); +assertEquals(6, pixels[5]); diff --git a/deps/v8/test/mjsunit/regexp.js b/deps/v8/test/mjsunit/regexp.js index 76fa44be9..ec82c96e0 100644 --- a/deps/v8/test/mjsunit/regexp.js +++ b/deps/v8/test/mjsunit/regexp.js @@ -1,4 +1,4 @@ -// Copyright 2008 the V8 project authors. All rights reserved. +// Copyright 2012 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: @@ -701,3 +701,7 @@ assertThrows("RegExp('(*)')"); assertThrows("RegExp('(?:*)')"); assertThrows("RegExp('(?=*)')"); assertThrows("RegExp('(?!*)')"); + +// Test trimmed regular expression for RegExp.test(). +assertTrue(/.*abc/.test("abc")); +assertFalse(/.*\d+/.test("q")); diff --git a/deps/v8/test/mjsunit/regress/regress-115452.js b/deps/v8/test/mjsunit/regress/regress-115452.js new file mode 100644 index 000000000..7e424ed88 --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-115452.js @@ -0,0 +1,48 @@ +// Copyright 2012 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. + +// Test that a function declaration cannot overwrite a read-only property. + +print(0) +function foobl() {} +assertTrue(typeof this.foobl == "function"); +assertTrue(Object.getOwnPropertyDescriptor(this, "foobl").writable); + +print(1) +Object.defineProperty(this, "foobl", {value: 1, writable: false}); +assertSame(1, this.foobl); +assertFalse(Object.getOwnPropertyDescriptor(this, "foobl").writable); + +print(2) +eval("function foobl() {}"); +assertSame(1, this.foobl); +assertFalse(Object.getOwnPropertyDescriptor(this, "foobl").writable); + +print(3) +eval("function foobl() {}"); +assertSame(1, this.foobl); +assertFalse(Object.getOwnPropertyDescriptor(this, "foobl").writable); diff --git a/deps/v8/test/mjsunit/regress/regress-117794.js b/deps/v8/test/mjsunit/regress/regress-117794.js new file mode 100644 index 000000000..5e11b4003 --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-117794.js @@ -0,0 +1,57 @@ +// Copyright 2012 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. + +// Loads specialized to be from the global object should not omit the +// smi check on the receiver. The code below should not crash. + +print = function() {} + +function constructor() {}; + +function assertHasOwnProperties(object, limit) { + for (var i = 0; i < limit; i++) { } +} + +try { + Object.keys(); +} catch(exc2) { + print(exc2.stack); +} + +var x1 = new Object(); + +try { + new Function("A Man Called Horse", x1.d); +} catch(exc3) { + print(exc3.stack); +} + +try { + (-(true)).toPrecision(0x30, 'lib1-f1'); +} catch(exc1) { + print(exc1.stack); +} diff --git a/deps/v8/test/mjsunit/regress/regress-119925.js b/deps/v8/test/mjsunit/regress/regress-119925.js new file mode 100644 index 000000000..67127548c --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-119925.js @@ -0,0 +1,34 @@ +// Copyright 2012 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. + +// Test that the throw is not inlined if object literals cannot be +// inlined. +Array.prototype.__proto__ = { 77e4 : null }; +function continueWithinLoop() { + for (var key in [(1.2)]) { } +}; +continueWithinLoop(); diff --git a/deps/v8/test/mjsunit/regress/regress-1624-strict.js b/deps/v8/test/mjsunit/regress/regress-1624-strict.js new file mode 100644 index 000000000..8bc58d5ab --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-1624-strict.js @@ -0,0 +1,140 @@ +// Copyright 2012 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. + +// Test that global eval calls of strict code (independent from whether being +// direct or indirect) have their own lexical and variable environment. + +"use strict"; +var evil = eval; + +// Test global direct strict eval in strict script. +// Expects new environment. +var no_touch = 0; +eval('"use strict"; var no_touch = 1;'); +assertSame(0, no_touch); + +// Test global indirect strict eval in strict script. +// Expects new environment. +var no_touch = 0; +evil('"use strict"; var no_touch = 2;'); +assertSame(0, no_touch); + +// Test global direct non-strict eval in strict script. +// Expects new environment. +var no_touch = 0; +eval('var no_touch = 3;'); +assertSame(0, no_touch); + +// Test global indirect non-strict eval in strict script. +// Expects global environment. +var no_touch = 0; +evil('var no_touch = 4;'); +assertSame(4, no_touch); + +// Test non-global direct strict eval in strict script. +// Expects new environment. +var no_touch = 0; +(function() { + var no_touch = 0; + eval('"use strict"; var no_touch = 5;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global indirect strict eval in strict script. +// Expects new environment. +var no_touch = 0; +(function() { + var no_touch = 0; + evil('"use strict"; var no_touch = 6;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global direct non-strict eval in strict script. +// Expects new environment. +var no_touch = 0; +(function() { + var no_touch = 0; + eval('var no_touch = 7;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global indirect non-strict eval in strict script. +// Expects global environment. +var no_touch = 0; +(function() { + var no_touch = 0; + evil('var no_touch = 8;'); + assertSame(0, no_touch); +})() +assertSame(8, no_touch); + +// Test non-global direct strict eval in strict script. +// Expects new environment. +var no_touch = 0; +(function() { + "use strict"; + var no_touch = 0; + eval('"use strict"; var no_touch = 9;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global indirect strict eval in strict script. +// Expects new environment. +var no_touch = 0; +(function() { + "use strict"; + var no_touch = 0; + evil('"use strict"; var no_touch = 10;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global direct non-strict eval in strict script. +// Expects new environment. +var no_touch = 0; +(function() { + "use strict"; + var no_touch = 0; + eval('var no_touch = 11;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global indirect non-strict eval in strict script. +// Expects global environment. +var no_touch = 0; +(function() { + "use strict"; + var no_touch = 0; + evil('var no_touch = 12;'); + assertSame(0, no_touch); +})() +assertSame(12, no_touch); diff --git a/deps/v8/test/mjsunit/regress/regress-1624.js b/deps/v8/test/mjsunit/regress/regress-1624.js new file mode 100644 index 000000000..987e036d7 --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-1624.js @@ -0,0 +1,139 @@ +// Copyright 2012 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. + +// Test that global eval calls of strict code (independent from whether being +// direct or indirect) have their own lexical and variable environment. + +var evil = eval; + +// Test global direct strict eval. +// Expects new environment. +var no_touch = 0; +eval('"use strict"; var no_touch = 1;'); +assertSame(0, no_touch); + +// Test global indirect strict eval. +// Expects new environment. +var no_touch = 0; +evil('"use strict"; var no_touch = 2;'); +assertSame(0, no_touch); + +// Test global direct non-strict eval. +// Expects global environment. +var no_touch = 0; +eval('var no_touch = 3;'); +assertSame(3, no_touch); + +// Test global indirect non-strict eval. +// Expects global environment. +var no_touch = 0; +evil('var no_touch = 4;'); +assertSame(4, no_touch); + +// Test non-global direct strict eval in non-strict function. +// Expects new environment. +var no_touch = 0; +(function() { + var no_touch = 0; + eval('"use strict"; var no_touch = 5;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global indirect strict eval in non-strict function. +// Expects new environment. +var no_touch = 0; +(function() { + var no_touch = 0; + evil('"use strict"; var no_touch = 6;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global direct non-strict eval in non-strict function. +// Expects function environment. +var no_touch = 0; +(function() { + var no_touch = 0; + eval('var no_touch = 7;'); + assertSame(7, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global indirect non-strict eval in non-strict function. +// Expects global environment. +var no_touch = 0; +(function() { + var no_touch = 0; + evil('var no_touch = 8;'); + assertSame(0, no_touch); +})() +assertSame(8, no_touch); + +// Test non-global direct strict eval in strict function. +// Expects new environment. +var no_touch = 0; +(function() { + "use strict"; + var no_touch = 0; + eval('"use strict"; var no_touch = 9;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global indirect strict eval in strict function. +// Expects new environment. +var no_touch = 0; +(function() { + "use strict"; + var no_touch = 0; + evil('"use strict"; var no_touch = 10;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global direct non-strict eval in strict function. +// Expects new environment. +var no_touch = 0; +(function() { + "use strict"; + var no_touch = 0; + eval('var no_touch = 11;'); + assertSame(0, no_touch); +})() +assertSame(0, no_touch); + +// Test non-global indirect non-strict eval in strict function. +// Expects global environment. +var no_touch = 0; +(function() { + "use strict"; + var no_touch = 0; + evil('var no_touch = 12;'); + assertSame(0, no_touch); +})() +assertSame(12, no_touch); diff --git a/deps/v8/test/mjsunit/regress/regress-1973.js b/deps/v8/test/mjsunit/regress/regress-1973.js new file mode 100644 index 000000000..8708bf127 --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-1973.js @@ -0,0 +1,52 @@ +// Copyright 2012 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. + +// Test that getters and setters pass unwrapped this values in strict mode +// and wrapped this values is non-strict mode. + +function TestAccessorWrapping(primitive) { + var prototype = Object.getPrototypeOf(Object(primitive)) + // Check that strict mode passes unwrapped this value. + var strict_type = typeof primitive; + Object.defineProperty(prototype, "strict", { + get: function() { "use strict"; assertSame(strict_type, typeof this); }, + set: function() { "use strict"; assertSame(strict_type, typeof this); } + }); + primitive.strict = primitive.strict; + // Check that non-strict mode passes wrapped this value. + var sloppy_type = typeof Object(primitive); + Object.defineProperty(prototype, "sloppy", { + get: function() { assertSame(sloppy_type, typeof this); }, + set: function() { assertSame(sloppy_type, typeof this); } + }); + primitive.sloppy = primitive.sloppy; +} + +TestAccessorWrapping(true); +TestAccessorWrapping(0); +TestAccessorWrapping({}); +TestAccessorWrapping(""); diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-119926.js b/deps/v8/test/mjsunit/regress/regress-crbug-119926.js new file mode 100644 index 000000000..26b84fad7 --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-crbug-119926.js @@ -0,0 +1,33 @@ +// Copyright 2012 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. + +// Test that array elements don't break upon garbage collection. + +var a = new Array(500); +for (var i = 0; i < 500000; i++) { + a[i] = new Object(); +} diff --git a/deps/v8/test/mjsunit/regress/regress-sqrt.js b/deps/v8/test/mjsunit/regress/regress-sqrt.js new file mode 100644 index 000000000..f2a7e5524 --- /dev/null +++ b/deps/v8/test/mjsunit/regress/regress-sqrt.js @@ -0,0 +1,47 @@ +// Copyright 2012 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: --allow-natives-syntax + +// Check that Math.sqrt returns the same value regardless of being +// optimized or not. + +function f(x) { + return Math.sqrt(x); +} + +var x = 7.0506280066499245e-233; + +var a = f(x); + +f(0.1); +f(0.2); +%OptimizeFunctionOnNextCall(f); + +var b = f(x); + +assertEquals(a, b); diff --git a/deps/v8/test/mozilla/mozilla.status b/deps/v8/test/mozilla/mozilla.status index cc2925d66..e64959acf 100644 --- a/deps/v8/test/mozilla/mozilla.status +++ b/deps/v8/test/mozilla/mozilla.status @@ -69,6 +69,9 @@ js1_5/Array/regress-465980-02: SKIP ecma_3/Date/15.9.3.2-1: SKIP js1_2/function/Number: SKIP +# TODO(2018): Temporarily allow timeout in debug mode. +js1_5/GC/regress-203278-2: PASS || TIMEOUT if $mode == debug + ##################### SLOW TESTS ##################### # This takes a long time to run (~100 seconds). It should only be run diff --git a/deps/v8/test/test262/test262.status b/deps/v8/test/test262/test262.status index 1a8a8dc7d..67607fff9 100644 --- a/deps/v8/test/test262/test262.status +++ b/deps/v8/test/test262/test262.status @@ -33,9 +33,6 @@ def FAIL_OK = FAIL, OKAY # '__proto__' should be treated as a normal property in JSON. S15.12.2_A1: FAIL -# V8 Bug: http://code.google.com/p/v8/issues/detail?id=1624 -S10.4.2.1_A1: FAIL - # V8 Bug: http://code.google.com/p/v8/issues/detail?id=1475 15.2.3.6-4-405: FAIL 15.2.3.6-4-410: FAIL @@ -73,6 +70,19 @@ S7.8.4_A7.2_T6: FAIL_OK S8.5_A2.2: PASS if ($system != linux || $arch == x64), FAIL_OK if ($system == linux && $arch != x64) S8.5_A2.1: PASS if ($system != linux || $arch == x64), FAIL_OK if ($system == linux && $arch != x64) +############################ INVALID TESTS ############################# + +# The reference value calculated by Test262 is incorrect if you run these tests +# in PST/PDT between first Sunday in March and first Sunday in April. The DST +# switch was moved in 2007 whereas Test262 bases the reference value on 2000. +# Test262 Bug: https://bugs.ecmascript.org/show_bug.cgi?id=293 +S15.9.3.1_A5_T1: PASS || FAIL_OK +S15.9.3.1_A5_T2: PASS || FAIL_OK +S15.9.3.1_A5_T3: PASS || FAIL_OK +S15.9.3.1_A5_T4: PASS || FAIL_OK +S15.9.3.1_A5_T5: PASS || FAIL_OK +S15.9.3.1_A5_T6: PASS || FAIL_OK + ############################ SKIPPED TESTS ############################# # These tests take a looong time to run in debug mode. |