| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 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 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 79 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 90 m_transientRegistrationNodes->add(&node); | 90 m_transientRegistrationNodes->add(&node); |
| 91 } | 91 } |
| 92 | 92 |
| 93 void MutationObserverRegistration::clearTransientRegistrations() | 93 void MutationObserverRegistration::clearTransientRegistrations() |
| 94 { | 94 { |
| 95 if (!m_transientRegistrationNodes) { | 95 if (!m_transientRegistrationNodes) { |
| 96 ASSERT(!m_registrationNodeKeepAlive); | 96 ASSERT(!m_registrationNodeKeepAlive); |
| 97 return; | 97 return; |
| 98 } | 98 } |
| 99 | 99 |
| 100 for (NodeHashSet::iterator iter = m_transientRegistrationNodes->begin(); ite
r != m_transientRegistrationNodes->end(); ++iter) | 100 for (auto& node : *m_transientRegistrationNodes) |
| 101 (*iter)->unregisterTransientMutationObserver(this); | 101 node->unregisterTransientMutationObserver(this); |
| 102 | 102 |
| 103 m_transientRegistrationNodes.clear(); | 103 m_transientRegistrationNodes.clear(); |
| 104 | 104 |
| 105 ASSERT(m_registrationNodeKeepAlive); | 105 ASSERT(m_registrationNodeKeepAlive); |
| 106 m_registrationNodeKeepAlive = nullptr; // Balanced in observeSubtreeNodeWill
Detach. | 106 m_registrationNodeKeepAlive = nullptr; // Balanced in observeSubtreeNodeWill
Detach. |
| 107 } | 107 } |
| 108 | 108 |
| 109 void MutationObserverRegistration::unregister() | 109 void MutationObserverRegistration::unregister() |
| 110 { | 110 { |
| 111 ASSERT(m_registrationNode); | 111 ASSERT(m_registrationNode); |
| (...skipping 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 145 { | 145 { |
| 146 visitor->trace(m_observer); | 146 visitor->trace(m_observer); |
| 147 visitor->trace(m_registrationNode); | 147 visitor->trace(m_registrationNode); |
| 148 visitor->trace(m_registrationNodeKeepAlive); | 148 visitor->trace(m_registrationNodeKeepAlive); |
| 149 #if ENABLE(OILPAN) | 149 #if ENABLE(OILPAN) |
| 150 visitor->trace(m_transientRegistrationNodes); | 150 visitor->trace(m_transientRegistrationNodes); |
| 151 #endif | 151 #endif |
| 152 } | 152 } |
| 153 | 153 |
| 154 } // namespace blink | 154 } // namespace blink |
| OLD | NEW |