Flow analysis and optimization with computed gotos

[Brad Lucier <lucier at math dot purdue dot edu>]

Michael:

I fear that some of what I wrote last night might be nonsense; it's no
longer clear to me that the techniques implemented in flow.c work in the
presence of multiple computed gotos in a rooutine, and that techniques
appropriate for interprocedural PRE will be needed.  (I believe that
computed gotos can be handled the same as function returns, so perhaps the same
analysis techniques will be needed.)

The reference given in Muchnick (can't find Morgan's book in this town)
for interprocedural PRE is

E. Morel and C. Renvoise, Interprocedural Elimination of
Partial Redundancies, in {\it Program Flow Analysis: Theory and
Applications,} S. S. Muchnick and N. D. Jones, eds., Prentice-Hall,
Englewood Cliffs, NJ, 1981, pp. 160--188.

The Purdue library doesn't have this book, either (arggh), but Google
pointed out the paper:

http://citeseer.nj.nec.com/323051.html

which has the following interesting reference in the appendix:

[10] D.M. Dhamdhere and H. Patil. An elimination algorithm for bidirectional
data ow problems using edge placement. ACM Transactions on Programming
Languages and Systems, 15(2):312{336, April 1993.

and there are many other references (search for "Interprocedural Elimination
of Partial Redundancies").

Brad