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
|
/*
Copyright (C) 2000 Stefan Westerfeld
stefan@space.twc.de
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#include "referenceclean.h"
#include "time.h"
using namespace std;
using namespace Arts;
ReferenceClean::ReferenceClean(Pool<Object_skel>& objectPool)
:objectPool(objectPool)
{
Dispatcher::the()->ioManager()->addTimer(5000, this);
}
void ReferenceClean::notifyTime()
{
/*
* This last_notify and now check is because IOManager accumulates
* notifyTime() calls, so it may happen that we don't get one for ten
* seconds, and then two. However, this breaks the "second-chance"
* algorithm referenceClean is using, which depends on the fact that
* there is some significant time delay between two calls. So we'll
* verify it by hand.
*/
static time_t last_notify = 0;
time_t now;
time(&now);
if(now-last_notify > 4)
{
clean();
last_notify = now;
}
}
void ReferenceClean::forceClean()
{
/*
* as we're giving a second chance on reference clean, we need to
* clean twice to really really clean up
*/
clean();
clean();
}
void ReferenceClean::clean()
{
/*
* we manually iterate through the pool here, to get around the problem
* that if an object disappears, ten other objects might cease to exist
* as well (as they are dependant), which would break a list which we
* could obtain via enumerate() and would probably lead to a crash
*/
unsigned long l;
for(l=0; l<objectPool.max(); l++)
{
Object_skel *skel = objectPool[l];
if(skel) skel->_referenceClean();
}
}
ReferenceClean::~ReferenceClean()
{
Dispatcher::the()->ioManager()->removeTimer(this);
}
|
