diff options
| author | Ulf Hermann <ulf.hermann@qt.io> | 2024-01-18 10:04:17 +0100 |
|---|---|---|
| committer | Ulf Hermann <ulf.hermann@qt.io> | 2024-01-20 20:27:46 +0000 |
| commit | af212e5e4edb73978298cd030b15deb8d8c28183 (patch) | |
| tree | 833bd40ec63e46aae6a5beca38eb90f1387a9679 /src/qmlcompiler/qqmljsbasicblocks.cpp | |
| parent | 59b0b59090e2ff3f04bd15120720ee6a5b0c3f4b (diff) | |
QmlCompiler: Use a hash set for the list of conversions
There can be a lot of them and we don't want quadratic behavior. It might be possible to further improve on this using e.g. sorted lists
and algorithms provided by the STL. However, such an implementation
would be more complicated and would require weighing several trade-offs.
Pick-to: 6.7 6.6 6.5
Fixes: QTBUG-121139
Change-Id: I717b49bd4af97abcaae9ae78d1e1b31d5d462952
Reviewed-by: Fabian Kosmale <fabian.kosmale@qt.io>
Reviewed-by: Marc Mutz <marc.mutz@qt.io>
Diffstat (limited to 'src/qmlcompiler/qqmljsbasicblocks.cpp')
| -rw-r--r-- | src/qmlcompiler/qqmljsbasicblocks.cpp | 38 |
1 files changed, 21 insertions, 17 deletions
diff --git a/src/qmlcompiler/qqmljsbasicblocks.cpp b/src/qmlcompiler/qqmljsbasicblocks.cpp index 0aedcbbd3c..67d331e9ff 100644 --- a/src/qmlcompiler/qqmljsbasicblocks.cpp +++ b/src/qmlcompiler/qqmljsbasicblocks.cpp @@ -311,16 +311,6 @@ static bool containsAny(const ContainerA &container, const ContainerB &elements) return false; } -template<typename ContainerA, typename ContainerB> -static bool containsAll(const ContainerA &container, const ContainerB &elements) -{ - for (const auto &element : elements) { - if (!container.contains(element)) - return false; - } - return true; -} - template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>> class NewFlatMap @@ -347,7 +337,7 @@ private: struct PendingBlock { - QList<int> conversions; + QQmlJSBasicBlocks::Conversions conversions; int start = -1; bool registerActive = false; }; @@ -434,7 +424,7 @@ void QQmlJSBasicBlocks::populateReaderLocations() auto nextBlock = m_basicBlocks.find(block.start); auto currentBlock = nextBlock++; bool registerActive = block.registerActive; - QList<int> conversions = block.conversions; + Conversions conversions = block.conversions; const auto blockEnd = (nextBlock == m_basicBlocks.end()) ? m_annotations.end() @@ -446,7 +436,7 @@ void QQmlJSBasicBlocks::populateReaderLocations() for (; blockInstr != blockEnd; ++blockInstr) { if (registerActive && blockInstr->second.typeConversions.contains(writtenRegister)) { - conversions.append(blockInstr.key()); + conversions.insert(blockInstr.key()); } for (auto readIt = blockInstr->second.readRegisters.constBegin(), @@ -473,12 +463,26 @@ void QQmlJSBasicBlocks::populateReaderLocations() // If we find that an already processed block has the register activated by this jump, // we need to re-evaluate it. We also need to propagate any newly found conversions. const auto processed = processedBlocks.find(blockStart); - if (processed == processedBlocks.end()) + if (processed == processedBlocks.end()) { blocks.append({conversions, blockStart, registerActive}); - else if (registerActive && !processed->registerActive) + } else if (registerActive && !processed->registerActive) { blocks.append({conversions, blockStart, registerActive}); - else if (!containsAll(processed->conversions, conversions)) - blocks.append({processed->conversions + conversions, blockStart, registerActive}); + } else { + + // TODO: Use unite() once it is fixed. + // We don't use unite() here since it would be more expensive. unite() + // effectively loops on only insert() and insert() does a number of checks + // each time. We trade those checks for calculating the hash twice on each + // iteration. Calculating the hash is very cheap for integers. + Conversions merged = processed->conversions; + for (const int conversion : std::as_const(conversions)) { + if (!merged.contains(conversion)) + merged.insert(conversion); + } + + if (merged.size() > processed->conversions.size()) + blocks.append({std::move(merged), blockStart, registerActive}); + } }; if (!currentBlock->second.jumpIsUnconditional && nextBlock != m_basicBlocks.end()) |