diff options
| author | Mårten Nordheim <marten.nordheim@qt.io> | 2021-08-30 21:54:27 +0200 |
|---|---|---|
| committer | Mårten Nordheim <marten.nordheim@qt.io> | 2021-08-31 17:54:30 +0200 |
| commit | 5ad75eda0c59fa9dbbcb15ccf466ae9683ca8c0e (patch) | |
| tree | c2f122aeb235b27d6832a56dee6adb0df70d7e10 /src | |
| parent | 586d9e6013de94e5affd0ea6b079799cce069f2d (diff) | |
QNetworkAccessCache: Another fix to the linked list insertion
When inserting between two nodes the "previous" node's "newer" was
forgotten and not updated. So every node's "newer" would point to the
"newest" node.
Change-Id: I5b0df8812be5f7f62b3ae363e4c78f582e0e5c43
Reviewed-by: Edward Welbourne <edward.welbourne@qt.io>
Diffstat (limited to 'src')
| -rw-r--r-- | src/network/access/qnetworkaccesscache.cpp | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/src/network/access/qnetworkaccesscache.cpp b/src/network/access/qnetworkaccesscache.cpp index 4c37212b97..56d1b3b914 100644 --- a/src/network/access/qnetworkaccesscache.cpp +++ b/src/network/access/qnetworkaccesscache.cpp @@ -173,6 +173,8 @@ void QNetworkAccessCache::linkEntry(const QByteArray &key) current = current->older; } node->older = current->older; + if (node->older) + node->older->newer = node; node->newer = current; current->older = node; if (node->older == nullptr) { |