Module BTL_Liveness

module BTL_Liveness: sig .. end

val transfer : BTL.iblock_info Maps.PTree.tree ->
       bool Stdlib.ref ->
       BinNums.positive -> Registers.Regset.t -> Registers.Regset.t

module RegsetLat: Lattice.LFSet(Registers.Regset)

module DS: Kildall.Backward_Dataflow_Solver(RegsetLat)(Kildall.NodeSetBackward)

val analyze_liveness_btl : BTL.iblock_info Maps.PTree.t -> Registers.Regset.t Maps.PTree.tree * bool

val get_outputs : Registers.Regset.t Maps.PTree.tree ->
       'a -> BinNums.positive list -> Registers.Regset.t

val apply_liveness_info : Registers.Regset.t Maps.PTree.tree ->
       BinNums.positive -> BTL.iblock_info -> unit

val update_liveness_btl : BTL.iblock_info Maps.PTree.t -> bool

val compute_liveins : 'a -> BTL.iblock_info -> BTL.iblock_info Maps.PTree.tree -> unit

val get_liveins : BTL.iblock -> Registers.Regset.t

val btl_simple_dead_code_elimination : BTL.iblock_info Maps.PTree.t -> BTL.iblock_info Maps.PTree.t