OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
(...skipping 15 matching lines...) Expand all Loading... |
26 | 26 |
27 #ifndef NodeChildRemovalTracker_h | 27 #ifndef NodeChildRemovalTracker_h |
28 #define NodeChildRemovalTracker_h | 28 #define NodeChildRemovalTracker_h |
29 | 29 |
30 #include "core/dom/Node.h" | 30 #include "core/dom/Node.h" |
31 | 31 |
32 namespace WebCore { | 32 namespace WebCore { |
33 | 33 |
34 class NodeChildRemovalTracker { | 34 class NodeChildRemovalTracker { |
35 public: | 35 public: |
36 explicit NodeChildRemovalTracker(Node*); | 36 explicit NodeChildRemovalTracker(Node&); |
37 ~NodeChildRemovalTracker(); | 37 ~NodeChildRemovalTracker(); |
38 | 38 |
39 static bool isBeingRemoved(Node*); | 39 static bool isBeingRemoved(Node*); |
40 | 40 |
41 private: | 41 private: |
42 Node* node() const { return m_node; } | 42 Node& node() const { return m_node; } |
43 NodeChildRemovalTracker* previous() { return m_previous; } | 43 NodeChildRemovalTracker* previous() { return m_previous; } |
44 | 44 |
45 Node* m_node; | 45 Node& m_node; |
46 NodeChildRemovalTracker* m_previous; | 46 NodeChildRemovalTracker* m_previous; |
47 static NodeChildRemovalTracker* s_last; | 47 static NodeChildRemovalTracker* s_last; |
48 }; | 48 }; |
49 | 49 |
50 inline NodeChildRemovalTracker::NodeChildRemovalTracker(Node* node) | 50 inline NodeChildRemovalTracker::NodeChildRemovalTracker(Node& node) |
51 : m_node(node) | 51 : m_node(node) |
52 , m_previous(s_last) | 52 , m_previous(s_last) |
53 { | 53 { |
54 s_last = this; | 54 s_last = this; |
55 } | 55 } |
56 | 56 |
57 inline NodeChildRemovalTracker::~NodeChildRemovalTracker() | 57 inline NodeChildRemovalTracker::~NodeChildRemovalTracker() |
58 { | 58 { |
59 s_last = m_previous; | 59 s_last = m_previous; |
60 } | 60 } |
61 | 61 |
62 inline bool NodeChildRemovalTracker::isBeingRemoved(Node* node) | 62 inline bool NodeChildRemovalTracker::isBeingRemoved(Node* node) |
63 { | 63 { |
64 for (NodeChildRemovalTracker* removal = s_last; removal; removal = removal->
previous()) { | 64 for (NodeChildRemovalTracker* removal = s_last; removal; removal = removal->
previous()) { |
65 if (removal->node()->containsIncludingShadowDOM(node)) | 65 if (removal->node().containsIncludingShadowDOM(node)) |
66 return true; | 66 return true; |
67 } | 67 } |
68 | 68 |
69 return false; | 69 return false; |
70 } | 70 } |
71 | 71 |
72 } // namespace | 72 } // namespace |
73 | 73 |
74 #endif | 74 #endif |
OLD | NEW |