| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 796 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 807 | 807 |
| 808 obj->SetProperty( | 808 obj->SetProperty( |
| 809 *first, Smi::FromInt(1), NONE, kNonStrictMode)->ToObjectChecked(); | 809 *first, Smi::FromInt(1), NONE, kNonStrictMode)->ToObjectChecked(); |
| 810 obj->SetProperty( | 810 obj->SetProperty( |
| 811 *second, Smi::FromInt(2), NONE, kNonStrictMode)->ToObjectChecked(); | 811 *second, Smi::FromInt(2), NONE, kNonStrictMode)->ToObjectChecked(); |
| 812 | 812 |
| 813 obj->SetElement(0, *first, NONE, kNonStrictMode)->ToObjectChecked(); | 813 obj->SetElement(0, *first, NONE, kNonStrictMode)->ToObjectChecked(); |
| 814 obj->SetElement(1, *second, NONE, kNonStrictMode)->ToObjectChecked(); | 814 obj->SetElement(1, *second, NONE, kNonStrictMode)->ToObjectChecked(); |
| 815 | 815 |
| 816 // Make the clone. | 816 // Make the clone. |
| 817 Handle<JSObject> clone = Copy(obj); | 817 Handle<JSObject> clone = JSObject::Copy(obj); |
| 818 CHECK(!clone.is_identical_to(obj)); | 818 CHECK(!clone.is_identical_to(obj)); |
| 819 | 819 |
| 820 CHECK_EQ(obj->GetElement(isolate, 0), clone->GetElement(isolate, 0)); | 820 CHECK_EQ(obj->GetElement(isolate, 0), clone->GetElement(isolate, 0)); |
| 821 CHECK_EQ(obj->GetElement(isolate, 1), clone->GetElement(isolate, 1)); | 821 CHECK_EQ(obj->GetElement(isolate, 1), clone->GetElement(isolate, 1)); |
| 822 | 822 |
| 823 CHECK_EQ(obj->GetProperty(*first), clone->GetProperty(*first)); | 823 CHECK_EQ(obj->GetProperty(*first), clone->GetProperty(*first)); |
| 824 CHECK_EQ(obj->GetProperty(*second), clone->GetProperty(*second)); | 824 CHECK_EQ(obj->GetProperty(*second), clone->GetProperty(*second)); |
| 825 | 825 |
| 826 // Flip the values. | 826 // Flip the values. |
| 827 clone->SetProperty( | 827 clone->SetProperty( |
| (...skipping 2306 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3134 // Unoptimized code is missing and the deoptimizer will go ballistic. | 3134 // Unoptimized code is missing and the deoptimizer will go ballistic. |
| 3135 CompileRun("var g = mkClosure(); g('bozo');"); | 3135 CompileRun("var g = mkClosure(); g('bozo');"); |
| 3136 } | 3136 } |
| 3137 | 3137 |
| 3138 | 3138 |
| 3139 TEST(Regress169209) { | 3139 TEST(Regress169209) { |
| 3140 i::FLAG_stress_compaction = false; | 3140 i::FLAG_stress_compaction = false; |
| 3141 i::FLAG_allow_natives_syntax = true; | 3141 i::FLAG_allow_natives_syntax = true; |
| 3142 i::FLAG_flush_code_incrementally = true; | 3142 i::FLAG_flush_code_incrementally = true; |
| 3143 | 3143 |
| 3144 // Disable loading the i18n extension which breaks the assumptions of this | |
| 3145 // test about the heap layout. | |
| 3146 i::FLAG_enable_i18n = false; | |
| 3147 | |
| 3148 CcTest::InitializeVM(); | 3144 CcTest::InitializeVM(); |
| 3149 Isolate* isolate = Isolate::Current(); | 3145 Isolate* isolate = Isolate::Current(); |
| 3150 Heap* heap = isolate->heap(); | 3146 Heap* heap = isolate->heap(); |
| 3151 HandleScope scope(isolate); | 3147 HandleScope scope(isolate); |
| 3152 | 3148 |
| 3153 // Perform one initial GC to enable code flushing. | 3149 // Perform one initial GC to enable code flushing. |
| 3154 heap->CollectAllGarbage(Heap::kAbortIncrementalMarkingMask); | 3150 heap->CollectAllGarbage(Heap::kAbortIncrementalMarkingMask); |
| 3155 | 3151 |
| 3156 // Prepare a shared function info eligible for code flushing for which | 3152 // Prepare a shared function info eligible for code flushing for which |
| 3157 // the unoptimized code will be replaced during optimization. | 3153 // the unoptimized code will be replaced during optimization. |
| (...skipping 289 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3447 " var a = new Array(n);" | 3443 " var a = new Array(n);" |
| 3448 " for (var i = 0; i < n; i += 100) a[i] = i;" | 3444 " for (var i = 0; i < n; i += 100) a[i] = i;" |
| 3449 "};" | 3445 "};" |
| 3450 "f(10 * 1024 * 1024);"); | 3446 "f(10 * 1024 * 1024);"); |
| 3451 IncrementalMarking* marking = HEAP->incremental_marking(); | 3447 IncrementalMarking* marking = HEAP->incremental_marking(); |
| 3452 if (marking->IsStopped()) marking->Start(); | 3448 if (marking->IsStopped()) marking->Start(); |
| 3453 // This big step should be sufficient to mark the whole array. | 3449 // This big step should be sufficient to mark the whole array. |
| 3454 marking->Step(100 * MB, IncrementalMarking::NO_GC_VIA_STACK_GUARD); | 3450 marking->Step(100 * MB, IncrementalMarking::NO_GC_VIA_STACK_GUARD); |
| 3455 ASSERT(marking->IsComplete()); | 3451 ASSERT(marking->IsComplete()); |
| 3456 } | 3452 } |
| OLD | NEW |