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
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/usr/diag/prdf/common/util/prdfFlyWeight.C $ */
/* */
/* OpenPOWER HostBoot Project */
/* */
/* COPYRIGHT International Business Machines Corp. 2000,2014 */
/* */
/* Licensed under the Apache License, Version 2.0 (the "License"); */
/* you may not use this file except in compliance with the License. */
/* You may obtain a copy of the License at */
/* */
/* http://www.apache.org/licenses/LICENSE-2.0 */
/* */
/* Unless required by applicable law or agreed to in writing, software */
/* distributed under the License is distributed on an "AS IS" BASIS, */
/* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or */
/* implied. See the License for the specific language governing */
/* permissions and limitations under the License. */
/* */
/* IBM_PROLOG_END_TAG */
// Module Description **************************************************
//
// Description:
//
// End Module Description **********************************************
//----------------------------------------------------------------------
// Includes
//----------------------------------------------------------------------
#define prdfFlyWeight_C
#include <prdfFlyWeight.H>
#include <tracinterface.H>
#include <prdfHeapBucketSize.H>
#include <prdfTrace.H>
#include <prdfAssert.h>
#undef prdfFlyWeight_C
//----------------------------------------------------------------------
// User Types
//----------------------------------------------------------------------
//----------------------------------------------------------------------
// Constants
//----------------------------------------------------------------------
//----------------------------------------------------------------------
// Macros
//----------------------------------------------------------------------
//----------------------------------------------------------------------
// Internal Function Prototypes
//----------------------------------------------------------------------
//----------------------------------------------------------------------
// Global Variables
//----------------------------------------------------------------------
namespace PRDF
{
//---------------------------------------------------------------------
// Member Function Specifications
//---------------------------------------------------------------------
template < class T , uint32_t S >
FlyWeight<T,S>::~FlyWeight()
{
clear();
}
//---------------------------------------------------------------------
template < class T, uint32_t S >
void FlyWeight<T,S>::clear()
{
for(typename HeapType::const_iterator i = iv_heap.begin(); i != iv_heap.end(); ++i)
{
delete[] (T*)*i;
}
iv_heap.erase(iv_heap.begin(),iv_heap.end());
iv_nextOpen = NULL;
}
//---------------------------------------------------------------------
template < class T , uint32_t S >
T & FlyWeight<T,S>::get(const T & key)
{
T * result = NULL;
T * current_array = NULL;
// search to see if we already have one
for(typename HeapType::const_iterator i = iv_heap.begin();
i != iv_heap.end() && (result == NULL); ++i)
{
current_array = (T*)*i;
for(T * p = current_array;
p != (current_array + RoundBucketSize<T,S>::value); ++p)
{
if (p == iv_nextOpen)
break;
if(*p == key)
{
result = p;
break;
}
}
}
if(result == NULL) // didn't find it - add it
{
if(iv_nextOpen == NULL) // need a new array
{
current_array = new T[RoundBucketSize<T,S>::value];
if(current_array == NULL) // dg00a
{ // dg00a
PRDF_ERR("PRDF Could not get requested memory");
PRDF_ASSERT( NULL != current_array );
} // dg00a
// if the heap of array ptrs is full(or non-existant) then increase capacity by S dg00a
if(iv_heap.size() == iv_heap.capacity()) // dg00a
{ // dg00a
iv_heap.reserve(iv_heap.capacity() + RoundBucketSize<T,S>::value); // dg00a
} // dg01a
iv_heap.push_back(current_array);
iv_nextOpen = current_array;
}
*iv_nextOpen = key;
result = iv_nextOpen;
++iv_nextOpen;
if((current_array != NULL) && // Done to fix BEAM error
(iv_nextOpen == (current_array + RoundBucketSize<T,S>::value))) // this array is full
{
iv_nextOpen = NULL;
}
}
return *result;
}
} //End namespace PRDF
#if defined( FLYWEIGHT_PROFILING )
namespace PRDF
{
template < class T , uint32_t S >
void FlyWeight<T,S>::printStats(void)
{
PRDF_TRAC( "FlyWeight Memory allocated = %d",(iv_heap.size() * sizeof(T) *
RoundBucketSize<T,S>::value ) );
}
} //End namespace PRDF
#endif
|
