On Tue, Jan 28, 2025 at 08:50:41AM +0100, Florian Weimer wrote:
* André Almeida:
As requested by Peter at [1], this patchset drops the
ROBUST_LIST_LIMIT. This is achieve by simply rewriting the processed
list element ->next to point to the head->list address, destroying the
linked list to avoid any circular list.
Well, I suggested we do this for a new robust list.
Furthermore, I'm not entirely sure
if this is entirely backwards-compatible.
I share Florian's concern about backward compat here. It might work, it
might not.
I was just saying that if we're going to be doing new robust lists, we
should try and fix all the known wrongs, and this one lets us get rid of the limit.