| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008 Nikolas Zimmermann <zimmermann@kde
.org> | 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008 Nikolas Zimmermann <zimmermann@kde
.org> |
| 3 * Copyright (C) 2004, 2005, 2006, 2007 Rob Buis <buis@kde.org> | 3 * Copyright (C) 2004, 2005, 2006, 2007 Rob Buis <buis@kde.org> |
| 4 * Copyright (C) Research In Motion Limited 2009-2010. All rights reserved. | 4 * Copyright (C) Research In Motion Limited 2009-2010. All rights reserved. |
| 5 * Copyright (C) 2011 Torch Mobile (Beijing) Co. Ltd. All rights reserved. | 5 * Copyright (C) 2011 Torch Mobile (Beijing) Co. Ltd. All rights reserved. |
| 6 * Copyright (C) 2012 University of Szeged | 6 * Copyright (C) 2012 University of Szeged |
| 7 * Copyright (C) 2012 Renata Hodovan <reni@webkit.org> | 7 * Copyright (C) 2012 Renata Hodovan <reni@webkit.org> |
| 8 * | 8 * |
| 9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
| 10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
| (...skipping 686 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 697 { | 697 { |
| 698 if (!inActiveDocument() || m_needsShadowTreeRecreation) | 698 if (!inActiveDocument() || m_needsShadowTreeRecreation) |
| 699 return; | 699 return; |
| 700 scheduleShadowTreeRecreation(); | 700 scheduleShadowTreeRecreation(); |
| 701 invalidateDependentShadowTrees(); | 701 invalidateDependentShadowTrees(); |
| 702 } | 702 } |
| 703 | 703 |
| 704 void SVGUseElement::invalidateDependentShadowTrees() | 704 void SVGUseElement::invalidateDependentShadowTrees() |
| 705 { | 705 { |
| 706 // Recursively invalidate dependent <use> shadow trees | 706 // Recursively invalidate dependent <use> shadow trees |
| 707 const WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> >& instances = in
stancesForElement(); | 707 const WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement>>& instances = ins
tancesForElement(); |
| 708 for (SVGElement* instance : instances) { | 708 for (SVGElement* instance : instances) { |
| 709 if (SVGUseElement* element = instance->correspondingUseElement()) { | 709 if (SVGUseElement* element = instance->correspondingUseElement()) { |
| 710 ASSERT(element->inDocument()); | 710 ASSERT(element->inDocument()); |
| 711 element->invalidateShadowTree(); | 711 element->invalidateShadowTree(); |
| 712 } | 712 } |
| 713 } | 713 } |
| 714 } | 714 } |
| 715 | 715 |
| 716 void SVGUseElement::transferUseAttributesToReplacedElement(SVGElement* from, SVG
Element* to) const | 716 void SVGUseElement::transferUseAttributesToReplacedElement(SVGElement* from, SVG
Element* to) const |
| 717 { | 717 { |
| (...skipping 69 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 787 | 787 |
| 788 if (m_resource) | 788 if (m_resource) |
| 789 m_resource->removeClient(this); | 789 m_resource->removeClient(this); |
| 790 | 790 |
| 791 m_resource = resource; | 791 m_resource = resource; |
| 792 if (m_resource) | 792 if (m_resource) |
| 793 m_resource->addClient(this); | 793 m_resource->addClient(this); |
| 794 } | 794 } |
| 795 | 795 |
| 796 } | 796 } |
| OLD | NEW |