[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Proposal: block-based vector allocator
From: |
Paul Eggert |
Subject: |
Re: Proposal: block-based vector allocator |
Date: |
Thu, 31 May 2012 22:44:05 -0700 |
User-agent: |
Mozilla/5.0 (X11; Linux i686; rv:12.0) Gecko/20120430 Thunderbird/12.0.1 |
On 05/31/2012 10:15 PM, Dmitry Antipov wrote:
> On non-USE_LSB_TAG system, roundup_size is orthogonal to pointer
> values (roundup_size can't be less than sizeof (Lisp_Object), of course).
Ah, OK, then we can make roundup_size be the equivalent of
COMMON_MULTIPLE (sizeof (Lisp_Object), defined USE_LSB_TAG ? 8 : 1).
> For example, 32-bit system (non-wide-int, i.e. sizeof (Lisp_Object) == 4)
> without USE_LSB_TAG is expected to work with roundup_size = 4, but I can't
> test this and have no ideas why it's worth trying at all.
It would waste less memory due to internal fragmentation, which
would be a win. I don't see the downside -- perhaps you could
explain?
- Re: Proposal: block-based vector allocator, Dmitry Antipov, 2012/06/01
- Re: Proposal: block-based vector allocator,
Paul Eggert <=
- Re: Proposal: block-based vector allocator, Dmitry Antipov, 2012/06/01
- Re: Proposal: block-based vector allocator, Stefan Monnier, 2012/06/01
- Re: Proposal: block-based vector allocator, Paul Eggert, 2012/06/01
- Re: Proposal: block-based vector allocator, Eli Zaretskii, 2012/06/02
- Re: Proposal: block-based vector allocator, Paul Eggert, 2012/06/03
- Re: Proposal: block-based vector allocator, Eli Zaretskii, 2012/06/03