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
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
|
/*
* Copyright (c) 2005-2006 Bart Coppens <kde@bartcoppens.be>
*
* 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.
*/
#include <kdebug.h>
#include <sys/mman.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <unistd.h>
#include <string.h>
#include <fcntl.h>
#include <qmutex.h>
#include <qthread.h>
#include <qfile.h>
#include <kstaticdeleter.h>
#include <kglobal.h>
#include <kconfig.h>
#include "kis_tileddatamanager.h"
#include "kis_tile.h"
#include "kis_tilemanager.h"
// Note: the cache file doesn't get deleted when we crash and so :(
KisTileManager* KisTileManager::m_singleton = 0;
static KStaticDeleter<KisTileManager> staticDeleter;
KisTileManager::KisTileManager() {
Q_ASSERT(KisTileManager::m_singleton == 0);
KisTileManager::m_singleton = this;
m_bytesInMem = 0;
m_bytesTotal = 0;
m_swapForbidden = false;
// Hardcoded (at the moment only?): 4 pools of 1000 tiles each
m_tilesPerPool = 1000;
m_pools = new Q_UINT8*[4];
m_poolPixelSizes = new Q_INT32[4];
m_poolFreeList = new PoolFreeList[4];
for (int i = 0; i < 4; i++) {
m_pools[i] = 0;
m_poolPixelSizes[i] = 0;
m_poolFreeList[i] = PoolFreeList();
}
m_currentInMem = 0;
KConfig * cfg = KGlobal::config();
cfg->setGroup("");
m_maxInMem = cfg->readNumEntry("maxtilesinmem", 4000);
m_swappiness = cfg->readNumEntry("swappiness", 100);
m_tileSize = KisTile::WIDTH * KisTile::HEIGHT;
m_freeLists.resize(8);
counter = 0;
m_poolMutex = new QMutex(true);
m_swapMutex = new QMutex(true);
}
KisTileManager::~KisTileManager() {
if (!m_freeLists.empty()) { // See if there are any nonempty freelists
FreeListList::iterator listsIt = m_freeLists.begin();
FreeListList::iterator listsEnd = m_freeLists.end();
while(listsIt != listsEnd) {
if ( ! (*listsIt).empty() ) {
FreeList::iterator it = (*listsIt).begin();
FreeList::iterator end = (*listsIt).end();
while (it != end) {
delete *it;
++it;
}
(*listsIt).clear();
}
++listsIt;
}
m_freeLists.clear();
}
for (FileList::iterator it = m_files.begin(); it != m_files.end(); ++it) {
(*it).tempFile->close();
(*it).tempFile->unlink();
delete (*it).tempFile;
}
delete [] m_poolPixelSizes;
delete [] m_pools;
delete m_poolMutex;
delete m_swapMutex;
}
KisTileManager* KisTileManager::instance()
{
if(KisTileManager::m_singleton == 0) {
staticDeleter.setObject(KisTileManager::m_singleton, new KisTileManager());
Q_CHECK_PTR(KisTileManager::m_singleton);
}
return KisTileManager::m_singleton;
}
void KisTileManager::registerTile(KisTile* tile)
{
m_swapMutex->lock();
TileInfo* info = new TileInfo();
info->tile = tile;
info->inMem = true;
info->mmapped = false;
info->onFile = false;
info->file = 0;
info->filePos = 0;
info->size = tile->WIDTH * tile->HEIGHT * tile->m_pixelSize;
info->fsize = 0; // the size in the file
info->validNode = true;
m_tileMap[tile] = info;
m_swappableList.push_back(info);
info->node = -- m_swappableList.end();
m_currentInMem++;
m_bytesTotal += info->size;
m_bytesInMem += info->size;
doSwapping();
if (++counter % 50 == 0)
printInfo();
m_swapMutex->unlock();
}
void KisTileManager::deregisterTile(KisTile* tile) {
m_swapMutex->lock();
if (!m_tileMap.contains(tile)) {
m_swapMutex->unlock();
return;
}
// Q_ASSERT(m_tileMap.contains(tile));
TileInfo* info = m_tileMap[tile];
if (info->onFile) { // It was once mmapped
// To freelist
FreeInfo* freeInfo = new FreeInfo();
freeInfo->file = info->file;
freeInfo->filePos = info->filePos;
freeInfo->size = info->fsize;
uint pixelSize = (info->size / m_tileSize);
// It is still mmapped?
if (info->mmapped) {
// munmap it
munmap(info->tile->m_data, info->size);
m_bytesInMem -= info->size;
m_currentInMem--;
}
if (m_freeLists.capacity() <= pixelSize)
m_freeLists.resize(pixelSize + 1);
m_freeLists[pixelSize].push_back(freeInfo);
// the KisTile will attempt to delete its data. This is of course silly when
// it was mmapped. So change the m_data to NULL, which is safe to delete
tile->m_data = 0;
} else {
m_bytesInMem -= info->size;
m_currentInMem--;
}
if (info->validNode) {
m_swappableList.erase(info->node);
info->validNode = false;
}
m_bytesTotal -= info->size;
delete info;
m_tileMap.erase(tile);
doSwapping();
m_swapMutex->unlock();
}
void KisTileManager::ensureTileLoaded(const KisTile* tile)
{
m_swapMutex->lock();
TileInfo* info = m_tileMap[tile];
if (info->validNode) {
m_swappableList.erase(info->node);
info->validNode = false;
}
if (!info->inMem) {
fromSwap(info);
}
m_swapMutex->unlock();
}
void KisTileManager::maySwapTile(const KisTile* tile)
{
m_swapMutex->lock();
TileInfo* info = m_tileMap[tile];
m_swappableList.push_back(info);
info->validNode = true;
info->node = -- m_swappableList.end();
doSwapping();
m_swapMutex->unlock();
}
void KisTileManager::fromSwap(TileInfo* info)
{
m_swapMutex->lock();
if (info->inMem) {
m_swapMutex->unlock();
return;
}
doSwapping();
Q_ASSERT(info->onFile);
Q_ASSERT(info->file);
Q_ASSERT(!info->mmapped);
if (!kritaMmap(info->tile->m_data, 0, info->size, PROT_READ | PROT_WRITE, MAP_SHARED,
info->file->handle(), info->filePos)) {
kdWarning() << "fromSwap failed!" << endl;
m_swapMutex->unlock();
return;
}
info->inMem = true;
info->mmapped = true;
m_currentInMem++;
m_bytesInMem += info->size;
m_swapMutex->unlock();
}
void KisTileManager::toSwap(TileInfo* info) {
m_swapMutex->lock();
//Q_ASSERT(info->inMem);
if (!info || !info->inMem) {
m_swapMutex->unlock();
return;
}
KisTile *tile = info->tile;
if (!info->onFile) {
// This tile is not yet in the file. Save it there
uint pixelSize = (info->size / m_tileSize);
bool foundFree = false;
if (m_freeLists.capacity() > pixelSize) {
if (!m_freeLists[pixelSize].empty()) {
// found one
FreeList::iterator it = m_freeLists[pixelSize].begin();
info->file = (*it)->file;
info->filePos = (*it)->filePos;
info->fsize = (*it)->size;
delete *it;
m_freeLists[pixelSize].erase(it);
foundFree = true;
}
}
if (!foundFree) { // No position found or free, create a new
long pagesize = sysconf(_SC_PAGESIZE);
TempFile* tfile = 0;
if (m_files.empty() || m_files.back().fileSize >= MaxSwapFileSize) {
m_files.push_back(TempFile());
tfile = &(m_files.back());
tfile->tempFile = new KTempFile();
tfile->fileSize = 0;
} else {
tfile = &(m_files.back());
}
off_t newsize = tfile->fileSize + info->size;
newsize = newsize + newsize % pagesize;
if (ftruncate(tfile->tempFile->handle(), newsize)) {
// XXX make these maybe i18n()able and in an error box, but then through
// some kind of proxy such that we don't pollute this with GUI code
kdWarning(DBG_AREA_TILES) << "Resizing the temporary swapfile failed!" << endl;
// Be somewhat pollite and try to figure out why it failed
switch (errno) {
case EIO: kdWarning(DBG_AREA_TILES) << "Error was E IO, "
<< "possible reason is a disk error!" << endl; break;
case EINVAL: kdWarning(DBG_AREA_TILES) << "Error was E INVAL, "
<< "possible reason is that you are using more memory than "
<< "the filesystem or disk can handle" << endl; break;
default: kdWarning(DBG_AREA_TILES) << "Errno was: " << errno << endl;
}
kdWarning(DBG_AREA_TILES) << "The swapfile is: " << tfile->tempFile->name() << endl;
kdWarning(DBG_AREA_TILES) << "Will try to avoid using the swap any further" << endl;
kdDebug(DBG_AREA_TILES) << "Failed ftruncate info: "
<< "tried adding " << info->size << " bytes "
<< "(rounded to pagesize: " << newsize << ") "
<< "from a " << tfile->fileSize << " bytes file" << endl;
printInfo();
m_swapForbidden = true;
m_swapMutex->unlock();
return;
}
info->file = tfile->tempFile;
info->fsize = info->size;
info->filePos = tfile->fileSize;
tfile->fileSize = newsize;
}
//memcpy(data, tile->m_data, info->size);
QFile* file = info->file->file();
if(!file) {
kdWarning() << "Opening the file as QFile failed" << endl;
m_swapForbidden = true;
m_swapMutex->unlock();
return;
}
int fd = file->handle();
Q_UINT8* data = 0;
if (!kritaMmap(data, 0, info->size, PROT_READ | PROT_WRITE, MAP_SHARED,
fd, info->filePos)) {
kdWarning() << "Initial mmap failed" << endl;
m_swapForbidden = true;
m_swapMutex->unlock();
return;
}
memcpy(data, info->tile->m_data, info->size);
munmap(data, info->size);
m_poolMutex->lock();
if (isPoolTile(tile->m_data, tile->m_pixelSize))
reclaimTileToPool(tile->m_data, tile->m_pixelSize);
else
delete[] tile->m_data;
m_poolMutex->unlock();
tile->m_data = 0;
} else {
//madvise(info->tile->m_data, info->fsize, MADV_DONTNEED);
Q_ASSERT(info->mmapped);
// munmap it
munmap(tile->m_data, info->size);
tile->m_data = 0;
}
info->inMem = false;
info->mmapped = false;
info->onFile = true;
m_currentInMem--;
m_bytesInMem -= info->size;
m_swapMutex->unlock();
}
void KisTileManager::doSwapping()
{
m_swapMutex->lock();
if (m_swapForbidden || m_currentInMem <= m_maxInMem) {
m_swapMutex->unlock();
return;
}
#if 1 // enable this to enable swapping
Q_UINT32 count = QMIN(m_swappableList.size(), m_swappiness);
for (Q_UINT32 i = 0; i < count && !m_swapForbidden; i++) {
toSwap(m_swappableList.front());
m_swappableList.front()->validNode = false;
m_swappableList.pop_front();
}
#endif
m_swapMutex->unlock();
}
void KisTileManager::printInfo()
{
kdDebug(DBG_AREA_TILES) << m_bytesInMem << " out of " << m_bytesTotal << " bytes in memory\n";
kdDebug(DBG_AREA_TILES) << m_currentInMem << " out of " << m_tileMap.size() << " tiles in memory\n";
kdDebug(DBG_AREA_TILES) << m_files.size() << " swap files in use" << endl;
kdDebug(DBG_AREA_TILES) << m_swappableList.size() << " elements in the swapable list\n";
kdDebug(DBG_AREA_TILES) << "Freelists information\n";
for (uint i = 0; i < m_freeLists.capacity(); i++) {
if ( ! m_freeLists[i].empty() ) {
kdDebug(DBG_AREA_TILES) << m_freeLists[i].size()
<< " elements in the freelist for pixelsize " << i << "\n";
}
}
kdDebug(DBG_AREA_TILES) << "Pool stats (" << m_tilesPerPool << " tiles per pool)" << endl;
for (int i = 0; i < 4; i++) {
if (m_pools[i]) {
kdDebug(DBG_AREA_TILES) << "Pool " << i << ": Freelist count: " << m_poolFreeList[i].count()
<< ", pixelSize: " << m_poolPixelSizes[i] << endl;
}
}
if (m_swapForbidden)
kdDebug(DBG_AREA_TILES) << "Something was wrong with the swap, see above for details" << endl;
kdDebug(DBG_AREA_TILES) << endl;
}
Q_UINT8* KisTileManager::requestTileData(Q_INT32 pixelSize)
{
m_swapMutex->lock();
Q_UINT8* data = findTileFor(pixelSize);
if ( data ) {
m_swapMutex->unlock();
return data;
}
m_swapMutex->unlock();
return new Q_UINT8[m_tileSize * pixelSize];
}
void KisTileManager::dontNeedTileData(Q_UINT8* data, Q_INT32 pixelSize)
{
m_poolMutex->lock();
if (isPoolTile(data, pixelSize)) {
reclaimTileToPool(data, pixelSize);
} else
delete[] data;
m_poolMutex->unlock();
}
Q_UINT8* KisTileManager::findTileFor(Q_INT32 pixelSize)
{
m_poolMutex->lock();
for (int i = 0; i < 4; i++) {
if (m_poolPixelSizes[i] == pixelSize) {
if (!m_poolFreeList[i].isEmpty()) {
Q_UINT8* data = m_poolFreeList[i].front();
m_poolFreeList[i].pop_front();
m_poolMutex->unlock();
return data;
}
}
if (m_pools[i] == 0) {
// allocate new pool
m_poolPixelSizes[i] = pixelSize;
m_pools[i] = new Q_UINT8[pixelSize * m_tileSize * m_tilesPerPool];
// j = 1 because we return the first element, so no need to add it to the freelist
for (int j = 1; j < m_tilesPerPool; j++)
m_poolFreeList[i].append(&m_pools[i][j * pixelSize * m_tileSize]);
m_poolMutex->unlock();
return m_pools[i];
}
}
m_poolMutex->unlock();
return 0;
}
bool KisTileManager::isPoolTile(Q_UINT8* data, Q_INT32 pixelSize) {
if (data == 0)
return false;
m_poolMutex->lock();
for (int i = 0; i < 4; i++) {
if (m_poolPixelSizes[i] == pixelSize) {
bool b = data >= m_pools[i]
&& data < m_pools[i] + pixelSize * m_tileSize * m_tilesPerPool;
if (b) {
m_poolMutex->unlock();
return true;
}
}
}
m_poolMutex->unlock();
return false;
}
void KisTileManager::reclaimTileToPool(Q_UINT8* data, Q_INT32 pixelSize) {
m_poolMutex->lock();
for (int i = 0; i < 4; i++) {
if (m_poolPixelSizes[i] == pixelSize)
if (data >= m_pools[i] && data < m_pools[i] + pixelSize * m_tileSize * m_tilesPerPool) {
m_poolFreeList[i].append(data);
}
}
m_poolMutex->unlock();
}
void KisTileManager::configChanged() {
KConfig * cfg = KGlobal::config();
cfg->setGroup("");
m_maxInMem = cfg->readNumEntry("maxtilesinmem", 4000);
m_swappiness = cfg->readNumEntry("swappiness", 100);
m_swapMutex->lock();
doSwapping();
m_swapMutex->unlock();
}
bool KisTileManager::kritaMmap(Q_UINT8*& result, void *start, size_t length,
int prot, int flags, int fd, off_t offset) {
result = (Q_UINT8*) mmap(start, length, prot, flags, fd, offset);
// Same here for warning and GUI
if (result == (Q_UINT8*)-1) {
kdWarning(DBG_AREA_TILES) << "mmap failed: errno is " << errno << "; we're probably going to crash very soon now...\n";
// Try to ignore what happened and carry on, but unlikely that we'll get
// much further, since the file resizing went OK and this is memory-related...
if (errno == ENOMEM) {
kdWarning(DBG_AREA_TILES) << "mmap failed with E NOMEM! This means that "
<< "either there are no more memory mappings available for Krita, "
<< "or that there is no more memory available!" << endl;
}
kdWarning(DBG_AREA_TILES) << "Trying to continue anyway (no guarantees)" << endl;
kdWarning(DBG_AREA_TILES) << "Will try to avoid using the swap any further" << endl;
kdDebug(DBG_AREA_TILES) << "Failed mmap info: "
<< "tried mapping " << length << " bytes" << endl;
if (!m_files.empty()) {
kdDebug(DBG_AREA_TILES) << "Probably to a " << m_files.back().fileSize << " bytes file" << endl;
}
printInfo();
// Be nice
result = 0;
return false;
}
return true;
}
|