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
|
// vim: set tabstop=4 shiftwidth=4 noexpandtab
/*
Gwenview - A simple image viewer for KDE
Copyright 2000-2004 Aurélien Gâteau
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
// TQt
#include <tqtimer.h>
// KDE
#include <kdebug.h>
// Local
#include "busylevelmanager.moc"
namespace Gwenview {
#undef ENABLE_LOG
#undef LOG
//#define ENABLE_LOG
#ifdef ENABLE_LOG
#define LOG(x) kdDebug() << k_funcinfo << x << endl
#else
#define LOG(x) ;
#endif
BusyLevelManager::BusyLevelManager()
: mCurrentBusyLevel( BUSY_NONE )
{
connect( &mDelayedBusyLevelTimer, TQT_SIGNAL( timeout()),
this, TQT_SLOT( delayedBusyLevelChanged()));
}
BusyLevelManager* BusyLevelManager::instance() {
static BusyLevelManager manager;
return &manager;
}
// How the busy level stuff works:
// This system allows suspending less important tasks while more important
// task are active, i.e. no thumbnails are generated when the viewed
// image is being loaded and painted.
// All objects responsible for operations set their busy level
// to the matching value when the operation starts and reset their busy
// level when the operation is done. They all connect to busyLevelChanged()
// signal and suspend their operation if the current busy level is higher
// than the busy level of their operation. If a new operation is started,
// it needs to be immediatelly suspended if the current busy level is higher!
// Note that there can be only one level per object,
// so if one object is responsible for more operations,
// it needs to use helper objects for setBusyLevel().
void BusyLevelManager::setBusyLevel( TQObject* obj, BusyLevel level ) {
LOG("BUSY:" << level << ":" << obj << ":" << obj->className() );
if( level > BUSY_NONE ) {
if( mBusyLevels.tqcontains( obj ) && mBusyLevels[ obj ] == level ) return;
if( !mBusyLevels.tqcontains( obj )) {
connect( obj, TQT_SIGNAL( destroyed( TQObject* )), this, TQT_SLOT( objectDestroyed( TQObject* )));
}
mBusyLevels[ obj ] = level;
} else {
mBusyLevels.remove( obj );
disconnect( obj, TQT_SIGNAL( destroyed( TQObject* )), this, TQT_SLOT( objectDestroyed( TQObject* )));
}
mDelayedBusyLevelTimer.start( 0, true );
}
void BusyLevelManager::objectDestroyed( TQObject* obj ) {
LOG("DESTROYED:" << obj );
mBusyLevels.remove( obj );
mDelayedBusyLevelTimer.start( 0, true );
}
void BusyLevelManager::delayedBusyLevelChanged() {
BusyLevel newLevel = BUSY_NONE;
for( TQMap< TQObject*, BusyLevel >::ConstIterator it = mBusyLevels.begin();
it != mBusyLevels.end();
++it ) {
newLevel = TQMAX( newLevel, *it );
}
if( newLevel != mCurrentBusyLevel ) {
LOG("CHANGED BUSY:" << newLevel);
mCurrentBusyLevel = newLevel;
emit busyLevelChanged( newLevel );
}
}
BusyLevel BusyLevelManager::busyLevel() const {
return mCurrentBusyLevel;
}
} // namespace
|
