OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 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 186 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
197 if (!root) | 197 if (!root) |
198 root = insertionPoint->containingShadowRoot(); | 198 root = insertionPoint->containingShadowRoot(); |
199 if (root) | 199 if (root) |
200 root->removeChildShadowRoot(); | 200 root->removeChildShadowRoot(); |
201 m_registeredWithParentShadowRoot = false; | 201 m_registeredWithParentShadowRoot = false; |
202 } | 202 } |
203 | 203 |
204 DocumentFragment::removedFrom(insertionPoint); | 204 DocumentFragment::removedFrom(insertionPoint); |
205 } | 205 } |
206 | 206 |
207 void ShadowRoot::childrenChanged(bool changedByParser, Node* beforeChange, Node*
afterChange, int childCountDelta) | 207 void ShadowRoot::childrenChanged(const ChildrenChange& change) |
208 { | 208 { |
209 ContainerNode::childrenChanged(changedByParser, beforeChange, afterChange, c
hildCountDelta); | 209 ContainerNode::childrenChanged(change); |
210 | 210 |
211 checkForSiblingStyleChanges(false, beforeChange, afterChange, childCountDelt
a); | 211 checkForSiblingStyleChanges(change.type == ChildRemoved ? SiblingRemoved : O
ther, change.siblingBeforeChange, change.siblingAfterChange); |
212 | 212 |
213 if (InsertionPoint* point = shadowInsertionPointOfYoungerShadowRoot()) { | 213 if (InsertionPoint* point = shadowInsertionPointOfYoungerShadowRoot()) { |
214 if (ShadowRoot* root = point->containingShadowRoot()) | 214 if (ShadowRoot* root = point->containingShadowRoot()) |
215 root->owner()->setNeedsDistributionRecalc(); | 215 root->owner()->setNeedsDistributionRecalc(); |
216 } | 216 } |
217 } | 217 } |
218 | 218 |
219 void ShadowRoot::registerScopedHTMLStyleChild() | 219 void ShadowRoot::registerScopedHTMLStyleChild() |
220 { | 220 { |
221 ++m_numberOfStyles; | 221 ++m_numberOfStyles; |
(...skipping 115 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
337 void ShadowRoot::trace(Visitor* visitor) | 337 void ShadowRoot::trace(Visitor* visitor) |
338 { | 338 { |
339 visitor->trace(m_prev); | 339 visitor->trace(m_prev); |
340 visitor->trace(m_next); | 340 visitor->trace(m_next); |
341 visitor->trace(m_shadowRootRareData); | 341 visitor->trace(m_shadowRootRareData); |
342 TreeScope::trace(visitor); | 342 TreeScope::trace(visitor); |
343 DocumentFragment::trace(visitor); | 343 DocumentFragment::trace(visitor); |
344 } | 344 } |
345 | 345 |
346 } | 346 } |
OLD | NEW |