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
|
/****************************************************************************
**
** Copyright (C) 2014 Klaralvdalens Datakonsult AB (KDAB).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the Qt3D module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL3$
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and The Qt Company. For licensing terms
** and conditions see http://www.qt.io/terms-conditions. For further
** information use the contact form at http://www.qt.io/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 3 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPLv3 included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 3 requirements
** will be met: https://www.gnu.org/licenses/lgpl.html.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 2.0 or later 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 2.0 requirements will be
** met: http://www.gnu.org/licenses/gpl-2.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QT3DCORE_QHANDLEMANAGER_P_H
#define QT3DCORE_QHANDLEMANAGER_P_H
//
// W A R N I N G
// -------------
//
// This file is not part of the Qt API. It exists for the convenience
// of other Qt classes. This header file may change from version to
// version without notice, or even be removed.
//
// We mean it.
//
#include <QtGlobal>
#include <Qt3DCore/qt3dcore_global.h>
#include "qhandle_p.h"
#include <QtCore/QVector>
QT_BEGIN_NAMESPACE
namespace Qt3DCore {
template <typename T, uint INDEXBITS = 16>
class QHandleManager
{
public:
QHandleManager()
: m_firstFreeEntry(0)
, m_activeEntryCount(0)
, m_entries(1 << INDEXBITS)
{
reset();
}
quint32 activeEntries() const { return m_activeEntryCount; }
void reset();
QHandle<T, INDEXBITS> acquire(T *d);
void release(const QHandle<T, INDEXBITS> &handle);
void update(const QHandle<T, INDEXBITS> &, T *d);
T *data(const QHandle<T, INDEXBITS> &handle, bool *ok = 0);
const T *constData(const QHandle<T, INDEXBITS> &handle, bool *ok = 0) const;
private:
Q_DISABLE_COPY(QHandleManager)
template <typename U>
struct HandleEntry
{
HandleEntry()
: m_data(Q_NULLPTR)
, m_nextFreeIndex(0)
, m_counter(0)
, m_active(false)
, m_endOfFreeList(false)
{}
explicit HandleEntry(quint32 nextFreeIndex)
: m_data(Q_NULLPTR)
, m_nextFreeIndex(nextFreeIndex)
, m_counter(0)
, m_active(false)
, m_endOfFreeList(false)
{}
U *m_data;
unsigned int m_nextFreeIndex : QHandle<U, INDEXBITS>::IndexBits;
unsigned int m_counter : QHandle<U, INDEXBITS>::CounterBits;
unsigned int m_active : 1;
unsigned int m_endOfFreeList : 1;
};
quint32 m_firstFreeEntry;
int m_activeEntryCount;
QVector<HandleEntry<T> > m_entries;
};
template <typename T, uint INDEXBITS>
void QHandleManager<T, INDEXBITS>::reset()
{
m_activeEntryCount = 0;
m_firstFreeEntry = 0;
for (int i = 0; i < QHandle<T, INDEXBITS >::MaxIndex; ++i)
m_entries[i] = HandleEntry<T>(i + 1);
m_entries[QHandle<T, INDEXBITS>::MaxIndex] = HandleEntry<T>();
m_entries[QHandle<T, INDEXBITS>::MaxIndex].m_endOfFreeList = true;
}
template <typename T, uint INDEXBITS>
QHandle<T, INDEXBITS> QHandleManager<T, INDEXBITS>::acquire(T *d)
{
typedef QHandle<T, INDEXBITS> qHandle;
Q_ASSERT(m_activeEntryCount < qHandle::MaxIndex);
const quint32 newIndex = m_firstFreeEntry;
Q_ASSERT(newIndex < qHandle::MaxIndex);
Q_ASSERT(m_entries[newIndex].m_active == false);
Q_ASSERT(!m_entries[newIndex].m_endOfFreeList);
m_firstFreeEntry = m_entries[newIndex].m_nextFreeIndex;
m_entries[newIndex].m_nextFreeIndex = 0;
++m_entries[newIndex].m_counter;
if (m_entries[newIndex].m_counter == 0)
m_entries[newIndex].m_counter = 1;
m_entries[newIndex].m_active = true;
m_entries[newIndex].m_data = d;
++m_activeEntryCount;
return qHandle(newIndex, m_entries[newIndex].m_counter);
}
template <typename T, uint INDEXBITS>
void QHandleManager<T, INDEXBITS>::release(const QHandle<T, INDEXBITS> &handle)
{
const quint32 index = handle.index();
Q_ASSERT(m_entries[index].m_counter == handle.counter());
Q_ASSERT(m_entries[index].m_active == true);
m_entries[index].m_nextFreeIndex = m_firstFreeEntry;
m_entries[index].m_active = false;
m_firstFreeEntry = index;
--m_activeEntryCount;
}
// Needed in case the QResourceManager has reordered
// memory so that the handle still points to valid data
template <typename T, uint INDEXBITS>
void QHandleManager<T, INDEXBITS>::update(const QHandle<T, INDEXBITS> &handle, T *d)
{
const quint32 index = handle.index();
Q_ASSERT(m_entries[index].m_counter == handle.counter());
Q_ASSERT(m_entries[index].m_active == true);
m_entries[index].m_data = d;
}
template <typename T, uint INDEXBITS>
T *QHandleManager<T, INDEXBITS>::data(const QHandle<T, INDEXBITS> &handle, bool *ok)
{
const quint32 index = handle.index();
if (m_entries[index].m_counter != handle.counter() ||
m_entries[index].m_active == false) {
if (ok)
*ok = false;
return Q_NULLPTR;
}
T *d = m_entries[index].m_data;
if (ok)
*ok = true;
return d;
}
template <typename T, uint INDEXBITS>
const T *QHandleManager<T, INDEXBITS>::constData(const QHandle<T, INDEXBITS> &handle, bool *ok) const
{
const quint32 index = handle.index();
if (m_entries[index].m_counter != handle.counter() ||
m_entries[index].m_active == false) {
if (ok)
*ok = false;
return Q_NULLPTR;
}
const T *d = m_entries[index].m_data;
if (ok)
*ok = true;
return d;
}
} // Qt3D
QT_END_NAMESPACE
#endif // QT3DCORE_QHANDLEMANAGER_H
|
