blob: be23f2d001fcc7ac10ed9088e84abc519ca745b4 (
plain)
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
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: prdfRegisterCache.C $ */
/* */
/* IBM CONFIDENTIAL */
/* */
/* COPYRIGHT International Business Machines Corp. 2012,2013 */
/* */
/* p1 */
/* */
/* Object Code Only (OCO) source materials */
/* Licensed Internal Code Source Materials */
/* IBM HostBoot Licensed Internal Code */
/* */
/* The source code for this program is not published or otherwise */
/* divested of its trade secrets, irrespective of what has been */
/* deposited with the U.S. Copyright Office. */
/* */
/* Origin: 30 */
/* */
/* IBM_PROLOG_END_TAG */
#include <prdfRegisterCache.H>
#include <iipconst.h>
namespace PRDF
{
//------------------------------------------------------------------------------
RegDataCache & RegDataCache::getCachedRegisters()
{
return PRDF_GET_SINGLETON( ReadCache );
}
//------------------------------------------------------------------------------
RegDataCache::~RegDataCache()
{
flush();
}
//------------------------------------------------------------------------------
BIT_STRING_CLASS & RegDataCache::read( ExtensibleChip * i_chip,
const SCAN_COMM_REGISTER_CLASS * i_reg )
{
ScomRegisterAccess l_scomAccessKey ( *i_reg, i_chip );
BIT_STRING_CLASS * l_pBitString = queryCache( l_scomAccessKey );
if ( NULL == l_pBitString )
{
// Creating new entry
l_pBitString = new BitStringBuffer( i_reg->GetBitLength() );
// Adding register in the cache
iv_cachedRead[l_scomAccessKey] = l_pBitString;
}
return *l_pBitString;
}
//------------------------------------------------------------------------------
void RegDataCache::flush()
{
for ( CacheDump::iterator it = iv_cachedRead.begin();
it != iv_cachedRead.end(); it++ )
{
// Freeing up the bit string memory reserved on heap
delete it->second;
}
// Deleting all the entry from the cache
iv_cachedRead.clear();
}
//------------------------------------------------------------------------------
void RegDataCache::flush( ExtensibleChip* i_pChip,
const SCAN_COMM_REGISTER_CLASS * i_pRegister )
{
ScomRegisterAccess l_scomAccessKey ( *i_pRegister,i_pChip );
// Find the entries associated with the given target in the map
CacheDump::iterator it = iv_cachedRead.find( l_scomAccessKey );
// If entry exists delete the entry for given scom address
if ( it !=iv_cachedRead.end() )
{
delete it->second;
iv_cachedRead.erase( it );
}
}
//------------------------------------------------------------------------------
BIT_STRING_CLASS * RegDataCache::queryCache(
ExtensibleChip* i_pChip,
const SCAN_COMM_REGISTER_CLASS * i_pRegister )const
{
ScomRegisterAccess l_scomAccessKey ( *i_pRegister,i_pChip );
return queryCache( l_scomAccessKey );
}
//------------------------------------------------------------------------------
BIT_STRING_CLASS * RegDataCache::queryCache(
const ScomRegisterAccess & i_scomAccessKey ) const
{
BIT_STRING_CLASS * l_pBitString = NULL;
CacheDump::const_iterator itDump = iv_cachedRead.find( i_scomAccessKey );
if( iv_cachedRead.end() != itDump )
{
l_pBitString = itDump->second ;
}
return l_pBitString;
}
//------------------------------------------------------------------------------
}// end namespace PRDF
|