Re: Eager garbage collection

[Andrea Corallo]

Eli Zaretskii <eliz@gnu.org> writes:

>> Cc: emacs-devel@gnu.org
>> Date: Wed, 18 Nov 2020 08:02:17 +0000
>> From: Andrea Corallo via "Emacs development discussions." 
>> <emacs-devel@gnu.org>
>> 
>> My question is, what is the advantage of this implementation respect the
>> pure Lisp one we have?
>> 
>> <https://gitlab.com/koral/gcmh/-/blob/master/gcmh.el>
>> 
>> AFAIU they achieve the same.  If that's the case I indeed prefer the
>> Lisp one as simpler and easier to extend.
>
> AFAICT, the basic idea is very different, so the results will probably
> also be different.

My understanding is that they both:

  - Run the normal GC with a threshold X1
  - Run after an idle time t GC with threshold X2, where X2 < X1

This patch compute X2 in terms of X1 using
`gc-opportunistic-eager-factor' while in gcmh one specify
`gcmh-low-cons-threshold' and `gcmh-high-cons-threshold' but
conceptually looks the same to me.

Am I wrong?

  Andrea