| 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 113 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 124 | 124 |
| 125 if (type != MutationObserver::Attributes || !(m_options & MutationObserver::
AttributeFilter)) | 125 if (type != MutationObserver::Attributes || !(m_options & MutationObserver::
AttributeFilter)) |
| 126 return true; | 126 return true; |
| 127 | 127 |
| 128 if (!attributeName->namespaceURI().isNull()) | 128 if (!attributeName->namespaceURI().isNull()) |
| 129 return false; | 129 return false; |
| 130 | 130 |
| 131 return m_attributeFilter.contains(attributeName->localName()); | 131 return m_attributeFilter.contains(attributeName->localName()); |
| 132 } | 132 } |
| 133 | 133 |
| 134 void MutationObserverRegistration::addRegistrationNodesToSet(WillBeHeapHashSet<R
awPtrWillBeMember<Node> >& nodes) const | 134 void MutationObserverRegistration::addRegistrationNodesToSet(WillBeHeapHashSet<R
awPtrWillBeMember<Node>>& nodes) const |
| 135 { | 135 { |
| 136 ASSERT(m_registrationNode); | 136 ASSERT(m_registrationNode); |
| 137 nodes.add(m_registrationNode.get()); | 137 nodes.add(m_registrationNode.get()); |
| 138 if (!m_transientRegistrationNodes) | 138 if (!m_transientRegistrationNodes) |
| 139 return; | 139 return; |
| 140 for (NodeHashSet::const_iterator iter = m_transientRegistrationNodes->begin(
); iter != m_transientRegistrationNodes->end(); ++iter) | 140 for (NodeHashSet::const_iterator iter = m_transientRegistrationNodes->begin(
); iter != m_transientRegistrationNodes->end(); ++iter) |
| 141 nodes.add(iter->get()); | 141 nodes.add(iter->get()); |
| 142 } | 142 } |
| 143 | 143 |
| 144 DEFINE_TRACE(MutationObserverRegistration) | 144 DEFINE_TRACE(MutationObserverRegistration) |
| 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 |