OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
(...skipping 273 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
284 } | 284 } |
285 | 285 |
286 const DestinationInsertionPoints* ElementShadow::destinationInsertionPointsFor(c
onst Node* key) const | 286 const DestinationInsertionPoints* ElementShadow::destinationInsertionPointsFor(c
onst Node* key) const |
287 { | 287 { |
288 NodeToDestinationInsertionPoints::const_iterator it = m_nodeToInsertionPoint
s.find(key); | 288 NodeToDestinationInsertionPoints::const_iterator it = m_nodeToInsertionPoint
s.find(key); |
289 return it == m_nodeToInsertionPoints.end() ? 0: &it->value; | 289 return it == m_nodeToInsertionPoints.end() ? 0: &it->value; |
290 } | 290 } |
291 | 291 |
292 void ElementShadow::distribute() | 292 void ElementShadow::distribute() |
293 { | 293 { |
294 host()->setNeedsStyleRecalc(); | 294 host()->setNeedsStyleRecalc(SubtreeStyleChange); |
295 Vector<HTMLShadowElement*, 32> shadowInsertionPoints; | 295 Vector<HTMLShadowElement*, 32> shadowInsertionPoints; |
296 DistributionPool pool(*host()); | 296 DistributionPool pool(*host()); |
297 | 297 |
298 for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadow
Root()) { | 298 for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadow
Root()) { |
299 HTMLShadowElement* shadowInsertionPoint = 0; | 299 HTMLShadowElement* shadowInsertionPoint = 0; |
300 const Vector<RefPtr<InsertionPoint> >& insertionPoints = root->descendan
tInsertionPoints(); | 300 const Vector<RefPtr<InsertionPoint> >& insertionPoints = root->descendan
tInsertionPoints(); |
301 for (size_t i = 0; i < insertionPoints.size(); ++i) { | 301 for (size_t i = 0; i < insertionPoints.size(); ++i) { |
302 InsertionPoint* point = insertionPoints[i].get(); | 302 InsertionPoint* point = insertionPoints[i].get(); |
303 if (!point->isActive()) | 303 if (!point->isActive()) |
304 continue; | 304 continue; |
(...skipping 81 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
386 | 386 |
387 void ElementShadow::clearDistribution() | 387 void ElementShadow::clearDistribution() |
388 { | 388 { |
389 m_nodeToInsertionPoints.clear(); | 389 m_nodeToInsertionPoints.clear(); |
390 | 390 |
391 for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadow
Root()) | 391 for (ShadowRoot* root = youngestShadowRoot(); root; root = root->olderShadow
Root()) |
392 root->setShadowInsertionPointOfYoungerShadowRoot(0); | 392 root->setShadowInsertionPointOfYoungerShadowRoot(0); |
393 } | 393 } |
394 | 394 |
395 } // namespace | 395 } // namespace |
OLD | NEW |