blob: 79e143f33ccf88bd4d5651e74d7a04889255417f (
plain)
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
|
// **********************************************************************
//
// Copyright (c) 2003-2004 ZeroC, Inc. All rights reserved.
//
// This copy of Ice is licensed to you under the terms described in the
// ICE_LICENSE file included in this distribution.
//
// **********************************************************************
#include <Ice/Ice.h>
#include <IcePack/WaitQueue.h>
using namespace std;
IcePack::WaitItem::WaitItem(const Ice::ObjectPtr& object) :
_object(object)
{
}
IcePack::WaitItem::~WaitItem()
{
}
const IceUtil::Time&
IcePack::WaitItem:: getExpirationTime()
{
return _expiration;
}
void
IcePack::WaitItem::setExpirationTime(const IceUtil::Time& time)
{
_expiration = time;
}
IcePack::WaitQueue::WaitQueue() : _destroyed(false)
{
}
void
IcePack::WaitQueue::run()
{
IceUtil::Monitor< IceUtil::Mutex>::Lock sync(*this);
while(true)
{
if(_waitQueue.empty() && _workQueue.empty() && !_destroyed)
{
wait();
}
if(!_workQueue.empty())
{
//
// Execute all the work queue items.
//
for(list<WaitItemPtr>::iterator p = _workQueue.begin(); p != _workQueue.end(); ++p)
{
try
{
if(_destroyed)
{
(*p)->expired(true);
}
else
{
(*p)->execute();
}
}
catch(...)
{
}
}
_workQueue.clear();
}
if(_destroyed)
{
break;
}
if(!_waitQueue.empty())
{
//
// Notify expired items.
//
while(!_waitQueue.empty())
{
WaitItemPtr item = _waitQueue.front();
if(item->getExpirationTime() <= IceUtil::Time::now())
{
try
{
item->expired(false);
}
catch(...)
{
}
_waitQueue.pop_front();
}
else
{
//
// Wait until the next item expire or a notification. Note: in any case we
// get out of this loop to get a chance to execute the work queue.
//
timedWait(item->getExpirationTime() - IceUtil::Time::now());
break;
}
}
}
}
assert(_workQueue.empty());
if(!_waitQueue.empty())
{
for(list<WaitItemPtr>::iterator p = _waitQueue.begin(); p != _waitQueue.end(); ++p)
{
(*p)->expired(true);
}
}
}
void
IcePack::WaitQueue::destroy()
{
{
IceUtil::Monitor< IceUtil::Mutex>::Lock sync(*this);
_destroyed = true;
notify();
}
getThreadControl().join();
}
void
IcePack::WaitQueue::add(const WaitItemPtr& item, const IceUtil::Time& wait)
{
IceUtil::Monitor< IceUtil::Mutex>::Lock sync(*this);
//
// We'll have to notify the thread if it's sleeping for good.
//
bool notifyThread = _workQueue.empty() && _waitQueue.empty();
if(wait == IceUtil::Time::seconds(0))
{
item->setExpirationTime(IceUtil::Time::now());
_workQueue.push_back(item);
}
else
{
IceUtil::Time expire = IceUtil::Time::now() + wait;
item->setExpirationTime(expire);
list<WaitItemPtr>::iterator p = _waitQueue.begin();
while(p != _waitQueue.end())
{
if((*p)->getExpirationTime() >= expire)
{
break;
}
++p;
}
_waitQueue.insert(p, item);
}
if(notifyThread)
{
notify();
}
}
void
IcePack::WaitQueue::notifyAllWaitingOn(const Ice::ObjectPtr& object)
{
IceUtil::Monitor< IceUtil::Mutex>::Lock sync(*this);
//
// TODO: OPTIMIZATION: Use a map with the object as a key.
//
list<WaitItemPtr>::iterator p = _waitQueue.begin();
while(p != _waitQueue.end())
{
if((*p)->isWaitingOn(object))
{
_workQueue.push_back(*p);
p = _waitQueue.erase(p);
}
else
{
++p;
}
}
if(!_workQueue.empty())
{
notify();
}
}
|
