Move rendering/svg/RenderSVGResource* to layout/svg.

Source/core/layout/svg/SVGResourcesCycleSolver.cpp

 /*
  * Copyright (C) Research In Motion Limited 2010. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  * Library General Public License for more details.
  *
  * You should have received a copy of the GNU Library General Public License
  * along with this library; see the file COPYING.LIB.  If not, write to
  * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  * Boston, MA 02110-1301, USA.
  */
 
 #include "config.h"
 #include "core/layout/svg/SVGResourcesCycleSolver.h"
 
 // Set to a value > 0, to debug the resource cache.
 #define DEBUG_CYCLE_DETECTION 0
 
+#include "core/layout/svg/LayoutSVGResourceClipper.h"
+#include "core/layout/svg/LayoutSVGResourceFilter.h"
+#include "core/layout/svg/LayoutSVGResourceMarker.h"
+#include "core/layout/svg/LayoutSVGResourceMasker.h"
+#include "core/layout/svg/LayoutSVGResourcePaintServer.h"
 #include "core/layout/svg/SVGResources.h"
 #include "core/layout/svg/SVGResourcesCache.h"
-#include "core/rendering/svg/RenderSVGResourceClipper.h"
-#include "core/rendering/svg/RenderSVGResourceFilter.h"
-#include "core/rendering/svg/RenderSVGResourceMarker.h"
-#include "core/rendering/svg/RenderSVGResourceMasker.h"
-#include "core/rendering/svg/RenderSVGResourcePaintServer.h"
 
 namespace blink {
 
 SVGResourcesCycleSolver::SVGResourcesCycleSolver(LayoutObject* renderer, SVGResources* resources)
     : m_renderer(renderer)
     , m_resources(resources)
 {
     ASSERT(m_renderer);
     ASSERT(m_resources);
 }
 
 SVGResourcesCycleSolver::~SVGResourcesCycleSolver()
 {
 }
 
 struct ActiveFrame {
     typedef SVGResourcesCycleSolver::ResourceSet ResourceSet;
 
-    ActiveFrame(ResourceSet& activeSet, RenderSVGResourceContainer* resource)
+    ActiveFrame(ResourceSet& activeSet, LayoutSVGResourceContainer* resource)
         : m_activeSet(activeSet)
         , m_resource(resource)
     {
         m_activeSet.add(m_resource);
     }
     ~ActiveFrame()
     {
         m_activeSet.remove(m_resource);
     }
 
     ResourceSet& m_activeSet;
-    RenderSVGResourceContainer* m_resource;
+    LayoutSVGResourceContainer* m_resource;
 };
 
-bool SVGResourcesCycleSolver::resourceContainsCycles(RenderSVGResourceContainer* resource)
+bool SVGResourcesCycleSolver::resourceContainsCycles(LayoutSVGResourceContainer* resource)
 {
     // If we've traversed this sub-graph before and no cycles were observed, then
     // reuse that result.
     if (m_dagCache.contains(resource))
         return false;
 
     ActiveFrame frame(m_activeResources, resource);
 
     LayoutObject* node = resource;
     while (node) {
@@ skipping 23 matching lines @@
     return false;
 }
 
 void SVGResourcesCycleSolver::resolveCycles()
 {
     ASSERT(m_activeResources.isEmpty());
 
     // If the starting LayoutObject is a resource container itself, then add it
     // to the active set (to break direct self-references.)
     if (m_renderer->isSVGResourceContainer())
-        m_activeResources.add(toRenderSVGResourceContainer(m_renderer));
+        m_activeResources.add(toLayoutSVGResourceContainer(m_renderer));
 
     ResourceSet localResources;
     m_resources->buildSetOfResources(localResources);
 
     // This performs a depth-first search for a back-edge in all the
     // (potentially disjoint) graphs formed by the resources referenced by
     // |m_renderer|.
     ResourceSet::iterator end = localResources.end();
     for (ResourceSet::iterator it = localResources.begin(); it != end; ++it) {
         if (m_activeResources.contains(*it) || resourceContainsCycles(*it))
             breakCycle(*it);
     }
 
     m_activeResources.clear();
 }
 
-void SVGResourcesCycleSolver::breakCycle(RenderSVGResourceContainer* resourceLeadingToCycle)
+void SVGResourcesCycleSolver::breakCycle(LayoutSVGResourceContainer* resourceLeadingToCycle)
 {
     ASSERT(resourceLeadingToCycle);
     if (resourceLeadingToCycle == m_resources->linkedResource()) {
         m_resources->resetLinkedResource();
         return;
     }
 
     switch (resourceLeadingToCycle->resourceType()) {
     case MaskerResourceType:
         ASSERT(resourceLeadingToCycle == m_resources->masker());
@@ skipping 25 matching lines @@
         ASSERT(resourceLeadingToCycle == m_resources->clipper());
         m_resources->resetClipper();
         break;
     default:
         ASSERT_NOT_REACHED();
         break;
     }
 }
 
 }