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
|
/* -*- 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 "SlsQueueProcessor.hxx"
#include "SlsCacheConfiguration.hxx"
#include "SlsRequestQueue.hxx"
namespace sd { namespace slidesorter { namespace cache {
//===== QueueProcessor ======================================================
QueueProcessor::QueueProcessor (
RequestQueue& rQueue,
const std::shared_ptr<BitmapCache>& rpCache,
const Size& rPreviewSize,
const bool bDoSuperSampling,
const SharedCacheContext& rpCacheContext)
: maMutex(),
maTimer(),
mnTimeBetweenHighPriorityRequests (10/*ms*/),
mnTimeBetweenLowPriorityRequests (100/*ms*/),
mnTimeBetweenRequestsWhenNotIdle (1000/*ms*/),
maPreviewSize(rPreviewSize),
mbDoSuperSampling(bDoSuperSampling),
mpCacheContext(rpCacheContext),
mrQueue(rQueue),
mpCache(rpCache),
maBitmapFactory(),
mbIsPaused(false)
{
// Look into the configuration if there for overriding values.
css::uno::Any aTimeBetweenReqeusts;
aTimeBetweenReqeusts = CacheConfiguration::Instance()->GetValue("TimeBetweenHighPriorityRequests");
if (aTimeBetweenReqeusts.has<sal_Int32>())
aTimeBetweenReqeusts >>= mnTimeBetweenHighPriorityRequests;
aTimeBetweenReqeusts = CacheConfiguration::Instance()->GetValue("TimeBetweenLowPriorityRequests");
if (aTimeBetweenReqeusts.has<sal_Int32>())
aTimeBetweenReqeusts >>= mnTimeBetweenLowPriorityRequests;
aTimeBetweenReqeusts = CacheConfiguration::Instance()->GetValue("TimeBetweenRequestsDuringShow");
if (aTimeBetweenReqeusts.has<sal_Int32>())
aTimeBetweenReqeusts >>= mnTimeBetweenRequestsWhenNotIdle;
maTimer.SetInvokeHandler (LINK(this,QueueProcessor,ProcessRequestHdl));
maTimer.SetTimeout (10);
}
QueueProcessor::~QueueProcessor()
{
}
void QueueProcessor::Start (int nPriorityClass)
{
if (mbIsPaused)
return;
if ( ! maTimer.IsActive())
{
if (nPriorityClass == 0)
maTimer.SetTimeout (10);
else
maTimer.SetTimeout (100);
maTimer.Start();
}
}
void QueueProcessor::Stop()
{
if (maTimer.IsActive())
maTimer.Stop();
}
void QueueProcessor::Pause()
{
mbIsPaused = true;
}
void QueueProcessor::Resume()
{
mbIsPaused = false;
if ( ! mrQueue.IsEmpty())
Start(mrQueue.GetFrontPriorityClass());
}
void QueueProcessor::SetPreviewSize (
const Size& rPreviewSize,
const bool bDoSuperSampling)
{
maPreviewSize = rPreviewSize;
mbDoSuperSampling = bDoSuperSampling;
}
IMPL_LINK_NOARG(QueueProcessor, ProcessRequestHdl, Timer *, void)
{
ProcessRequests();
}
void QueueProcessor::ProcessRequests()
{
assert(mpCacheContext.get()!=nullptr);
// Never process more than one request at a time in order to prevent the
// lock up of the edit view.
if ( ! mrQueue.IsEmpty()
&& ! mbIsPaused
&& mpCacheContext->IsIdle())
{
CacheKey aKey = nullptr;
RequestPriorityClass ePriorityClass (NOT_VISIBLE);
{
::osl::MutexGuard aGuard (mrQueue.GetMutex());
if ( ! mrQueue.IsEmpty())
{
// Get the request with the highest priority from the queue.
ePriorityClass = mrQueue.GetFrontPriorityClass();
aKey = mrQueue.GetFront();
mrQueue.PopFront();
}
}
if (aKey != nullptr)
ProcessOneRequest(aKey, ePriorityClass);
}
// Schedule the processing of the next element(s).
{
::osl::MutexGuard aGuard (mrQueue.GetMutex());
if ( ! mrQueue.IsEmpty())
Start(mrQueue.GetFrontPriorityClass());
}
}
void QueueProcessor::ProcessOneRequest (
CacheKey aKey,
const RequestPriorityClass ePriorityClass)
{
try
{
::osl::MutexGuard aGuard (maMutex);
// Create a new preview bitmap and store it in the cache.
if (mpCache.get() != nullptr
&& mpCacheContext.get() != nullptr)
{
const SdPage* pSdPage = dynamic_cast<const SdPage*>(mpCacheContext->GetPage(aKey));
if (pSdPage != nullptr)
{
const Bitmap aPreview (
maBitmapFactory.CreateBitmap(*pSdPage, maPreviewSize, mbDoSuperSampling));
mpCache->SetBitmap (pSdPage, aPreview, ePriorityClass!=NOT_VISIBLE);
// Initiate a repaint of the new preview.
mpCacheContext->NotifyPreviewCreation(aKey, aPreview);
}
}
}
catch (css::uno::RuntimeException &)
{
OSL_FAIL("RuntimeException caught in QueueProcessor");
}
catch (css::uno::Exception &)
{
OSL_FAIL("Exception caught in QueueProcessor");
}
}
void QueueProcessor::SetBitmapCache (
const std::shared_ptr<BitmapCache>& rpCache)
{
mpCache = rpCache;
}
} } } // end of namespace ::sd::slidesorter::cache
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
