From 320a859a8a89c8dca3fc4bab79ae6eac1fcafa7a Mon Sep 17 00:00:00 2001 From: Mehdi Bouaziz Date: Tue, 30 Oct 2018 16:25:37 -0700 Subject: [PATCH] Remove some uninteresting dead code Reviewed By: jeremydubreil Differential Revision: D12840590 fbshipit-source-id: 5360b78b1 --- infer/src/biabduction/Paths.ml | 21 +-------------------- infer/src/biabduction/Paths.mli | 13 ------------- 2 files changed, 1 insertion(+), 33 deletions(-) diff --git a/infer/src/biabduction/Paths.ml b/infer/src/biabduction/Paths.ml index cdeecbeda..badae74a0 100644 --- a/infer/src/biabduction/Paths.ml +++ b/infer/src/biabduction/Paths.ml @@ -10,7 +10,6 @@ open! IStd (** Execution Paths *) -module L = Logging module F = Format (* =============== START of the Path module ===============*) @@ -36,12 +35,6 @@ module Path : sig val curr_node : t -> Procdesc.Node.t option (** return the current node of the path *) - val d : t -> unit - (** dump a path *) - - val d_stats : t -> unit - (** dump statistics of the path *) - val extend : Procdesc.Node.t -> Typ.Name.t option -> session -> t -> t (** extend a path with a new node reached from the given session, with an optional string for exceptions *) @@ -390,8 +383,6 @@ end = struct Invariant.reset_stats path - let d_stats path = L.d_str (F.asprintf "%a" pp_stats path) - module PathMap = Caml.Map.Make (struct type nonrec t = t @@ -448,8 +439,6 @@ end = struct add_delayed path ; doit 0 fmt path ; print_delayed () - let d p = L.add_print pp p - let create_loc_trace path pos_opt : Errlog.loc_trace = let trace = ref [] in let g level path _ exn_opt = @@ -554,9 +543,6 @@ module PathSet : sig val add_renamed_prop : Prop.normal Prop.t -> Path.t -> t -> t (** It's the caller's resposibility to ensure that Prop.prop_rename_primed_footprint_vars was called on the prop *) - val d : t -> unit - (** dump the pathset *) - val diff : t -> t -> t (** difference between two pathsets *) @@ -689,7 +675,7 @@ end = struct !res - let pp pe fmt ps = + let[@warning "-32"] pp pe fmt ps = let count = ref 0 in let pp_path fmt path = F.fprintf fmt "[path: %a@\n%a]" Path.pp_stats path Path.pp path in let f prop path = @@ -699,11 +685,6 @@ end = struct iter f ps - let d (ps : t) = - let pp pe fmt ps = F.fprintf fmt "%a@\n" (pp pe) ps in - L.add_print_with_pe pp ps - - (** It's the caller's resposibility to ensure that Prop.prop_rename_primed_footprint_vars was called on the list *) let from_renamed_list (pl : ('a Prop.t * Path.t) list) : t = List.fold ~f:(fun ps (p, pa) -> add_renamed_prop p pa ps) ~init:empty pl diff --git a/infer/src/biabduction/Paths.mli b/infer/src/biabduction/Paths.mli index 007dd948e..3e3bd6228 100644 --- a/infer/src/biabduction/Paths.mli +++ b/infer/src/biabduction/Paths.mli @@ -31,12 +31,6 @@ module Path : sig val curr_node : t -> Procdesc.Node.t option (** return the current node of the path *) - val d : t -> unit [@@warning "-32"] - (** dump a path *) - - val d_stats : t -> unit [@@warning "-32"] - (** dump statistics of the path *) - val extend : Procdesc.Node.t -> Typ.Name.t option -> session -> t -> t (** extend a path with a new node reached from the given session, with an optional string for exceptions *) @@ -56,10 +50,6 @@ module Path : sig val join : t -> t -> t (** join two paths *) - val pp_stats : Format.formatter -> t -> unit - [@@warning "-32"] - (** pretty print statistics of the path *) - val start : Procdesc.Node.t -> t (** create a new path with given start node *) end @@ -71,9 +61,6 @@ module PathSet : sig val add_renamed_prop : Prop.normal Prop.t -> Path.t -> t -> t (** It's the caller's resposibility to ensure that Prop.prop_rename_primed_footprint_vars was called on the prop *) - val d : t -> unit [@@warning "-32"] - (** dump the pathset *) - val diff : t -> t -> t (** difference between two pathsets *)