OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2004, 2005, 2006, 2007 Nikolas Zimmermann <zimmermann@kde.org> | 2 * Copyright (C) 2004, 2005, 2006, 2007 Nikolas Zimmermann <zimmermann@kde.org> |
3 * Copyright (C) 2004, 2005, 2006 Rob Buis <buis@kde.org> | 3 * Copyright (C) 2004, 2005, 2006 Rob Buis <buis@kde.org> |
4 * Copyright (C) 2006 Samuel Weinig <sam.weinig@gmail.com> | 4 * Copyright (C) 2006 Samuel Weinig <sam.weinig@gmail.com> |
5 * Copyright (C) 2009 Dirk Schulze <krit@webkit.org> | 5 * Copyright (C) 2009 Dirk Schulze <krit@webkit.org> |
6 * Copyright (C) Research In Motion Limited 2010. All rights reserved. | 6 * Copyright (C) Research In Motion Limited 2010. All rights reserved. |
7 * | 7 * |
8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
(...skipping 119 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
130 if (RenderObject* object = renderer()) | 130 if (RenderObject* object = renderer()) |
131 object->setNeedsLayoutAndFullPaintInvalidation(); | 131 object->setNeedsLayoutAndFullPaintInvalidation(); |
132 } | 132 } |
133 | 133 |
134 RenderObject* SVGFilterElement::createRenderer(RenderStyle*) | 134 RenderObject* SVGFilterElement::createRenderer(RenderStyle*) |
135 { | 135 { |
136 RenderSVGResourceFilter* renderer = new RenderSVGResourceFilter(this); | 136 RenderSVGResourceFilter* renderer = new RenderSVGResourceFilter(this); |
137 | 137 |
138 WillBeHeapHashSet<RefPtrWillBeMember<Node> >::iterator layerEnd = m_clientsT
oAdd.end(); | 138 WillBeHeapHashSet<RefPtrWillBeMember<Node> >::iterator layerEnd = m_clientsT
oAdd.end(); |
139 for (WillBeHeapHashSet<RefPtrWillBeMember<Node> >::iterator it = m_clientsTo
Add.begin(); it != layerEnd; ++it) | 139 for (WillBeHeapHashSet<RefPtrWillBeMember<Node> >::iterator it = m_clientsTo
Add.begin(); it != layerEnd; ++it) |
140 renderer->addClientRenderLayer(it->get()); | 140 renderer->addClient(it->get()->renderer()); |
141 m_clientsToAdd.clear(); | 141 m_clientsToAdd.clear(); |
142 | 142 |
143 return renderer; | 143 return renderer; |
144 } | 144 } |
145 | 145 |
146 bool SVGFilterElement::selfHasRelativeLengths() const | 146 bool SVGFilterElement::selfHasRelativeLengths() const |
147 { | 147 { |
148 return m_x->currentValue()->isRelative() | 148 return m_x->currentValue()->isRelative() |
149 || m_y->currentValue()->isRelative() | 149 || m_y->currentValue()->isRelative() |
150 || m_width->currentValue()->isRelative() | 150 || m_width->currentValue()->isRelative() |
151 || m_height->currentValue()->isRelative(); | 151 || m_height->currentValue()->isRelative(); |
152 } | 152 } |
153 | 153 |
154 void SVGFilterElement::addClient(Node* client) | 154 void SVGFilterElement::addClient(Node* client) |
155 { | 155 { |
156 ASSERT(client); | 156 ASSERT(client); |
157 m_clientsToAdd.add(client); | 157 m_clientsToAdd.add(client); |
158 } | 158 } |
159 | 159 |
160 void SVGFilterElement::removeClient(Node* client) | 160 void SVGFilterElement::removeClient(Node* client) |
161 { | 161 { |
162 ASSERT(client); | 162 ASSERT(client); |
163 m_clientsToAdd.remove(client); | 163 m_clientsToAdd.remove(client); |
164 } | 164 } |
165 | 165 |
166 } | 166 } |
OLD | NEW |