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
|
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of the QtQml module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** 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 https://www.qt.io/terms-conditions. For further
** information use the contact form at https://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.LGPL3 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-3.0.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 (at your option) the GNU General
** Public license version 3 or any later version approved by the KDE Free
** Qt Foundation. The licenses are as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL2 and LICENSE.GPL3
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-2.0.html and
** https://www.gnu.org/licenses/gpl-3.0.html.
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef QV4IDENTIFIER_H
#define QV4IDENTIFIER_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 <qstring.h>
QT_BEGIN_NAMESPACE
namespace QV4 {
namespace Heap {
struct String;
}
struct String;
struct IdentifierTable;
struct ExecutionEngine;
struct Identifier
{
QString string;
uint hashValue;
};
struct IdentifierHashEntry {
const Identifier *identifier;
union {
int value;
void *pointer;
};
static int get(const IdentifierHashEntry *This, int *) { return This ? This->value : -1; }
static bool get(const IdentifierHashEntry *This, bool *) { return This != 0; }
static void *get(const IdentifierHashEntry *This, void **) { return This ? This->pointer : 0; }
};
struct IdentifierHashData
{
IdentifierHashData(int numBits);
~IdentifierHashData() {
free(entries);
}
QBasicAtomicInt refCount;
int alloc;
int size;
int numBits;
IdentifierTable *identifierTable;
IdentifierHashEntry *entries;
};
struct IdentifierHashBase
{
IdentifierHashData *d;
IdentifierHashBase() : d(0) {}
IdentifierHashBase(ExecutionEngine *engine);
inline IdentifierHashBase(const IdentifierHashBase &other);
inline ~IdentifierHashBase();
inline IdentifierHashBase &operator=(const IdentifierHashBase &other);
bool isEmpty() const { return !d; }
inline int count() const;
bool contains(const Identifier *i) const;
bool contains(const QString &str) const;
bool contains(String *str) const;
protected:
IdentifierHashEntry *addEntry(const Identifier *i);
const IdentifierHashEntry *lookup(const Identifier *identifier) const;
const IdentifierHashEntry *lookup(const QString &str) const;
const IdentifierHashEntry *lookup(String *str) const;
const Identifier *toIdentifier(const QString &str) const;
const Identifier *toIdentifier(Heap::String *str) const;
};
template<typename T>
struct IdentifierHash : public IdentifierHashBase
{
IdentifierHash()
: IdentifierHashBase() {}
IdentifierHash(ExecutionEngine *engine)
: IdentifierHashBase(engine) {}
inline IdentifierHash(const IdentifierHash<T> &other)
: IdentifierHashBase(other) {}
inline ~IdentifierHash() {}
inline IdentifierHash &operator=(const IdentifierHash<T> &other) {
IdentifierHashBase::operator =(other);
return *this;
}
void add(const QString &str, const T &value);
inline T value(const QString &str) const;
inline T value(String *str) const;
QString findId(T value) const;
};
inline IdentifierHashBase::IdentifierHashBase(const IdentifierHashBase &other)
{
d = other.d;
if (d)
d->refCount.ref();
}
inline IdentifierHashBase::~IdentifierHashBase()
{
if (d && !d->refCount.deref())
delete d;
}
IdentifierHashBase &IdentifierHashBase::operator=(const IdentifierHashBase &other)
{
if (other.d)
other.d->refCount.ref();
if (d && !d->refCount.deref())
delete d;
d = other.d;
return *this;
}
inline int IdentifierHashBase::count() const
{
return d ? d->size : 0;
}
inline bool IdentifierHashBase::contains(const Identifier *i) const
{
return lookup(i) != 0;
}
inline bool IdentifierHashBase::contains(const QString &str) const
{
return lookup(str) != 0;
}
inline bool IdentifierHashBase::contains(String *str) const
{
return lookup(str) != 0;
}
template<typename T>
void IdentifierHash<T>::add(const QString &str, const T &value)
{
IdentifierHashEntry *e = addEntry(toIdentifier(str));
e->value = value;
}
template<typename T>
inline T IdentifierHash<T>::value(const QString &str) const
{
return IdentifierHashEntry::get(lookup(str), (T*)0);
}
template<typename T>
inline T IdentifierHash<T>::value(String *str) const
{
return IdentifierHashEntry::get(lookup(str), (T*)0);
}
template<typename T>
QString IdentifierHash<T>::findId(T value) const
{
IdentifierHashEntry *e = d->entries;
IdentifierHashEntry *end = e + d->alloc;
while (e < end) {
if (e->identifier && IdentifierHashEntry::get(e, (T*)0) == value)
return e->identifier->string;
++e;
}
return QString();
}
}
QT_END_NAMESPACE
#endif
|
