Oilpan: add assert to verify eager finalization.

Source/platform/heap/ThreadState.h

 /*
  * Copyright (C) 2013 Google Inc. 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
@@ skipping 220 matching lines @@
             m_state->leaveNoAllocationScope();
         }
     private:
         ThreadState* m_state;
     };
 
     class SweepForbiddenScope final {
     public:
         explicit SweepForbiddenScope(ThreadState* state) : m_state(state)
         {
-            ASSERT(!m_state->m_sweepForbidden);
-            m_state->m_sweepForbidden = true;
+            ASSERT(!m_state->m_isSweepForbidden);
+            m_state->m_isSweepForbidden = true;
         }
         ~SweepForbiddenScope()
         {
-            ASSERT(m_state->m_sweepForbidden);
-            m_state->m_sweepForbidden = false;
+            ASSERT(m_state->m_isSweepForbidden);
+            m_state->m_isSweepForbidden = false;
         }
     private:
         ThreadState* m_state;
     };
 
     // The set of ThreadStates for all threads attached to the Blink
     // garbage collector.
     using AttachedThreadStateSet = HashSet<ThreadState*>;
     static AttachedThreadStateSet& attachedThreads();
     static RecursiveMutex& threadAttachMutex();
@@ skipping 109 matching lines @@
     bool isAllocationAllowed() const { return !isAtSafePoint() && !m_noAllocationCount; }
     void enterNoAllocationScope() { m_noAllocationCount++; }
     void leaveNoAllocationScope() { m_noAllocationCount--; }
     bool isGCForbidden() const { return m_gcForbiddenCount; }
     void enterGCForbiddenScope() { m_gcForbiddenCount++; }
     void leaveGCForbiddenScope()
     {
         ASSERT(m_gcForbiddenCount > 0);
         m_gcForbiddenCount--;
     }
-    bool sweepForbidden() const { return m_sweepForbidden; }
+    bool sweepForbidden() const { return m_isSweepForbidden; }
+
+#if ENABLE(ASSERT)
+    bool isEagerlySweeping() const { return m_isEagerlySweeping; }
+    void enterEagerSweepScope()
+    {
+        ASSERT(!m_isEagerlySweeping);
+        m_isEagerlySweeping = true;
+    }
+    void leaveEagerSweepScope()
+    {
+        ASSERT(m_isEagerlySweeping);
+        m_isEagerlySweeping = false;
+    }
+#endif
 
     void prepareRegionTree();
     void flushHeapDoesNotContainCacheIfNeeded();
 
     // Safepoint related functionality.
     //
     // When a thread attempts to perform GC it needs to stop all other threads
     // that use the heap or at least guarantee that they will not touch any
     // heap allocated object until GC is complete.
     //
@@ skipping 314 matching lines @@
     // and lazily construct ThreadState in it using placement new.
     static uint8_t s_mainThreadStateStorage[];
 
     ThreadIdentifier m_thread;
     OwnPtr<PersistentNode> m_persistents;
     StackState m_stackState;
     intptr_t* m_startOfStack;
     intptr_t* m_endOfStack;
     void* m_safePointScopeMarker;
     Vector<Address> m_safePointStackCopy;
-    bool m_atSafePoint;
     Vector<Interruptor*> m_interruptors;
-    bool m_sweepForbidden;
+
     size_t m_noAllocationCount;
     size_t m_gcForbiddenCount;
+
     BaseHeap* m_heaps[NumberOfHeaps];
 
     int m_vectorBackingHeapIndex;
     size_t m_heapAges[NumberOfHeaps];
     size_t m_currentHeapAges;
 
-    bool m_isTerminating;
     GarbageCollectedMixinConstructorMarker* m_gcMixinMarker;
 
     bool m_shouldFlushHeapDoesNotContainCache;
     GCState m_gcState;
 
     CallbackStack* m_threadLocalWeakCallbackStack;
     HashMap<void*, bool (*)(void*, Visitor&)> m_preFinalizers;
 
     v8::Isolate* m_isolate;
     void (*m_traceDOMWrappers)(v8::Isolate*, Visitor*);
 
 #if defined(ADDRESS_SANITIZER)
     void* m_asanFakeStack;
 #endif
 
     Vector<PageMemoryRegion*> m_allocatedRegionsSinceLastGC;
 
 #if ENABLE(GC_PROFILING)
     double m_nextFreeListSnapshotTime;
 #endif
     // Ideally we want to allocate an array of size |gcInfoTableMax| but it will
     // waste memory. Thus we limit the array size to 2^8 and share one entry
     // with multiple types of vectors. This won't be an issue in practice,
     // since there will be less than 2^8 types of objects in common cases.
     static const int likelyToBePromptlyFreedArraySize = (1 << 8);
     static const int likelyToBePromptlyFreedArrayMask = likelyToBePromptlyFreedArraySize - 1;
     OwnPtr<int[]> m_likelyToBePromptlyFreed;
+
+    bool m_atSafePoint;
+    bool m_isTerminating;
+    bool m_isSweepForbidden;
+#if ENABLE(ASSERT)
+    bool m_isEagerlySweeping;
+#endif
 };
 
 template<ThreadAffinity affinity> class ThreadStateFor;
 
 template<> class ThreadStateFor<MainThreadOnly> {
 public:
     static ThreadState* state()
     {
         // This specialization must only be used from the main thread.
         ASSERT(ThreadState::current()->isMainThread());
         return ThreadState::mainThreadState();
     }
 };
 
 template<> class ThreadStateFor<AnyThread> {
 public:
     static ThreadState* state() { return ThreadState::current(); }
 };
 
 } // namespace blink
 
 #endif // ThreadState_h