| 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 690 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 701 return; | 701 return; |
| 702 clearInstanceRoot(); | 702 clearInstanceRoot(); |
| 703 scheduleShadowTreeRecreation(); | 703 scheduleShadowTreeRecreation(); |
| 704 invalidateDependentShadowTrees(); | 704 invalidateDependentShadowTrees(); |
| 705 } | 705 } |
| 706 | 706 |
| 707 void SVGUseElement::invalidateDependentShadowTrees() | 707 void SVGUseElement::invalidateDependentShadowTrees() |
| 708 { | 708 { |
| 709 // Recursively invalidate dependent <use> shadow trees | 709 // Recursively invalidate dependent <use> shadow trees |
| 710 const WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement>>& rawInstances =
instancesForElement(); | 710 const WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement>>& rawInstances =
instancesForElement(); |
| 711 Vector<RefPtrWillBeRawPtr<SVGElement>> instances; | 711 WillBeHeapVector<RefPtrWillBeMember<SVGElement>> instances; |
| 712 instances.appendRange(rawInstances.begin(), rawInstances.end()); | 712 instances.appendRange(rawInstances.begin(), rawInstances.end()); |
| 713 for (auto& instance : instances) { | 713 for (auto& instance : instances) { |
| 714 if (RefPtrWillBeRawPtr<SVGUseElement> element = instance->correspondingU
seElement()) { | 714 if (RefPtrWillBeRawPtr<SVGUseElement> element = instance->correspondingU
seElement()) { |
| 715 ASSERT(element->inDocument()); | 715 ASSERT(element->inDocument()); |
| 716 element->invalidateShadowTree(); | 716 element->invalidateShadowTree(); |
| 717 } | 717 } |
| 718 } | 718 } |
| 719 } | 719 } |
| 720 | 720 |
| 721 void SVGUseElement::transferUseAttributesToReplacedElement(SVGElement* from, SVG
Element* to) const | 721 void SVGUseElement::transferUseAttributesToReplacedElement(SVGElement* from, SVG
Element* to) const |
| (...skipping 100 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 822 | 822 |
| 823 if (m_resource) | 823 if (m_resource) |
| 824 m_resource->removeClient(this); | 824 m_resource->removeClient(this); |
| 825 | 825 |
| 826 m_resource = resource; | 826 m_resource = resource; |
| 827 if (m_resource) | 827 if (m_resource) |
| 828 m_resource->addClient(this); | 828 m_resource->addClient(this); |
| 829 } | 829 } |
| 830 | 830 |
| 831 } | 831 } |
| OLD | NEW |