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
|
/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: eventqueue.cxx,v $
*
* $Revision: 1.10 $
*
* last change: $Author: rt $ $Date: 2006-07-26 07:25:33 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
// must be first
#include <canvas/debug.hxx>
#ifndef _CANVAS_VERBOSETRACE_HXX
#include <canvas/verbosetrace.hxx>
#endif
#include <comphelper/anytostring.hxx>
#include <cppuhelper/exc_hlp.hxx>
#include <event.hxx>
#include <eventqueue.hxx>
#include <slideshowexceptions.hxx>
#include <boost/shared_ptr.hpp>
#include <boost/mem_fn.hpp>
#include <queue>
#include <algorithm>
#include <limits>
using namespace ::com::sun::star;
namespace presentation
{
namespace internal
{
bool EventQueue::EventEntry::operator<( const EventEntry& rEvent ) const
{
// negate comparison, we want priority queue to be sorted
// in increasing order of activation times
return this->nTime > rEvent.nTime;
}
EventQueue::EventQueue(
boost::shared_ptr<canvas::tools::ElapsedTime> const & pPresTimer )
: maEvents(),
maNextEvents(),
mpTimer( pPresTimer )
{
}
EventQueue::~EventQueue()
{
// add in all that have been added explicitly for this round:
EventEntryVector::const_iterator const iEnd( maNextEvents.end() );
for ( EventEntryVector::const_iterator iPos( maNextEvents.begin() );
iPos != iEnd; ++iPos ) {
maEvents.push(*iPos);
}
EventEntryVector().swap( maNextEvents );
// dispose event queue
while( !maEvents.empty() )
{
try {
maEvents.top().pEvent->dispose();
}
catch (uno::Exception &) {
OSL_ENSURE( false, rtl::OUStringToOString(
comphelper::anyToString(
cppu::getCaughtException() ),
RTL_TEXTENCODING_UTF8 ).getStr() );
}
maEvents.pop();
}
}
bool EventQueue::addEvent( const EventSharedPtr& rEvent )
{
ENSURE_AND_RETURN( rEvent.get() != NULL,
"EventQueue::addEvent: event ptr NULL" );
// prepare entry
// A seemingly obvious optimization cannot be used here,
// because it breaks assumed order of notification: zero
// timeout events could be fired() immediately, but that
// would not unwind the stack and furthermore changes
// order of notification
// add entry
maEvents.push( EventEntry( rEvent, rEvent->getActivationTime(
mpTimer->getElapsedTime()) ) );
return true;
}
bool EventQueue::addEventForNextRound( EventSharedPtr const& rEvent )
{
ENSURE_AND_RETURN( rEvent.get() != NULL,
"EventQueue::addEvent: event ptr NULL" );
maNextEvents.push_back(
EventEntry( rEvent, rEvent->getActivationTime(
mpTimer->getElapsedTime()) ) );
return true;
}
void EventQueue::forceEmpty()
{
process_(true);
}
void EventQueue::process()
{
process_(false);
}
void EventQueue::process_( bool bFireAllEvents )
{
VERBOSE_TRACE( "EventQueue: heartbeat" );
// add in all that have been added explicitly for this round:
EventEntryVector::const_iterator const iEnd( maNextEvents.end() );
for ( EventEntryVector::const_iterator iPos( maNextEvents.begin() );
iPos != iEnd; ++iPos ) {
maEvents.push(*iPos);
}
EventEntryVector().swap( maNextEvents );
// perform topmost, ready-to-execute event
// =======================================
const double nCurrTime( mpTimer->getElapsedTime() );
// process ready/elapsed events. Note that the 'perceived'
// current time remains constant for this loop, thus we're
// processing only those events which where ready when we
// entered this method.
while( !maEvents.empty() &&
(bFireAllEvents || maEvents.top().nTime <= nCurrTime) )
{
EventEntry event( maEvents.top() );
maEvents.pop();
// only process event, if it is still 'charged',
// i.e. the fire() call effects something. This is
// used when e.g. having events registered at multiple
// places, which should fire only once: after the
// initial fire() call, those events become inactive
// and return false on isCharged. This frees us from
// the need to prune queues of those inactive shells.
if( event.pEvent->isCharged() )
{
try
{
#if OSL_DEBUG_LEVEL > 0
VERBOSE_TRACE( "Firing event: unknown (0x%X), timeout was: %f",
event.pEvent.get(),
event.pEvent->getActivationTime(0.0) );
#endif
event.pEvent->fire();
}
catch( uno::Exception& )
{
// catch anything here, we don't want
// to leave this scope under _any_
// circumstance. Although, do _not_
// reinsert an activity that threw
// once.
// NOTE: we explicitely don't catch(...) here,
// since this will also capture segmentation
// violations and the like. In such a case, we
// still better let our clients now...
OSL_TRACE( "::presentation::internal::EventQueue: Event threw a uno::Exception, action might not have been fully performed" );
}
catch( SlideShowException& )
{
// catch anything here, we don't want
// to leave this scope under _any_
// circumstance. Although, do _not_
// reinsert an activity that threw
// once.
// NOTE: we explicitely don't catch(...) here,
// since this will also capture segmentation
// violations and the like. In such a case, we
// still better let our clients now...
OSL_TRACE( "::presentation::internal::EventQueue: Event threw a SlideShowException, action might not have been fully performed" );
}
}
else
{
#if OSL_DEBUG_LEVEL > 0
VERBOSE_TRACE( "Ignoring discharged event: unknown (0x%X), timeout was: %f",
event.pEvent.get(),
event.pEvent->getActivationTime(0.0) );
#endif
}
}
}
bool EventQueue::isEmpty() const
{
return maEvents.empty();
}
double EventQueue::nextTimeout() const
{
// return time for next entry (if any)
return isEmpty() ?
::std::numeric_limits<double>::max() :
maEvents.top().nTime - mpTimer->getElapsedTime();
}
void EventQueue::clear()
{
// TODO(P1): Maybe a plain vector and vector.swap will
// be faster here. Profile.
maEvents = ImplQueueType();
}
}
}
|
