[gclist] Boehm collector vs lazy allocation with demand paging

Charles Fiterman cef@geodesic.com
Tue, 08 Apr 1997 13:27:02 -0500

>This currently doesn't work well in conjunction with dynamic library
>support on some systems (win32 and Irix, mostly) on which dynamic
>library data areas are found by enumerating address mappings.  I'm
>planning on fixing this for Irix, but I haven't had the time.
>I don't know how to fix it for win32.  There should also be a generic
>mechanism to exclude areas from the default root set.  But it's not
>currently there, either.

I use

void gcDeclareLeafRoot(const char *lowAddress, const char *highAddressPlus1);

This declares all or part of a root as not having pointers. In scanning 
for roots these are taken into account.

Charles Fiterman		Geodesic Systems
414 North Orleans Suite 410	Phone 312 832 1221 x223
Chicago IL 60610-4418		FAX   312 832 1230

A computer language without garbage collection
  is like a city without garbage collection.