| 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 53 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 64       value); | 64       value); | 
| 65   weakmap->set_table(*table); | 65   weakmap->set_table(*table); | 
| 66 } | 66 } | 
| 67 | 67 | 
| 68 static int NumberOfWeakCalls = 0; | 68 static int NumberOfWeakCalls = 0; | 
| 69 static void WeakPointerCallback( | 69 static void WeakPointerCallback( | 
| 70     const v8::WeakCallbackData<v8::Value, void>& data) { | 70     const v8::WeakCallbackData<v8::Value, void>& data) { | 
| 71   std::pair<v8::Persistent<v8::Value>*, int>* p = | 71   std::pair<v8::Persistent<v8::Value>*, int>* p = | 
| 72       reinterpret_cast<std::pair<v8::Persistent<v8::Value>*, int>*>( | 72       reinterpret_cast<std::pair<v8::Persistent<v8::Value>*, int>*>( | 
| 73           data.GetParameter()); | 73           data.GetParameter()); | 
| 74   ASSERT_EQ(1234, p->second); | 74   DCHECK_EQ(1234, p->second); | 
| 75   NumberOfWeakCalls++; | 75   NumberOfWeakCalls++; | 
| 76   p->first->Reset(); | 76   p->first->Reset(); | 
| 77 } | 77 } | 
| 78 | 78 | 
| 79 | 79 | 
| 80 TEST(Weakness) { | 80 TEST(Weakness) { | 
| 81   FLAG_incremental_marking = false; | 81   FLAG_incremental_marking = false; | 
| 82   LocalContext context; | 82   LocalContext context; | 
| 83   Isolate* isolate = GetIsolateFrom(&context); | 83   Isolate* isolate = GetIsolateFrom(&context); | 
| 84   Factory* factory = isolate->factory(); | 84   Factory* factory = isolate->factory(); | 
| (...skipping 163 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 } | 
| OLD | NEW | 
|---|