Replace ASSERTs in platform/heap/ with DCHECKs

third_party/WebKit/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 134 matching lines @@
 
    private:
     ThreadState* m_state;
   };
 
   class SweepForbiddenScope final {
     STACK_ALLOCATED();
 
    public:
     explicit SweepForbiddenScope(ThreadState* state) : m_state(state) {
-      ASSERT(!m_state->m_sweepForbidden);
+      DCHECK(!m_state->m_sweepForbidden);
       m_state->m_sweepForbidden = true;
     }
     ~SweepForbiddenScope() {
-      ASSERT(m_state->m_sweepForbidden);
+      DCHECK(m_state->m_sweepForbidden);
       m_state->m_sweepForbidden = false;
     }
 
    private:
     ThreadState* m_state;
   };
 
   void lockThreadAttachMutex();
   void unlockThreadAttachMutex();
 
@@ skipping 20 matching lines @@
     return **s_threadSpecific;
 #else
     uintptr_t dummy;
     uintptr_t addressDiff =
         s_mainThreadStackStart - reinterpret_cast<uintptr_t>(&dummy);
     // This is a fast way to judge if we are in the main thread.
     // If |&dummy| is within |s_mainThreadUnderestimatedStackSize| byte from
     // the stack start of the main thread, we judge that we are in
     // the main thread.
     if (LIKELY(addressDiff < s_mainThreadUnderestimatedStackSize)) {
-      ASSERT(**s_threadSpecific == mainThreadState());
+      DCHECK_EQ(**s_threadSpecific, mainThreadState());
       return mainThreadState();
     }
     // TLS lookup is slow.
     return **s_threadSpecific;
 #endif
   }
 
   static ThreadState* mainThreadState() {
     return reinterpret_cast<ThreadState*>(s_mainThreadStateStorage);
   }
 
   static ThreadState* fromObject(const void*);
 
   bool isMainThread() const { return this == mainThreadState(); }
-#if ENABLE(ASSERT)
+#if DCHECK_IS_ON()
   bool checkThread() const { return m_thread == currentThread(); }
 #endif
 
   ThreadHeap& heap() const { return *m_heap; }
 
   // When ThreadState is detaching from non-main thread its
   // heap is expected to be empty (because it is going away).
   // Perform registered cleanup tasks and garbage collection
   // to sweep away any objects that are left on this heap.
   // We assert that nothing must remain after this cleanup.
@@ skipping 145 matching lines @@
   bool isAtSafePoint() const { return m_atSafePoint; }
 
   void addInterruptor(std::unique_ptr<BlinkGCInterruptor>);
 
   void recordStackEnd(intptr_t* endOfStack) { m_endOfStack = endOfStack; }
 
   // Get one of the heap structures for this thread.
   // The thread heap is split into multiple heap parts based on object types
   // and object sizes.
   BaseArena* arena(int arenaIndex) const {
-    ASSERT(0 <= arenaIndex);
-    ASSERT(arenaIndex < BlinkGC::NumberOfArenas);
+    DCHECK_LE(0, arenaIndex);
+    DCHECK_LT(arenaIndex, BlinkGC::NumberOfArenas);
     return m_arenas[arenaIndex];
   }
 
-#if ENABLE(ASSERT)
+#if DCHECK_IS_ON()
   // Infrastructure to determine if an address is within one of the
   // address ranges for the Blink heap. If the address is in the Blink
   // heap the containing heap page is returned.
   BasePage* findPageFromAddress(Address);
   BasePage* findPageFromAddress(const void* pointer) {
     return findPageFromAddress(
         reinterpret_cast<Address>(const_cast<void*>(pointer)));
   }
 #endif
 
@@ skipping 50 matching lines @@
   }
 
   // By entering a gc-forbidden scope, conservative GCs will not
   // be allowed while handling an out-of-line allocation request.
   // Intended used when constructing subclasses of GC mixins, where
   // the object being constructed cannot be safely traced & marked
   // fully should a GC be allowed while its subclasses are being
   // constructed.
   void enterGCForbiddenScopeIfNeeded(
       GarbageCollectedMixinConstructorMarker* gcMixinMarker) {
-    ASSERT(checkThread());
+    DCHECK(checkThread());
     if (!m_gcMixinMarker) {
       enterMixinConstructionScope();
       m_gcMixinMarker = gcMixinMarker;
     }
   }
   void leaveGCForbiddenScopeIfNeeded(
       GarbageCollectedMixinConstructorMarker* gcMixinMarker) {
-    ASSERT(checkThread());
+    DCHECK(checkThread());
     if (m_gcMixinMarker == gcMixinMarker) {
       leaveMixinConstructionScope();
       m_gcMixinMarker = nullptr;
     }
   }
 
   // vectorBackingArena() returns an arena that the vector allocation should
   // use.  We have four vector arenas and want to choose the best arena here.
   //
   // The goal is to improve the succession rate where expand and
@@ skipping 13 matching lines @@
   // To implement the heuristics, we add an arenaAge to each arena. The arenaAge
   // is updated if:
   //
   // - a vector on the arena is expanded; or
   // - a vector that meets the condition (*) is allocated on the arena
   //
   //   (*) More than 33% of the same type of vectors have been promptly
   //       freed since the last GC.
   //
   BaseArena* vectorBackingArena(size_t gcInfoIndex) {
-    ASSERT(checkThread());
+    DCHECK(checkThread());
     size_t entryIndex = gcInfoIndex & likelyToBePromptlyFreedArrayMask;
     --m_likelyToBePromptlyFreed[entryIndex];
     int arenaIndex = m_vectorBackingArenaIndex;
     // If m_likelyToBePromptlyFreed[entryIndex] > 0, that means that
     // more than 33% of vectors of the type have been promptly freed
     // since the last GC.
     if (m_likelyToBePromptlyFreed[entryIndex] > 0) {
       m_arenaAges[arenaIndex] = ++m_currentArenaAges;
       m_vectorBackingArenaIndex = arenaIndexOfVectorArenaLeastRecentlyExpanded(
           BlinkGC::Vector1ArenaIndex, BlinkGC::Vector4ArenaIndex);
     }
-    ASSERT(isVectorArenaIndex(arenaIndex));
+    DCHECK(isVectorArenaIndex(arenaIndex));
     return m_arenas[arenaIndex];
   }
   BaseArena* expandedVectorBackingArena(size_t gcInfoIndex);
   static bool isVectorArenaIndex(int arenaIndex) {
     return BlinkGC::Vector1ArenaIndex <= arenaIndex &&
            arenaIndex <= BlinkGC::Vector4ArenaIndex;
   }
   void allocationPointAdjusted(int arenaIndex);
   void promptlyFreed(size_t gcInfoIndex);
 
@@ skipping 32 matching lines @@
 
   // Register the pre-finalizer for the |self| object. The class T must have
   // USING_PRE_FINALIZER().
   template <typename T>
   class PrefinalizerRegistration final {
    public:
     PrefinalizerRegistration(T* self) {
       static_assert(sizeof(&T::invokePreFinalizer) > 0,
                     "USING_PRE_FINALIZER(T) must be defined.");
       ThreadState* state = ThreadState::current();
-#if ENABLE(ASSERT)
+#if DCHECK_IS_ON()
       DCHECK(state->checkThread());
 #endif
       DCHECK(!state->sweepForbidden());
       DCHECK(!state->m_orderedPreFinalizers.contains(
           PreFinalizer(self, T::invokePreFinalizer)));
       state->m_orderedPreFinalizers.add(
           PreFinalizer(self, T::invokePreFinalizer));
     }
   };
 
@@ skipping 184 matching lines @@
 template <ThreadAffinity affinity>
 class ThreadStateFor;
 
 template <>
 class ThreadStateFor<MainThreadOnly> {
   STATIC_ONLY(ThreadStateFor);
 
  public:
   static ThreadState* state() {
     // This specialization must only be used from the main thread.
-    ASSERT(ThreadState::current()->isMainThread());
+    DCHECK(ThreadState::current()->isMainThread());
     return ThreadState::mainThreadState();
   }
 };
 
 template <>
 class ThreadStateFor<AnyThread> {
   STATIC_ONLY(ThreadStateFor);
 
  public:
   static ThreadState* state() { return ThreadState::current(); }
 };
 
 }  // namespace blink
 
 #endif  // ThreadState_h