Re: Best Ref-counting algorithms?

"Christoffer Lernv" <lerno@dragonascendant.com> wrote in message
> On Jul 14, 8:02 pm, Hans Aberg <haberg_20080...@math.su.se> wrote:
>> Christoffer LernC6 wrote:
>> >> It depends on what resources you want to collect, and what
>> >> implementation language you are choosing.
>>
>> > I'm playing around with a ref-counting based (memory) GC for a
>> > language I have yet to construct.
>>
>> But what language are you planning use for the implementation? If you
>> choose C++, then it is hard to find the root set. Suppose you create
>> object for use in your language; then global objects and those in th
>> stack should be registered somehow for the tracing, but those on the
>> heap should not, as the are live when they can be traced from the other.
>
> I was thinking of using C for implementation, but does that matter? As
> long as I implement the language in a non GC:ed language I will have
> to take care of writing the GC myself (or for C, use the Bohm
> conservative GC).


yes.


Boehm in general seems like a good option, although I guess I don't use it
because its featureset is not exactly the same as mine, in particular,
because AFAIK it lacks per-object type-info (in my GC, pretty much every
piece of allocated memory has a type...).




> /C

Return to the comp.compilers page.
Search the comp.compilers archives again.