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
|
/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: urp_cache.hxx,v $
*
* $Revision: 1.6 $
*
* last change: $Author: rt $ $Date: 2005-09-07 22:45:26 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
#include <stdio.h>
#include <list>
#include <algorithm>
#ifndef _RTL_USTRING_HXX_
#include <rtl/ustring.hxx>
#endif
#include "urp_threadid.hxx"
#include "urp_cache.h"
namespace bridges_urp
{
template < class t , class tequals >
inline Cache< t , tequals >::Cache( sal_uInt16 nMaxEntries ) :
m_pCache( new t[nMaxEntries] ),
m_nMaxEntries( nMaxEntries ),
m_nEntries( 0 )
{
}
template < class t , class tequals >
inline Cache< t , tequals >::~Cache( )
{
delete [] m_pCache;
}
template < class t , class tequals >
inline sal_uInt16 Cache< t , tequals >::put( const t & value )
{
if( ! m_nMaxEntries )
{
return 0xffff;
}
sal_uInt16 nEntry = 0xffff;
if( m_nEntries < m_nMaxEntries )
{
// cache has still empty places
m_pCache[m_nEntries] = value;
nEntry = m_nEntries;
m_nEntries ++;
// add it to the cache
m_lstLeastRecentlyUsed.push_front( nEntry );
}
else
{
// cache is full, remove an element and insert the new one
nEntry = m_lstLeastRecentlyUsed.back();
m_lstLeastRecentlyUsed.pop_back();
m_lstLeastRecentlyUsed.push_front( nEntry );
m_pCache[nEntry] = value;
}
return nEntry;
}
template < class t , class tequals >
inline sal_uInt16 Cache< t , tequals >::seek( const t & value )
{
for( ::std::list< sal_uInt16 >::iterator ii = m_lstLeastRecentlyUsed.begin() ;
ii != m_lstLeastRecentlyUsed.end() ;
++ ii )
{
if( value == m_pCache[*ii] )
{
sal_uInt16 nEntry = *ii;
m_lstLeastRecentlyUsed.erase( ii );
m_lstLeastRecentlyUsed.push_front( nEntry );
return nEntry;
}
}
return 0xffff;
}
// helper predicate for element removal
template < class t >
struct PredicateOverMax
{
t m_;
inline PredicateOverMax( const t &value ) : m_(value)
{}
sal_Int32 operator () ( const t &value ) const
{ return value >= m_; }
};
template < class t, class tequals >
inline void Cache < t , tequals >::resize( sal_uInt16 nNewMaxEntries )
{
if( 0 == nNewMaxEntries )
{
m_lstLeastRecentlyUsed.clear();
delete [] m_pCache;
m_pCache = 0;
m_nMaxEntries = 0;
}
else
{
// allocate
t *pNew = new t[nNewMaxEntries];
sal_Int32 nMin = nNewMaxEntries < m_nMaxEntries ? nNewMaxEntries : m_nMaxEntries;
// copy
for( sal_Int32 i = 0; i < nMin ; i ++ )
{
pNew[i] = m_pCache[i];
}
// delete
delete [] m_pCache;
// assign
m_pCache = pNew;
// remove overlapping lru cache entries
::std::remove_if(m_lstLeastRecentlyUsed.begin(),
m_lstLeastRecentlyUsed.end(),
PredicateOverMax< sal_Int32 > ( nMin ) );
}
m_nMaxEntries = nNewMaxEntries;
m_nEntries = m_nEntries < m_nMaxEntries ?
m_nEntries : m_nMaxEntries;
}
template < class t, class tequals >
inline void Cache < t, tequals >:: clear()
{
for( sal_Int32 i = 0; i < m_nMaxEntries ; i ++ )
{
m_pCache[i] = t();
}
m_lstLeastRecentlyUsed.clear();
m_nEntries = 0;
}
}
|
