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
|
/****************************************************************************
** $Id: qt/src/kernel/qpixmapcache.cpp 2.3.1 edited 2001-01-26 $
**
** Implementation of QPixmapCache class
**
** Created : 950504
**
** Copyright (C) 1992-2000 Trolltech AS. All rights reserved.
**
** This file is part of the kernel module of the Qt GUI Toolkit.
**
** This file may be distributed under the terms of the Q Public License
** as defined by Trolltech AS of Norway and appearing in the file
** LICENSE.QPL included in the packaging of this file.
**
** This file may be distributed and/or modified under the terms of the
** GNU General Public License version 2 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.
**
** Licensees holding valid Qt Enterprise Edition or Qt Professional Edition
** licenses may use this file in accordance with the Qt Commercial License
** Agreement provided with the Software.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.trolltech.com/pricing.html or email sales@trolltech.com for
** information about Qt Commercial License Agreements.
** See http://www.trolltech.com/qpl/ for QPL licensing information.
** See http://www.trolltech.com/gpl/ for GPL licensing information.
**
** Contact info@trolltech.com if any conditions of this licensing are
** not clear to you.
**
**********************************************************************/
#include "qpixmapcache.h"
#include "qcache.h"
#include "qobject.h"
// REVISED: paul
/*!
\class QPixmapCache qpixmapcache.h
\brief The QPixmapCache class provides an application-global cache for
pixmaps.
\ingroup environment
\ingroup drawing
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.
Here follows an example. QRadioButton has a non-trivial visual
representation. In the function QRadioButton::drawButton(), we do
not draw the radio button directly. Instead, we first check the
global pixmap cache for a pixmap with the key "$qt_radio_nnn_",
where \c nnn is a numerical value that specifies the the radio
button state. If a pixmap is found, we bitBlt() it onto the widget
and return. Otherwise, we create a new pixmap, draw the radio button
in the pixmap and finally insert the pixmap in the global pixmap
cache, using the key above. The bitBlt() is 10 times faster than
drawing the radio button. All radio buttons in the program share
the cached pixmap since QPixmapCache is application-global.
QPixmapCache contains no member data, only static functions to access
the global pixmap cache. It creates an internal QCache for caching the
pixmaps.
The cache associates a pixmap with a normal string (key). If two
pixmaps are inserted into the cache using equal keys, then the last
pixmap will hide the first pixmap. The QDict 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 KByte
(1 MByte); it is changed with setCacheLimit(). A pixmap takes
roughly width*height*depth/8 bytes of memory.
See the \l QCache documentation for more details about the cache mechanism.
*/
static const int cache_size = 149; // size of internal hash array
static int cache_limit = 1024; // 1024 KB cache limit
void cleanup_pixmap_cache();
class QPMCache: public QObject, public QCache<QPixmap>
{
public:
QPMCache():
QObject( 0, "global pixmap cache" ),
QCache<QPixmap>( cache_limit * 1024, cache_size ),
id( 0 ), ps( 0 ), t( FALSE )
{
qAddPostRoutine( cleanup_pixmap_cache );
setAutoDelete( TRUE );
}
~QPMCache() {}
void timerEvent( QTimerEvent * );
bool insert( const QString& k, const QPixmap *d, int c, int p = 0 );
private:
int id;
int ps;
bool t;
};
/*
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();
if ( !count() ) {
killTimer( id );
id = 0;
} else if ( nt != t ) {
killTimer( id );
id = startTimer( nt ? 10000 : 30000 );
t = nt;
}
}
bool QPMCache::insert( const QString& k, const QPixmap *d, int c, int p )
{
bool r = QCache<QPixmap>::insert( k, d, c, p );
if ( r && !id ) {
id = startTimer( 30000 );
t = FALSE;
}
return r;
}
static QPMCache *pm_cache = 0; // global pixmap cache
void cleanup_pixmap_cache()
{
delete pm_cache;
pm_cache = 0;
}
/*!
Returns the pixmap associated with \a key in the cache, or null if there
is no such pixmap.
<strong>
NOTE: if valid, you should copy the pixmap immediately (this is quick
since QPixmaps are \link shclass.html implicitly shared\endlink), because
subsequent insertions into the cache could cause the pointer to become
invalid. For this reason, we recommend you use
find(const QString&, QPixmap&) instead.
</strong>
Example:
\code
QPixmap* pp;
QPixmap p;
if ( (pp=QPixmapCache::find("my_previous_copy", pm)) ) {
p = *pp;
} else {
p.load("bigimage.png");
QPixmapCache::insert("my_previous_copy", new QPixmap(p));
}
painter->drawPixmap(0, 0, p);
\endcode
*/
QPixmap *QPixmapCache::find( const QString &key )
{
return pm_cache ? pm_cache->find(key) : 0;
}
/*!
Looks for a cached pixmap associated with \a key in the cache. If a
pixmap is found, the function sets \a pm to that pixmap and returns
TRUE. Otherwise, the function returns FALSE and does not change \a
pm.
Example:
\code
QPixmap p;
if ( !QPixmapCache::find("my_previous_copy", pm) ) {
pm.load("bigimage.png");
QPixmapCache::insert("my_previous_copy", pm);
}
painter->drawPixmap(0, 0, p);
\endcode
*/
bool QPixmapCache::find( const QString &key, QPixmap& pm )
{
QPixmap* p = pm_cache ? pm_cache->find(key) : 0;
if ( p ) pm = *p;
return !!p;
}
/*!
\obsolete
Inserts the pixmap \a pm associated with \a key into the cache.
Returns TRUE if successful, or FALSE if the pixmap is too big for the cache.
<strong>
NOTE: \a pm must be allocated on the heap (using \c new).
If this function returns FALSE, you must delete \a pm yourself.
If this function returns TRUE, do not use \a pm afterwards or
keep references to it, as any other insertions into the cache,
from anywhere in the application, or within Qt itself, could cause
the pixmap to be discarded from the cache, and the pointer to
become invalid.
Due to these dangers, we strongly recommend that you use
insert(const QString&, const QPixmap&) instead.
</strong>
*/
bool QPixmapCache::insert( const QString &key, QPixmap *pm )
{
if ( !pm_cache ) { // create pixmap cache
pm_cache = new QPMCache;
CHECK_PTR( pm_cache );
}
return pm_cache->insert( key, pm, pm->width()*pm->height()*pm->depth()/8 );
}
/*!
Inserts a copy of the pixmap \a pm associated with \a key into the cache.
All pixmaps inserted by the Qt library have a key starting with "$qt..".
Use something else for your own pixmaps.
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.
\sa setCacheLimit().
*/
void QPixmapCache::insert( const QString &key, const QPixmap& pm )
{
if ( !pm_cache ) { // create pixmap cache
pm_cache = new QPMCache;
CHECK_PTR( pm_cache );
}
QPixmap *p = new QPixmap(pm);
if ( !pm_cache->insert( key, p, p->width()*p->height()*p->depth()/8 ) )
delete p;
}
/*!
Returns the cache limit (in kilobytes).
The default setting is 1024 kilobytes.
\sa setCacheLimit().
*/
int QPixmapCache::cacheLimit()
{
return cache_limit;
}
/*!
Sets the cache limit to \a n kilobytes.
The default setting is 1024 kilobytes.
\sa cacheLimit()
*/
void QPixmapCache::setCacheLimit( int n )
{
cache_limit = n;
if ( pm_cache )
pm_cache->setMaxCost( 1024*cache_limit );
}
/*!
Removes all pixmaps from the cache.
*/
void QPixmapCache::clear()
{
if ( pm_cache )
pm_cache->clear();
}
|