| /**************************************************************************** |
| ** |
| ** 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 "qv4identifier_p.h" |
| #include "qv4identifiertable_p.h" |
| #include "qv4string_p.h" |
| #include <private/qprimefornumbits_p.h> |
| |
| QT_BEGIN_NAMESPACE |
| |
| namespace QV4 { |
| |
| IdentifierHashData::IdentifierHashData(IdentifierTable *table, int numBits) |
| : size(0) |
| , numBits(numBits) |
| , identifierTable(table) |
| { |
| refCount.storeRelaxed(1); |
| alloc = qPrimeForNumBits(numBits); |
| entries = (IdentifierHashEntry *)malloc(alloc*sizeof(IdentifierHashEntry)); |
| memset(entries, 0, alloc*sizeof(IdentifierHashEntry)); |
| identifierTable->addIdentifierHash(this); |
| } |
| |
| IdentifierHashData::IdentifierHashData(IdentifierHashData *other) |
| : size(other->size) |
| , numBits(other->numBits) |
| , identifierTable(other->identifierTable) |
| { |
| refCount.storeRelaxed(1); |
| alloc = other->alloc; |
| entries = (IdentifierHashEntry *)malloc(alloc*sizeof(IdentifierHashEntry)); |
| memcpy(entries, other->entries, alloc*sizeof(IdentifierHashEntry)); |
| identifierTable->addIdentifierHash(this); |
| } |
| |
| IdentifierHashData::~IdentifierHashData() { |
| free(entries); |
| if (identifierTable) |
| identifierTable->removeIdentifierHash(this); |
| } |
| |
| IdentifierHash::IdentifierHash(ExecutionEngine *engine) |
| { |
| d = new IdentifierHashData(engine->identifierTable, 3); |
| } |
| |
| void IdentifierHash::detach() |
| { |
| if (!d || d->refCount.loadAcquire() == 1) |
| return; |
| IdentifierHashData *newData = new IdentifierHashData(d); |
| if (d && !d->refCount.deref()) |
| delete d; |
| d = newData; |
| } |
| |
| |
| IdentifierHashEntry *IdentifierHash::addEntry(PropertyKey identifier) |
| { |
| Q_ASSERT(identifier.isStringOrSymbol()); |
| |
| // fill up to max 50% |
| bool grow = (d->alloc <= d->size*2); |
| |
| if (grow) { |
| ++d->numBits; |
| int newAlloc = qPrimeForNumBits(d->numBits); |
| IdentifierHashEntry *newEntries = (IdentifierHashEntry *)malloc(newAlloc * sizeof(IdentifierHashEntry)); |
| memset(newEntries, 0, newAlloc*sizeof(IdentifierHashEntry)); |
| for (int i = 0; i < d->alloc; ++i) { |
| const IdentifierHashEntry &e = d->entries[i]; |
| if (!e.identifier.isValid()) |
| continue; |
| uint idx = e.identifier.id() % newAlloc; |
| while (newEntries[idx].identifier.isValid()) { |
| ++idx; |
| idx %= newAlloc; |
| } |
| newEntries[idx] = e; |
| } |
| free(d->entries); |
| d->entries = newEntries; |
| d->alloc = newAlloc; |
| } |
| |
| uint idx = identifier.id() % d->alloc; |
| while (d->entries[idx].identifier.isValid()) { |
| Q_ASSERT(d->entries[idx].identifier != identifier); |
| ++idx; |
| idx %= d->alloc; |
| } |
| d->entries[idx].identifier = identifier; |
| ++d->size; |
| return d->entries + idx; |
| } |
| |
| const IdentifierHashEntry *IdentifierHash::lookup(PropertyKey identifier) const |
| { |
| if (!d || !identifier.isStringOrSymbol()) |
| return nullptr; |
| Q_ASSERT(d->entries); |
| |
| uint idx = identifier.id() % d->alloc; |
| while (1) { |
| if (!d->entries[idx].identifier.isValid()) |
| return nullptr; |
| if (d->entries[idx].identifier == identifier) |
| return d->entries + idx; |
| ++idx; |
| idx %= d->alloc; |
| } |
| } |
| |
| const IdentifierHashEntry *IdentifierHash::lookup(const QString &str) const |
| { |
| if (!d) |
| return nullptr; |
| |
| PropertyKey id = d->identifierTable->asPropertyKey(str); |
| return lookup(id); |
| } |
| |
| const IdentifierHashEntry *IdentifierHash::lookup(String *str) const |
| { |
| if (!d) |
| return nullptr; |
| PropertyKey id = d->identifierTable->asPropertyKey(str); |
| if (id.isValid()) |
| return lookup(id); |
| return lookup(str->toQString()); |
| } |
| |
| const PropertyKey IdentifierHash::toIdentifier(const QString &str) const |
| { |
| Q_ASSERT(d); |
| return d->identifierTable->asPropertyKey(str); |
| } |
| |
| const PropertyKey IdentifierHash::toIdentifier(Heap::String *str) const |
| { |
| Q_ASSERT(d); |
| return d->identifierTable->asPropertyKey(str); |
| } |
| |
| QString QV4::IdentifierHash::findId(int value) const |
| { |
| IdentifierHashEntry *e = d->entries; |
| IdentifierHashEntry *end = e + d->alloc; |
| while (e < end) { |
| if (e->identifier.isValid() && e->value == value) |
| return e->identifier.toQString(); |
| ++e; |
| } |
| return QString(); |
| } |
| |
| void IdentifierHashData::markObjects(MarkStack *markStack) const |
| { |
| IdentifierHashEntry *e = entries; |
| IdentifierHashEntry *end = e + alloc; |
| while (e < end) { |
| if (Heap::Base *o = e->identifier.asStringOrSymbol()) |
| o->mark(markStack); |
| ++e; |
| } |
| } |
| |
| |
| } |
| |
| QT_END_NAMESPACE |