>>>>> "DS" == Dan Sugalski <[EMAIL PROTECTED]> writes:
DS> We're going to use a copying collector. When the string gets
DS> copied as part of a compaction run things'll get cleaned up
DS> appropriately. (Not that there's really any cleanup to do in that
DS> case) Granted the destination string buffer will only be as big as
DS> the source buffer 'really' is (which is to say the amount of
DS> memory actually in the string plus the extra bit at the end, if
DS> there is any) but that's fine.
ok. i didn't realize the GC design was that far along. IIRC copying
collectors need to have double the used space at all times to make a
copy. is that ram tradeoff for speed? again IIRC copying is much simpler
than mark/sweep but the ram does cost.
DS> Nah, with a copying collector it's actually a little easier. The fewer
DS> fields that need checking the faster things are.
but you do have to copy and update all the active links. is this GC only
for the data buffers and PMC's are in their own space? then you only
have to copy the buffer and update 1 pointer in each PMC. that works for
me.
uri
--
Uri Guttman --------- [EMAIL PROTECTED] ---------- http://www.sysarch.com
SYStems ARCHitecture and Stem Development ------ http://www.stemsystems.com
Learn Advanced Object Oriented Perl from Damian Conway - Boston, July 10-11
Class and Registration info: http://www.sysarch.com/perl/OOP_class.html
