Module UnitTests__SchedulerTests.MockProcCfg

module Node = MockNode
type t = (Node.t * Node.t list) list
type instrs_dir = IR.Instrs.not_reversed
val instrs : 'a -> 'b IR.Instrs.t
val equal_id : IStdlib.IStd.Int.t -> IStdlib.IStd.Int.t -> bool
val fold_succs : (IStdlib.IStd.Int.t * 'a list) list -> IStdlib.IStd.Int.t -> init:'b -> f:('b -> 'a -> 'b) -> 'b
val fold_preds : ('a * IStdlib.IStd.Int.t list) list -> IStdlib.IStd.Int.t -> init:'b -> f:('b -> 'a -> 'b) -> 'b
val fold_nodes : ('a * 'b) list -> init:'c -> f:('c -> 'a -> 'c) -> 'c
val fold_normal_succs : (IStdlib.IStd.Int.t * 'a list) list -> IStdlib.IStd.Int.t -> init:'b -> f:('b -> 'a -> 'b) -> 'b
val fold_normal_preds : ('a * IStdlib.IStd.Int.t list) list -> IStdlib.IStd.Int.t -> init:'b -> f:('b -> 'a -> 'b) -> 'b
val fold_exceptional_succs : 'a -> 'b -> init:'c -> f:'d -> 'c
val fold_exceptional_preds : 'a -> 'b -> init:'c -> f:'d -> 'c
val from_adjacency_list : 'a -> 'a
val start_node : 'a -> int
val exit_node : 'a -> 'b
val proc_desc : 'a -> 'b
val from_pdesc : 'a -> 'b
val is_loop_head : 'a -> 'b
module WTO : sig ... end
val wto : WTO.CFG.t -> WTO.CFG.Node.t IR__WeakTopologicalOrder.Partition.t