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
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/usr/diag/prdf/common/util/UtilSMap.H $ */
/* */
/* OpenPOWER HostBoot Project */
/* */
/* COPYRIGHT International Business Machines Corp. 2007,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 */
/** @file UtilSMap.H
* An optimized implementation of the STL Map meant for small maps that do not
* need to be sorted.
*/
#ifndef __UTIL_UTILSMAP_H
#define __UTIL_UTILSMAP_H
#include <stddef.h>
#include <stdlib.h>
namespace PRDF
{
template <typename _First, typename _Second> class UtilSMap_Iterator;
template <typename _First, typename _Second> UtilSMap_Iterator<_First, _Second>
operator+(UtilSMap_Iterator<_First,_Second>& l, size_t i);
template <typename _First, typename _Second>
class UtilSMap_Iterator
{
protected:
char * iv_position;
public:
UtilSMap_Iterator(char * i_position) : iv_position(i_position) {};
bool operator==(const UtilSMap_Iterator & r)
{ return iv_position == r.iv_position; };
bool operator!=(const UtilSMap_Iterator & r)
{ return iv_position != r.iv_position; };
UtilSMap_Iterator<_First, _Second>& operator++();
_First & first() { return *(_First *) iv_position; };
_Second & second();
friend UtilSMap_Iterator<_First, _Second>
operator+<>(UtilSMap_Iterator<_First,_Second>& l,
size_t i);
};
template <typename _First, typename _Second>
class UtilSMap
{
public:
typedef _First key_type;
typedef _Second data_type;
typedef size_t size_type;
typedef UtilSMap_Iterator<_First,_Second> iterator;
private:
char * iv_memblock;
size_type iv_size;
size_type iv_blockCount;
public:
static const
size_type cv_firstSize = 4 * (sizeof(_First) / 4 +
(0 == (sizeof(_First) % 4) ? 0 :
4 - (sizeof(_First) % 4)));
static const
size_type cv_secondSize = 4 * (sizeof(_Second) / 4 +
(0 == (sizeof(_Second) % 4) ? 0 :
4 - (sizeof(_Second) % 4)));
static const
size_type cv_blockSize = cv_firstSize + cv_secondSize;
public:
UtilSMap() : iv_memblock(NULL), iv_size(0), iv_blockCount(2) {};
~UtilSMap() { this->clear(); };
inline size_type size() const { return iv_size;};
inline bool empty() const { return 0 == iv_size;};
inline iterator begin() const
{ return UtilSMap_Iterator<_First,_Second>(iv_memblock); };
inline iterator end() const
{ return UtilSMap_Iterator<_First,_Second>(
&iv_memblock[iv_size * cv_blockSize]);
};
void clear()
{
if (NULL != iv_memblock)
{
for( size_type i = 0; i < iv_size; i++ )
{
((key_type *)&iv_memblock[i])->~key_type();
((data_type *)
&iv_memblock[i + cv_firstSize])->~data_type();
}
free(iv_memblock);
}
iv_memblock = NULL;
iv_size = 0;
iv_blockCount = 2;
};
data_type * insert(const key_type & k, const data_type & v)
{
if (NULL == iv_memblock)
{
iv_memblock = (char *) malloc(cv_blockSize * iv_blockCount);
}
if (iv_size == iv_blockCount)
{
iv_blockCount <<= 1;
iv_memblock = (char *)
realloc(iv_memblock, cv_blockSize * iv_blockCount);
}
new ((key_type *)&iv_memblock[cv_blockSize * iv_size])
(key_type) (k);
data_type * l_rc = new ((data_type *)
&iv_memblock[cv_blockSize * iv_size + cv_firstSize])
(data_type) (v);
iv_size++;
return l_rc;
};
data_type & operator[](const key_type & i)
{
data_type * l_rc = find(i);
if (NULL == l_rc)
l_rc = insert(i, data_type());
return *l_rc;
};
UtilSMap & operator = (const UtilSMap & i_rhs )
{
if( &i_rhs == this ) return *this;
clear();
iv_size = i_rhs.iv_size;
iv_blockCount = i_rhs.iv_blockCount;
if( NULL != i_rhs.iv_memblock )
{
iv_memblock = (char *) malloc( cv_blockSize * iv_blockCount);
for( size_type i = 0; i < iv_size; i++ )
{
new ((key_type *)&iv_memblock[i])
(key_type)( i_rhs.iv_memblock[i] );
new ((data_type *) &iv_memblock[ i + cv_firstSize])
(data_type) (i_rhs.iv_memblock[ i + cv_firstSize]);
}
}
return *this;
};
UtilSMap (const UtilSMap & i_rhs )
{
iv_size = i_rhs.iv_size;
iv_blockCount = i_rhs.iv_blockCount;
iv_memblock = NULL;
if( NULL != i_rhs.iv_memblock )
{
iv_memblock = (char *) malloc( cv_blockSize * iv_blockCount);
for( size_type i = 0; i < iv_size; i++ )
{
new ((key_type *)&iv_memblock[i])
(key_type)( i_rhs.iv_memblock[i] );
new ((data_type *) &iv_memblock[ i + cv_firstSize])
(data_type) (i_rhs.iv_memblock[ i + cv_firstSize]);
}
}
};
data_type * find(const key_type & k)
{
if (NULL == iv_memblock)
return NULL;
for (size_type i = 0; i < iv_size; i++)
if ((*(key_type *)&iv_memblock[i * cv_blockSize]) == k)
return ((data_type *)
&iv_memblock[i * cv_blockSize + cv_firstSize]);
return NULL;
};
};
template <typename _First, typename _Second>
UtilSMap_Iterator<_First,_Second>&
UtilSMap_Iterator<_First,_Second>::operator++()
{
iv_position =
&iv_position[UtilSMap<_First,_Second>::cv_blockSize];
return *this;
};
template <typename _First, typename _Second>
_Second& UtilSMap_Iterator<_First,_Second>::second()
{
return *(_Second *)
&iv_position[UtilSMap<_First, _Second>::cv_firstSize];
};
template <typename _First, typename _Second>
UtilSMap_Iterator<_First,_Second>
operator+(UtilSMap_Iterator<_First, _Second>& l, size_t i)
{
return UtilSMap_Iterator<_First,_Second>(&l.iv_position[
UtilSMap<_First,_Second>::cv_blockSize * i]);
};
} // end namespace PRDF
#endif
|
