--- Comment #118 from Walter Bright <> 2011-04-14 
19:34:40 PDT ---
(In reply to comment #117)
> I hope it is as you say it is, but without benchmarks it's hard to say
> anything, and this talk of state machines etc. is disconcerting.


Also, even if the compiler emits the tables necessary for more precise gc, the
gc implementation can ignore them and do it the old way. Emitting the tables
makes it possible for people to experiment with various kinds of gc strategies.

> Note that the
> current GC does a quick check for each possible pointer if it's between the 
> low
> and high address range of all GC pages - for small heaps, this weeds out most
> false pointers.

True, and it works tolerably well. To do a moving gc, however, you need more
precise information.

BTW, I just want to reiterate that a "hard" realtime constraint means your
program fails if it doesn't meet it. A "soft" constraint means the program
degrades in some way, but keeps functioning.

Configure issuemail:
------- You are receiving this mail because: -------

Reply via email to