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
|
// Copyright (C) 2021 The Qt Company Ltd.
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
#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.
//
#include <QtCore/private/qglobal_p.h>
#include <QtCore/q20memory.h>
QT_BEGIN_NAMESPACE
#define QRECYCLEPOOLCOOKIE 0x33218ADF
template<typename T, int Step>
class QRecyclePoolPrivate
{
public:
QRecyclePoolPrivate()
: recyclePoolHold(true), outstandingItems(0), cookie(QRECYCLEPOOLCOOKIE),
currentPage(nullptr), nextAllocated(nullptr)
{
}
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();
template<typename...Args>
[[nodiscard]] inline T *New(Args&&...args);
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>
template<typename...Args>
T *QRecyclePool<T, Step>::New(Args&&...args)
{
return q20::construct_at(d->allocate(), std::forward<Args>(args)...);
}
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;
free(p);
p = n;
}
delete this;
}
template<typename T, int Step>
T *QRecyclePoolPrivate<T, Step>::allocate()
{
PoolType *rv = nullptr;
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 *)malloc(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
|
