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
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/
**
** This file is part of the QtDeclarative module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QRECYCLEPOOL_P_H
#define QRECYCLEPOOL_P_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists purely as an
// implementation detail. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
//
QT_BEGIN_NAMESPACE
#define QRECYCLEPOOLCOOKIE 0x33218ADF
template<typename T, int Step>
class QRecyclePoolPrivate
{
public:
QRecyclePoolPrivate()
: recyclePoolHold(true), outstandingItems(0), cookie(QRECYCLEPOOLCOOKIE),
currentPage(0), nextAllocated(0)
{
}
bool recyclePoolHold;
int outstandingItems;
quint32 cookie;
struct PoolType : public T {
union {
QRecyclePoolPrivate<T, Step> *pool;
PoolType *nextAllocated;
};
};
struct Page {
Page *nextPage;
unsigned int free;
union {
char array[Step * sizeof(PoolType)];
qint64 q_for_alignment_1;
double q_for_alignment_2;
};
};
Page *currentPage;
PoolType *nextAllocated;
inline T *allocate();
static inline void dispose(T *);
inline void releaseIfPossible();
};
template<typename T, int Step = 1024>
class QRecyclePool
{
public:
inline QRecyclePool();
inline ~QRecyclePool();
inline T *New();
template<typename T1>
inline T *New(const T1 &);
template<typename T1>
inline T *New(T1 &);
static inline void Delete(T *);
private:
QRecyclePoolPrivate<T, Step> *d;
};
template<typename T, int Step>
QRecyclePool<T, Step>::QRecyclePool()
: d(new QRecyclePoolPrivate<T, Step>())
{
}
template<typename T, int Step>
QRecyclePool<T, Step>::~QRecyclePool()
{
d->recyclePoolHold = false;
d->releaseIfPossible();
}
template<typename T, int Step>
T *QRecyclePool<T, Step>::New()
{
T *rv = d->allocate();
new (rv) T;
return rv;
}
template<typename T, int Step>
template<typename T1>
T *QRecyclePool<T, Step>::New(const T1 &a)
{
T *rv = d->allocate();
new (rv) T(a);
return rv;
}
template<typename T, int Step>
template<typename T1>
T *QRecyclePool<T, Step>::New(T1 &a)
{
T *rv = d->allocate();
new (rv) T(a);
return rv;
}
template<typename T, int Step>
void QRecyclePool<T, Step>::Delete(T *t)
{
t->~T();
QRecyclePoolPrivate<T, Step>::dispose(t);
}
template<typename T, int Step>
void QRecyclePoolPrivate<T, Step>::releaseIfPossible()
{
if (recyclePoolHold || outstandingItems)
return;
Page *p = currentPage;
while (p) {
Page *n = p->nextPage;
qFree(p);
p = n;
}
delete this;
}
template<typename T, int Step>
T *QRecyclePoolPrivate<T, Step>::allocate()
{
PoolType *rv = 0;
if (nextAllocated) {
rv = nextAllocated;
nextAllocated = rv->nextAllocated;
} else if (currentPage && currentPage->free) {
rv = (PoolType *)(currentPage->array + (Step - currentPage->free) * sizeof(PoolType));
currentPage->free--;
} else {
Page *p = (Page *)qMalloc(sizeof(Page));
p->nextPage = currentPage;
p->free = Step;
currentPage = p;
rv = (PoolType *)currentPage->array;
currentPage->free--;
}
rv->pool = this;
++outstandingItems;
return rv;
}
template<typename T, int Step>
void QRecyclePoolPrivate<T, Step>::dispose(T *t)
{
PoolType *pt = static_cast<PoolType *>(t);
Q_ASSERT(pt->pool && pt->pool->cookie == QRECYCLEPOOLCOOKIE);
QRecyclePoolPrivate<T, Step> *This = pt->pool;
pt->nextAllocated = This->nextAllocated;
This->nextAllocated = pt;
--This->outstandingItems;
This->releaseIfPossible();
}
QT_END_NAMESPACE
#endif // QRECYCLEPOOL_P_H
|
