From 5ad75eda0c59fa9dbbcb15ccf466ae9683ca8c0e Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?M=C3=A5rten=20Nordheim?= <marten.nordheim@qt.io>
Date: Mon, 30 Aug 2021 21:54:27 +0200
Subject: [PATCH] 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>
---
 src/network/access/qnetworkaccesscache.cpp | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/src/network/access/qnetworkaccesscache.cpp b/src/network/access/qnetworkaccesscache.cpp
index 4c37212b97a..56d1b3b914b 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) {