Trivial changes to default Vector sizing in the shadow area.

Source/core/dom/shadow/ElementShadow.cpp

 /*
  * Copyright (C) 2012 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Neither the name of Google Inc. nor the names of its
@@ skipping 176 matching lines @@
             pool.append(insertionPoint->at(i));
     } else {
         for (Node* fallbackNode = insertionPoint->firstChild(); fallbackNode; fallbackNode = fallbackNode->nextSibling())
             pool.append(fallbackNode);
     }
 }
 
 void ElementShadow::distribute()
 {
     Vector<Node*> pool;
+    pool.reserveInitialCapacity(32);
     for (Node* node = host()->firstChild(); node; node = node->nextSibling())
         populate(node, pool);
 
     host()->setNeedsStyleRecalc();
 
-    Vector<bool> distributed(pool.size());
-    distributed.fill(false);
+    Vector<bool> distributed;
+    distributed.fill(false, pool.size());
 
-    Vector<HTMLShadowElement*, 8> activeShadowInsertionPoints;
+    Vector<HTMLShadowElement*, 32> activeShadowInsertionPoints;
     for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot()) {
         HTMLShadowElement* firstActiveShadowInsertionPoint = 0;
 
         const Vector<RefPtr<InsertionPoint> >& insertionPoints = root->childInsertionPoints();
         for (size_t i = 0; i < insertionPoints.size(); ++i) {
             InsertionPoint* point = insertionPoints[i].get();
             if (!point->isActive())
                 continue;
 
             if (isHTMLShadowElement(point)) {
@@ skipping 59 matching lines @@
 }
 
 void ElementShadow::distributeNodeChildrenTo(InsertionPoint* insertionPoint, ContainerNode* containerNode)
 {
     ContentDistribution distribution;
     for (Node* node = containerNode->firstChild(); node; node = node->nextSibling()) {
         if (isActiveInsertionPoint(node)) {
             InsertionPoint* innerInsertionPoint = toInsertionPoint(node);
             if (innerInsertionPoint->hasDistribution()) {
                 for (size_t i = 0; i < innerInsertionPoint->size(); ++i) {
-                    distribution.append(innerInsertionPoint->at(i));
-                    m_nodeToInsertionPoint.add(innerInsertionPoint->at(i), insertionPoint);
+                    Node* nodeToAdd = innerInsertionPoint->at(i);
+                    distribution.append(nodeToAdd);
+                    m_nodeToInsertionPoint.add(nodeToAdd, insertionPoint);
                 }
             } else {
                 for (Node* child = innerInsertionPoint->firstChild(); child; child = child->nextSibling()) {
                     distribution.append(child);
                     m_nodeToInsertionPoint.add(child, insertionPoint);
                 }
             }
         } else {
             distribution.append(node);
             m_nodeToInsertionPoint.add(node, insertionPoint);
@@ skipping 51 matching lines @@
 
 void ElementShadow::clearDistribution()
 {
     m_nodeToInsertionPoint.clear();
 
     for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadowRoot())
         root->setInsertionPoint(0);
 }
 
 } // namespace