type t
= PathCountTransferFunctions(Absint.ProcCfg.Normal).CFG.t
type instrs_dir
= PathCountTransferFunctions(Absint.ProcCfg.Normal).CFG.instrs_dir
module Node : sig ... end
val instrs : Node.t -> instrs_dir IR.Instrs.t
val fold_succs : t -> (Node.t, Node.t, 'accum) IStdlib.IStd.Container.fold
val fold_preds : t -> (Node.t, Node.t, 'accum) IStdlib.IStd.Container.fold
val fold_normal_succs : t -> (Node.t, Node.t, 'accum) IStdlib.IStd.Container.fold
val fold_normal_preds : t -> (Node.t, Node.t, 'accum) IStdlib.IStd.Container.fold
val fold_exceptional_succs : t -> (Node.t, Node.t, 'accum) IStdlib.IStd.Container.fold
val fold_exceptional_preds : t -> (Node.t, Node.t, 'accum) IStdlib.IStd.Container.fold
val start_node : t -> Node.t
val exit_node : t -> Node.t
val proc_desc : t -> IR.Procdesc.t
val fold_nodes : (t, Node.t, 'accum) IStdlib.IStd.Container.fold
val from_pdesc : IR.Procdesc.t -> t
val is_loop_head : IR.Procdesc.t -> Node.t -> bool
val wto : t -> Node.t IR.WeakTopologicalOrder.Partition.t