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 313 314 315 316 317 318 319 320 321 322
|
/* -*- 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.
*
************************************************************************/
#ifndef SD_SLIDESORTER_QUEUE_PROCESSOR_THREAD_HXX
#define SD_SLIDESORTER_QUEUE_PROCESSOR_THREAD_HXX
#include "view/SlsPageObjectViewObjectContact.hxx"
#include <vcl/svapp.hxx>
#include <osl/thread.hxx>
namespace sd { namespace slidesorter { namespace view {
class SlideSorterView;
} } }
namespace sd { namespace slidesorter { namespace cache {
template <class Queue,
class RequestData,
class BitmapCache,
class BitmapFactory>
class QueueProcessorThread
: public ::osl::Thread
{
public:
QueueProcessorThread (
view::SlideSorterView& rView,
Queue& rQueue,
BitmapCache& rCache);
~QueueProcessorThread (void);
/** Start the execution of a suspended thread. A thread is suspended
after Stop() is called or when the queue on which it operates is
empty. Calling Start() on a running thread is OK.
*/
void Start (void);
/** Stop the thread by suspending it. To re-start its execution call
Start().
*/
void Stop (void);
/** As we can not really terminate the rendering of a preview bitmap for
a request in midair this method acts more like a semaphor. It
returns only when it is save for the caller to delete the request.
For this to work it is important to remove the request from the
queue before calling this method.
*/
void RemoveRequest (RequestData& rRequest);
/** Terminate the execution of the thread. When the thread is detached
it deletes itself. Otherwise the caller of this method may call
delete after this method returnes.
*/
void SAL_CALL Terminate (void);
protected:
/** This virutal method is called (among others?) from the
inherited create method and acts as the main function of this
thread.
*/
virtual void SAL_CALL run (void);
/** Called after the thread is terminated via the terminate
method. Used to kill the thread by calling delete on this.
*/
virtual void SAL_CALL onTerminated (void);
private:
/** Flag that indicates wether the onTerminated method has been already
called. If so then a subsequent call to detach deletes the thread.
*/
volatile bool mbIsTerminated;
volatile bool mbCanBeJoined;
/** This mutex is used to guard the queue processor. Be carefull not to
mix its use with that of the solar mutex.
*/
::osl::Mutex maMutex;
view::SlideSorterView& mrView;
Queue& mrQueue;
BitmapCache& mrCache;
void ProcessQueueEntry (void);
};
//===== QueueProcessorThread ================================================
template <class Queue, class Request, class Cache, class Factory>
QueueProcessorThread<Queue, Request, Cache, Factory>
::QueueProcessorThread (
view::SlideSorterView& rView,
Queue& rQueue,
Cache& rCache)
: mbIsTerminated (false),
mbCanBeJoined (false),
mrView (rView),
mrQueue (rQueue),
mrCache (rCache)
{
create();
}
template <class Queue, class Request, class Cache, class Factory>
QueueProcessorThread<Queue, Request, Cache, Factory>
::~QueueProcessorThread (void)
{
}
template <class Queue, class Request, class Cache, class Factory>
void SAL_CALL QueueProcessorThread<Queue, Request, Cache, Factory>::run (void)
{
while ( ! mbIsTerminated)
{
if (mrQueue.IsEmpty())
{
// Sleep while the queue is empty.
suspend();
}
else if (GetpApp()->AnyInput())
{
yield();
// When there is input waiting to be processed we wait a short
// time and try again.
TimeValue aTimeToWait;
aTimeToWait.Seconds = 0;
aTimeToWait.Nanosec = 50*1000*1000;
wait (aTimeToWait);
}
else
{
ProcessQueueEntry();
yield ();
}
}
}
template <class Queue, class Request, class Cache, class Factory>
void QueueProcessorThread<Queue, Request, Cache, Factory>
::ProcessQueueEntry (void)
{
Request* pRequest = NULL;
int nPriorityClass;
bool bRequestIsValid = false;
do
{
{
::osl::MutexGuard aGuard (maMutex);
if (mbIsTerminated)
break;
if (mrQueue.IsEmpty())
break;
}
SolarMutexGuard aSolarGuard;
::osl::MutexGuard aGuard (maMutex);
if (mbIsTerminated)
break;
if (mrQueue.IsEmpty())
break;
// Get the requeuest with the highest priority from the queue.
nPriorityClass = mrQueue.GetFrontPriorityClass();
pRequest = &mrQueue.GetFront();
mrQueue.PopFront();
bRequestIsValid = true;
try
{
// Create a new preview bitmap and store it in the cache.
if (mbIsTerminated)
break;
BitmapEx aBitmap (Factory::CreateBitmap (*pRequest, mrView));
if (mbIsTerminated)
break;
mrCache.SetBitmap (
pRequest->GetPage(),
aBitmap,
nPriorityClass==0);
}
catch (...)
{
OSL_TRACE ("QueueProcessorThread::ProcessQueueEntry(): caught exception; %p", this);
// We are rendering a preview and can do without if need
// be. So keep going if something happens that should
// not happen.
}
}
while (false);
}
template <class Queue,
class RequestData,
class BitmapCache,
class BitmapFactory>
void QueueProcessorThread<
Queue, RequestData, BitmapCache, BitmapFactory
>::Start (void)
{
resume ();
}
template <class Queue,
class RequestData,
class BitmapCache,
class BitmapFactory>
void QueueProcessorThread<
Queue, RequestData, BitmapCache, BitmapFactory
>::Stop (void)
{
suspend();
}
template <class Queue,
class RequestData,
class BitmapCache,
class BitmapFactory>
void QueueProcessorThread<
Queue, RequestData, BitmapCache, BitmapFactory
>::RemoveRequest (RequestData& rRequest)
{
// Do nothing else then wait for the mutex to be released.
::osl::MutexGuard aGuard (mrQueue.GetMutex());
}
template <class Queue,
class RequestData,
class BitmapCache,
class BitmapFactory>
void QueueProcessorThread<
Queue, RequestData, BitmapCache, BitmapFactory
>::Terminate (void)
{
// SolarMutexGuard aSolarGuard;
::osl::Thread::terminate ();
{
::osl::MutexGuard aGuard (maMutex);
mbIsTerminated = true;
}
Start();
}
/** This callback method is called when the run() method terminates.
*/
template <class Queue,
class RequestData,
class BitmapCache,
class BitmapFactory>
void SAL_CALL QueueProcessorThread<
Queue, RequestData, BitmapCache, BitmapFactory
>::onTerminated (void)
{
::osl::MutexGuard aGuard (maMutex);
mbCanBeJoined = true;
}
} } } // end of namespace ::sd::slidesorter::cache
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|