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
|
/* -*- 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 <canvas/debug.hxx>
#include <canvas/verbosetrace.hxx>
#include <comphelper/anytostring.hxx>
#include <cppuhelper/exc_hlp.hxx>
#include "slideshowexceptions.hxx"
#include "activity.hxx"
#include "activitiesqueue.hxx"
#include <boost/mem_fn.hpp>
#include <boost/shared_ptr.hpp>
#include <algorithm>
using namespace ::com::sun::star;
namespace slideshow
{
namespace internal
{
ActivitiesQueue::ActivitiesQueue(
const ::boost::shared_ptr< ::canvas::tools::ElapsedTime >& pPresTimer ) :
mpTimer( pPresTimer ),
maCurrentActivitiesWaiting(),
maCurrentActivitiesReinsert(),
maDequeuedActivities()
{
}
ActivitiesQueue::~ActivitiesQueue()
{
// dispose all queue entries
try
{
std::for_each( maCurrentActivitiesWaiting.begin(),
maCurrentActivitiesWaiting.end(),
boost::mem_fn( &Disposable::dispose ) );
std::for_each( maCurrentActivitiesReinsert.begin(),
maCurrentActivitiesReinsert.end(),
boost::mem_fn( &Disposable::dispose ) );
}
catch (uno::Exception &)
{
OSL_FAIL( OUStringToOString(
comphelper::anyToString(
cppu::getCaughtException() ),
RTL_TEXTENCODING_UTF8 ).getStr() );
}
}
bool ActivitiesQueue::addActivity( const ActivitySharedPtr& pActivity )
{
OSL_ENSURE( pActivity, "ActivitiesQueue::addActivity: activity ptr NULL" );
if( !pActivity )
return false;
// add entry to waiting list
maCurrentActivitiesWaiting.push_back( pActivity );
return true;
}
void ActivitiesQueue::process()
{
VERBOSE_TRACE( "ActivitiesQueue: outer loop heartbeat" );
// accumulate time lag for all activities, and lag time
// base if necessary:
ActivityQueue::const_iterator iPos(
maCurrentActivitiesWaiting.begin() );
const ActivityQueue::const_iterator iEnd(
maCurrentActivitiesWaiting.end() );
double fLag = 0.0;
for ( ; iPos != iEnd; ++iPos )
fLag = std::max<double>( fLag, (*iPos)->calcTimeLag() );
if (fLag > 0.0)
{
mpTimer->adjustTimer( -fLag );
}
// process list of activities
while( !maCurrentActivitiesWaiting.empty() )
{
// process topmost activity
ActivitySharedPtr pActivity( maCurrentActivitiesWaiting.front() );
maCurrentActivitiesWaiting.pop_front();
bool bReinsert( false );
try
{
// fire up activity
bReinsert = pActivity->perform();
}
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::ActivitiesQueue: Activity threw a SlideShowException, removing from ring" );
}
if( bReinsert )
maCurrentActivitiesReinsert.push_back( pActivity );
else
maDequeuedActivities.push_back( pActivity );
VERBOSE_TRACE( "ActivitiesQueue: inner loop heartbeat" );
}
if( !maCurrentActivitiesReinsert.empty() )
{
// reinsert all processed, but not finished
// activities back to waiting queue. With swap(),
// we kill two birds with one stone: we reuse the
// list nodes, and we clear the
// maCurrentActivitiesReinsert list
maCurrentActivitiesWaiting.swap( maCurrentActivitiesReinsert );
}
}
void ActivitiesQueue::processDequeued()
{
// notify all dequeued activities from last round
::std::for_each( maDequeuedActivities.begin(),
maDequeuedActivities.end(),
::boost::mem_fn( &Activity::dequeued ) );
maDequeuedActivities.clear();
}
bool ActivitiesQueue::isEmpty() const
{
return maCurrentActivitiesWaiting.empty() && maCurrentActivitiesReinsert.empty();
}
void ActivitiesQueue::clear()
{
// dequeue all entries:
std::for_each( maCurrentActivitiesWaiting.begin(),
maCurrentActivitiesWaiting.end(),
boost::mem_fn( &Activity::dequeued ) );
ActivityQueue().swap( maCurrentActivitiesWaiting );
std::for_each( maCurrentActivitiesReinsert.begin(),
maCurrentActivitiesReinsert.end(),
boost::mem_fn( &Activity::dequeued ) );
ActivityQueue().swap( maCurrentActivitiesReinsert );
}
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
