Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 237 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 248 Handle<Smi>(Smi::FromInt(i), isolate)); | 248 Handle<Smi>(Smi::FromInt(i), isolate)); |
| 249 } | 249 } |
| 250 | 250 |
| 251 // Force compacting garbage collection. The subsequent collections are used | 251 // Force compacting garbage collection. The subsequent collections are used |
| 252 // to verify that key references were actually updated. | 252 // to verify that key references were actually updated. |
| 253 CHECK(FLAG_always_compact); | 253 CHECK(FLAG_always_compact); |
| 254 heap->CollectAllGarbage(Heap::kNoGCFlags); | 254 heap->CollectAllGarbage(Heap::kNoGCFlags); |
| 255 heap->CollectAllGarbage(Heap::kNoGCFlags); | 255 heap->CollectAllGarbage(Heap::kNoGCFlags); |
| 256 heap->CollectAllGarbage(Heap::kNoGCFlags); | 256 heap->CollectAllGarbage(Heap::kNoGCFlags); |
| 257 } | 257 } |
| 258 | |
| 259 | |
| 260 TEST(Regress399527) { | |
| 261 CcTest::InitializeVM(); | |
| 262 v8::HandleScope scope(CcTest::isolate()); | |
| 263 Isolate* isolate = CcTest::i_isolate(); | |
| 264 Heap* heap = isolate->heap(); | |
| 265 | |
| 266 { | |
| 267 HandleScope scope(isolate); | |
| 268 Handle<JSWeakMap> weak_map = AllocateJSWeakMap(isolate); | |
| 269 IncrementalMarking* marking = heap->incremental_marking(); | |
| 270 if (marking->IsStopped()) { | |
|
Michael Starzinger
2014/08/04 15:15:37
Please use SimulateIncrementalMarking instead of t
Hannes Payer (out of office)
2014/08/04 15:31:44
Done.
| |
| 271 marking->Start(); | |
| 272 } | |
| 273 | |
| 274 while (!Marking::IsBlack(Marking::MarkBitFrom(*weak_map))) { | |
| 275 marking->Step(MB, IncrementalMarking::NO_GC_VIA_STACK_GUARD); | |
| 276 } | |
| 277 } | |
| 278 // The weak map is marked black here but leaving the handle scope will make | |
| 279 // the object unreachable. Aborting incremental marking will clear all the | |
| 280 // marking bits which makes the weak map garbage. | |
| 281 heap->CollectAllGarbage(Heap::kAbortIncrementalMarkingMask); | |
| 282 } | |
| OLD | NEW |