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 * | 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 80 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
91 // Instance tree handling | 91 // Instance tree handling |
92 void buildShadowAndInstanceTree(SVGElement* target); | 92 void buildShadowAndInstanceTree(SVGElement* target); |
93 void clearInstanceRoot(); | 93 void clearInstanceRoot(); |
94 void buildShadowTree(SVGElement* target, SVGElement* targetInstance, bool fo
undUse); | 94 void buildShadowTree(SVGElement* target, SVGElement* targetInstance, bool fo
undUse); |
95 void clearShadowTree(); | 95 void clearShadowTree(); |
96 bool hasCycleUseReferencing(SVGUseElement*, ContainerNode* targetInstance, S
VGElement*& newTarget); | 96 bool hasCycleUseReferencing(SVGUseElement*, ContainerNode* targetInstance, S
VGElement*& newTarget); |
97 bool expandUseElementsInShadowTree(); | 97 bool expandUseElementsInShadowTree(); |
98 void expandSymbolElementsInShadowTree(); | 98 void expandSymbolElementsInShadowTree(); |
99 void cloneNonMarkupEventListeners(); | 99 void cloneNonMarkupEventListeners(); |
100 | 100 |
101 void transferUseAttributesToReplacedElement(SVGElement* from, SVGElement* to
) const; | |
102 | |
103 void invalidateDependentShadowTrees(); | 101 void invalidateDependentShadowTrees(); |
104 | 102 |
105 bool resourceIsStillLoading() const; | 103 bool resourceIsStillLoading() const; |
106 bool resourceIsValid() const; | 104 bool resourceIsValid() const; |
107 Document* externalDocument() const; | 105 Document* externalDocument() const; |
108 bool instanceTreeIsLoading(const SVGElement*); | 106 bool instanceTreeIsLoading(const SVGElement*); |
109 void notifyFinished(Resource*) override; | 107 void notifyFinished(Resource*) override; |
110 String debugName() const override { return "SVGUseElement"; } | 108 String debugName() const override { return "SVGUseElement"; } |
111 TreeScope* referencedScope() const; | 109 TreeScope* referencedScope() const; |
112 void setDocumentResource(PassRefPtrWillBeRawPtr<DocumentResource>); | 110 void setDocumentResource(PassRefPtrWillBeRawPtr<DocumentResource>); |
113 | 111 |
114 RefPtrWillBeMember<SVGAnimatedLength> m_x; | 112 RefPtrWillBeMember<SVGAnimatedLength> m_x; |
115 RefPtrWillBeMember<SVGAnimatedLength> m_y; | 113 RefPtrWillBeMember<SVGAnimatedLength> m_y; |
116 RefPtrWillBeMember<SVGAnimatedLength> m_width; | 114 RefPtrWillBeMember<SVGAnimatedLength> m_width; |
117 RefPtrWillBeMember<SVGAnimatedLength> m_height; | 115 RefPtrWillBeMember<SVGAnimatedLength> m_height; |
118 | 116 |
119 bool m_haveFiredLoadEvent; | 117 bool m_haveFiredLoadEvent; |
120 bool m_needsShadowTreeRecreation; | 118 bool m_needsShadowTreeRecreation; |
121 RefPtrWillBeMember<SVGElement> m_targetElementInstance; | 119 RefPtrWillBeMember<SVGElement> m_targetElementInstance; |
122 RefPtrWillBeMember<DocumentResource> m_resource; | 120 RefPtrWillBeMember<DocumentResource> m_resource; |
123 }; | 121 }; |
124 | 122 |
125 } // namespace blink | 123 } // namespace blink |
126 | 124 |
127 #endif // SVGUseElement_h | 125 #endif // SVGUseElement_h |
OLD | NEW |