| Index: third_party/WebKit/Source/wtf/BloomFilter.h
|
| diff --git a/third_party/WebKit/Source/wtf/BloomFilter.h b/third_party/WebKit/Source/wtf/BloomFilter.h
|
| index 131f92ba9e72b0ec308827c7e2b0ee5d9a5d4212..4618304cfb8b56115d5f43321dfc5e2af7bcfc30 100644
|
| --- a/third_party/WebKit/Source/wtf/BloomFilter.h
|
| +++ b/third_party/WebKit/Source/wtf/BloomFilter.h
|
| @@ -75,7 +75,7 @@ class BloomFilter {
|
| return mayContain(string.impl()->hash());
|
| }
|
|
|
| -#if ENABLE(ASSERT)
|
| +#if DCHECK_IS_ON()
|
| // Slow.
|
| bool likelyEmpty() const;
|
| bool isClear() const;
|
| @@ -108,8 +108,8 @@ template <unsigned keyBits>
|
| inline void BloomFilter<keyBits>::remove(unsigned hash) {
|
| uint8_t& first = firstSlot(hash);
|
| uint8_t& second = secondSlot(hash);
|
| - ASSERT(first);
|
| - ASSERT(second);
|
| + DCHECK(first);
|
| + DCHECK(second);
|
| // In case of an overflow, the slot sticks in the table until clear().
|
| if (LIKELY(first < maximumCount()))
|
| --first;
|
| @@ -122,7 +122,7 @@ inline void BloomFilter<keyBits>::clear() {
|
| memset(m_table, 0, tableSize);
|
| }
|
|
|
| -#if ENABLE(ASSERT)
|
| +#if DCHECK_IS_ON()
|
| template <unsigned keyBits>
|
| bool BloomFilter<keyBits>::likelyEmpty() const {
|
| for (size_t n = 0; n < tableSize; ++n) {
|
|
|