OLD | NEW |
---|---|
(Empty) | |
1 /* | |
2 * Copyright (C) 2015 Google Inc. All rights reserved. | |
3 * | |
4 * Redistribution and use in source and binary forms, with or without | |
5 * modification, are permitted provided that the following conditions are | |
6 * met: | |
7 * | |
8 * * Redistributions of source code must retain the above copyright | |
9 * notice, this list of conditions and the following disclaimer. | |
10 * * Redistributions in binary form must reproduce the above | |
11 * copyright notice, this list of conditions and the following disclaimer | |
12 * in the documentation and/or other materials provided with the | |
13 * distribution. | |
14 * * Neither the name of Google Inc. nor the names of its | |
15 * contributors may be used to endorse or promote products derived from | |
16 * this software without specific prior written permission. | |
17 * | |
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
29 */ | |
30 | |
31 #include "config.h" | |
32 | |
33 #include "core/timing/PerformanceObserverRegistration.h" | |
34 | |
35 #include "core/timing/PerformanceBase.h" | |
36 | |
37 namespace blink { | |
38 | |
39 PerformanceObserverRegistration* PerformanceObserverRegistration::create(Perform anceObserver& observer, PerformanceBase* performance, const HashSet<AtomicString >& typeFilter) | |
40 { | |
41 return new PerformanceObserverRegistration(observer, performance, typeFilter ); | |
42 } | |
43 | |
44 PerformanceObserverRegistration::PerformanceObserverRegistration(PerformanceObse rver& observer, PerformanceBase* performance, const HashSet<AtomicString>& typeF ilter) | |
45 : m_observer(observer) | |
46 , m_performance(performance) | |
47 , m_typeFilter(typeFilter) | |
48 , m_referenceCount(0) | |
49 { | |
50 m_performance->registerPerformanceObserver(this); | |
51 m_observer->observationStarted(this); | |
52 } | |
53 | |
54 PerformanceObserverRegistration::~PerformanceObserverRegistration() | |
55 { | |
56 } | |
57 | |
58 void PerformanceObserverRegistration::dispose() | |
59 { | |
60 if (!--m_referenceCount) { | |
esprehn
2015/07/18 22:24:16
don't manually reference count, you want to use We
| |
61 m_observer->observationEnded(this); | |
62 m_observer.clear(); | |
63 } | |
64 } | |
65 | |
66 void PerformanceObserverRegistration::resetObservation(const HashSet<AtomicStrin g>& typeFilter) | |
67 { | |
68 ++m_referenceCount; | |
69 m_performance->unregisterPerformanceObserver(this); | |
70 m_typeFilter = typeFilter; | |
71 m_performance->registerPerformanceObserver(this); | |
72 --m_referenceCount; | |
73 } | |
74 | |
75 void PerformanceObserverRegistration::unregister() | |
76 { | |
77 ASSERT(m_performance); | |
78 m_performance->unregisterPerformanceObserver(this); | |
79 // The above line will cause this object to be deleted, so don't do any more in this function. | |
80 } | |
81 | |
82 bool PerformanceObserverRegistration::shouldReceiveEntryFrom(const AtomicString& typeName) const | |
83 { | |
84 return m_typeFilter.contains(typeName); | |
85 } | |
86 | |
87 DEFINE_TRACE(PerformanceObserverRegistration) | |
88 { | |
89 visitor->trace(m_observer); | |
90 visitor->trace(m_performance); | |
91 } | |
92 | |
93 } // namespace blink | |
OLD | NEW |