Replace RenderArena with PartitionAlloc

Source/core/platform/text/BidiRunList.h

 /*
  * Copyright (C) 2000 Lars Knoll (knoll@kde.org)
  * Copyright (C) 2003, 2004, 2006, 2007, 2008 Apple Inc.  All right reserved.
  * Copyright (C) 2011 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 149 matching lines @@
 
     newRuns.lastRun()->setNext(toReplace->next());
 
     // Fix up any of other pointers which may now be stale.
     if (m_lastRun == toReplace)
         m_lastRun = newRuns.lastRun();
     if (m_logicallyLastRun == toReplace)
         m_logicallyLastRun = newRuns.logicallyLastRun();
     m_runCount += newRuns.runCount() - 1; // We added the new runs and removed toReplace.
 
-    toReplace->destroy();
+    delete toReplace;
     newRuns.clearWithoutDestroyingRuns();
 }
 
 template <class Run>
 void BidiRunList<Run>::clearWithoutDestroyingRuns()
 {
     m_firstRun = 0;
     m_lastRun = 0;
     m_logicallyLastRun = 0;
     m_runCount = 0;
 }
 
 template <class Run>
 void BidiRunList<Run>::deleteRuns()
 {
     if (!m_firstRun)
         return;
 
     Run* curr = m_firstRun;
     while (curr) {
         Run* s = curr->next();
-        curr->destroy();
+        delete curr;
         curr = s;
     }
 
     m_firstRun = 0;
     m_lastRun = 0;
     m_runCount = 0;
 }
 
 template <class Run>
 void BidiRunList<Run>::reverseRuns(unsigned start, unsigned end)
@@ skipping 41 matching lines @@
         m_firstRun = endRun;
 
     startRun->m_next = afterEnd;
     if (!afterEnd)
         m_lastRun = startRun;
 }
 
 } // namespace WebCore
 
 #endif // BidiRunList