Re: GC mark stack

[Stefan Monnier]

Lynn Winebarger [2022-06-26 11:31:43] wrote:
> I was reviewing alloc.c in the 28.1 source, and noted that it uses a
> semi-naive computation of the transitive closure of the graph of live
> data structures (weak hash tables is where I see it).
> Since the fix to https://debbugs.gnu.org/cgi/bugreport.cgi?bug=54698
> (commit 7a8798de95a57c8ff85f070075e0a0176b458578) moved to using an
> explicit stack, I was curious if you'd considered using a variant of
> Tarjan's SCC algorithm, such as the one described in
> http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.40.9019&rep=rep1&type=pdf

I must admit that I don't understand what you're referring to.
And seeing the lack of response by other people, I suspect I'm not alone.

Are you talking about the code in `mark_and_sweep_weak_table_contents`?
Maybe the `do .. while` loop?


        Stefan