1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <salhelper/timer.hxx>
#include <osl/thread.hxx>
#include <condition_variable>
#include <mutex>
using namespace salhelper;
class salhelper::TimerManager final : public osl::Thread
{
public:
TimerManager();
~TimerManager();
/// register timer
void registerTimer(salhelper::Timer* pTimer);
/// unregister timer
void unregisterTimer(salhelper::Timer * pTimer);
/// lookup timer
bool lookupTimer(const salhelper::Timer* pTimer);
protected:
/// worker-function of thread
virtual void SAL_CALL run() override;
/// Checking and triggering of a timer event
void checkForTimeout();
/// sorted-queue data
salhelper::Timer* m_pHead;
bool m_terminate;
/// List Protection
std::mutex m_Lock;
/// Signal the insertion of a timer
std::condition_variable m_notEmpty;
/// "Singleton Pattern"
//static salhelper::TimerManager* m_pManager;
};
namespace
{
salhelper::TimerManager& getTimerManager()
{
static salhelper::TimerManager aManager;
return aManager;
}
}
Timer::Timer()
: m_aTimeOut(0),
m_aExpired(0),
m_aRepeatDelta(0),
m_pNext(nullptr)
{
}
Timer::Timer(const TTimeValue& rTime)
: m_aTimeOut(rTime),
m_aExpired(0),
m_aRepeatDelta(0),
m_pNext(nullptr)
{
}
Timer::Timer(const TTimeValue& rTime, const TTimeValue& Repeat)
: m_aTimeOut(rTime),
m_aExpired(0),
m_aRepeatDelta(Repeat),
m_pNext(nullptr)
{
}
Timer::~Timer()
{
stop();
}
void Timer::start()
{
if (!isTicking())
{
if (!m_aTimeOut.isEmpty())
setRemainingTime(m_aTimeOut);
getTimerManager().registerTimer(this);
}
}
void Timer::stop()
{
getTimerManager().unregisterTimer(this);
}
sal_Bool Timer::isTicking() const
{
return getTimerManager().lookupTimer(this);
}
sal_Bool Timer::isExpired() const
{
TTimeValue Now;
osl_getSystemTime(&Now);
return !(Now < m_aExpired);
}
sal_Bool Timer::expiresBefore(const Timer* pTimer) const
{
if (pTimer)
return m_aExpired < pTimer->m_aExpired;
else
return false;
}
void Timer::setAbsoluteTime(const TTimeValue& Time)
{
m_aTimeOut = 0;
m_aExpired = Time;
m_aRepeatDelta = 0;
m_aExpired.normalize();
}
void Timer::setRemainingTime(const TTimeValue& Remaining)
{
osl_getSystemTime(&m_aExpired);
m_aExpired.addTime(Remaining);
}
void Timer::setRemainingTime(const TTimeValue& Remaining, const TTimeValue& Repeat)
{
osl_getSystemTime(&m_aExpired);
m_aExpired.addTime(Remaining);
m_aRepeatDelta = Repeat;
}
void Timer::addTime(const TTimeValue& Delta)
{
m_aExpired.addTime(Delta);
}
TTimeValue Timer::getRemainingTime() const
{
TTimeValue Now;
osl_getSystemTime(&Now);
sal_Int32 secs = m_aExpired.Seconds - Now.Seconds;
if (secs < 0)
return TTimeValue(0, 0);
sal_Int32 nsecs = m_aExpired.Nanosec - Now.Nanosec;
if (nsecs < 0)
{
if (secs > 0)
{
secs -= 1;
nsecs += 1000000000;
}
else
return TTimeValue(0, 0);
}
return TTimeValue(secs, nsecs);
}
/** The timer manager cleanup has been removed (no thread is killed anymore),
so the thread leaks.
This will result in a GPF in case the salhelper-library gets unloaded before
process termination.
@TODO : rewrite this file, so that the timerManager thread gets destroyed,
when there are no timers anymore !
**/
TimerManager::TimerManager() :
m_pHead(nullptr), m_terminate(false)
{
// start thread
create();
}
TimerManager::~TimerManager() {
{
std::scoped_lock g(m_Lock);
// Sometimes, the TimerManager thread gets killed before the static's destruction;
// in that case, notify_all could hang in unit tests
if (!isRunning())
return;
m_terminate = true;
}
m_notEmpty.notify_all();
join();
}
void TimerManager::registerTimer(Timer* pTimer)
{
if (!pTimer)
return;
pTimer->acquire();
bool notify = false;
{
std::lock_guard Guard(m_Lock);
// try to find one with equal or lower remaining time.
Timer** ppIter = &m_pHead;
while (*ppIter)
{
if (pTimer->expiresBefore(*ppIter))
{
// next element has higher remaining time,
// => insert new timer before
break;
}
ppIter= &((*ppIter)->m_pNext);
}
// next element has higher remaining time,
// => insert new timer before
pTimer->m_pNext= *ppIter;
*ppIter = pTimer;
if (pTimer == m_pHead)
{
notify = true;
}
}
if (notify) {
// it was inserted as new head
// signal it to TimerManager Thread
m_notEmpty.notify_all();
}
}
void TimerManager::unregisterTimer(Timer * pTimer)
{
if (!pTimer)
return;
auto found = false;
{
// lock access
std::lock_guard Guard(m_Lock);
Timer** ppIter = &m_pHead;
while (*ppIter)
{
if (pTimer == (*ppIter))
{
// remove timer from list
*ppIter = (*ppIter)->m_pNext;
found = true;
break;
}
ppIter= &((*ppIter)->m_pNext);
}
}
if (found) {
pTimer->release();
}
}
bool TimerManager::lookupTimer(const Timer* pTimer)
{
if (!pTimer)
return false;
// lock access
std::lock_guard Guard(m_Lock);
// check the list
for (Timer* pIter = m_pHead; pIter != nullptr; pIter= pIter->m_pNext)
{
if (pIter == pTimer)
return true;
}
return false;
}
void TimerManager::checkForTimeout()
{
std::unique_lock aLock (m_Lock);
if (!m_pHead)
{
return;
}
Timer* pTimer = m_pHead;
if (!pTimer->isExpired())
return;
// remove expired timer
m_pHead = pTimer->m_pNext;
aLock.unlock();
pTimer->onShot();
// restart timer if specified
if (!pTimer->m_aRepeatDelta.isEmpty())
{
TTimeValue Now;
osl_getSystemTime(&Now);
Now.Seconds += pTimer->m_aRepeatDelta.Seconds;
Now.Nanosec += pTimer->m_aRepeatDelta.Nanosec;
pTimer->m_aExpired = Now;
registerTimer(pTimer);
}
pTimer->release();
}
void TimerManager::run()
{
osl_setThreadName("salhelper::TimerManager");
setPriority( osl_Thread_PriorityBelowNormal );
while (schedule())
{
{
std::unique_lock a_Guard(m_Lock);
if (m_pHead != nullptr)
{
TTimeValue delay = m_pHead->getRemainingTime();
m_notEmpty.wait_for(
a_Guard,
std::chrono::nanoseconds(
sal_Int64(delay.Seconds) * 1'000'000'000 + delay.Nanosec),
[this] { return m_terminate; });
}
else
{
m_notEmpty.wait(a_Guard, [this] { return m_terminate || m_pHead != nullptr; });
}
if (m_terminate) {
break;
}
}
checkForTimeout();
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|