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-moved/idefs2.sig
ViewVC logotype

View of /sml/trunk/src/MLRISC/ir-moved/idefs2.sig

Parent Directory Parent Directory | Revision Log Revision Log


Revision 245 - (download) (as text) (annotate)
Sat Apr 17 18:47:12 1999 UTC (21 years, 3 months ago) by monnier
Original Path: sml/branches/SMLNJ/src/MLRISC/ir-moved/idefs2.sig
File size: 734 byte(s)
version 110.16
(*
 * This is Reif and Tarjan's algorithm (SIAM J Computing 1981) 
 * for computing approximate birthpoints for expressions.   
 * For each basic block B,
 *   idef(x) = { defs(v_i) | i = 1 ... n in all paths 
 *                           idom(x) v_1 v_2 ... v_n x where n >= 1 and
 *                                   v_i <> idom(x) for all 1 <= i <= n
 *             }
 *)
signature IDEFS =
sig

   type var = int

   val compute_idefs : 
       {def_use : 'n Graph.node -> var list * var list,
        cfg     : ('n,'e,'g) Graph.graph
       } ->
       { idefuse      : unit -> (RegSet.regset * RegSet.regset) Array.array,
         ipostdefuse  : unit -> (RegSet.regset * RegSet.regset) Array.array
       }

end

(*
 * $Log$
 *)

root@smlnj-gforge.cs.uchicago.edu
ViewVC Help
Powered by ViewVC 1.0.0