OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2007 Eric Seidel <eric@webkit.org> | 2 * Copyright (C) 2007 Eric Seidel <eric@webkit.org> |
3 * Copyright (C) 2007 Rob Buis <buis@kde.org> | 3 * Copyright (C) 2007 Rob Buis <buis@kde.org> |
4 * Copyright (C) 2008 Apple Inc. All rights reserved. | 4 * Copyright (C) 2008 Apple Inc. All rights reserved. |
5 * | 5 * |
6 * This library is free software; you can redistribute it and/or | 6 * This library is free software; you can redistribute it and/or |
7 * modify it under the terms of the GNU Library General Public | 7 * modify it under the terms of the GNU Library General Public |
8 * License as published by the Free Software Foundation; either | 8 * License as published by the Free Software Foundation; either |
9 * version 2 of the License, or (at your option) any later version. | 9 * version 2 of the License, or (at your option) any later version. |
10 * | 10 * |
(...skipping 293 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
304 return; | 304 return; |
305 | 305 |
306 if (RenderObject* renderer = targetElement->renderer()) | 306 if (RenderObject* renderer = targetElement->renderer()) |
307 RenderSVGResource::markForLayoutAndParentResourceInvalidation(renderer); | 307 RenderSVGResource::markForLayoutAndParentResourceInvalidation(renderer); |
308 | 308 |
309 AffineTransform* t = targetElement->supplementalTransform(); | 309 AffineTransform* t = targetElement->supplementalTransform(); |
310 if (!t) | 310 if (!t) |
311 return; | 311 return; |
312 | 312 |
313 // ...except in case where we have additional instances in <use> trees. | 313 // ...except in case where we have additional instances in <use> trees. |
314 const HashSet<SVGElement*>& instances = targetElement->instancesForElement()
; | 314 const WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> >& instances = ta
rgetElement->instancesForElement(); |
315 const HashSet<SVGElement*>::const_iterator end = instances.end(); | 315 const WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> >::const_iterator
end = instances.end(); |
316 for (HashSet<SVGElement*>::const_iterator it = instances.begin(); it != end;
++it) { | 316 for (WillBeHeapHashSet<RawPtrWillBeWeakMember<SVGElement> >::const_iterator
it = instances.begin(); it != end; ++it) { |
317 SVGElement* shadowTreeElement = *it; | 317 SVGElement* shadowTreeElement = *it; |
318 ASSERT(shadowTreeElement); | 318 ASSERT(shadowTreeElement); |
319 AffineTransform* transform = shadowTreeElement->supplementalTransform(); | 319 AffineTransform* transform = shadowTreeElement->supplementalTransform(); |
320 if (!transform) | 320 if (!transform) |
321 continue; | 321 continue; |
322 transform->setMatrix(t->a(), t->b(), t->c(), t->d(), t->e(), t->f()); | 322 transform->setMatrix(t->a(), t->b(), t->c(), t->d(), t->e(), t->f()); |
323 if (RenderObject* renderer = shadowTreeElement->renderer()) { | 323 if (RenderObject* renderer = shadowTreeElement->renderer()) { |
324 renderer->setNeedsTransformUpdate(); | 324 renderer->setNeedsTransformUpdate(); |
325 RenderSVGResource::markForLayoutAndParentResourceInvalidation(render
er); | 325 RenderSVGResource::markForLayoutAndParentResourceInvalidation(render
er); |
326 } | 326 } |
(...skipping 14 matching lines...) Expand all Loading... |
341 | 341 |
342 void SVGAnimateMotionElement::updateAnimationMode() | 342 void SVGAnimateMotionElement::updateAnimationMode() |
343 { | 343 { |
344 if (!m_animationPath.isEmpty()) | 344 if (!m_animationPath.isEmpty()) |
345 setAnimationMode(PathAnimation); | 345 setAnimationMode(PathAnimation); |
346 else | 346 else |
347 SVGAnimationElement::updateAnimationMode(); | 347 SVGAnimationElement::updateAnimationMode(); |
348 } | 348 } |
349 | 349 |
350 } | 350 } |
OLD | NEW |