/* -*- 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 . */ // must be first #include #include #include #include #include #include #include #include #include #include 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( boost::shared_ptr 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() != NULL, "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() != NULL, "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::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: */ > LibreOffice 核心代码仓库文档基金会
summaryrefslogtreecommitdiff
path: root/stoc
AgeCommit message (Expand)Author
2019-03-21pUnoReturn should be null when UNO methode is VOIDJuergen Funk
2019-03-04simplify UNO getTypes methodsNoel Grandin
2019-02-13Avoid index for single getToken() callMatteo Casalin
2019-02-12tdf#120703 PVS: remove redundant static castsMike Kaganski
2019-02-11new loplugin writeonlyvarsNoel Grandin
2019-02-10loplugin:indentation in soltools..svlNoel Grandin
2019-01-31const_cast is not needed hereMike Kaganski
2019-01-31loplugin:unnecessaryparen (clang-cl)Stephan Bergmann
2019-01-30loplugin:redundantinline (clang-cl)Stephan Bergmann
2019-01-29loplugin:flatten in stoc..storeNoel Grandin
2019-01-11Replace OUStringBuffer::appendCopy with append(std::u16string_view)Stephan Bergmann
2018-11-29Simplify containers iterations in slideshow, sot, starmath, stocArkadiy Illarionov
2018-11-22improve function-local statics in scripting..svtoolsNoel Grandin
2018-11-16loplugin:buriedassign in sd..writerfilterNoel Grandin
2018-11-04tdf#120703 PVS: V547 Expression is always true/falseMike Kaganski
2018-11-04replace double-checked locking patterns with thread safe local staticsMike Kaganski
2018-11-02fix signatures of deleted copy/assign operatorsNoel Grandin
2018-10-24remove more rtl::OUString and OString prefixesNoel Grandin
2018-10-18clang-tidy readability-simplify-boolean-exprNoel Grandin
2018-10-17clang-tidy readability-redundant-smartptr-getNoel Grandin
2018-10-09Extend loplugin:redundantinline to catch inline functions w/o external linkageStephan Bergmann
2018-10-08tdf#120362: Don't ask user to enable JVM when enumerating scriptsMike Kaganski
2018-10-08loplugin:constfields in stoc..svgioNoel Grandin
2018-09-17New loplugin:externalStephan Bergmann
2018-09-12loplugin:simplifyconstruct in stoc..svlNoel Grandin
2018-09-10tdf#42949 Fix IWYU warnings in include/cppuhelper/*Gabor Kelemen
2018-09-05clang-tidy performance-inefficient-vector-operationNoel Grandin