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
323
324
325
326
327
328
329
330
331
332
333
334
|
/****************************************************************************
**
** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies).
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtGui module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the either Technology Preview License Agreement or the
** Beta Release License Agreement.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain
** additional rights. These rights are described in the Nokia Qt LGPL
** Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this
** package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3.0 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU General Public License version 3.0 requirements will be
** met: http://www.gnu.org/copyleft/gpl.html.
**
** If you are unsure which license is appropriate for your use, please
** contact the sales department at http://www.qtsoftware.com/contact.
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qpixmapcache.h"
#include "qcache.h"
#include "qobject.h"
#include "qdebug.h"
#include "qpaintengine.h"
#include <private/qimage_p.h>
#include <private/qpixmap_raster_p.h>
QT_BEGIN_NAMESPACE
/*!
\class QPixmapCache
\brief The QPixmapCache class provides an application-wide cache for pixmaps.
\ingroup environment
\ingroup multimedia
This class is a tool for optimized drawing with QPixmap. You can
use it to store temporary pixmaps that are expensive to generate
without using more storage space than cacheLimit(). Use insert()
to insert pixmaps, find() to find them, and clear() to empty the
cache.
QPixmapCache contains no member data, only static functions to
access the global pixmap cache. It creates an internal QCache
object for caching the pixmaps.
The cache associates a pixmap with a string (key). If two pixmaps
are inserted into the cache using equal keys, then the last pixmap
will hide the first pixmap. The QHash and QCache classes do
exactly the same.
The cache becomes full when the total size of all pixmaps in the
cache exceeds cacheLimit(). The initial cache limit is 1024 KB (1
MB); it is changed with setCacheLimit(). A pixmap takes roughly
(\e{width} * \e{height} * \e{depth})/8 bytes of memory.
The \e{Qt Quarterly} article
\l{http://doc.trolltech.com/qq/qq12-qpixmapcache.html}{Optimizing
with QPixmapCache} explains how to use QPixmapCache to speed up
applications by caching the results of painting.
\sa QCache, QPixmap
*/
#if defined(Q_OS_SYMBIAN)
static int cache_limit = 1024; // 1048 KB cache limit for symbian
#elif defined(Q_WS_QWS) || defined(Q_OS_WINCE)
static int cache_limit = 2048; // 2048 KB cache limit for embedded
#else
static int cache_limit = 10240; // 10 MB cache limit for desktop
#endif
// XXX: hw: is this a general concept we need to abstract?
class QDetachedPixmap : public QPixmap
{
public:
QDetachedPixmap(const QPixmap &pix) : QPixmap(pix)
{
if (data && data->classId() == QPixmapData::RasterClass) {
QRasterPixmapData *d = static_cast<QRasterPixmapData*>(data);
if (!d->image.isNull() && d->image.d->paintEngine
&& !d->image.d->paintEngine->isActive())
{
delete d->image.d->paintEngine;
d->image.d->paintEngine = 0;
}
}
}
};
class QPMCache : public QObject, public QCache<qint64, QDetachedPixmap>
{
Q_OBJECT
public:
QPMCache()
: QObject(0),
QCache<qint64, QDetachedPixmap>(cache_limit * 1024),
theid(0), ps(0), t(false) { }
~QPMCache() { }
void timerEvent(QTimerEvent *);
bool insert(const QString& key, const QPixmap &pixmap, int cost);
bool remove(const QString &key);
QPixmap *object(const QString &key) const;
private:
QHash<QString, qint64> cacheKeys;
int theid;
int ps;
bool t;
};
QT_BEGIN_INCLUDE_NAMESPACE
#include "qpixmapcache.moc"
QT_END_INCLUDE_NAMESPACE
/*
This is supposed to cut the cache size down by about 80-90% in a
minute once the application becomes idle, to let any inserted pixmap
remain in the cache for some time before it becomes a candidate for
cleaning-up, and to not cut down the size of the cache while the
cache is in active use.
When the last pixmap has been deleted from the cache, kill the
timer so Qt won't keep the CPU from going into sleep mode.
*/
void QPMCache::timerEvent(QTimerEvent *)
{
int mc = maxCost();
bool nt = totalCost() == ps;
setMaxCost(nt ? totalCost() * 3 / 4 : totalCost() -1);
setMaxCost(mc);
ps = totalCost();
QHash<QString, qint64>::iterator it = cacheKeys.begin();
while (it != cacheKeys.end()) {
if (!contains(it.value())) {
it = cacheKeys.erase(it);
} else {
++it;
}
}
if (!size()) {
killTimer(theid);
theid = 0;
} else if (nt != t) {
killTimer(theid);
theid = startTimer(nt ? 10000 : 30000);
t = nt;
}
}
QPixmap *QPMCache::object(const QString &key) const
{
return QCache<qint64, QDetachedPixmap>::object(cacheKeys.value(key, -1));
}
bool QPMCache::insert(const QString& key, const QPixmap &pixmap, int cost)
{
qint64 cacheKey = pixmap.cacheKey();
if (QCache<qint64, QDetachedPixmap>::object(cacheKey)) {
cacheKeys.insert(key, cacheKey);
return true;
}
qint64 oldCacheKey = cacheKeys.value(key, -1);
//If for the same key we add already a pixmap we should delete it
if (oldCacheKey != -1)
QCache<qint64, QDetachedPixmap>::remove(oldCacheKey);
bool success = QCache<qint64, QDetachedPixmap>::insert(cacheKey, new QDetachedPixmap(pixmap), cost);
if (success) {
cacheKeys.insert(key, cacheKey);
if (!theid) {
theid = startTimer(30000);
t = false;
}
}
return success;
}
bool QPMCache::remove(const QString &key)
{
qint64 cacheKey = cacheKeys.value(key, -1);
cacheKeys.remove(key);
return QCache<qint64, QDetachedPixmap>::remove(cacheKey);
}
Q_GLOBAL_STATIC(QPMCache, pm_cache)
/*!
\obsolete
\overload
Returns the pixmap associated with the \a key in the cache, or
null if there is no such pixmap.
\warning If valid, you should copy the pixmap immediately (this is
fast). Subsequent insertions into the cache could cause the
pointer to become invalid. For this reason, we recommend you use
find(const QString&, QPixmap&) instead.
Example:
\snippet doc/src/snippets/code/src_gui_image_qpixmapcache.cpp 0
*/
QPixmap *QPixmapCache::find(const QString &key)
{
return pm_cache()->object(key);
}
/*!
Looks for a cached pixmap associated with the \a key in the cache.
If the pixmap is found, the function sets \a pm to that pixmap and
returns true; otherwise it leaves \a pm alone and returns false.
Example:
\snippet doc/src/snippets/code/src_gui_image_qpixmapcache.cpp 1
*/
bool QPixmapCache::find(const QString &key, QPixmap& pm)
{
QPixmap *ptr = pm_cache()->object(key);
if (ptr)
pm = *ptr;
return ptr != 0;
}
/*!
Inserts a copy of the pixmap \a pm associated with the \a key into
the cache.
All pixmaps inserted by the Qt library have a key starting with
"$qt", so your own pixmap keys should never begin "$qt".
When a pixmap is inserted and the cache is about to exceed its
limit, it removes pixmaps until there is enough room for the
pixmap to be inserted.
The oldest pixmaps (least recently accessed in the cache) are
deleted when more space is needed.
The function returns true if the object was inserted into the
cache; otherwise it returns false.
\sa setCacheLimit()
*/
bool QPixmapCache::insert(const QString &key, const QPixmap &pm)
{
return pm_cache()->insert(key, pm, pm.width() * pm.height() * pm.depth() / 8);
}
/*!
Returns the cache limit (in kilobytes).
The default cache limit is 2048 KB for Embedded, 10240 KB for
Desktops.
\sa setCacheLimit()
*/
int QPixmapCache::cacheLimit()
{
return cache_limit;
}
/*!
Sets the cache limit to \a n kilobytes.
The default setting is 2048 KB for Embedded, 10240 KB for
Desktops.
\sa cacheLimit()
*/
void QPixmapCache::setCacheLimit(int n)
{
cache_limit = n;
pm_cache()->setMaxCost(1024 * cache_limit);
}
/*!
Removes the pixmap associated with \a key from the cache.
*/
void QPixmapCache::remove(const QString &key)
{
pm_cache()->remove(key);
}
/*!
Removes all pixmaps from the cache.
*/
void QPixmapCache::clear()
{
QT_TRY {
pm_cache()->clear();
} QT_CATCH(const std::bad_alloc &) {
// if we ran out of memory during pm_cache(), it's no leak,
// so just ignore it.
}
}
QT_END_NAMESPACE
|