--- Begin Message ---
Subject: |
Quadratic complexity in sweep_markers |
Date: |
Sat, 25 Nov 2017 17:06:07 +0000 |
I've sat on this patch for way too long, and I think I previously
reported the issue, but I can't find it right now.
sweep_markers() calls unchain_marker() for every unmarked
marker. unchain_marker() walks the list of all markers in the buffer
for every one of them. This causes performance problems during GC,
since it's O(n^2) in the number of markers per buffer.
I've often noticed this dominating GC time, and in one instance
experienced a GC call that lasted for more than an hour.
At this point I think this is an actual bug, and one that severely
affects at least one user (me). Please consider fixing this.
--- End Message ---
--- Begin Message ---
Subject: |
Re: bug#24548: 25.2.50; Long GC delays with many non-detached markers (PATCH) |
Date: |
Fri, 23 Mar 2018 11:11:00 -0400 |
User-agent: |
Gnus/5.13 (Gnus v5.13) Emacs/27.0.50 (gnu/linux) |
Version: 27.1
> At least the patch below seems to work as well.
Yes, I'm sufficiently confident that I installed it into master.
Stefan
--- End Message ---