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
|
/*
SPDX-License-Identifier: GPL-2.0-or-later
SPDX-FileCopyrightText: 2006 David Nolden <david.nolden.kdevelop@art-master.de>
*/
#include "cachemanager.h"
#define DBG_SRC QLatin1String("CacheManager")
#include "debug_utils.h"
DEBUG_REGISTER_DISABLED(CacheManager)
void CacheNode::access() const
{
m_manager->access(this);
}
void CacheManager::remove(const CacheNode* node)
{
m_set.erase(node);
}
void CacheManager::add(const CacheNode* node)
{
m_set.insert(node);
}
CacheNode::CacheNode(Manager* manager) : m_manager(manager), m_value(manager->currentMax()) //initialize m_value with the current maximum, so the new node has a chance even in a cache full of high-rated nodes
{
m_manager->add(this);
}
CacheNode::~CacheNode()
{
m_manager->remove(this);
};
void CacheManager::restart(unsigned int normalizeby)
{
m_currentFrame = 1;
m_currentMax = 1;
SetType oldSet = m_set;
m_set = SetType();
for (SetType::iterator it = oldSet.begin(); it != oldSet.end(); ++it) {
unsigned int newValue = (*it)->value() / (normalizeby / 1000);
if (newValue > m_currentMax) m_currentMax = newValue;
(*it)->setValue(newValue); ///This way not all information is discarded
m_set.insert(*it);
}
}
void CacheManager::access(const CacheNode* node)
{
static const unsigned int limit = (std::numeric_limits<unsigned int>::max() / 3)*2;
m_set.erase(node);
node->setValue(m_currentMax+1);
m_set.insert(node);
if (node->value() > m_currentMax)
m_currentMax = node->value();
if (node->value() > limit)
restart(node->value());
}
void CacheManager::setMaxNodes (int maxNodes)
{
m_maxNodes = maxNodes;
increaseFrame();
}
void CacheManager::increaseFrame()
{
m_currentFrame ++;
if (m_set.size() > m_maxNodes) {
DEBUG() << "Have " << m_set.size() << " nodes, maximum is " << m_maxNodes << ", erasing." ;
int mustErase = m_set.size() - m_maxNodes;
while (!m_set.empty() && mustErase != 0) {
--mustErase;
SetType::iterator it = m_set.begin();
erase(*it);
}
DEBUG() << "Have " << m_set.size() << " nodes after erasing." ;
}
}
void CacheManager::removeLowerHalf()
{
int maxNodes = m_maxNodes;
setMaxNodes(m_set.size() / 2);
setMaxNodes(maxNodes);
}
void CacheManager::saveMemory()
{
removeLowerHalf();
}
|
