Re: Bitwise sweeping
Richard Brooksby <[email protected]> Tue, 11 Jan 2011 12:05:04 +0000
| Newsgroups | gmane.comp.programming.garbage-collection.general |
|---|---|
| Message-ID | <[email protected]> |
On 2011-01-10, at 00:30, Jon Harrop wrote: > Does anyone know if this is a new idea or what the closest prior art = is? Just a note that the MPS "AMS" pool class uses bit arrays in a similar = way <http://www.ravenbrook.com/project/mps/master/code/poolams.c> and = was developed in the mid 1990s. Re allocation: The MPS, in general, allocates individual objects without = a function call, but it does search for free areas using a bit table = scan. See BTFindLongResRange in = <http://www.ravenbrook.com/project/mps/master/code/bt.c>. The "AMS" pool class wasn't commercially deployed and so it isn't = particularly highly optimised.=