|def-use and use-def chain... firstname.lastname@example.org (V.C. Sreedhar) (1992-07-12)|
|Re: def-use and use-def chain... email@example.com (1992-07-13)|
|Re: def-use and use-def chain... lins@Apple.COM (1992-07-13)|
|From:||firstname.lastname@example.org (Preston Briggs)|
|Organization:||Rice University, Houston|
|Date:||Mon, 13 Jul 1992 14:12:09 GMT|
V.C. Sreedhar <email@example.com> writes:
>I am developing some of the dataflow analysis in our compiler.
>Can anyone point to me an efficient way of representing
>for def-use and use-def chain? I am looking space efficient algorithms
>(bit vectors). I need to represent both du and ud chains.
Check out all the literature on static single assignment (SSA).
Efficiently Computing Static Single Assignment Form
and the Control Flow Graph
Cytron, Ferrante, Rosen, Wegman, Zadeck
TOPLAS October 1991, Volume 13(4)
Among other things, SSA is an efficient way to represent DU and UD
chains. On the other hand, a representation based on bit vectors is
going to require big space and big time to compute.
Return to the
Search the comp.compilers archives again.