split MEMORY_TOOL_REPLACES_ALLOCATOR into initial size and malloc.

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 320 matching lines @@
         }
 
         static void traceValue(typename DefaultAllocator::Visitor* visitor, Node* node) { }
 
     private:
         Node* pool() { return reinterpret_cast_ptr<Node*>(m_pool.buffer); }
         Node* pastPool() { return pool() + m_poolSize; }
 
         Node* m_freeList;
         bool m_isDoneWithInitialFreeList;
-#if defined(MEMORY_TOOL_REPLACES_ALLOCATOR)
+#if defined(MEMORY_SANITIZER_INITIAL_SIZE)
         // The allocation pool for nodes is one big chunk that ASAN has no
         // insight into, so it can cloak errors. Make it as small as possible
         // to force nodes to be allocated individually where ASAN can see them.
         static const size_t m_poolSize = 1;
 #else
         static const size_t m_poolSize = inlineCapacity;
 #endif
         AlignedBuffer<sizeof(NodeBase) * m_poolSize, WTF_ALIGN_OF(NodeBase)> m_pool;
     };
 
@@ skipping 656 matching lines @@
     struct NeedsTracing<ListHashSet<T, U, V> > {
         static const bool value = false;
     };
 #endif
 
 } // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif /* WTF_ListHashSet_h */