github/qBittorrent
1
0
Fork 0
mirror of https://github.com/qbittorrent/qBittorrent synced 2025-08-20 21:33:27 -07:00
Code Issues Projects Releases Packages Wiki Activity Actions 3

Improve resume queue load performance

Browse source
This commit is contained in:
Leon Blakey 2025-06-07 10:08:30 -07:00
commit 58a87138cc
1 changed files with 12 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

15
src/base/bittorrent/bencoderesumedatastorage.cpp
View file

@ -189,8 +189,14 @@ void BitTorrent::BencodeResumeDataStorage::loadQueue(const Path &queueFilename)
return;
}
QHash<TorrentID, qsizetype> registeredTorrentsIndexes;
registeredTorrentsIndexes.reserve(m_registeredTorrents.length());
qsizetype i = 0;
for (const TorrentID &torrentID : asConst(m_registeredTorrents))
registeredTorrentsIndexes.insert(torrentID, i++);
const QRegularExpression hashPattern {u"^([A-Fa-f0-9]{40})$"_s};
int start = 0;
qsizetype start = 0;
while (true)
{
const auto line = QString::fromLatin1(queueFile.readLine(lineMaxLength).trimmed());
@ -201,10 +207,13 @@ void BitTorrent::BencodeResumeDataStorage::loadQueue(const Path &queueFilename)
if (rxMatch.hasMatch())
{
const auto torrentID = BitTorrent::TorrentID::fromString(rxMatch.captured(1));
const int pos = m_registeredTorrents.indexOf(torrentID, start);
const qsizetype pos = registeredTorrentsIndexes.value(torrentID, -1);
if (pos != -1)
{
std::swap(m_registeredTorrents[start], m_registeredTorrents[pos]);
if (start != pos) {
std::swap(m_registeredTorrents[start], m_registeredTorrents[pos]);
registeredTorrentsIndexes.insert(torrentID, start);
}
++start;
}
}