| OLD | NEW | 
|---|
| 1 /* | 1 /* | 
| 2  * Copyright (C) 2006 Apple Computer, Inc. | 2  * Copyright (C) 2006 Apple Computer, Inc. | 
| 3  * Copyright (C) 2007 Nikolas Zimmermann <zimmermann@kde.org> | 3  * Copyright (C) 2007 Nikolas Zimmermann <zimmermann@kde.org> | 
| 4  * Copyright (C) Research In Motion Limited 2010. All rights reserved. | 4  * Copyright (C) Research In Motion Limited 2010. All rights reserved. | 
| 5  * | 5  * | 
| 6  * This library is free software; you can redistribute it and/or | 6  * This library is free software; you can redistribute it and/or | 
| 7  * modify it under the terms of the GNU Library General Public | 7  * modify it under the terms of the GNU Library General Public | 
| 8  * License as published by the Free Software Foundation; either | 8  * License as published by the Free Software Foundation; either | 
| 9  * version 2 of the License, or (at your option) any later version. | 9  * version 2 of the License, or (at your option) any later version. | 
| 10  * | 10  * | 
| (...skipping 103 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 114     const LayoutSVGRoot& svgRoot = SVGLayoutSupport::mapRectToSVGRootForPaintInv
     alidation(this, paintInvalidationRect, rect); | 114     const LayoutSVGRoot& svgRoot = SVGLayoutSupport::mapRectToSVGRootForPaintInv
     alidation(this, paintInvalidationRect, rect); | 
| 115     svgRoot.mapRectToPaintInvalidationBacking(paintInvalidationContainer, rect, 
     paintInvalidationState); | 115     svgRoot.mapRectToPaintInvalidationBacking(paintInvalidationContainer, rect, 
     paintInvalidationState); | 
| 116 } | 116 } | 
| 117 | 117 | 
| 118 bool LayoutSVGBlock::nodeAtPoint(const HitTestRequest&, HitTestResult&, const Hi
     tTestLocation&, const LayoutPoint&, HitTestAction) | 118 bool LayoutSVGBlock::nodeAtPoint(const HitTestRequest&, HitTestResult&, const Hi
     tTestLocation&, const LayoutPoint&, HitTestAction) | 
| 119 { | 119 { | 
| 120     ASSERT_NOT_REACHED(); | 120     ASSERT_NOT_REACHED(); | 
| 121     return false; | 121     return false; | 
| 122 } | 122 } | 
| 123 | 123 | 
| 124 void LayoutSVGBlock::invalidateTreeIfNeeded(const PaintInvalidationState& paintI
     nvalidationState) | 124 void LayoutSVGBlock::invalidateTreeIfNeeded(PaintInvalidationState& paintInvalid
     ationState) | 
| 125 { | 125 { | 
| 126     if (!shouldCheckForPaintInvalidation(paintInvalidationState)) | 126     if (!shouldCheckForPaintInvalidation(paintInvalidationState)) | 
| 127         return; | 127         return; | 
| 128 | 128 | 
| 129     if (paintInvalidationState.cachedOffsetsEnabled()) { | 129     if (paintInvalidationState.cachedOffsetsEnabled()) { | 
| 130         m_cachedPaintInvalidationTransform = paintInvalidationState.svgTransform
     (); | 130         m_cachedPaintInvalidationTransform = paintInvalidationState.svgTransform
     (); | 
| 131     } else { | 131     } else { | 
| 132         m_cachedPaintInvalidationTransform.makeIdentity(); | 132         m_cachedPaintInvalidationTransform.makeIdentity(); | 
| 133         LayoutObject* next = parent(); | 133         LayoutObject* next = parent(); | 
| 134         while (!next->isSVGRoot()) { | 134         while (!next->isSVGRoot()) { | 
| (...skipping 10 matching lines...) Expand all  Loading... | 
| 145 | 145 | 
| 146 void LayoutSVGBlock::updatePaintInfoRect(IntRect& rect) | 146 void LayoutSVGBlock::updatePaintInfoRect(IntRect& rect) | 
| 147 { | 147 { | 
| 148     if (rect != LayoutRect::infiniteIntRect()) { | 148     if (rect != LayoutRect::infiniteIntRect()) { | 
| 149         AffineTransform transformToRoot = m_cachedPaintInvalidationTransform * l
     ocalTransform(); | 149         AffineTransform transformToRoot = m_cachedPaintInvalidationTransform * l
     ocalTransform(); | 
| 150         rect = enclosingIntRect(transformToRoot.inverse().mapRect(FloatRect(rect
     ))); | 150         rect = enclosingIntRect(transformToRoot.inverse().mapRect(FloatRect(rect
     ))); | 
| 151     } | 151     } | 
| 152 } | 152 } | 
| 153 | 153 | 
| 154 } | 154 } | 
| OLD | NEW | 
|---|