Collecting more frequently

[Jeffrey A Law]

  In message < 200003172349.PAA24733@kankakee.wrs.com >you write:
  > If your adventuresome, then a scheme that finds out how close the
  > machine is to paging, and then collecting on demand might be the most
  > optimal scheme, but this is far from portable and does introduce some
  > non-repeatability into the compiler that some us us would hate to see
  > go.
I briefly pondered the idea of trying to malloc a large hunk of memory
in the collector (say a few meg) and if that failed to force a collector
run and force the collector to free any pages it's got cached.

The idea was to help boxes with a limited amount of virtual memory which
do not have a usable mmap such as the m68k boxes I occasionally test on.

jeff