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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#ifndef _LRU_CACHE_HXX_
#define _LRU_CACHE_HXX_
// __CACHE_DIAGNOSE forces cache size to 4 and works only for OUString keys
// #define __CACHE_DIAGNOSE 1
#include <osl/mutex.hxx>
#include "rtl/ustring.hxx"
#include <boost/unordered_map.hpp>
/** Implementation of a least recently used (lru) cache.
<br>
@author Daniel Boelzle
*/
template< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >
class LRU_Cache
{
struct CacheEntry
{
t_Key aKey;
t_Val aVal;
CacheEntry * pPred;
CacheEntry * pSucc;
};
typedef ::boost::unordered_map< t_Key, CacheEntry *, t_KeyHash, t_KeyEqual > t_Key2Element;
mutable ::osl::Mutex _aCacheMutex;
sal_Int32 _nCachedElements;
t_Key2Element _aKey2Element;
CacheEntry * _pBlock;
mutable CacheEntry * _pHead;
mutable CacheEntry * _pTail;
inline void toFront( CacheEntry * pEntry ) const;
public:
/** Constructor:
<br>
@param nCachedElements number of elements to be cached; default param set to 128
*/
inline LRU_Cache( sal_Int32 nCachedElements = 128 );
/** Destructor: releases all cached elements and keys.
<br>
*/
inline ~LRU_Cache();
/** Retrieves a value from the cache. Returns default constructed value,
if none was found.
<br>
@param rKey a key
@return value
*/
inline t_Val getValue( t_Key const & rKey ) const;
/** Sets a value to be cached for given key.
<br>
@param rKey a key
@param rValue a value
*/
inline void setValue( t_Key const & rKey, t_Val const & rValue );
/** Tests whether a value is cached for given key.
<br>
@param rKey a key
@return true, if value is cached
*/
inline sal_Bool hasValue( t_Key const & rKey ) const;
/** Clears the cache, thus releasing all cached elements and keys.
<br>
*/
inline void clear();
};
//__________________________________________________________________________________________________
template< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >
inline LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::LRU_Cache( sal_Int32 nCachedElements )
#ifdef __CACHE_DIAGNOSE
: _nCachedElements( 4 )
#else
: _nCachedElements( nCachedElements )
#endif
, _pBlock( 0 )
{
if (_nCachedElements > 0)
{
_pBlock = new CacheEntry[_nCachedElements];
_pHead = _pBlock;
_pTail = _pBlock + _nCachedElements -1;
for ( sal_Int32 nPos = _nCachedElements; nPos--; )
{
_pBlock[nPos].pPred = _pBlock + nPos -1;
_pBlock[nPos].pSucc = _pBlock + nPos +1;
}
}
}
//__________________________________________________________________________________________________
template< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >
inline LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::~LRU_Cache()
{
delete [] _pBlock;
}
//__________________________________________________________________________________________________
template< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >
inline void LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::toFront(
CacheEntry * pEntry ) const
{
if (pEntry != _pHead)
{
// cut out element
if (pEntry == _pTail)
{
_pTail = pEntry->pPred;
}
else
{
pEntry->pSucc->pPred = pEntry->pPred;
pEntry->pPred->pSucc = pEntry->pSucc;
}
// push to front
_pHead->pPred = pEntry;
pEntry->pSucc = _pHead;
_pHead = pEntry;
}
}
//__________________________________________________________________________________________________
template< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >
inline sal_Bool LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::hasValue(
t_Key const & rKey ) const
{
::osl::MutexGuard aGuard( _aCacheMutex );
typename t_Key2Element::const_iterator const iFind( _aKey2Element.find( rKey ) );
return (iFind != _aKey2Element.end());
}
//__________________________________________________________________________________________________
template< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >
inline t_Val LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::getValue(
t_Key const & rKey ) const
{
::osl::MutexGuard aGuard( _aCacheMutex );
const typename t_Key2Element::const_iterator iFind( _aKey2Element.find( rKey ) );
if (iFind != _aKey2Element.end())
{
CacheEntry * pEntry = (*iFind).second;
toFront( pEntry );
#ifdef __CACHE_DIAGNOSE
OSL_TRACE( "> retrieved element \"" );
OSL_TRACE( "%s", ::rtl::OUStringToOString( pEntry->aKey, RTL_TEXTENCODING_ASCII_US ).getStr() );
OSL_TRACE( "\" from cache <\n" );
#endif
return pEntry->aVal;
}
return t_Val();
}
//__________________________________________________________________________________________________
template< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >
inline void LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::setValue(
t_Key const & rKey, t_Val const & rValue )
{
if (_nCachedElements > 0)
{
::osl::MutexGuard aGuard( _aCacheMutex );
typename t_Key2Element::const_iterator const iFind( _aKey2Element.find( rKey ) );
CacheEntry * pEntry;
if (iFind == _aKey2Element.end())
{
pEntry = _pTail; // erase last element
#ifdef __CACHE_DIAGNOSE
if (pEntry->aKey.getLength())
{
OSL_TRACE( "> kicking element \"" );
OSL_TRACE( "%s", ::rtl::OUStringToOString( pEntry->aKey, RTL_TEXTENCODING_ASCII_US ).getStr() );
OSL_TRACE( "\" from cache <\n" );
}
#endif
_aKey2Element.erase( pEntry->aKey );
_aKey2Element[ pEntry->aKey = rKey ] = pEntry;
}
else
{
pEntry = (*iFind).second;
#ifdef __CACHE_DIAGNOSE
OSL_TRACE( "> replacing element \"" );
OSL_TRACE( "%s", ::rtl::OUStringToOString( pEntry->aKey, RTL_TEXTENCODING_ASCII_US ).getStr() );
OSL_TRACE( "\" in cache <\n" );
#endif
}
pEntry->aVal = rValue;
toFront( pEntry );
}
}
//__________________________________________________________________________________________________
template< class t_Key, class t_Val, class t_KeyHash, class t_KeyEqual >
inline void LRU_Cache< t_Key, t_Val, t_KeyHash, t_KeyEqual >::clear()
{
::osl::MutexGuard aGuard( _aCacheMutex );
_aKey2Element.clear();
for ( sal_Int32 nPos = _nCachedElements; nPos--; )
{
_pBlock[nPos].aKey = t_Key();
_pBlock[nPos].aVal = t_Val();
}
#ifdef __CACHE_DIAGNOSE
OSL_TRACE( "> cleared cache <\n" );
#endif
}
//==================================================================================================
struct FctHashOUString : public ::std::unary_function< ::rtl::OUString const &, size_t >
{
size_t operator()( ::rtl::OUString const & rKey ) const
{ return (size_t)rKey.hashCode(); }
};
/** Template instance for OUString keys, Any values.<br>
*/
typedef LRU_Cache< ::rtl::OUString, ::com::sun::star::uno::Any,
FctHashOUString, ::std::equal_to< ::rtl::OUString > >
LRU_CacheAnyByOUString;
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
