Home My Page Projects Code Snippets Project Openings SML/NJ
Summary Activity Forums Tracker Lists Tasks Docs Surveys News SCM Files

SCM Repository

[smlnj] View of /sml/trunk/src/MLRISC/ir-archive/derived-graph.sig
ViewVC logotype

View of /sml/trunk/src/MLRISC/ir-archive/derived-graph.sig

Parent Directory Parent Directory | Revision Log Revision Log

Revision 912 - (download) (as text) (annotate)
Fri Aug 24 18:12:36 2001 UTC (18 years, 2 months ago) by george
File size: 556 byte(s)
Initial revision
 * Compute Tarjan's dominator derived graph from a dominator tree.
 * This is used partly to computing path expressions.  Alternatively,
 * it can also be used for testing for reducibility.  In particular,
 * cycles involving more than one node represent irreducible loops
 * in the flow graph.
 * -- Allen

signature DERIVED_GRAPH =
   structure Dom : DOMINATOR_TREE
   type ('n,'e) derived_graph = ('n,'e Graph.edge,unit) Graph.graph

   val derived_graph :   (* O(n+e) *)
        ('n,'e,'g) Dom.dominator_tree -> ('n,'e) derived_graph

ViewVC Help
Powered by ViewVC 1.0.0