Make classes and structures in core/dom fast-allocated.

Source/core/dom/custom/CustomElementProcessingStack.h

 /*
  * Copyright (C) 2013 Google 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
@@ skipping 20 matching lines @@
 #ifndef CustomElementProcessingStack_h
 #define CustomElementProcessingStack_h
 
 #include "core/CoreExport.h"
 #include "core/dom/custom/CustomElementCallbackQueue.h"
 #include "wtf/Vector.h"
 
 namespace blink {
 
 class CORE_EXPORT CustomElementProcessingStack : public NoBaseWillBeGarbageCollectedFinalized<CustomElementProcessingStack> {
+    WTF_MAKE_FAST_ALLOCATED_WILL_BE_REMOVED(CustomElementProcessingStack);
     WTF_MAKE_NONCOPYABLE(CustomElementProcessingStack);
 public:
     // This is stack allocated in many DOM callbacks. Make it cheap.
     class CallbackDeliveryScope {
+        STACK_ALLOCATED();
     public:
         CallbackDeliveryScope()
             : m_savedElementQueueStart(s_elementQueueStart)
         {
             s_elementQueueStart = s_elementQueueEnd;
         }
 
         ~CallbackDeliveryScope()
         {
             if (s_elementQueueStart != s_elementQueueEnd)
@@ skipping 42 matching lines @@
     // The processing stack, flattened. Element queues lower in the
     // stack appear toward the head of the vector. The first element
     // is a null sentinel value.
     static const size_t kNumSentinels = 1;
     WillBeHeapVector<RawPtrWillBeMember<CustomElementCallbackQueue>> m_flattenedProcessingStack;
 };
 
 } // namespace blink
 
 #endif // CustomElementProcessingStack_h