aboutsummaryrefslogtreecommitdiffstats
path: root/src/qml/jsruntime/qv4identifierhash.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/qml/jsruntime/qv4identifierhash.cpp')
-rw-r--r--src/qml/jsruntime/qv4identifierhash.cpp190
1 files changed, 190 insertions, 0 deletions
diff --git a/src/qml/jsruntime/qv4identifierhash.cpp b/src/qml/jsruntime/qv4identifierhash.cpp
new file mode 100644
index 0000000000..48df2283f0
--- /dev/null
+++ b/src/qml/jsruntime/qv4identifierhash.cpp
@@ -0,0 +1,190 @@
+// Copyright (C) 2016 The Qt Company Ltd.
+// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
+
+#include <private/qv4identifierhash_p.h>
+#include <private/qv4identifiertable_p.h>
+#include <private/qv4string_p.h>
+#include <private/qv4identifierhashdata_p.h>
+#include <private/qprimefornumbits_p.h>
+
+QT_BEGIN_NAMESPACE
+
+namespace QV4 {
+
+IdentifierHash::IdentifierHash(ExecutionEngine *engine)
+{
+ d = new IdentifierHashData(engine->identifierTable, 3);
+ Q_ASSERT(!isEmpty());
+}
+
+void IdentifierHash::detach()
+{
+ if (!d || d->refCount.loadAcquire() == 1)
+ return;
+ IdentifierHashData *newData = new IdentifierHashData(d);
+ if (d && !d->refCount.deref())
+ delete d;
+ d = newData;
+}
+
+inline
+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;
+}
+
+inline
+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;
+ }
+}
+
+inline
+const IdentifierHashEntry *IdentifierHash::lookup(const QString &str) const
+{
+ if (!d)
+ return nullptr;
+
+ PropertyKey id = d->identifierTable->asPropertyKey(str, IdentifierTable::ForceConversionToId);
+ return lookup(id);
+}
+
+inline
+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());
+}
+
+inline
+const PropertyKey IdentifierHash::toIdentifier(const QString &str) const
+{
+ Q_ASSERT(d);
+ return d->identifierTable->asPropertyKey(str, IdentifierTable::ForceConversionToId);
+}
+
+inline
+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();
+}
+
+QV4::IdentifierHash::IdentifierHash(const IdentifierHash &other)
+{
+ d = other.d;
+ if (d)
+ d->refCount.ref();
+}
+
+QV4::IdentifierHash::~IdentifierHash()
+{
+ if (d && !d->refCount.deref())
+ delete d;
+}
+
+IdentifierHash &QV4::IdentifierHash::operator=(const IdentifierHash &other)
+{
+ if (other.d)
+ other.d->refCount.ref();
+ if (d && !d->refCount.deref())
+ delete d;
+ d = other.d;
+ return *this;
+}
+
+int QV4::IdentifierHash::count() const
+{
+ return d ? d->size : 0;
+}
+
+void QV4::IdentifierHash::add(const QString &str, int value)
+{
+ IdentifierHashEntry *e = addEntry(toIdentifier(str));
+ e->value = value;
+}
+
+void QV4::IdentifierHash::add(Heap::String *str, int value)
+{
+ IdentifierHashEntry *e = addEntry(toIdentifier(str));
+ e->value = value;
+}
+
+int QV4::IdentifierHash::value(const QString &str) const
+{
+ const IdentifierHashEntry *e = lookup(str);
+ return e ? e->value : -1;
+}
+
+int QV4::IdentifierHash::value(String *str) const
+{
+ const IdentifierHashEntry *e = lookup(str);
+ return e ? e->value : -1;
+}
+
+
+}
+
+QT_END_NAMESPACE