OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2004, 2005, 2006, 2008 Nikolas Zimmermann <zimmermann@kde.org> | 2 * Copyright (C) 2004, 2005, 2006, 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 * Copyright (C) 2008 Eric Seidel <eric@webkit.org> | 4 * Copyright (C) 2008 Eric Seidel <eric@webkit.org> |
5 * Copyright (C) 2008 Dirk Schulze <krit@webkit.org> | 5 * Copyright (C) 2008 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 |
11 * version 2 of the License, or (at your option) any later version. | 11 * version 2 of the License, or (at your option) any later version. |
12 * | 12 * |
13 * This library is distributed in the hope that it will be useful, | 13 * This library is distributed in the hope that it will be useful, |
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
16 * Library General Public License for more details. | 16 * Library General Public License for more details. |
17 * | 17 * |
18 * You should have received a copy of the GNU Library General Public License | 18 * You should have received a copy of the GNU Library General Public License |
19 * along with this library; see the file COPYING.LIB. If not, write to | 19 * along with this library; see the file COPYING.LIB. If not, write to |
20 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 20 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
21 * Boston, MA 02110-1301, USA. | 21 * Boston, MA 02110-1301, USA. |
22 */ | 22 */ |
23 | 23 |
24 #include "config.h" | 24 #include "config.h" |
25 #include "core/svg/SVGLinearGradientElement.h" | 25 #include "core/svg/SVGLinearGradientElement.h" |
26 | 26 |
27 #include "core/rendering/svg/RenderSVGResourceLinearGradient.h" | 27 #include "core/layout/svg/LayoutSVGResourceLinearGradient.h" |
28 #include "core/svg/LinearGradientAttributes.h" | 28 #include "core/svg/LinearGradientAttributes.h" |
29 #include "core/svg/SVGLength.h" | 29 #include "core/svg/SVGLength.h" |
30 | 30 |
31 namespace blink { | 31 namespace blink { |
32 | 32 |
33 inline SVGLinearGradientElement::SVGLinearGradientElement(Document& document) | 33 inline SVGLinearGradientElement::SVGLinearGradientElement(Document& document) |
34 : SVGGradientElement(SVGNames::linearGradientTag, document) | 34 : SVGGradientElement(SVGNames::linearGradientTag, document) |
35 , m_x1(SVGAnimatedLength::create(this, SVGNames::x1Attr, SVGLength::create(L
engthModeWidth), AllowNegativeLengths)) | 35 , m_x1(SVGAnimatedLength::create(this, SVGNames::x1Attr, SVGLength::create(L
engthModeWidth), AllowNegativeLengths)) |
36 , m_y1(SVGAnimatedLength::create(this, SVGNames::y1Attr, SVGLength::create(L
engthModeHeight), AllowNegativeLengths)) | 36 , m_y1(SVGAnimatedLength::create(this, SVGNames::y1Attr, SVGLength::create(L
engthModeHeight), AllowNegativeLengths)) |
37 , m_x2(SVGAnimatedLength::create(this, SVGNames::x2Attr, SVGLength::create(L
engthModeWidth), AllowNegativeLengths)) | 37 , m_x2(SVGAnimatedLength::create(this, SVGNames::x2Attr, SVGLength::create(L
engthModeWidth), AllowNegativeLengths)) |
(...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
78 { | 78 { |
79 if (!isSupportedAttribute(attrName)) { | 79 if (!isSupportedAttribute(attrName)) { |
80 SVGGradientElement::svgAttributeChanged(attrName); | 80 SVGGradientElement::svgAttributeChanged(attrName); |
81 return; | 81 return; |
82 } | 82 } |
83 | 83 |
84 SVGElement::InvalidationGuard invalidationGuard(this); | 84 SVGElement::InvalidationGuard invalidationGuard(this); |
85 | 85 |
86 updateRelativeLengthsInformation(); | 86 updateRelativeLengthsInformation(); |
87 | 87 |
88 RenderSVGResourceContainer* renderer = toRenderSVGResourceContainer(this->re
nderer()); | 88 LayoutSVGResourceContainer* renderer = toLayoutSVGResourceContainer(this->re
nderer()); |
89 if (renderer) | 89 if (renderer) |
90 renderer->invalidateCacheAndMarkForLayout(); | 90 renderer->invalidateCacheAndMarkForLayout(); |
91 } | 91 } |
92 | 92 |
93 LayoutObject* SVGLinearGradientElement::createRenderer(const LayoutStyle&) | 93 LayoutObject* SVGLinearGradientElement::createRenderer(const LayoutStyle&) |
94 { | 94 { |
95 return new RenderSVGResourceLinearGradient(this); | 95 return new LayoutSVGResourceLinearGradient(this); |
96 } | 96 } |
97 | 97 |
98 static void setGradientAttributes(SVGGradientElement* element, LinearGradientAtt
ributes& attributes, bool isLinear = true) | 98 static void setGradientAttributes(SVGGradientElement* element, LinearGradientAtt
ributes& attributes, bool isLinear = true) |
99 { | 99 { |
100 if (!attributes.hasSpreadMethod() && element->spreadMethod()->isSpecified()) | 100 if (!attributes.hasSpreadMethod() && element->spreadMethod()->isSpecified()) |
101 attributes.setSpreadMethod(element->spreadMethod()->currentValue()->enum
Value()); | 101 attributes.setSpreadMethod(element->spreadMethod()->currentValue()->enum
Value()); |
102 | 102 |
103 if (!attributes.hasGradientUnits() && element->gradientUnits()->isSpecified(
)) | 103 if (!attributes.hasGradientUnits() && element->gradientUnits()->isSpecified(
)) |
104 attributes.setGradientUnits(element->gradientUnits()->currentValue()->en
umValue()); | 104 attributes.setGradientUnits(element->gradientUnits()->currentValue()->en
umValue()); |
105 | 105 |
(...skipping 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
169 | 169 |
170 bool SVGLinearGradientElement::selfHasRelativeLengths() const | 170 bool SVGLinearGradientElement::selfHasRelativeLengths() const |
171 { | 171 { |
172 return m_x1->currentValue()->isRelative() | 172 return m_x1->currentValue()->isRelative() |
173 || m_y1->currentValue()->isRelative() | 173 || m_y1->currentValue()->isRelative() |
174 || m_x2->currentValue()->isRelative() | 174 || m_x2->currentValue()->isRelative() |
175 || m_y2->currentValue()->isRelative(); | 175 || m_y2->currentValue()->isRelative(); |
176 } | 176 } |
177 | 177 |
178 } // namespace blink | 178 } // namespace blink |
OLD | NEW |