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
|
/****************************************************************************
**
** 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$
**
****************************************************************************/
#include "qqmllistaccessor_p.h"
#include <private/qqmlmetatype_p.h>
#include <QtCore/qstringlist.h>
#include <QtCore/qdebug.h>
#include <QtCore/qurl.h>
// ### Remove me
#include <private/qqmlengine_p.h>
QT_BEGIN_NAMESPACE
QQmlListAccessor::QQmlListAccessor()
: m_type(Invalid)
{
}
QQmlListAccessor::~QQmlListAccessor()
{
}
QVariant QQmlListAccessor::list() const
{
return d;
}
void QQmlListAccessor::setList(const QVariant &v)
{
d = v;
// An incoming JS array as model is treated as a variant list, so we need to
// convert it first with toVariant().
QMetaType variantsType = d.metaType();
if (variantsType == QMetaType::fromType<QJSValue>()) {
d = d.value<QJSValue>().toVariant();
variantsType = d.metaType();
}
if (!d.isValid()) {
m_type = Invalid;
} else if (variantsType == QMetaType::fromType<QStringList>()) {
m_type = StringList;
} else if (variantsType == QMetaType::fromType<QList<QUrl>>()) {
m_type = UrlList;
} else if (variantsType == QMetaType::fromType<QVariantList>()) {
m_type = VariantList;
} else if (variantsType == QMetaType::fromType<QList<QObject *>>()) {
m_type = ObjectList;
} else if (variantsType == QMetaType::fromType<QQmlListReference>()) {
m_type = ListProperty;
} else if (variantsType.flags() & QMetaType::PointerToQObject) {
m_type = Instance;
} else if (int i = 0; [&](){bool ok = false; i = v.toInt(&ok); return ok;}()) {
// Here we have to check for an upper limit, because down the line code might (well, will)
// allocate memory depending on the number of elements. The upper limit cannot be INT_MAX:
// QVector<QPointer<QQuickItem>> something;
// something.resize(count());
// (See e.g. QQuickRepeater::regenerate())
// This will allocate data along the lines of:
// sizeof(QPointer<QQuickItem>) * count() + QVector::headerSize
// So, doing an approximate round-down-to-nice-number, we get:
const int upperLimit = 100 * 1000 * 1000;
if (i < 0) {
qWarning("Model size of %d is less than 0", i);
m_type = Invalid;
} else if (i > upperLimit) {
qWarning("Model size of %d is bigger than the upper limit %d", i, upperLimit);
m_type = Invalid;
} else {
m_type = Integer;
d = i;
}
} else {
const QQmlType type = QQmlMetaType::qmlListType(v.metaType());
if (type.isSequentialContainer()) {
m_metaSequence = type.listMetaSequence();
m_type = Sequence;
} else {
m_type = Instance;
}
}
}
qsizetype QQmlListAccessor::count() const
{
switch(m_type) {
case StringList:
Q_ASSERT(d.metaType() == QMetaType::fromType<QStringList>());
return reinterpret_cast<const QStringList *>(d.constData())->count();
case UrlList:
Q_ASSERT(d.metaType() == QMetaType::fromType<QList<QUrl>>());
return reinterpret_cast<const QList<QUrl> *>(d.constData())->count();
case VariantList:
Q_ASSERT(d.metaType() == QMetaType::fromType<QVariantList>());
return reinterpret_cast<const QVariantList *>(d.constData())->count();
case ObjectList:
Q_ASSERT(d.metaType() == QMetaType::fromType<QList<QObject *>>());
return reinterpret_cast<const QList<QObject *> *>(d.constData())->count();
case ListProperty:
Q_ASSERT(d.metaType() == QMetaType::fromType<QQmlListReference>());
return reinterpret_cast<const QQmlListReference *>(d.constData())->count();
case Sequence:
Q_ASSERT(m_metaSequence != QMetaSequence());
return m_metaSequence.size(d.constData());
case Instance:
return 1;
case Integer:
return *reinterpret_cast<const int *>(d.constData());
case Invalid:
return 0;
}
Q_UNREACHABLE();
return 0;
}
QVariant QQmlListAccessor::at(qsizetype idx) const
{
Q_ASSERT(idx >= 0 && idx < count());
switch(m_type) {
case StringList:
Q_ASSERT(d.metaType() == QMetaType::fromType<QStringList>());
return QVariant::fromValue(reinterpret_cast<const QStringList *>(d.constData())->at(idx));
case UrlList:
Q_ASSERT(d.metaType() == QMetaType::fromType<QList<QUrl>>());
return QVariant::fromValue(reinterpret_cast<const QList<QUrl> *>(d.constData())->at(idx));
case VariantList:
Q_ASSERT(d.metaType() == QMetaType::fromType<QVariantList>());
return reinterpret_cast<const QVariantList *>(d.constData())->at(idx);
case ObjectList:
Q_ASSERT(d.metaType() == QMetaType::fromType<QList<QObject *>>());
return QVariant::fromValue(reinterpret_cast<const QList<QObject *> *>(d.constData())->at(idx));
case ListProperty:
Q_ASSERT(d.metaType() == QMetaType::fromType<QQmlListReference>());
return QVariant::fromValue(reinterpret_cast<const QQmlListReference *>(d.constData())->at(idx));
case Sequence: {
Q_ASSERT(m_metaSequence != QMetaSequence());
QVariant result;
const QMetaType valueMetaType = m_metaSequence.valueMetaType();
if (valueMetaType == QMetaType::fromType<QVariant>()) {
m_metaSequence.valueAtIndex(d.constData(), idx, &result);
} else {
result = QVariant(valueMetaType);
m_metaSequence.valueAtIndex(d.constData(), idx, result.data());
}
return result;
}
case Instance:
return d;
case Integer:
return QVariant(idx);
case Invalid:
return QVariant();
}
Q_UNREACHABLE();
return QVariant();
}
bool QQmlListAccessor::isValid() const
{
return m_type != Invalid;
}
QT_END_NAMESPACE
|
