| Index: Source/wtf/HashTable.h
|
| diff --git a/Source/wtf/HashTable.h b/Source/wtf/HashTable.h
|
| index 1e29a606e0508565f3e92587272997452f9c2f65..4ff96014cf1d371edd70792beb761dd3dafdaa42 100644
|
| --- a/Source/wtf/HashTable.h
|
| +++ b/Source/wtf/HashTable.h
|
| @@ -1289,7 +1289,7 @@ template<typename Key, typename Value, typename Extractor, typename HashFunction
|
| // and/or weak callback then we are done. This optimization does not
|
| // happen for ListHashSet since its iterator does not point at the
|
| // backing.
|
| - if (!m_table || visitor->isHeapObjectAlive(m_table))
|
| + if (!m_table || Allocator::isHeapObjectAlive(m_table))
|
| return;
|
| // Normally, we mark the backing store without performing trace. This
|
| // means it is marked live, but the pointers inside it are not marked.
|
|
|