Re: Heap pointers

"Gene" <>
1 Nov 2005 00:21:57 -0500

          From comp.compilers

Related articles
Heap pointers (shrey) (2005-10-29)
Re: Heap pointers (Gene) (2005-11-01)
Re: Heap pointers (2005-11-01)
Re: Heap pointers (Hans-Peter Diettrich) (2005-11-01)
Re: Heap pointers (Dmitry A. Kazakov) (2005-11-01)
Re: Heap pointers (Robert A Duff) (2005-11-01)
| List of all articles for this month |

From: "Gene" <>
Newsgroups: comp.compilers
Date: 1 Nov 2005 00:21:57 -0500
References: 05-10-204
Keywords: GC, storage
Posted-Date: 01 Nov 2005 00:21:57 EST

For the runtime part, you might study the Boehm garbage collector,
which uses some of the techniques that John mentions.

A compile-time part is pretty standard data flow analysis, somewhat
easier than general alias analysis. (See for example the "dragon book"
Compiler Design, Aho, Sethi, and Ullman.) Essentially it's a reaching
definitions problem. If a pointer use can be reached only by
definitions of one type (stack or heap) then you can safely tag that
use. Otherwise it remains untagged, a "don't know" case.


Post a followup to this message

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