From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,b307bd75c8071241
X-Google-Attributes: gid103376,public
From: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: newbie Q: storage management
Date: 1997/05/13
Message-ID: <dewar.863525952@merv>#1/1
X-Deja-AN: 241280661
References: <JSA.97May7210852@alexandria> <dewar.863177132@merv>
 	<E9xK3L.Cw2@world.std.com> <5l1sva$a8g@mulga.cs.mu.OZ.AU>
 <JSA.97May12185254@alexandria>
Organization: New York University
Newsgroups: comp.lang.ada
Date: 1997-05-13T00:00:00+00:00
List-Id: <comp.lang.ada>


Jon says

<<> Hans Boehm's GC is indeed freely available and it does indeed work fine
> with gcc.

Yup.>>


Does the Yup here mean you have used it and it works fine and is actually
helpful? Or just that you think it should work. Geert Bosch has done quite
a bit of work with this GC (you may remember his concerns about the use
of virtual origins, which, though they increase efficiency generally,
completely derail a conservative GC), and concludes that it is not so
useful in an Ada environment (Geert, care to expand)

Note that conservative GC is not that conservative, it is not guaranteed
to work in an arbitrary environment. The point about virtual origins in
arrays is a useful reminder of this.