OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2006 Apple Computer, Inc. All rights reserved. | 2 * Copyright (C) 2006 Apple Computer, 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 COMPUTER, INC. ``AS IS'' AND ANY | 13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, 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 COMPUTER, INC. OR | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, 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 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 Timer_h | 26 #ifndef Timer_h |
27 #define Timer_h | 27 #define Timer_h |
28 | 28 |
29 #include "platform/PlatformExport.h" | 29 #include "platform/PlatformExport.h" |
30 #include "platform/heap/Handle.h" | 30 #include "platform/heap/Handle.h" |
| 31 #include "platform/scheduler/CancellableTaskFactory.h" |
31 #include "public/platform/WebTraceLocation.h" | 32 #include "public/platform/WebTraceLocation.h" |
32 #include "wtf/Noncopyable.h" | 33 #include "wtf/Noncopyable.h" |
33 #include "wtf/Threading.h" | 34 #include "wtf/Threading.h" |
34 #include "wtf/Vector.h" | 35 #include "wtf/Vector.h" |
35 | 36 |
36 namespace blink { | 37 namespace blink { |
37 | 38 |
38 // Time intervals are all in seconds. | 39 // Time intervals are all in seconds. |
39 | 40 |
40 class PLATFORM_EXPORT TimerBase { | 41 class PLATFORM_EXPORT TimerBase { |
(...skipping 15 matching lines...) Expand all Loading... |
56 | 57 |
57 void stop(); | 58 void stop(); |
58 bool isActive() const; | 59 bool isActive() const; |
59 const WebTraceLocation& location() const { return m_location; } | 60 const WebTraceLocation& location() const { return m_location; } |
60 | 61 |
61 double nextFireInterval() const; | 62 double nextFireInterval() const; |
62 double nextUnalignedFireInterval() const; | 63 double nextUnalignedFireInterval() const; |
63 double repeatInterval() const { return m_repeatInterval; } | 64 double repeatInterval() const { return m_repeatInterval; } |
64 | 65 |
65 void augmentRepeatInterval(double delta) { | 66 void augmentRepeatInterval(double delta) { |
66 setNextFireTime(m_nextFireTime + delta); | 67 double now = monotonicallyIncreasingTime(); |
| 68 setNextFireTime(now, m_nextFireTime - now + delta); |
67 m_repeatInterval += delta; | 69 m_repeatInterval += delta; |
68 } | 70 } |
69 | 71 |
70 void didChangeAlignmentInterval(); | 72 void didChangeAlignmentInterval(double now); |
71 | 73 |
72 private: | 74 private: |
73 virtual void fired() = 0; | 75 virtual void fired() = 0; |
74 | 76 |
75 virtual double alignedFireTime(double fireTime) const { return fireTime; } | 77 virtual double alignedFireTime(double fireTime) const { return fireTime; } |
76 | 78 |
77 void checkConsistency() const; | 79 void setNextFireTime(double now, double delay); |
78 void checkHeapIndex() const; | |
79 | 80 |
80 void setNextFireTime(double); | 81 void run(); |
81 | |
82 bool inHeap() const { return m_heapIndex != -1; } | |
83 | |
84 bool hasValidHeapPosition() const; | |
85 void updateHeapIfNeeded(double oldTime); | |
86 | |
87 void heapDecreaseKey(); | |
88 void heapDelete(); | |
89 void heapDeleteMin(); | |
90 void heapIncreaseKey(); | |
91 void heapInsert(); | |
92 void heapPop(); | |
93 void heapPopMin(); | |
94 | |
95 Vector<TimerBase*>& timerHeap() const { ASSERT(m_cachedThreadGlobalTimerHeap
); return *m_cachedThreadGlobalTimerHeap; } | |
96 | 82 |
97 double m_nextFireTime; // 0 if inactive | 83 double m_nextFireTime; // 0 if inactive |
98 double m_unalignedNextFireTime; // m_nextFireTime not considering alignment
interval | 84 double m_unalignedNextFireTime; // m_nextFireTime not considering alignment
interval |
99 double m_repeatInterval; // 0 if not repeating | 85 double m_repeatInterval; // 0 if not repeating |
100 int m_heapIndex; // -1 if not in heap | |
101 unsigned m_heapInsertionOrder; // Used to keep order among equal-fire-time t
imers | |
102 Vector<TimerBase*>* m_cachedThreadGlobalTimerHeap; | |
103 WebTraceLocation m_location; | 86 WebTraceLocation m_location; |
| 87 CancellableTaskFactory m_cancellableTaskFactory; |
| 88 WebScheduler* m_webScheduler; // Not owned. |
104 | 89 |
105 #if ENABLE(ASSERT) | 90 #if ENABLE(ASSERT) |
106 ThreadIdentifier m_thread; | 91 ThreadIdentifier m_thread; |
107 #endif | 92 #endif |
108 | 93 |
109 friend class ThreadTimers; | 94 friend class ThreadTimers; |
110 friend class TimerHeapLessThanFunction; | 95 friend class TimerHeapLessThanFunction; |
111 friend class TimerHeapReference; | 96 friend class TimerHeapReference; |
112 }; | 97 }; |
113 | 98 |
(...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
150 // This raw pointer is safe as long as Timer<X> is held by the X itself (Tha
t's the case | 135 // This raw pointer is safe as long as Timer<X> is held by the X itself (Tha
t's the case |
151 // in the current code base). | 136 // in the current code base). |
152 GC_PLUGIN_IGNORE("363031") | 137 GC_PLUGIN_IGNORE("363031") |
153 TimerFiredClass* m_object; | 138 TimerFiredClass* m_object; |
154 TimerFiredFunction m_function; | 139 TimerFiredFunction m_function; |
155 }; | 140 }; |
156 | 141 |
157 inline bool TimerBase::isActive() const | 142 inline bool TimerBase::isActive() const |
158 { | 143 { |
159 ASSERT(m_thread == currentThread()); | 144 ASSERT(m_thread == currentThread()); |
160 return m_nextFireTime; | 145 return m_cancellableTaskFactory.isPending(); |
161 } | 146 } |
162 | 147 |
163 } | 148 } |
164 | 149 |
165 #endif | 150 #endif |
OLD | NEW |