OLD | NEW |
1 /* | 1 /* |
2 * Copyright (c) 2009, Google Inc. All rights reserved. | 2 * Copyright (c) 2009, Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 11 matching lines...) Expand all Loading... |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #include "config.h" | 31 #include "config.h" |
32 | |
33 #include "core/rendering/svg/RenderSVGModelObject.h" | 32 #include "core/rendering/svg/RenderSVGModelObject.h" |
34 | 33 |
35 #include "SVGNames.h" | 34 #include "SVGNames.h" |
36 #include "core/rendering/RenderView.h" | 35 #include "core/rendering/RenderView.h" |
37 #include "core/rendering/svg/RenderSVGRoot.h" | 36 #include "core/rendering/svg/RenderSVGRoot.h" |
| 37 #include "core/rendering/svg/SVGRenderSupport.h" |
38 #include "core/rendering/svg/SVGResourcesCache.h" | 38 #include "core/rendering/svg/SVGResourcesCache.h" |
39 #include "core/svg/SVGGraphicsElement.h" | 39 #include "core/svg/SVGGraphicsElement.h" |
40 | 40 |
41 namespace WebCore { | 41 namespace WebCore { |
42 | 42 |
43 RenderSVGModelObject::RenderSVGModelObject(SVGElement* node) | 43 RenderSVGModelObject::RenderSVGModelObject(SVGElement* node) |
44 : RenderObject(node) | 44 : RenderObject(node) |
45 { | 45 { |
46 } | 46 } |
47 | 47 |
(...skipping 104 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
152 | 152 |
153 const LayoutRect& newRepaintRect = previousRepaintRect(); | 153 const LayoutRect& newRepaintRect = previousRepaintRect(); |
154 const LayoutPoint& newPositionFromRepaintContainer = previousPositionFromRep
aintContainer(); | 154 const LayoutPoint& newPositionFromRepaintContainer = previousPositionFromRep
aintContainer(); |
155 repaintAfterLayoutIfNeeded(containerForRepaint(), | 155 repaintAfterLayoutIfNeeded(containerForRepaint(), |
156 shouldDoFullRepaintAfterLayout(), oldRepaintRect, oldPositionFromRepaint
Container, &newRepaintRect, &newPositionFromRepaintContainer); | 156 shouldDoFullRepaintAfterLayout(), oldRepaintRect, oldPositionFromRepaint
Container, &newRepaintRect, &newPositionFromRepaintContainer); |
157 | 157 |
158 RenderObject::repaintTreeAfterLayout(newRepaintContainer); | 158 RenderObject::repaintTreeAfterLayout(newRepaintContainer); |
159 } | 159 } |
160 | 160 |
161 } // namespace WebCore | 161 } // namespace WebCore |
OLD | NEW |