1 /* 2 * Copyright (C) 2013 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/EventPathWalker.h" 29 30 #include "core/dom/shadow/ContentDistributor.h" 31 #include "core/dom/shadow/InsertionPoint.h" 32 #include "core/dom/shadow/ShadowRoot.h" 33 34 namespace WebCore { 35 36 EventPathWalker::EventPathWalker(const Node* node) 37 : m_node(node) 38 , m_distributedNode(node) 39 , m_isVisitingInsertionPointInReprojection(false) 40 { 41 ASSERT(node); 42 // FIXME: It's not clear if we need this document check, but I think we do 43 // since DocType nodes from document.implementation.createDocumentType 44 // don't have a document(). 45 if (Document* document = node->document()) 46 document->updateDistributionForNodeIfNeeded(const_cast<Node*>(node)); 47 } 48 49 Node* EventPathWalker::parent(const Node* node) 50 { 51 EventPathWalker walker(node); 52 walker.moveToParent(); 53 return walker.node(); 54 } 55 56 void EventPathWalker::moveToParent() 57 { 58 ASSERT(m_node); 59 ASSERT(m_distributedNode); 60 if (ElementShadow* shadow = shadowOfParent(m_node)) { 61 if (InsertionPoint* insertionPoint = shadow->distributor().findInsertionPointFor(m_distributedNode)) { 62 m_node = insertionPoint; 63 m_isVisitingInsertionPointInReprojection = true; 64 return; 65 } 66 } 67 if (!m_node->isShadowRoot()) { 68 m_node = m_node->parentNode(); 69 if (!(m_node && m_node->isShadowRoot() && toShadowRoot(m_node)->insertionPoint())) 70 m_distributedNode = m_node; 71 m_isVisitingInsertionPointInReprojection = false; 72 return; 73 } 74 75 const ShadowRoot* shadowRoot = toShadowRoot(m_node); 76 if (InsertionPoint* insertionPoint = shadowRoot->insertionPoint()) { 77 m_node = insertionPoint; 78 m_isVisitingInsertionPointInReprojection = true; 79 return; 80 } 81 m_node = shadowRoot->host(); 82 m_distributedNode = m_node; 83 m_isVisitingInsertionPointInReprojection = false; 84 } 85 86 } // namespace 87