# SCM Repository

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

Parent Directory | Revision Log

Revision

File size: 710 byte(s)

**430**- (**download**) (**as text**) (**annotate**)*Wed Sep 8 09:47:00 1999 UTC*(20 years, 11 months ago) by*monnier*File size: 710 byte(s)

This commit was generated by cvs2svn to compensate for changes in r429, which included commits to RCS files with non-trunk default branches.

(* * 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 * } * -- Allen *) 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 -> (int list * int list) Array.array, ipostdefuse : unit -> (int list * int list) Array.array } end

root@smlnj-gforge.cs.uchicago.edu | ViewVC Help |

Powered by ViewVC 1.0.0 |