Chromium Code Reviews| 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 25 matching lines...) Expand all Loading... | |
| 36 #include "wtf/HashSet.h" | 36 #include "wtf/HashSet.h" |
| 37 #include "wtf/text/AtomicString.h" | 37 #include "wtf/text/AtomicString.h" |
| 38 #include "wtf/text/AtomicStringHash.h" | 38 #include "wtf/text/AtomicStringHash.h" |
| 39 | 39 |
| 40 namespace WebCore { | 40 namespace WebCore { |
| 41 | 41 |
| 42 class QualifiedName; | 42 class QualifiedName; |
| 43 | 43 |
| 44 class MutationObserverRegistration FINAL : public NoBaseWillBeGarbageCollectedFi nalized<MutationObserverRegistration> { | 44 class MutationObserverRegistration FINAL : public NoBaseWillBeGarbageCollectedFi nalized<MutationObserverRegistration> { |
| 45 public: | 45 public: |
| 46 static PassOwnPtrWillBeRawPtr<MutationObserverRegistration> create(MutationO bserver&, Node&, MutationObserverOptions, const HashSet<AtomicString>& attribute Filter); | 46 static PassOwnPtrWillBeRawPtr<MutationObserverRegistration> create(MutationO bserver&, Node*, MutationObserverOptions, const HashSet<AtomicString>& attribute Filter); |
| 47 ~MutationObserverRegistration(); | 47 ~MutationObserverRegistration(); |
| 48 | 48 |
| 49 void resetObservation(MutationObserverOptions, const HashSet<AtomicString>& attributeFilter); | 49 void resetObservation(MutationObserverOptions, const HashSet<AtomicString>& attributeFilter); |
| 50 void observedSubtreeNodeWillDetach(Node&); | 50 void observedSubtreeNodeWillDetach(Node&); |
| 51 void clearTransientRegistrations(); | 51 void clearTransientRegistrations(); |
| 52 bool hasTransientRegistrations() const { return m_transientRegistrationNodes && !m_transientRegistrationNodes->isEmpty(); } | 52 bool hasTransientRegistrations() const { return m_transientRegistrationNodes && !m_transientRegistrationNodes->isEmpty(); } |
| 53 void unregister(); | 53 void unregister(); |
| 54 | 54 |
| 55 bool shouldReceiveMutationFrom(Node&, MutationObserver::MutationType, const QualifiedName* attributeName) const; | 55 bool shouldReceiveMutationFrom(Node&, MutationObserver::MutationType, const QualifiedName* attributeName) const; |
| 56 bool isSubtree() const { return m_options & MutationObserver::Subtree; } | 56 bool isSubtree() const { return m_options & MutationObserver::Subtree; } |
| 57 | 57 |
| 58 MutationObserver& observer() const { return *m_observer; } | 58 MutationObserver& observer() const { return *m_observer; } |
| 59 MutationRecordDeliveryOptions deliveryOptions() const { return m_options & ( MutationObserver::AttributeOldValue | MutationObserver::CharacterDataOldValue); } | 59 MutationRecordDeliveryOptions deliveryOptions() const { return m_options & ( MutationObserver::AttributeOldValue | MutationObserver::CharacterDataOldValue); } |
| 60 MutationObserverOptions mutationTypes() const { return m_options & MutationO bserver::AllMutationTypes; } | 60 MutationObserverOptions mutationTypes() const { return m_options & MutationO bserver::AllMutationTypes; } |
| 61 | 61 |
| 62 void addRegistrationNodesToSet(HashSet<Node*>&) const; | 62 void addRegistrationNodesToSet(HashSet<Node*>&) const; |
| 63 | 63 |
| 64 void trace(Visitor*); | 64 void trace(Visitor*); |
| 65 | 65 |
| 66 void dispose(); | 66 void dispose(); |
| 67 | 67 |
| 68 private: | 68 private: |
| 69 MutationObserverRegistration(MutationObserver&, Node&, MutationObserverOptio ns, const HashSet<AtomicString>& attributeFilter); | 69 MutationObserverRegistration(MutationObserver&, Node*, MutationObserverOptio ns, const HashSet<AtomicString>& attributeFilter); |
| 70 | 70 |
| 71 RefPtrWillBeMember<MutationObserver> m_observer; | 71 RefPtrWillBeMember<MutationObserver> m_observer; |
| 72 Node& m_registrationNode; | 72 RawPtrWillBeMember<Node> m_registrationNode; |
| 73 // FIXME: Oilpan: once a Member reference will keep a Node | |
| 74 // and its tree alive, this keep-alive RefPtr can be | |
| 75 // removed for Oilpan builds. | |
|
Erik Corry
2014/05/06 07:32:09
The intended semantics is that m_registrationNode
sof
2014/05/06 22:03:25
Excellent information & description.
Weakened the
| |
| 73 RefPtr<Node> m_registrationNodeKeepAlive; | 76 RefPtr<Node> m_registrationNodeKeepAlive; |
|
haraken
2014/05/05 16:54:52
I'd remove m_registrationNodeKeepAlive, even thoug
sof
2014/05/05 19:35:43
Definitely, this will wait until it has settled on
haraken
2014/05/06 06:32:23
We're trying to land Mads' CL by the end of this w
sof
2014/05/06 07:13:10
Thanks for the update, whenever it is ready :) Thi
| |
| 74 typedef HashSet<RefPtr<Node> > NodeHashSet; | 77 typedef HashSet<RefPtr<Node> > NodeHashSet; |
| 75 OwnPtr<NodeHashSet> m_transientRegistrationNodes; | 78 OwnPtr<NodeHashSet> m_transientRegistrationNodes; |
| 76 | 79 |
| 77 MutationObserverOptions m_options; | 80 MutationObserverOptions m_options; |
| 78 HashSet<AtomicString> m_attributeFilter; | 81 HashSet<AtomicString> m_attributeFilter; |
| 79 }; | 82 }; |
| 80 | 83 |
| 81 } // namespace WebCore | 84 } // namespace WebCore |
| 82 | 85 |
| 83 #endif // MutationObserverRegistration_h | 86 #endif // MutationObserverRegistration_h |
| OLD | NEW |