|use-def chains firstname.lastname@example.org (Preston Briggs) (1989-09-18)|
|Re: use-def chains email@example.com (Ralph Johnson) (1989-09-20)|
|Re: use-def chains firstname.lastname@example.org (Preston Briggs) (1989-09-25)|
|Date:||Mon, 18 Sep 89 19:51:22 CDT|
|From:||Preston Briggs <email@example.com>|
I'm curious about how many people actually build
use-def chains for optimization.
(That is, for each variable reference, a list of all the instructions
that might have set the variable. Alternatively, def-use chains
link a definition with all the uses.)
They are mentioned often in the literature, but seem expensive in
time and space to build. On the other hand, Wegman and Zadeck (and
others) have been playing with a form called Static Single Assignment
(SSA) which seems reasonably space efficient. They also have methods
to construct the form quickly, at least for reducible flow graphs.
So, any experience out there? I'm especially interested in
space-efficient representations (think BIG fortran routines), so
ideas for compact representation are welcome too.
Return to the
Search the comp.compilers archives again.