Re: MPS: weak hash tables

[Eli Zaretskii]

> From: Gerd Möllmann <gerd.moellmann@gmail.com>
> Cc: eller.helmut@gmail.com,  pipcet@protonmail.com,  emacs-devel@gnu.org
> Date: Sat, 06 Jul 2024 14:43:43 +0200
> 
> >> We allocate bignums in igc. Every N bignum allocations, take some time to
> >> process messages and thus finalize them. I have no idea what a good N
> >> would be thpugh. We could try with 1000 and 0.1s, maybe.
> >> 
> >> This also assumes that only bignums are allocated frequently plus must
> >> be finalized. Don't know if that's true.
> >
> > maybe_gc is already called from places which tend to allocate Lisp
> > objects, so I'd go with that.
> 
> Right, but I have no good idea how often to call the message handling in
> this case. How often is maybe_gc called, and every how many calls would
> we then process messages.

maybe_gc is called from eval.c, where the Lisp evaluation happens.  It
is also called when we detect that we are idle (see keyboard.c).

> So, I've done the other thing first. Maybe we
> get away wtih that, and that code at least has an idea if handling
> messages might be necessary, or more often than usual.

I'm surprised that we need to invent solutions for issues that we
already have figured out, instead of simply reusing the wisdom we
already have.