[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Proposal: block-based vector allocator

From: Dmitry Antipov
Subject: Re: Proposal: block-based vector allocator
Date: Thu, 08 Dec 2011 12:50:27 +0400
User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:8.0) Gecko/20111115 Thunderbird/8.0

On 12/07/2011 08:30 PM, Stefan Monnier wrote:

I'm not convinced your result is because your code does better than
malloc.  Instead I expect it's because it avoids the mem_node overhead.
Recompiling and trying again without conservative stack scanning should
factor out this effect.

Without conservative stack scanning, it works at least not worse
(I believe we should ignore the differences less than, say, 0.5%).
But, as I have said, there are further improvements possible.

You can't do compaction without changing the Lisp_Vector's layout
(adding an indirection, as is done for Lisp_Strings).

I know, and I'm just saying that my proposal contains nothing which
makes compaction impossible or too tricky.

I thought we agreed that GC performance is not a concern here.
Of course, every change to the layout can impact the performance of the
GC.  Have you measured the impact of your code on GC performance?

Not yet. But will do it, of course.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]