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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include <comphelper/asyncnotification.hxx>
#include <osl/diagnose.h>
#include <osl/mutex.hxx>
#include <osl/conditn.hxx>
#include <comphelper/guarding.hxx>
#include <deque>
#include <set>
#include <functional>
#include <algorithm>
//........................................................................
namespace comphelper
{
//........................................................................
//====================================================================
//= AnyEvent
//====================================================================
//--------------------------------------------------------------------
AnyEvent::AnyEvent()
:m_refCount( 0 )
{
}
//--------------------------------------------------------------------
AnyEvent::~AnyEvent()
{
}
//--------------------------------------------------------------------
oslInterlockedCount SAL_CALL AnyEvent::acquire()
{
return osl_incrementInterlockedCount( &m_refCount );
}
//--------------------------------------------------------------------
oslInterlockedCount SAL_CALL AnyEvent::release()
{
if ( 0 == osl_decrementInterlockedCount( &m_refCount ) )
{
delete this;
return 0;
}
return m_refCount;
}
//====================================================================
//= ProcessableEvent
//====================================================================
struct ProcessableEvent
{
AnyEventRef aEvent;
::rtl::Reference< IEventProcessor > xProcessor;
ProcessableEvent( const AnyEventRef& _rEvent, const ::rtl::Reference< IEventProcessor >& _xProcessor )
:aEvent( _rEvent )
,xProcessor( _xProcessor )
{
}
ProcessableEvent( const ProcessableEvent& _rRHS )
:aEvent( _rRHS.aEvent )
,xProcessor( _rRHS.xProcessor )
{
}
ProcessableEvent& operator=( const ProcessableEvent& _rRHS )
{
aEvent = _rRHS.aEvent;
xProcessor = _rRHS.xProcessor;
return *this;
}
};
//====================================================================
typedef ::std::deque< ProcessableEvent > EventQueue;
//====================================================================
struct EqualProcessor : public ::std::unary_function< ProcessableEvent, bool >
{
const ::rtl::Reference< IEventProcessor >& rProcessor;
EqualProcessor( const ::rtl::Reference< IEventProcessor >& _rProcessor ) :rProcessor( _rProcessor ) { }
bool operator()( const ProcessableEvent& _rEvent )
{
return _rEvent.xProcessor.get() == rProcessor.get();
}
};
//====================================================================
//= EventNotifierImpl
//====================================================================
struct EventNotifierImpl
{
::osl::Mutex aMutex;
oslInterlockedCount m_refCount;
::osl::Condition aPendingActions;
EventQueue aEvents;
::std::set< ::rtl::Reference< IEventProcessor > >
m_aDeadProcessors;
EventNotifierImpl()
:m_refCount( 0 )
{
}
private:
EventNotifierImpl( const EventNotifierImpl& ); // never implemented
EventNotifierImpl& operator=( const EventNotifierImpl& ); // never implemented
};
//====================================================================
//= AsyncEventNotifier
//====================================================================
//--------------------------------------------------------------------
AsyncEventNotifier::AsyncEventNotifier()
:m_pImpl( new EventNotifierImpl )
{
}
//--------------------------------------------------------------------
AsyncEventNotifier::~AsyncEventNotifier()
{
}
//--------------------------------------------------------------------
void AsyncEventNotifier::removeEventsForProcessor( const ::rtl::Reference< IEventProcessor >& _xProcessor )
{
::osl::MutexGuard aGuard( m_pImpl->aMutex );
// remove all events for this processor
::std::remove_if( m_pImpl->aEvents.begin(), m_pImpl->aEvents.end(), EqualProcessor( _xProcessor ) );
// and just in case that an event for exactly this processor has just been
// popped from the queue, but not yet processed: remember it:
m_pImpl->m_aDeadProcessors.insert( _xProcessor );
}
//--------------------------------------------------------------------
void SAL_CALL AsyncEventNotifier::terminate()
{
::osl::MutexGuard aGuard( m_pImpl->aMutex );
// remember the termination request
Thread::terminate();
// awake the thread
m_pImpl->aPendingActions.set();
}
//--------------------------------------------------------------------
void AsyncEventNotifier::addEvent( const AnyEventRef& _rEvent, const ::rtl::Reference< IEventProcessor >& _xProcessor )
{
::osl::MutexGuard aGuard( m_pImpl->aMutex );
OSL_TRACE( "AsyncEventNotifier(%p): adding %p", this, _rEvent.get() );
// remember this event
m_pImpl->aEvents.push_back( ProcessableEvent( _rEvent, _xProcessor ) );
// awake the thread
m_pImpl->aPendingActions.set();
}
//--------------------------------------------------------------------
void AsyncEventNotifier::run()
{
acquire();
// keep us alive, in case we're terminated in the mid of the following
::rtl::Reference< AsyncEventNotifier > xKeepAlive( this );
do
{
AnyEventRef aNextEvent;
::rtl::Reference< IEventProcessor > xNextProcessor;
::osl::ClearableMutexGuard aGuard( m_pImpl->aMutex );
while ( m_pImpl->aEvents.size() > 0 )
{
ProcessableEvent aEvent( m_pImpl->aEvents.front() );
aNextEvent = aEvent.aEvent;
xNextProcessor = aEvent.xProcessor;
m_pImpl->aEvents.pop_front();
OSL_TRACE( "AsyncEventNotifier(%p): popping %p", this, aNextEvent.get() );
if ( !aNextEvent.get() )
continue;
// process the event, but only if it's processor did not die inbetween
::std::set< ::rtl::Reference< IEventProcessor > >::iterator deadPos = m_pImpl->m_aDeadProcessors.find( xNextProcessor );
if ( deadPos != m_pImpl->m_aDeadProcessors.end() )
{
m_pImpl->m_aDeadProcessors.erase( xNextProcessor );
xNextProcessor.clear();
OSL_TRACE( "AsyncEventNotifier(%p): removing %p", this, aNextEvent.get() );
}
// if there was a termination request (->terminate), respect it
if ( !schedule() )
return;
{
::comphelper::MutexRelease aReleaseOnce( m_pImpl->aMutex );
if ( xNextProcessor.get() )
xNextProcessor->processEvent( *aNextEvent.get() );
}
}
// if there was a termination request (->terminate), respect it
if ( !schedule() )
return;
// wait for new events to process
aGuard.clear();
m_pImpl->aPendingActions.reset();
m_pImpl->aPendingActions.wait();
}
while ( sal_True );
}
//--------------------------------------------------------------------
void SAL_CALL AsyncEventNotifier::onTerminated()
{
Thread::onTerminated();
// when we were started (->run), we aquired ourself. Release this now
// that we were finally terminated
release();
}
//--------------------------------------------------------------------
oslInterlockedCount SAL_CALL AsyncEventNotifier::acquire()
{
return osl_incrementInterlockedCount( &m_pImpl->m_refCount );
}
//--------------------------------------------------------------------
oslInterlockedCount SAL_CALL AsyncEventNotifier::release()
{
if ( 0 == osl_decrementInterlockedCount( &m_pImpl->m_refCount ) )
{
delete this;
return 0;
}
return m_pImpl->m_refCount;
}
//........................................................................
} // namespace comphelper
//........................................................................
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|