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
|
/**
* @file llkeyusetracker.h
* @brief Declaration of the LLKeyUseTracker class.
*
* $LicenseInfo:firstyear=2003&license=viewergpl$
*
* Copyright (c) 2003-2009, Linden Research, Inc.
*
* Second Life Viewer Source Code
* The source code in this file ("Source Code") is provided by Linden Lab
* to you under the terms of the GNU General Public License, version 2.0
* ("GPL"), unless you have obtained a separate licensing agreement
* ("Other License"), formally executed by you and Linden Lab. Terms of
* the GPL can be found in doc/GPL-license.txt in this distribution, or
* online at http://secondlifegrid.net/programs/open_source/licensing/gplv2
*
* There are special exceptions to the terms and conditions of the GPL as
* it is applied to this Source Code. View the full text of the exception
* in the file doc/FLOSS-exception.txt in this software distribution, or
* online at
* http://secondlifegrid.net/programs/open_source/licensing/flossexception
*
* By copying, modifying or distributing this software, you acknowledge
* that you have read and understood your obligations described above,
* and agree to abide by those obligations.
*
* ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
* WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
* COMPLETENESS OR PERFORMANCE.
* $/LicenseInfo$
*/
#ifndef LL_KEYUSETRACKER_H
#define LL_KEYUSETRACKER_H
// This is a generic cache for an arbitrary data type indexed against an
// arbitrary key type. The cache length is determined by expiration time
// tince against last use and set size. The age of elements and the size
// of the cache are queryable.
//
// This is implemented as a list, which makes search O(n). If you reuse this
// for something with a large dataset, consider reimplementing with a Boost
// multimap based on both a map(key) and priority queue(last_use).
template <class TKey, class TData>
class KeyUseTrackerNodeImpl
{
public:
U64 mLastUse;
U32 mUseCount;
TKey mKey;
TData mData;
KeyUseTrackerNodeImpl( TKey k, TData d ) :
mLastUse(0),
mUseCount(0),
mKey( k ),
mData( d )
{
}
};
template <class TKey, class TData>
class LLKeyUseTracker
{
typedef KeyUseTrackerNodeImpl<TKey,TData> TKeyUseTrackerNode;
typedef std::list<TKeyUseTrackerNode *> TKeyList;
TKeyList mKeyList;
U64 mMemUsecs;
U64 mLastExpire;
U32 mMaxCount;
U32 mCount;
static U64 getTime()
{
// This function operates on a frame basis, not instantaneous.
// We can rely on its output for determining first use in a
// frame.
return LLFrameTimer::getTotalTime();
}
void ageKeys()
{
U64 now = getTime();
if( now == mLastExpire )
{
return;
}
mLastExpire = now;
while( !mKeyList.empty() && (now - mKeyList.front()->mLastUse > mMemUsecs ) )
{
delete mKeyList.front();
mKeyList.pop_front();
mCount--;
}
}
TKeyUseTrackerNode *findNode( TKey key )
{
ageKeys();
typename TKeyList::iterator i;
for( i = mKeyList.begin(); i != mKeyList.end(); i++ )
{
if( (*i)->mKey == key )
return *i;
}
return NULL;
}
TKeyUseTrackerNode *removeNode( TKey key )
{
TKeyUseTrackerNode *i;
i = findNode( key );
if( i )
{
mKeyList.remove( i );
mCount--;
return i;
}
return NULL;
}
public:
LLKeyUseTracker( U32 memory_seconds, U32 max_count ) :
mLastExpire(0),
mMaxCount( max_count ),
mCount(0)
{
mMemUsecs = ((U64)memory_seconds) * 1000000;
}
~LLKeyUseTracker()
{
// Flush list
while( !mKeyList.empty() )
{
delete mKeyList.front();
mKeyList.pop_front();
mCount--;
}
}
void markUse( TKey key, TData data )
{
TKeyUseTrackerNode *node = removeNode( key );
if( !node )
{
node = new TKeyUseTrackerNode(key, data);
}
else
{
// Update data
node->mData = data;
}
node->mLastUse = getTime();
node->mUseCount++;
mKeyList.push_back( node );
mCount++;
// Too many items? Drop head
if( mCount > mMaxCount )
{
delete mKeyList.front();
mKeyList.pop_front();
mCount--;
}
}
void forgetKey( TKey key )
{
TKeyUseTrackerNode *node = removeNode( key );
if( node )
{
delete node;
}
}
U32 getUseCount( TKey key )
{
TKeyUseTrackerNode *node = findNode( key );
if( node )
{
return node->mUseCount;
}
return 0;
}
U64 getTimeSinceUse( TKey key )
{
TKeyUseTrackerNode *node = findNode( key );
if( node )
{
U64 now = getTime();
U64 delta = now - node->mLastUse;
return (U32)( delta / 1000000 );
}
return 0;
}
TData *getLastUseData( TKey key )
{
TKeyUseTrackerNode *node = findNode( key );
if( node )
{
return &node->mData;
}
return NULL;
}
U32 getKeyCount()
{
return mCount;
}
};
#endif
|
