OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2007 Nikolas Zimmermann <zimmermann@kde.org> | 2 * Copyright (C) 2007 Nikolas Zimmermann <zimmermann@kde.org> |
3 * Copyright (C) 2010 Rob Buis <rwlbuis@gmail.com> | 3 * Copyright (C) 2010 Rob Buis <rwlbuis@gmail.com> |
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 110 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
121 clearResourceReferences(); | 121 clearResourceReferences(); |
122 if (!isConnected()) | 122 if (!isConnected()) |
123 return; | 123 return; |
124 | 124 |
125 AtomicString id; | 125 AtomicString id; |
126 Element* target = SVGURIReference::targetElementFromIRIString( | 126 Element* target = SVGURIReference::targetElementFromIRIString( |
127 hrefString(), treeScope(), &id); | 127 hrefString(), treeScope(), &id); |
128 if (!target) { | 128 if (!target) { |
129 // Do not register as pending if we are already pending this resource. | 129 // Do not register as pending if we are already pending this resource. |
130 if (treeScope().ensureSVGTreeScopedResources().isElementPendingResource( | 130 if (treeScope().ensureSVGTreeScopedResources().isElementPendingResource( |
131 this, id)) | 131 *this, id)) |
132 return; | 132 return; |
133 if (!id.isEmpty()) { | 133 if (!id.isEmpty()) { |
134 treeScope().ensureSVGTreeScopedResources().addPendingResource(id, this); | 134 treeScope().ensureSVGTreeScopedResources().addPendingResource(id, *this); |
135 DCHECK(hasPendingResources()); | 135 DCHECK(hasPendingResources()); |
136 } | 136 } |
137 } else if (isSVGPathElement(*target)) { | 137 } else if (isSVGPathElement(*target)) { |
138 // Register us with the target in the dependencies map. Any change of | 138 // Register us with the target in the dependencies map. Any change of |
139 // hrefElement that leads to relayout/repainting now informs us, so we can | 139 // hrefElement that leads to relayout/repainting now informs us, so we can |
140 // react to it. | 140 // react to it. |
141 addReferenceTo(toSVGElement((target))); | 141 addReferenceTo(toSVGElement((target))); |
142 } | 142 } |
143 | 143 |
144 if (LayoutObject* layoutObject = this->layoutObject()) | 144 if (LayoutObject* layoutObject = this->layoutObject()) |
(...skipping 12 matching lines...) Expand all Loading... |
157 if (rootParent->isConnected()) | 157 if (rootParent->isConnected()) |
158 clearResourceReferences(); | 158 clearResourceReferences(); |
159 } | 159 } |
160 | 160 |
161 bool SVGTextPathElement::selfHasRelativeLengths() const { | 161 bool SVGTextPathElement::selfHasRelativeLengths() const { |
162 return m_startOffset->currentValue()->isRelative() || | 162 return m_startOffset->currentValue()->isRelative() || |
163 SVGTextContentElement::selfHasRelativeLengths(); | 163 SVGTextContentElement::selfHasRelativeLengths(); |
164 } | 164 } |
165 | 165 |
166 } // namespace blink | 166 } // namespace blink |
OLD | NEW |