OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All Rights Reserved. | 2 * Copyright (C) 2012 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 | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
12 * | 12 * |
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY | 13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY |
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR |
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
24 */ | 24 */ |
25 | 25 |
26 #ifndef IdTargetObserverRegistry_h | 26 #ifndef IdTargetObserverRegistry_h |
27 #define IdTargetObserverRegistry_h | 27 #define IdTargetObserverRegistry_h |
28 | 28 |
| 29 #include "platform/heap/Handle.h" |
29 #include "wtf/Forward.h" | 30 #include "wtf/Forward.h" |
30 #include "wtf/HashMap.h" | 31 #include "wtf/HashMap.h" |
31 #include "wtf/HashSet.h" | 32 #include "wtf/HashSet.h" |
32 #include "wtf/PassOwnPtr.h" | 33 #include "wtf/PassOwnPtr.h" |
33 #include "wtf/text/StringHash.h" | 34 #include "wtf/text/StringHash.h" |
34 | 35 |
35 namespace WebCore { | 36 namespace WebCore { |
36 | 37 |
37 class IdTargetObserver; | 38 class IdTargetObserver; |
38 | 39 |
39 class IdTargetObserverRegistry { | 40 class IdTargetObserverRegistry FINAL : public NoBaseWillBeGarbageCollectedFinali
zed<IdTargetObserverRegistry> { |
40 WTF_MAKE_NONCOPYABLE(IdTargetObserverRegistry); WTF_MAKE_FAST_ALLOCATED; | 41 WTF_MAKE_NONCOPYABLE(IdTargetObserverRegistry); |
| 42 WTF_MAKE_FAST_ALLOCATED_WILL_BE_REMOVED; |
41 friend class IdTargetObserver; | 43 friend class IdTargetObserver; |
42 public: | 44 public: |
43 static PassOwnPtr<IdTargetObserverRegistry> create(); | 45 static PassOwnPtrWillBeRawPtr<IdTargetObserverRegistry> create(); |
| 46 void trace(Visitor*); |
44 void notifyObservers(const AtomicString& id); | 47 void notifyObservers(const AtomicString& id); |
45 bool hasObservers(const AtomicString& id) const; | 48 bool hasObservers(const AtomicString& id) const; |
46 | 49 |
47 private: | 50 private: |
48 IdTargetObserverRegistry() : m_notifyingObserversInSet(0) { } | 51 IdTargetObserverRegistry() : m_notifyingObserversInSet(nullptr) { } |
49 void addObserver(const AtomicString& id, IdTargetObserver*); | 52 void addObserver(const AtomicString& id, IdTargetObserver*); |
50 void removeObserver(const AtomicString& id, IdTargetObserver*); | 53 void removeObserver(const AtomicString& id, IdTargetObserver*); |
51 void notifyObserversInternal(const AtomicString& id); | 54 void notifyObserversInternal(const AtomicString& id); |
52 | 55 |
53 typedef HashSet<IdTargetObserver*> ObserverSet; | 56 typedef WillBeHeapHashSet<RawPtrWillBeMember<IdTargetObserver> > ObserverSet
; |
54 typedef HashMap<StringImpl*, OwnPtr<ObserverSet> > IdToObserverSetMap; | 57 typedef WillBeHeapHashMap<StringImpl*, OwnPtrWillBeMember<ObserverSet> > IdT
oObserverSetMap; |
55 IdToObserverSetMap m_registry; | 58 IdToObserverSetMap m_registry; |
56 ObserverSet* m_notifyingObserversInSet; | 59 RawPtrWillBeMember<ObserverSet> m_notifyingObserversInSet; |
57 }; | 60 }; |
58 | 61 |
59 inline void IdTargetObserverRegistry::notifyObservers(const AtomicString& id) | 62 inline void IdTargetObserverRegistry::notifyObservers(const AtomicString& id) |
60 { | 63 { |
61 ASSERT(!m_notifyingObserversInSet); | 64 ASSERT(!m_notifyingObserversInSet); |
62 if (id.isEmpty() || m_registry.isEmpty()) | 65 if (id.isEmpty() || m_registry.isEmpty()) |
63 return; | 66 return; |
64 IdTargetObserverRegistry::notifyObserversInternal(id); | 67 IdTargetObserverRegistry::notifyObserversInternal(id); |
65 } | 68 } |
66 | 69 |
67 } // namespace WebCore | 70 } // namespace WebCore |
68 | 71 |
69 #endif // IdTargetObserverRegistry_h | 72 #endif // IdTargetObserverRegistry_h |
OLD | NEW |