[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: CFG

You can get a list of the entry/exit points by calling
getHeads()/getTails(), respectively, on the UnitGraph. We don't create a
single dummy start node that would have all the heads as successors,
or a single dummy end node that would have all the tails as
predecessors. If you need such nodes, I imagine it wouldn't be too hard
to add them to a UnitGraph yourself, after Soot has computed one.

Ondrej

On Thu, Mar 13, 2003 at 11:06:55AM +0100, Christian Hammer wrote:
> Hi!
> 
> I was wondering why there are no explicit entry and exit nodes in Soot's
> CFG implementations (UnitGraph).
> Usually those are inserted. For the computation of dominator trees and
> especially postdominator trees they are necessary to get a single tree.
> For that purpose usually there is an edge from the entry directly to the
> exit node.
> 
> Greetings,
> 
> --
> Christian Hammer
> E-Mail: mailto:hammer@fmi.uni-passau.de
> WWW: http://www.infosun.fmi.uni-passau.de/st/staff/hammer/
> PGP-Key: http://wwwkeys.de.pgp.net:11371/pks/lookup?search=0x969E653E
> 
>