Introduce ASSERT_ENABLED macro.

Source/wtf/BloomFilter.h

 /*
  * Copyright (C) 2011 Apple 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:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 46 matching lines @@
     void clear();
 
     void add(const AtomicString& string) { add(string.impl()->existingHash()); }
     void add(const String& string) { add(string.impl()->hash()); }
     void remove(const AtomicString& string) { remove(string.impl()->existingHash()); }
     void remove(const String& string) { remove(string.impl()->hash()); }
 
     bool mayContain(const AtomicString& string) const { return mayContain(string.impl()->existingHash()); }
     bool mayContain(const String& string) const { return mayContain(string.impl()->hash()); }
 
-#if !ASSERT_DISABLED
+#if ASSERT_ENABLED
     // Slow.
     bool likelyEmpty() const;
     bool isClear() const;
 #endif
 
 private:
     uint8_t& firstSlot(unsigned hash) { return m_table[hash & keyMask]; }
     uint8_t& secondSlot(unsigned hash) { return m_table[(hash >> 16) & keyMask]; }
     const uint8_t& firstSlot(unsigned hash) const { return m_table[hash & keyMask]; }
     const uint8_t& secondSlot(unsigned hash) const { return m_table[(hash >> 16) & keyMask]; }
@@ skipping 25 matching lines @@
     if (LIKELY(second < maximumCount()))
         --second;
 }
 
 template <unsigned keyBits>
 inline void BloomFilter<keyBits>::clear()
 {
     memset(m_table, 0, tableSize);
 }
 
-#if !ASSERT_DISABLED
+#if ASSERT_ENABLED
 template <unsigned keyBits>
 bool BloomFilter<keyBits>::likelyEmpty() const
 {
     for (size_t n = 0; n < tableSize; ++n) {
         if (m_table[n] && m_table[n] != maximumCount())
             return false;
     }
     return true;
 }
 
 template <unsigned keyBits>
 bool BloomFilter<keyBits>::isClear() const
 {
     for (size_t n = 0; n < tableSize; ++n) {
         if (m_table[n])
             return false;
     }
     return true;
 }
 #endif
 
 }
 
 using WTF::BloomFilter;
 
 #endif