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
|
/* -*- 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 <tools/diagnose_ex.h>
#include <comphelper/anytostring.hxx>
#include <cppuhelper/exc_hlp.hxx>
#include <event.hxx>
#include <eventqueue.hxx>
#include <slideshowexceptions.hxx>
#include <limits>
#include <memory>
using namespace ::com::sun::star;
namespace slideshow
{
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(
std::shared_ptr<canvas::tools::ElapsedTime> const & pPresTimer )
: maMutex(),
maEvents(),
maNextEvents(),
maNextNextEvents(),
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_FAIL( OUStringToOString(
comphelper::anyToString(
cppu::getCaughtException() ),
RTL_TEXTENCODING_UTF8 ).getStr() );
}
maEvents.pop();
}
}
bool EventQueue::addEvent( const EventSharedPtr& rEvent )
{
::osl::MutexGuard aGuard( maMutex );
SAL_INFO("slideshow.eventqueue", "adding event \"" << rEvent->GetDescription()
<< "\" [" << rEvent.get()
<< "] at " << mpTimer->getElapsedTime()
<< " with delay " << rEvent->getActivationTime(0.0)
);
ENSURE_OR_RETURN_FALSE( rEvent,
"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 )
{
::osl::MutexGuard aGuard( maMutex );
SAL_INFO("slideshow.eventqueue", "adding event \"" << rEvent->GetDescription()
<< "\" [" << rEvent.get()
<< "] for the next round at " << mpTimer->getElapsedTime()
<< " with delay " << rEvent->getActivationTime(0.0)
);
ENSURE_OR_RETURN_FALSE( rEvent.get() != nullptr,
"EventQueue::addEvent: event ptr NULL" );
maNextEvents.push_back(
EventEntry( rEvent, rEvent->getActivationTime(
mpTimer->getElapsedTime()) ) );
return true;
}
bool EventQueue::addEventWhenQueueIsEmpty (const EventSharedPtr& rpEvent)
{
::osl::MutexGuard aGuard( maMutex );
SAL_INFO("slideshow.eventqueue", "adding event \"" << rpEvent->GetDescription()
<< "\" [" << rpEvent.get()
<< "] for execution when the queue is empty at " << mpTimer->getElapsedTime()
<< " with delay " << rpEvent->getActivationTime(0.0)
);
ENSURE_OR_RETURN_FALSE(
rpEvent.get() != nullptr,
"EventQueue::addEvent: event ptr NULL");
maNextNextEvents.push(
EventEntry(
rpEvent,
rpEvent->getActivationTime(mpTimer->getElapsedTime())));
return true;
}
void EventQueue::forceEmpty()
{
::osl::MutexGuard aGuard( maMutex );
process_(true);
}
void EventQueue::process()
{
::osl::MutexGuard aGuard( maMutex );
process_(false);
}
void EventQueue::process_( bool bFireAllEvents )
{
SAL_INFO("slideshow.verbose", "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() );
// When maEvents does not contain any events that are due now
// then process one event from maNextNextEvents.
if (!maNextNextEvents.empty()
&& !bFireAllEvents
&& (maEvents.empty() || maEvents.top().nTime > nCurrTime))
{
const EventEntry aEvent (maNextNextEvents.top());
maNextNextEvents.pop();
maEvents.push(aEvent);
}
// 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
{
SAL_INFO("slideshow.eventqueue", "firing event \""
<< event.pEvent->GetDescription()
<< "\" [" << event.pEvent.get()
<< "] at " << mpTimer->getElapsedTime()
<< " with delay " << event.pEvent->getActivationTime(0.0)
);
event.pEvent->fire();
SAL_INFO("slideshow.eventqueue", "event \""
<< event.pEvent->GetDescription()
<< "\" [" << event.pEvent.get() << "] fired"
);
}
catch( uno::RuntimeException& )
{
throw;
}
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 explicitly 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_FAIL( OUStringToOString(
comphelper::anyToString( cppu::getCaughtException() ),
RTL_TEXTENCODING_UTF8 ).getStr() );
}
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 explicitly 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
{
SAL_INFO(
"slideshow.eventqueue",
"Ignoring discharged event: unknown ("
<< event.pEvent.get() << "), timeout was: "
<< event.pEvent->getActivationTime(0.0));
}
}
}
bool EventQueue::isEmpty() const
{
::osl::MutexGuard aGuard( maMutex );
return maEvents.empty() && maNextEvents.empty() && maNextNextEvents.empty();
}
double EventQueue::nextTimeout() const
{
::osl::MutexGuard aGuard( maMutex );
// return time for next entry (if any)
double nTimeout (::std::numeric_limits<double>::max());
const double nCurrentTime (mpTimer->getElapsedTime());
if ( ! maEvents.empty())
nTimeout = maEvents.top().nTime - nCurrentTime;
if ( ! maNextEvents.empty())
nTimeout = ::std::min(nTimeout, maNextEvents.front().nTime - nCurrentTime);
if ( ! maNextNextEvents.empty())
nTimeout = ::std::min(nTimeout, maNextNextEvents.top().nTime - nCurrentTime);
return nTimeout;
}
void EventQueue::clear()
{
::osl::MutexGuard aGuard( maMutex );
// TODO(P1): Maybe a plain vector and vector.swap will
// be faster here. Profile.
maEvents = ImplQueueType();
maNextEvents.clear();
maNextNextEvents = ImplQueueType();
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|