Allow assertions to be enabled in Blink Release builds.

Source/wtf/ListHashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
@@ skipping 199 matching lines @@
 
     // ListHashSetNode has this base class to hold the members because the MSVC
     // compiler otherwise gets into circular template dependencies when trying
     // to do sizeof on a node.
     template<typename ValueArg> class ListHashSetNodeBase {
     protected:
         ListHashSetNodeBase(const ValueArg& value)
             : m_value(value)
             , m_prev(0)
             , m_next(0)
-#ifndef NDEBUG
+#if ENABLE(ASSERT)
             , m_isAllocated(true)
 #endif
         {
         }
 
         template <typename U>
         ListHashSetNodeBase(const U& value)
             : m_value(value)
             , m_prev(0)
             , m_next(0)
-#ifndef NDEBUG
+#if ENABLE(ASSERT)
             , m_isAllocated(true)
 #endif
         {
         }
 
     public:
         ValueArg m_value;
         ListHashSetNodeBase* m_prev;
         ListHashSetNodeBase* m_next;
-#ifndef NDEBUG
+#if ENABLE(ASSERT)
         bool m_isAllocated;
 #endif
     };
 
     // This allocator is only used for non-Heap ListHashSets.
     template<typename ValueArg, size_t inlineCapacity>
     struct ListHashSetAllocator : public DefaultAllocator {
         typedef DefaultAllocator TableAllocator;
         typedef ListHashSetNode<ValueArg, ListHashSetAllocator> Node;
         typedef ListHashSetNodeBase<ValueArg> NodeBase;
@@ skipping 55 matching lines @@
                 }
             }
             m_freeList = next;
 
             return result;
         }
 
         void deallocate(Node* node)
         {
             if (inPool(node)) {
-#ifndef NDEBUG
+#if ENABLE(ASSERT)
                 node->m_isAllocated = false;
 #endif
                 node->m_next = m_freeList;
                 m_freeList = node;
                 return;
             }
 
             fastFree(node);
         }
 
@@ skipping 680 matching lines @@
     struct NeedsTracing<ListHashSet<T, U, V> > {
         static const bool value = false;
     };
 #endif
 
 } // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif /* WTF_ListHashSet_h */