Home | History | Annotate | Download | only in dom 
      1 /*
      2  * Copyright (C) 2012 Google Inc. All rights reserved.
      3  *
      4  * Redistribution and use in source and binary forms, with or without
      5  * modification, are permitted provided that the following conditions are
      6  * met:
      7  *
      8  *     * Redistributions of source code must retain the above copyright
      9  * notice, this list of conditions and the following disclaimer.
     10  *     * Neither the name of Google Inc. nor the names of its
     11  * contributors may be used to endorse or promote products derived from
     12  * this software without specific prior written permission.
     13  *
     14  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
     15  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
     16  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
     17  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
     18  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
     19  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
     20  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     21  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     22  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     23  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
     24  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     25  */
     26 
     27 #include "config.h"
     28 #include "core/dom/NodeRenderingTraversal.h"
     29 
     30 #include "core/dom/PseudoElement.h"
     31 #include "core/dom/shadow/ComposedTreeWalker.h"
     32 
     33 namespace WebCore {
     34 
     35 namespace NodeRenderingTraversal {
     36 
     37 void ParentDetails::didTraverseInsertionPoint(const InsertionPoint* insertionPoint)
     38 {
     39     if (!m_insertionPoint) {
     40         m_insertionPoint = insertionPoint;
     41         m_resetStyleInheritance  = m_resetStyleInheritance || insertionPoint->resetStyleInheritance();
     42     }
     43 }
     44 
     45 void ParentDetails::didTraverseShadowRoot(const ShadowRoot* root)
     46 {
     47     m_resetStyleInheritance  = m_resetStyleInheritance || root->resetStyleInheritance();
     48 }
     49 
     50 ContainerNode* parent(const Node* node, ParentDetails* details)
     51 {
     52     // FIXME: We should probably ASSERT(!node->document().childNeedsDistributionRecalc()) here, but
     53     // a bunch of things use NodeRenderingTraversal::parent in places where that looks like it could
     54     // be false.
     55     ASSERT(node);
     56     if (isActiveInsertionPoint(*node))
     57         return 0;
     58     ComposedTreeWalker walker(node, ComposedTreeWalker::CanStartFromShadowBoundary);
     59     return toContainerNode(walker.traverseParent(walker.get(), details));
     60 }
     61 
     62 Node* nextSibling(const Node* node)
     63 {
     64     ComposedTreeWalker walker(node);
     65     if (node->isBeforePseudoElement()) {
     66         walker.parent();
     67         walker.firstChild();
     68     } else
     69         walker.nextSibling();
     70 
     71     if (walker.get() || node->isAfterPseudoElement())
     72         return walker.get();
     73 
     74     Node* parent = walker.traverseParent(node);
     75     if (parent && parent->isElementNode())
     76         return toElement(parent)->pseudoElement(AFTER);
     77 
     78     return 0;
     79 }
     80 
     81 Node* previousSibling(const Node* node)
     82 {
     83     ComposedTreeWalker walker(node);
     84     if (node->isAfterPseudoElement()) {
     85         walker.parent();
     86         walker.lastChild();
     87     } else
     88         walker.previousSibling();
     89 
     90     if (walker.get() || node->isBeforePseudoElement())
     91         return walker.get();
     92 
     93     Node* parent = walker.traverseParent(node);
     94     if (parent && parent->isElementNode())
     95         return toElement(parent)->pseudoElement(BEFORE);
     96 
     97     return 0;
     98 }
     99 
    100 }
    101 
    102 } // namespace
    103