|Post-dominance relation in CFGs with no exit email@example.com (Dmitry Shaporenkov) (2001-03-26)|
|Re: Post-dominance relation in CFGs with no exit firstname.lastname@example.org (Bob Morgan) (2001-03-27)|
|From:||Bob Morgan <email@example.com>|
|Date:||27 Mar 2001 23:26:38 -0500|
|Organization:||Posted via Supernews, http://www.supernews.com|
|Posted-Date:||27 Mar 2001 23:26:38 EST|
On 26 Mar 2001 13:50:36 -0500, Dmitry Shaporenkov
> Does anybody know the proper way to
> apply algorithms for computation of post-dominators
> to flowgraphs without exit node? Obviously, it is necessary to
> augment CFG with the fake exit node, but how to determine what
> nodes of CFG connect with it?
The more general problem is the case where there is an exit node and
there are nodes which have no path to the exit node. When there is no
exit node create one. Now perform a depth first search on the reverse
of the flow graph (handling successors as predecessors and vice
versa). Any node that is not reached by the depth first search has no
path to the exit node.
Now perform a normal depth first search on the normal flow graph.
Visiting the nodes in post-order. Connect any node with no path to
the exit to an exit node with a fake edge, unless one of the
descendents of the node (in the normal depth first search) has already
been connected by a fake edge.
This should insure that every node has a path from entry to exit
without introducing too many new fake edges.
Return to the
Search the comp.compilers archives again.