OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2006 Apple Inc. All rights reserved. | 2 * Copyright (C) 2006 Apple Inc. All rights reserved. |
3 * Copyright (C) 2006 Nikolas Zimmermann <zimmermann@kde.org> | 3 * Copyright (C) 2006 Nikolas Zimmermann <zimmermann@kde.org> |
4 * Copyright (C) 2007 Rob Buis <buis@kde.org> | 4 * Copyright (C) 2007 Rob Buis <buis@kde.org> |
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 393 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
404 return m_relativeLengthSVGRoots.contains(svgRoot); | 404 return m_relativeLengthSVGRoots.contains(svgRoot); |
405 } | 405 } |
406 | 406 |
407 void SVGDocumentExtensions::invalidateSVGRootsWithRelativeLengthDescendents(Subt
reeLayoutScope* scope) | 407 void SVGDocumentExtensions::invalidateSVGRootsWithRelativeLengthDescendents(Subt
reeLayoutScope* scope) |
408 { | 408 { |
409 ASSERT(!m_inRelativeLengthSVGRootsInvalidation); | 409 ASSERT(!m_inRelativeLengthSVGRootsInvalidation); |
410 #if !ASSERT_DISABLED | 410 #if !ASSERT_DISABLED |
411 TemporaryChange<bool> inRelativeLengthSVGRootsChange(m_inRelativeLengthSVGRo
otsInvalidation, true); | 411 TemporaryChange<bool> inRelativeLengthSVGRootsChange(m_inRelativeLengthSVGRo
otsInvalidation, true); |
412 #endif | 412 #endif |
413 | 413 |
414 HashSet<SVGSVGElement*>::iterator end = m_relativeLengthSVGRoots.end(); | 414 WillBeHeapHashSet<RawPtrWillBeMember<SVGSVGElement> >::iterator end = m_rela
tiveLengthSVGRoots.end(); |
415 for (HashSet<SVGSVGElement*>::iterator it = m_relativeLengthSVGRoots.begin()
; it != end; ++it) | 415 for (WillBeHeapHashSet<RawPtrWillBeMember<SVGSVGElement> >::iterator it = m_
relativeLengthSVGRoots.begin(); it != end; ++it) |
416 (*it)->invalidateRelativeLengthClients(scope); | 416 (*it)->invalidateRelativeLengthClients(scope); |
417 } | 417 } |
418 | 418 |
419 #if ENABLE(SVG_FONTS) | 419 #if ENABLE(SVG_FONTS) |
420 void SVGDocumentExtensions::registerSVGFontFaceElement(SVGFontFaceElement* eleme
nt) | 420 void SVGDocumentExtensions::registerSVGFontFaceElement(SVGFontFaceElement* eleme
nt) |
421 { | 421 { |
422 m_svgFontFaceElements.add(element); | 422 m_svgFontFaceElements.add(element); |
423 } | 423 } |
424 | 424 |
425 void SVGDocumentExtensions::unregisterSVGFontFaceElement(SVGFontFaceElement* ele
ment) | 425 void SVGDocumentExtensions::unregisterSVGFontFaceElement(SVGFontFaceElement* ele
ment) |
(...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
476 { | 476 { |
477 ASSERT(m_document); | 477 ASSERT(m_document); |
478 return rootElement(*m_document); | 478 return rootElement(*m_document); |
479 } | 479 } |
480 | 480 |
481 void SVGDocumentExtensions::trace(Visitor* visitor) | 481 void SVGDocumentExtensions::trace(Visitor* visitor) |
482 { | 482 { |
483 visitor->trace(m_timeContainers); | 483 visitor->trace(m_timeContainers); |
484 visitor->trace(m_svgFontFaceElements); | 484 visitor->trace(m_svgFontFaceElements); |
485 visitor->trace(m_pendingSVGFontFaceElementsForRemoval); | 485 visitor->trace(m_pendingSVGFontFaceElementsForRemoval); |
| 486 visitor->trace(m_relativeLengthSVGRoots); |
486 } | 487 } |
487 | 488 |
488 } | 489 } |
OLD | NEW |