[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: tags in the 3 lowest bits
From: |
Stefan Monnier |
Subject: |
Re: tags in the 3 lowest bits |
Date: |
21 Nov 2003 10:32:16 -0500 |
User-agent: |
Gnus/5.09 (Gnus v5.9.0) Emacs/21.3.50 |
> OTOH, small arrays are already inefficient (because each array, no matter
> how small, is added to the memory-map (a binary tree) used for conservative
> stack marking). So maybe we should begin by changing the handling of small
> arrays (similar to what is done for strings, although I'm not quite sure
> what it would look like).
Of course, an alternative would be to switch to BoehmGC.
Dave Love has started work on this and it would be interesting to see
how it works out in practice (what kind of impact it has on memory
footprint and CPU usage).
Stefan
- tags in the 3 lowest bits, Stefan Monnier, 2003/11/19
- Re: tags in the 3 lowest bits, Kim F. Storm, 2003/11/19
- Re: tags in the 3 lowest bits, Stefan Monnier, 2003/11/20
- Re: tags in the 3 lowest bits,
Stefan Monnier <=
- Re: tags in the 3 lowest bits, Kim F. Storm, 2003/11/21
- Re: tags in the 3 lowest bits, David Kastrup, 2003/11/21
- Re: tags in the 3 lowest bits, Kim F. Storm, 2003/11/21
- Re: tags in the 3 lowest bits, Stefan Monnier, 2003/11/23