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
|
/* -*- 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.
*
************************************************************************/
#include "SlsCacheCompactor.hxx"
#include "SlsBitmapCompressor.hxx"
#include "SlsBitmapCache.hxx"
#include "SlsCacheCompactor.hxx"
#include "SlsCacheConfiguration.hxx"
#include <rtl/ustring.hxx>
#include <com/sun/star/uno/Any.hxx>
#include <set>
using namespace ::com::sun::star::uno;
// Uncomment the definition of VERBOSE to get some more OSL_TRACE messages.
#ifdef DEBUG
//#define VERBOSE
#endif
namespace {
/** This is a trivial implementation of the CacheCompactor interface class.
It ignores calls to RequestCompaction() and thus will never decrease the
total size of off-screen preview bitmaps.
*/
class NoCacheCompaction
: public ::sd::slidesorter::cache::CacheCompactor
{
public:
NoCacheCompaction (
::sd::slidesorter::cache::BitmapCache& rCache,
sal_Int32 nMaximalCacheSize)
: CacheCompactor(rCache, nMaximalCacheSize)
{}
virtual void RequestCompaction (void) { /* Ignored */ };
protected:
virtual void Run (void) { /* Do nothing */ };
};
/** This implementation of the CacheCompactor interface class uses one of
several bitmap compression algorithms to reduce the number of the bytes
of the off-screen previews in the bitmap cache. See the documentation
of CacheCompactor::Create() for more details on configuration properties
that control the choice of compression algorithm.
*/
class CacheCompactionByCompression
: public ::sd::slidesorter::cache::CacheCompactor
{
public:
CacheCompactionByCompression (
::sd::slidesorter::cache::BitmapCache& rCache,
sal_Int32 nMaximalCacheSize,
const ::boost::shared_ptr< ::sd::slidesorter::cache::BitmapCompressor>& rpCompressor);
protected:
virtual void Run (void);
private:
::boost::shared_ptr< ::sd::slidesorter::cache::BitmapCompressor> mpCompressor;
};
} // end of anonymous namespace
namespace sd { namespace slidesorter { namespace cache {
SAL_WNODEPRECATED_DECLARATIONS_PUSH
::std::auto_ptr<CacheCompactor> CacheCompactor::Create (
BitmapCache& rCache,
sal_Int32 nMaximalCacheSize)
{
static const ::rtl::OUString sNone (RTL_CONSTASCII_USTRINGPARAM("None"));
static const ::rtl::OUString sCompress (RTL_CONSTASCII_USTRINGPARAM("Compress"));
static const ::rtl::OUString sErase (RTL_CONSTASCII_USTRINGPARAM("Erase"));
static const ::rtl::OUString sResolution (RTL_CONSTASCII_USTRINGPARAM("ResolutionReduction"));
static const ::rtl::OUString sPNGCompression (RTL_CONSTASCII_USTRINGPARAM("PNGCompression"));
::boost::shared_ptr<BitmapCompressor> pCompressor;
::rtl::OUString sCompressionPolicy(sPNGCompression);
Any aCompressionPolicy (CacheConfiguration::Instance()->GetValue(
::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("CompressionPolicy"))));
if (aCompressionPolicy.has<rtl::OUString>())
aCompressionPolicy >>= sCompressionPolicy;
if (sCompressionPolicy == sNone)
pCompressor.reset(new NoBitmapCompression());
else if (sCompressionPolicy == sErase)
pCompressor.reset(new CompressionByDeletion());
else if (sCompressionPolicy == sResolution)
pCompressor.reset(new ResolutionReduction());
else
pCompressor.reset(new PngCompression());
::std::auto_ptr<CacheCompactor> pCompactor (NULL);
::rtl::OUString sCompactionPolicy(sCompress);
Any aCompactionPolicy (CacheConfiguration::Instance()->GetValue(
::rtl::OUString(RTL_CONSTASCII_USTRINGPARAM("CompactionPolicy"))));
if (aCompactionPolicy.has<rtl::OUString>())
aCompactionPolicy >>= sCompactionPolicy;
if (sCompactionPolicy == sNone)
pCompactor.reset(new NoCacheCompaction(rCache,nMaximalCacheSize));
else
pCompactor.reset(new CacheCompactionByCompression(rCache,nMaximalCacheSize,pCompressor));
return pCompactor;
}
SAL_WNODEPRECATED_DECLARATIONS_POP
void CacheCompactor::RequestCompaction (void)
{
if ( ! mbIsCompactionRunning && ! maCompactionTimer.IsActive())
maCompactionTimer.Start();
}
CacheCompactor::CacheCompactor(
BitmapCache& rCache,
sal_Int32 nMaximalCacheSize)
: mrCache(rCache),
mnMaximalCacheSize(nMaximalCacheSize),
mbIsCompactionRunning(false)
{
maCompactionTimer.SetTimeout(100 /*ms*/);
maCompactionTimer.SetTimeoutHdl(LINK(this,CacheCompactor,CompactionCallback));
}
IMPL_LINK(CacheCompactor, CompactionCallback, Timer*, EMPTYARG)
{
mbIsCompactionRunning = true;
try
{
Run();
}
catch (const ::com::sun::star::uno::RuntimeException&)
{
}
catch (const ::com::sun::star::uno::Exception&)
{
}
mbIsCompactionRunning = false;
return 1;
}
} } } // end of namespace ::sd::slidesorter::cache
namespace {
//===== CacheCompactionByCompression ==========================================
CacheCompactionByCompression::CacheCompactionByCompression (
::sd::slidesorter::cache::BitmapCache& rCache,
sal_Int32 nMaximalCacheSize,
const ::boost::shared_ptr< ::sd::slidesorter::cache::BitmapCompressor>& rpCompressor)
: CacheCompactor(rCache,nMaximalCacheSize),
mpCompressor(rpCompressor)
{
}
void CacheCompactionByCompression::Run (void)
{
if (mrCache.GetSize() > mnMaximalCacheSize)
{
#ifdef VERBOSE
OSL_TRACE ("bitmap cache uses to much space: %d > %d",
mrCache.GetSize(), mnMaximalCacheSize);
#endif
SAL_WNODEPRECATED_DECLARATIONS_PUSH
::std::auto_ptr< ::sd::slidesorter::cache::BitmapCache::CacheIndex> pIndex (
mrCache.GetCacheIndex(false,false));
SAL_WNODEPRECATED_DECLARATIONS_POP
::sd::slidesorter::cache::BitmapCache::CacheIndex::iterator iIndex;
for (iIndex=pIndex->begin(); iIndex!=pIndex->end(); ++iIndex)
{
if (*iIndex == NULL)
continue;
mrCache.Compress(*iIndex, mpCompressor);
if (mrCache.GetSize() < mnMaximalCacheSize)
break;
}
mrCache.ReCalculateTotalCacheSize();
#ifdef VERBOSE
OSL_TRACE (" there are now %d bytes occupied", mrCache.GetSize());
#endif
}
}
} // end of anonymous namespace
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
