On Wed, 30 Aug 2000, Joshua N Pritikin wrote:
> On Wed, Aug 30, 2000 at 01:15:39PM -0400, [EMAIL PROTECTED] wrote:
> > I didn't realize until I read through parts of this exactly how much time a
> > refcounting GC scheme took. Between that and perl 5's penchant for
> > flattening arrays and hashes (which creates a lot of garbage itself for
> > biggish things), I wonder how much perl 5's performance could be boosted
> > with some relatively minor changes to GC & list handling.
>
> Well, for a rough estimate try:
>
> sv.h:
> #undef SvREFCNT_inc
> #define SvREFCNT_inc(sv)
> #undef SvREFCNT_dec
> #define SvREFCNT_dec(sv)
I'm not sure how exact that'll be, since we'll incur a lot of extra memory
allocation overhead, but it ought to give a good seat-of-the-pants figure.
I'll give it a shot and see what we're looking at for numbers. (Might be a
while, so if anyone else wants to try, that'll be great)
Dan
