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 #ifndef NodeChildRemovalTracker_h
28 #define NodeChildRemovalTracker_h
29
30 #include "core/dom/Node.h"
31
32 namespace WebCore {
33
34 class NodeChildRemovalTracker {
35 public:
36 explicit NodeChildRemovalTracker(Node&);
37 ~NodeChildRemovalTracker();
38
39 static bool isBeingRemoved(Node*);
40
41 private:
node()42 Node& node() const { return m_node; }
previous()43 NodeChildRemovalTracker* previous() { return m_previous; }
44
45 Node& m_node;
46 NodeChildRemovalTracker* m_previous;
47 static NodeChildRemovalTracker* s_last;
48 };
49
NodeChildRemovalTracker(Node & node)50 inline NodeChildRemovalTracker::NodeChildRemovalTracker(Node& node)
51 : m_node(node)
52 , m_previous(s_last)
53 {
54 s_last = this;
55 }
56
~NodeChildRemovalTracker()57 inline NodeChildRemovalTracker::~NodeChildRemovalTracker()
58 {
59 s_last = m_previous;
60 }
61
isBeingRemoved(Node * node)62 inline bool NodeChildRemovalTracker::isBeingRemoved(Node* node)
63 {
64 for (NodeChildRemovalTracker* removal = s_last; removal; removal = removal->previous()) {
65 if (removal->node().containsIncludingShadowDOM(node))
66 return true;
67 }
68
69 return false;
70 }
71
72 } // namespace
73
74 #endif
75