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

Source/core/layout/line/InlineIterator.h

 /*
  * Copyright (C) 2000 Lars Knoll (knoll@kde.org)
  * Copyright (C) 2003, 2004, 2006, 2007, 2008, 2009, 2010 Apple Inc. All right reserved.
  * Copyright (C) 2010 Google Inc. All rights reserved.
  *
  * 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.
  *
@@ skipping 10 matching lines @@
  */
 
 #ifndef InlineIterator_h
 #define InlineIterator_h
 
 #include "core/layout/BidiRun.h"
 #include "core/layout/LayoutBlockFlow.h"
 #include "core/layout/api/LineLayoutBlockFlow.h"
 #include "core/layout/api/LineLayoutInline.h"
 #include "core/layout/api/LineLayoutText.h"
-
+#include "wtf/Allocator.h"
 #include "wtf/StdLibExtras.h"
 
 namespace blink {
 
 // This class is used to LayoutInline subtrees, stepping by character within the
 // text children. InlineIterator will use bidiNext to find the next LayoutText
 // optionally notifying a BidiResolver every time it steps into/out of a LayoutInline.
 class InlineIterator {
+    ALLOW_ONLY_INLINE_ALLOCATION();
 public:
     enum IncrementRule {
         FastIncrementInIsolatedLayout,
         FastIncrementInTextNode
     };
 
     InlineIterator()
         : m_root(nullptr)
         , m_obj(nullptr)
         , m_nextBreakablePosition(-1)
@@ skipping 279 matching lines @@
     ASSERT(m_obj);
     ASSERT(m_obj.isText());
     ASSERT(m_pos <= LineLayoutText(m_obj).textLength());
     if (m_pos < INT_MAX)
         m_pos++;
 }
 
 // FIXME: This is used by LayoutBlockFlow for simplified layout, and has nothing to do with bidi
 // it shouldn't use functions called bidiFirst and bidiNext.
 class InlineWalker {
+    STACK_ALLOCATED();
 public:
     InlineWalker(LayoutBlockFlow* root)
         : m_root(LineLayoutBlockFlow(root))
         , m_current(nullptr)
         , m_atEndOfInline(false)
     {
         // FIXME: This class should be taught how to do the SkipEmptyInlines codepath as well.
         m_current = bidiFirstIncludingEmptyInlines(m_root);
     }
 
@@ skipping 216 matching lines @@
 {
     return new BidiRun(start, end, obj, resolver.context(), resolver.dir());
 }
 
 enum AppendRunBehavior {
     AppendingFakeRun,
     AppendingRunsForObject
 };
 
 class IsolateTracker {
+    STACK_ALLOCATED();
 public:
     explicit IsolateTracker(BidiRunList<BidiRun>& runs, unsigned nestedIsolateCount)
         : m_nestedIsolateCount(nestedIsolateCount)
         , m_haveAddedFakeRunForRootIsolate(false)
         , m_runs(runs)
     {
     }
 
     void setMidpointStateForRootIsolate(const LineMidpointState& midpointState)
     {
@@ skipping 153 matching lines @@
         m_sor = m_eor;
     }
 
     m_direction = WTF::Unicode::OtherNeutral;
     m_status.eor = WTF::Unicode::OtherNeutral;
 }
 
 }
 
 #endif // InlineIterator_h