Refactor the Heap into ThreadHeap to prepare for per thread heaps

third_party/WebKit/Source/core/dom/ElementData.h

 /*
  * Copyright (C) 2013 Google Inc. All rights reserved.
  * Copyright (C) 2014 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
@@ skipping 118 matching lines @@
     static PassRefPtrWillBeRawPtr<ShareableElementData> createWithAttributes(const Vector<Attribute>&);
 
     explicit ShareableElementData(const Vector<Attribute>&);
     explicit ShareableElementData(const UniqueElementData&);
     ~ShareableElementData();
 
     DEFINE_INLINE_TRACE_AFTER_DISPATCH() { ElementData::traceAfterDispatch(visitor); }
 
     // Add support for placement new as ShareableElementData is not allocated
     // with a fixed size. Instead the allocated memory size is computed based on
-    // the number of attributes. This requires us to use Heap::allocate directly
+    // the number of attributes. This requires us to use ThreadHeap::allocate directly
     // with the computed size and subsequently call placement new with the
     // allocated memory address.
     void* operator new(std::size_t, void* location)
     {
         return location;
     }
 
     AttributeCollection attributes() const;
 
     Attribute m_attributeArray[0];
@@ skipping 69 matching lines @@
 }
 
 inline MutableAttributeCollection UniqueElementData::attributes()
 {
     return MutableAttributeCollection(m_attributeVector);
 }
 
 } // namespace blink
 
 #endif // ElementData_h