260 lines
7.9 KiB
C++
260 lines
7.9 KiB
C++
/****************************************************************************
|
|
**
|
|
** 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 "qv4objectiterator_p.h"
|
|
#include "qv4object_p.h"
|
|
#include "qv4stringobject_p.h"
|
|
#include "qv4identifier_p.h"
|
|
#include "qv4argumentsobject_p.h"
|
|
#include "qv4string_p.h"
|
|
#include "qv4iterator_p.h"
|
|
#include "qv4propertykey_p.h"
|
|
|
|
using namespace QV4;
|
|
|
|
void ForInIteratorPrototype::init(ExecutionEngine *)
|
|
{
|
|
defineDefaultProperty(QStringLiteral("next"), method_next, 0);
|
|
}
|
|
|
|
void ObjectIterator::init(const Object *o)
|
|
{
|
|
object->setM(o ? o->m() : nullptr);
|
|
current->setM(o ? o->m() : nullptr);
|
|
|
|
if (object->as<ArgumentsObject>()) {
|
|
Scope scope(engine);
|
|
Scoped<ArgumentsObject> (scope, object->asReturnedValue())->fullyCreate();
|
|
}
|
|
}
|
|
|
|
void ObjectIterator::next(Value *name, uint *index, Property *pd, PropertyAttributes *attrs)
|
|
{
|
|
name->setM(nullptr);
|
|
*index = UINT_MAX;
|
|
|
|
if (!object->as<Object>()) {
|
|
*attrs = PropertyAttributes();
|
|
return;
|
|
}
|
|
Scope scope(engine);
|
|
ScopedObject o(scope);
|
|
ScopedString n(scope);
|
|
|
|
while (1) {
|
|
Object *co = current->objectValue();
|
|
if (!co)
|
|
break;
|
|
|
|
while (1) {
|
|
co->advanceIterator(this, name, index, pd, attrs);
|
|
if (attrs->isEmpty())
|
|
break;
|
|
// check the property is not already defined earlier in the proto chain
|
|
if (co->heapObject() != object->heapObject()) {
|
|
o = object->as<Object>();
|
|
n = *name;
|
|
bool shadowed = false;
|
|
while (o->d() != current->heapObject()) {
|
|
PropertyKey id = n ? (n->toPropertyKey()) : PropertyKey::fromArrayIndex(*index);
|
|
if (id.isValid() && o->getOwnProperty(id) != Attr_Invalid) {
|
|
shadowed = true;
|
|
break;
|
|
}
|
|
o = o->getPrototypeOf();
|
|
}
|
|
if (shadowed)
|
|
continue;
|
|
}
|
|
return;
|
|
}
|
|
|
|
if (flags & WithProtoChain)
|
|
current->setM(co->getPrototypeOf());
|
|
else
|
|
current->setM(nullptr);
|
|
|
|
arrayIndex = 0;
|
|
memberIndex = 0;
|
|
}
|
|
*attrs = PropertyAttributes();
|
|
}
|
|
|
|
ReturnedValue ObjectIterator::nextPropertyName(Value *value)
|
|
{
|
|
Object *o = object->objectValue();
|
|
if (!o)
|
|
return Encode::null();
|
|
|
|
PropertyAttributes attrs;
|
|
uint index;
|
|
Scope scope(engine);
|
|
ScopedProperty p(scope);
|
|
ScopedString name(scope);
|
|
next(name.getRef(), &index, p, &attrs);
|
|
if (attrs.isEmpty())
|
|
return Encode::null();
|
|
|
|
*value = o->getValue(p->value, attrs);
|
|
|
|
if (!!name)
|
|
return name->asReturnedValue();
|
|
Q_ASSERT(index < UINT_MAX);
|
|
return Encode(index);
|
|
}
|
|
|
|
ReturnedValue ObjectIterator::nextPropertyNameAsString(Value *value)
|
|
{
|
|
Object *o = object->objectValue();
|
|
if (!o)
|
|
return Encode::null();
|
|
|
|
PropertyAttributes attrs;
|
|
uint index;
|
|
Scope scope(engine);
|
|
ScopedProperty p(scope);
|
|
ScopedString name(scope);
|
|
next(name.getRef(), &index, p, &attrs);
|
|
if (attrs.isEmpty())
|
|
return Encode::null();
|
|
|
|
*value = o->getValue(p->value, attrs);
|
|
|
|
if (!!name)
|
|
return name->asReturnedValue();
|
|
Q_ASSERT(index < UINT_MAX);
|
|
return Encode(engine->newString(QString::number(index)));
|
|
}
|
|
|
|
ReturnedValue ObjectIterator::nextPropertyNameAsString()
|
|
{
|
|
if (!object->as<Object>())
|
|
return Encode::null();
|
|
|
|
PropertyAttributes attrs;
|
|
uint index;
|
|
Scope scope(engine);
|
|
ScopedProperty p(scope);
|
|
ScopedString name(scope);
|
|
next(name.getRef(), &index, p, &attrs);
|
|
if (attrs.isEmpty())
|
|
return Encode::null();
|
|
|
|
if (!!name)
|
|
return name->asReturnedValue();
|
|
Q_ASSERT(index < UINT_MAX);
|
|
return Encode(engine->newString(QString::number(index)));
|
|
}
|
|
|
|
|
|
DEFINE_OBJECT_VTABLE(ForInIteratorObject);
|
|
|
|
void Heap::ForInIteratorObject::markObjects(Heap::Base *that, MarkStack *markStack)
|
|
{
|
|
ForInIteratorObject *o = static_cast<ForInIteratorObject *>(that);
|
|
o->object->mark(markStack);
|
|
o->workArea[0].mark(markStack);
|
|
o->workArea[1].mark(markStack);
|
|
Object::markObjects(that, markStack);
|
|
}
|
|
|
|
void Heap::ForInIteratorObject::destroy()
|
|
{
|
|
delete iterator;
|
|
}
|
|
|
|
ReturnedValue ForInIteratorPrototype::method_next(const FunctionObject *b, const Value *thisObject, const Value *, int)
|
|
{
|
|
const ForInIteratorObject *forIn = static_cast<const ForInIteratorObject *>(thisObject);
|
|
Q_ASSERT(forIn);
|
|
Scope scope(b);
|
|
|
|
ScopedPropertyKey key(scope, forIn->nextProperty());
|
|
bool done = false;
|
|
if (!key->isValid())
|
|
done = true;
|
|
ScopedStringOrSymbol s(scope, key->toStringOrSymbol(scope.engine));
|
|
return IteratorPrototype::createIterResultObject(scope.engine, s, done);
|
|
}
|
|
|
|
|
|
PropertyKey ForInIteratorObject::nextProperty() const
|
|
{
|
|
if (!d()->current)
|
|
return PropertyKey::invalid();
|
|
|
|
Scope scope(this);
|
|
ScopedObject c(scope, d()->current);
|
|
ScopedObject o(scope);
|
|
ScopedPropertyKey key(scope);
|
|
PropertyAttributes attrs;
|
|
|
|
while (1) {
|
|
while (1) {
|
|
key = d()->iterator->next(c, nullptr, &attrs);
|
|
if (!key->isValid())
|
|
break;
|
|
if (!attrs.isEnumerable() || key->isSymbol())
|
|
continue;
|
|
// check the property is not already defined earlier in the proto chain
|
|
if (d()->current != d()->object) {
|
|
o = d()->object;
|
|
bool shadowed = false;
|
|
while (o->d() != c->heapObject()) {
|
|
if (o->getOwnProperty(key) != Attr_Invalid) {
|
|
shadowed = true;
|
|
break;
|
|
}
|
|
o = o->getPrototypeOf();
|
|
}
|
|
if (shadowed)
|
|
continue;
|
|
}
|
|
return key;
|
|
}
|
|
|
|
c = c->getPrototypeOf();
|
|
d()->current.set(scope.engine, c->d());
|
|
if (!c)
|
|
break;
|
|
delete d()->iterator;
|
|
d()->iterator = c->ownPropertyKeys();
|
|
}
|
|
return PropertyKey::invalid();
|
|
}
|