mirror of
https://bitbucket.org/smil3y/katie.git
synced 2025-02-27 04:13:08 +00:00
255 lines
7.2 KiB
C++
255 lines
7.2 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2015 The Qt Company Ltd.
|
|
** Contact: http://www.qt.io/licensing/
|
|
**
|
|
** This file is part of the QtDeclarative 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 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 2.1 or version 3 as published by the Free
|
|
** Software Foundation and appearing in the file LICENSE.LGPLv21 and
|
|
** LICENSE.LGPLv3 included in the packaging of this file. Please review the
|
|
** following information to ensure the GNU Lesser General Public License
|
|
** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
|
|
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|
**
|
|
** As a special exception, The Qt Company gives you certain additional
|
|
** rights. These rights are described in The Qt Company 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.
|
|
**
|
|
** $QT_END_LICENSE$
|
|
**
|
|
****************************************************************************/
|
|
|
|
#include "qdeclarativecompiler_p.h"
|
|
#include "qdeclarativeengine.h"
|
|
#include "qdeclarativecomponent.h"
|
|
#include "qdeclarativecomponent_p.h"
|
|
#include "qdeclarativecontext.h"
|
|
#include "qdeclarativecontext_p.h"
|
|
|
|
#include <QtCore/qdebug.h>
|
|
|
|
#include <qobject_p.h>
|
|
|
|
QT_BEGIN_NAMESPACE
|
|
|
|
int QDeclarativeCompiledData::pack(const char *data, size_t size)
|
|
{
|
|
const char *p = packData.constData();
|
|
unsigned int ps = packData.size();
|
|
|
|
for (unsigned int ii = 0; (ii + size) <= ps; ii += sizeof(int)) {
|
|
if (0 == ::memcmp(p + ii, data, size))
|
|
return ii;
|
|
}
|
|
|
|
int rv = packData.size();
|
|
packData.append(data, size);
|
|
return rv;
|
|
}
|
|
|
|
int QDeclarativeCompiledData::indexForString(const QString &data)
|
|
{
|
|
int idx = primitives.indexOf(data);
|
|
if (idx == -1) {
|
|
idx = primitives.count();
|
|
primitives << data;
|
|
}
|
|
return idx;
|
|
}
|
|
|
|
int QDeclarativeCompiledData::indexForByteArray(const QByteArray &data)
|
|
{
|
|
int idx = datas.indexOf(data);
|
|
if (idx == -1) {
|
|
idx = datas.count();
|
|
datas << data;
|
|
}
|
|
return idx;
|
|
}
|
|
|
|
int QDeclarativeCompiledData::indexForUrl(const QUrl &data)
|
|
{
|
|
int idx = urls.indexOf(data);
|
|
if (idx == -1) {
|
|
idx = urls.count();
|
|
urls << data;
|
|
}
|
|
return idx;
|
|
}
|
|
|
|
int QDeclarativeCompiledData::indexForFloat(float *data, int count)
|
|
{
|
|
Q_ASSERT(count > 0);
|
|
|
|
for (int ii = 0; ii <= floatData.count() - count; ++ii) {
|
|
bool found = true;
|
|
for (int jj = 0; jj < count; ++jj) {
|
|
if (floatData.at(ii + jj) != data[jj]) {
|
|
found = false;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (found)
|
|
return ii;
|
|
}
|
|
|
|
int idx = floatData.count();
|
|
for (int ii = 0; ii < count; ++ii)
|
|
floatData << data[ii];
|
|
|
|
return idx;
|
|
}
|
|
|
|
int QDeclarativeCompiledData::indexForInt(int *data, int count)
|
|
{
|
|
Q_ASSERT(count > 0);
|
|
|
|
for (int ii = 0; ii <= intData.count() - count; ++ii) {
|
|
bool found = true;
|
|
for (int jj = 0; jj < count; ++jj) {
|
|
if (intData.at(ii + jj) != data[jj]) {
|
|
found = false;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (found)
|
|
return ii;
|
|
}
|
|
|
|
int idx = intData.count();
|
|
for (int ii = 0; ii < count; ++ii)
|
|
intData << data[ii];
|
|
|
|
return idx;
|
|
}
|
|
|
|
int QDeclarativeCompiledData::indexForLocation(const QDeclarativeParser::Location &l)
|
|
{
|
|
// ### FIXME
|
|
int rv = locations.count();
|
|
locations << l;
|
|
return rv;
|
|
}
|
|
|
|
int QDeclarativeCompiledData::indexForLocation(const QDeclarativeParser::LocationSpan &l)
|
|
{
|
|
// ### FIXME
|
|
int rv = locations.count();
|
|
locations << l.start << l.end;
|
|
return rv;
|
|
}
|
|
|
|
QDeclarativeCompiledData::QDeclarativeCompiledData(QDeclarativeEngine *engine)
|
|
: QDeclarativeCleanup(engine), importCache(0), root(0), rootPropertyCache(0)
|
|
{
|
|
}
|
|
|
|
QDeclarativeCompiledData::~QDeclarativeCompiledData()
|
|
{
|
|
for (int ii = 0; ii < types.count(); ++ii) {
|
|
if (types.at(ii).component)
|
|
types.at(ii).component->release();
|
|
if (types.at(ii).typePropertyCache)
|
|
types.at(ii).typePropertyCache->release();
|
|
}
|
|
|
|
for (int ii = 0; ii < propertyCaches.count(); ++ii)
|
|
propertyCaches.at(ii)->release();
|
|
|
|
for (int ii = 0; ii < contextCaches.count(); ++ii)
|
|
contextCaches.at(ii)->release();
|
|
|
|
if (importCache)
|
|
importCache->release();
|
|
|
|
if (rootPropertyCache)
|
|
rootPropertyCache->release();
|
|
|
|
qDeleteAll(cachedPrograms);
|
|
qDeleteAll(cachedClosures);
|
|
}
|
|
|
|
void QDeclarativeCompiledData::clear()
|
|
{
|
|
qDeleteAll(cachedPrograms);
|
|
qDeleteAll(cachedClosures);
|
|
for (int ii = 0; ii < cachedClosures.count(); ++ii)
|
|
cachedClosures[ii] = 0;
|
|
for (int ii = 0; ii < cachedPrograms.count(); ++ii)
|
|
cachedPrograms[ii] = 0;
|
|
}
|
|
|
|
const QMetaObject *QDeclarativeCompiledData::TypeReference::metaObject() const
|
|
{
|
|
if (type) {
|
|
return type->metaObject();
|
|
} else {
|
|
Q_ASSERT(component);
|
|
return component->root;
|
|
}
|
|
}
|
|
|
|
/*!
|
|
Returns the property cache, if one alread exists. The cache is not referenced.
|
|
*/
|
|
QDeclarativePropertyCache *QDeclarativeCompiledData::TypeReference::propertyCache() const
|
|
{
|
|
if (type)
|
|
return typePropertyCache;
|
|
else
|
|
return component->rootPropertyCache;
|
|
}
|
|
|
|
/*!
|
|
Returns the property cache, creating one if it doesn't already exist. The cache is not referenced.
|
|
*/
|
|
QDeclarativePropertyCache *QDeclarativeCompiledData::TypeReference::createPropertyCache(QDeclarativeEngine *engine)
|
|
{
|
|
if (typePropertyCache) {
|
|
return typePropertyCache;
|
|
} else if (type) {
|
|
typePropertyCache = QDeclarativeEnginePrivate::get(engine)->cache(type->metaObject());
|
|
typePropertyCache->addref();
|
|
return typePropertyCache;
|
|
} else {
|
|
return component->rootPropertyCache;
|
|
}
|
|
}
|
|
|
|
|
|
void QDeclarativeCompiledData::dumpInstructions()
|
|
{
|
|
if (!name.isEmpty())
|
|
qWarning() << name;
|
|
qWarning().nospace() << "Index\tLine\tOperation\t\tData1\tData2\tData3\tComments";
|
|
qWarning().nospace() << "-------------------------------------------------------------------------------";
|
|
for (int ii = 0; ii < bytecode.count(); ++ii) {
|
|
dump(&bytecode[ii], ii);
|
|
}
|
|
qWarning().nospace() << "-------------------------------------------------------------------------------";
|
|
}
|
|
|
|
|
|
QT_END_NAMESPACE
|