Re: Post-Dominators & Lengauer/Targan Algorithm

Rodrigo Augusto Barbato Ferreira <rodrigo.ferreira@dcc.unicamp.br>
wrote:


> How to compute the postdominance relation using the Lengauer/Tarjan
> algorithm for control flow graphs that have no exit. Since a canonical
> exit cannot be created for a no exit control flow graph, is there an
> alternative to do the reverse depth first ordering of it?


    I believe that you can simply add an exit block to the loop.
This is the same as a loop like


      while (loop_cond) {
          .. looop statements
      }


where loop_cond is never false.


    My favorite reference on control flow graph and SSA construction
is Robert Morgan's book "Building an Optimizing Compiler". If
you have not seen this book, I recommend ordering a copy from
fatbrain.com:


http://net.gurus.com/bk/fa/155558179X


    Ian Kaplan

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