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, 2008 Nikolas Zimmermann <zimmermann@kde.org> | 3 * Copyright (C) 2006, 2008 Nikolas Zimmermann <zimmermann@kde.org> |
4 * | 4 * |
5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
9 * | 9 * |
10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
(...skipping 86 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
97 WillBeHeapHashSet<RawPtrWillBeMember<SVGFontFaceElement> > m_svgFontFaceElem
ents; | 97 WillBeHeapHashSet<RawPtrWillBeMember<SVGFontFaceElement> > m_svgFontFaceElem
ents; |
98 // SVGFontFaceElements that are pending and scheduled for removal. | 98 // SVGFontFaceElements that are pending and scheduled for removal. |
99 WillBeHeapHashSet<RefPtrWillBeMember<SVGFontFaceElement> > m_pendingSVGFontF
aceElementsForRemoval; | 99 WillBeHeapHashSet<RefPtrWillBeMember<SVGFontFaceElement> > m_pendingSVGFontF
aceElementsForRemoval; |
100 #endif | 100 #endif |
101 HashMap<AtomicString, RenderSVGResourceContainer*> m_resources; | 101 HashMap<AtomicString, RenderSVGResourceContainer*> m_resources; |
102 WillBeHeapHashMap<AtomicString, OwnPtrWillBeMember<SVGPendingElements> > m_p
endingResources; // Resources that are pending. | 102 WillBeHeapHashMap<AtomicString, OwnPtrWillBeMember<SVGPendingElements> > m_p
endingResources; // Resources that are pending. |
103 WillBeHeapHashMap<AtomicString, OwnPtrWillBeMember<SVGPendingElements> > m_p
endingResourcesForRemoval; // Resources that are pending and scheduled for remov
al. | 103 WillBeHeapHashMap<AtomicString, OwnPtrWillBeMember<SVGPendingElements> > m_p
endingResourcesForRemoval; // Resources that are pending and scheduled for remov
al. |
104 OwnPtr<SVGResourcesCache> m_resourcesCache; | 104 OwnPtr<SVGResourcesCache> m_resourcesCache; |
105 WillBeHeapHashSet<RawPtrWillBeMember<SVGSVGElement> > m_relativeLengthSVGRoo
ts; // Root SVG elements with relative length descendants. | 105 WillBeHeapHashSet<RawPtrWillBeMember<SVGSVGElement> > m_relativeLengthSVGRoo
ts; // Root SVG elements with relative length descendants. |
106 FloatPoint m_translate; | 106 FloatPoint m_translate; |
107 #if ASSERT_ENABLED | 107 #if ENABLE(ASSERT) |
108 bool m_inRelativeLengthSVGRootsInvalidation; | 108 bool m_inRelativeLengthSVGRootsInvalidation; |
109 #endif | 109 #endif |
110 | 110 |
111 public: | 111 public: |
112 // This HashMap contains a list of pending resources. Pending resources, are
such | 112 // This HashMap contains a list of pending resources. Pending resources, are
such |
113 // which are referenced by any object in the SVG document, but do NOT exist
yet. | 113 // which are referenced by any object in the SVG document, but do NOT exist
yet. |
114 // For instance, dynamically build gradients / patterns / clippers... | 114 // For instance, dynamically build gradients / patterns / clippers... |
115 void addPendingResource(const AtomicString& id, Element*); | 115 void addPendingResource(const AtomicString& id, Element*); |
116 bool hasPendingResource(const AtomicString& id) const; | 116 bool hasPendingResource(const AtomicString& id) const; |
117 bool isElementPendingResources(Element*) const; | 117 bool isElementPendingResources(Element*) const; |
118 bool isElementPendingResource(Element*, const AtomicString& id) const; | 118 bool isElementPendingResource(Element*, const AtomicString& id) const; |
119 void clearHasPendingResourcesIfPossible(Element*); | 119 void clearHasPendingResourcesIfPossible(Element*); |
120 void removeElementFromPendingResources(Element*); | 120 void removeElementFromPendingResources(Element*); |
121 PassOwnPtrWillBeRawPtr<SVGPendingElements> removePendingResource(const Atomi
cString& id); | 121 PassOwnPtrWillBeRawPtr<SVGPendingElements> removePendingResource(const Atomi
cString& id); |
122 | 122 |
123 void serviceAnimations(double monotonicAnimationStartTime); | 123 void serviceAnimations(double monotonicAnimationStartTime); |
124 | 124 |
125 // The following two functions are used for scheduling a pending resource to
be removed. | 125 // The following two functions are used for scheduling a pending resource to
be removed. |
126 void markPendingResourcesForRemoval(const AtomicString&); | 126 void markPendingResourcesForRemoval(const AtomicString&); |
127 Element* removeElementFromPendingResourcesForRemoval(const AtomicString&); | 127 Element* removeElementFromPendingResourcesForRemoval(const AtomicString&); |
128 | 128 |
129 private: | 129 private: |
130 PassOwnPtrWillBeRawPtr<SVGPendingElements> removePendingResourceForRemoval(c
onst AtomicString&); | 130 PassOwnPtrWillBeRawPtr<SVGPendingElements> removePendingResourceForRemoval(c
onst AtomicString&); |
131 }; | 131 }; |
132 | 132 |
133 } | 133 } |
134 | 134 |
135 #endif | 135 #endif |
OLD | NEW |