| 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 91 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 102 if (!m_node->inDocument()) | 102 if (!m_node->inDocument()) |
| 103 return; | 103 return; |
| 104 while (current) { | 104 while (current) { |
| 105 if (m_event && current->keepEventInNode(m_event)) | 105 if (m_event && current->keepEventInNode(m_event)) |
| 106 break; | 106 break; |
| 107 Vector<RawPtr<InsertionPoint>, 8> insertionPoints; | 107 Vector<RawPtr<InsertionPoint>, 8> insertionPoints; |
| 108 collectDestinationInsertionPoints(*current, insertionPoints); | 108 collectDestinationInsertionPoints(*current, insertionPoints); |
| 109 if (!insertionPoints.isEmpty()) { | 109 if (!insertionPoints.isEmpty()) { |
| 110 for (size_t i = 0; i < insertionPoints.size(); ++i) { | 110 for (size_t i = 0; i < insertionPoints.size(); ++i) { |
| 111 InsertionPoint* insertionPoint = insertionPoints[i]; | 111 InsertionPoint* insertionPoint = insertionPoints[i]; |
| 112 if (insertionPoint->isShadowInsertionPoint()) { | |
| 113 ShadowRoot* containingShadowRoot = insertionPoint->containin
gShadowRoot(); | |
| 114 ASSERT(containingShadowRoot); | |
| 115 if (!containingShadowRoot->isOldest()) | |
| 116 addNodeEventContext(containingShadowRoot->olderShadowRoo
t()); | |
| 117 } | |
| 118 addNodeEventContext(insertionPoint); | 112 addNodeEventContext(insertionPoint); |
| 119 } | 113 } |
| 120 current = insertionPoints.last(); | 114 current = insertionPoints.last(); |
| 121 continue; | 115 continue; |
| 122 } | 116 } |
| 123 if (current->isShadowRoot()) { | 117 if (current->isShadowRoot()) { |
| 124 if (m_event && shouldStopAtShadowRoot(*m_event, *toShadowRoot(curren
t), *m_node)) | 118 if (m_event && shouldStopAtShadowRoot(*m_event, *toShadowRoot(curren
t), *m_node)) |
| 125 break; | 119 break; |
| 126 current = current->shadowHost(); | 120 current = current->shadowHost(); |
| 127 addNodeEventContext(current); | 121 addNodeEventContext(current); |
| (...skipping 205 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 333 | 327 |
| 334 void EventPath::trace(Visitor* visitor) | 328 void EventPath::trace(Visitor* visitor) |
| 335 { | 329 { |
| 336 visitor->trace(m_nodeEventContexts); | 330 visitor->trace(m_nodeEventContexts); |
| 337 visitor->trace(m_node); | 331 visitor->trace(m_node); |
| 338 visitor->trace(m_event); | 332 visitor->trace(m_event); |
| 339 visitor->trace(m_treeScopeEventContexts); | 333 visitor->trace(m_treeScopeEventContexts); |
| 340 } | 334 } |
| 341 | 335 |
| 342 } // namespace | 336 } // namespace |
| OLD | NEW |