Infer# integration

.gitignore

@@ -52,6 +52,7 @@ duplicates.txt
 /infer/tests/build_systems/incremental_analysis_add_procedure/src
 /infer/tests/build_systems/java_test_determinator/*.test
 /infer/tests/build_systems/java_source_parser/*.test
+/infer/tests/codetoanalyze/dotnet/*/*.json
 /_release
 /infer-source
 

Makefile

@@ -190,6 +190,23 @@ BUILD_SYSTEMS_TESTS += mvn
 endif
 endif
 
+DIRECT_TESTS += \
+  dotnet_arithmetic \
+  dotnet_array \
+  dotnet_bgeble \
+  dotnet_box \
+  dotnet_fieldderef \
+  dotnet_isinst \
+  dotnet_ldstr \
+  dotnet_logical \
+  dotnet_nullderef-interproc \
+  dotnet_nullderef-simple \
+  dotnet_nullparam \
+  dotnet_numcomparison \
+  dotnet_reference \
+  dotnet_resourceleak \
+  dotnet_starg
+
 ifeq ($(BUILD_C_ANALYZERS)+$(BUILD_JAVA_ANALYZERS),yes+yes)
 BUILD_SYSTEMS_TESTS += make utf8_in_pwd waf
 endif
@@ -447,6 +464,11 @@ endef
 
 .PHONY: $(DIRECT_TESTS:%=direct_%_test)
 $(DIRECT_TESTS:%=direct_%_test): infer
+	$(QUIET)$(call silent_on_success,Extracting test data, \
+	  if [[ -d $(INFER_DIR)/tests/codetoanalyze/dotnet/$(patsubst direct_dotnet_%_test,%,$@) ]]; then \
+	    cd $(INFER_DIR)/tests/codetoanalyze/dotnet/$(patsubst direct_dotnet_%_test,%,$@)/ && \
+	  	tar xJvf $(INFER_DIR)/tests/codetoanalyze/dotnet/$(patsubst direct_dotnet_%_test,%,$@)/jsons.tar.xz; \
+	  fi)
 	$(QUIET)$(call silent_on_success,Running test: $(subst _, ,$@),\
 	$(call silence_make,\
 	$(MAKE) -C \

infer/src/IR/CSharpClassName.ml

@@ -0,0 +1,125 @@
+(*
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *)
+
+open! IStd
+module F = Format
+module L = Logging
+
+(** invariant: if [namespace = Some str] then [not (String.equal str "")]. [classname] appears first
+    so that the comparator fails earlier *)
+type t = {classname: string; namespace: string option} [@@deriving compare, equal, yojson_of]
+
+module Map = Caml.Map.Make (struct
+  type nonrec t = t [@@deriving compare]
+end)
+
+module Set = Caml.Set.Make (struct
+  type nonrec t = t [@@deriving compare]
+end)
+
+let make ~namespace ~classname =
+  match namespace with Some "" -> {namespace= None; classname} | _ -> {namespace; classname}
+
+
+let from_string str =
+  match String.rsplit2 str ~on:'.' with
+  | None ->
+      {classname= str; namespace= None}
+  | Some ("", _) ->
+      L.die InternalError "Empty namespace path in CSharp qualified classname.@."
+  | Some (pkg, classname) ->
+      {classname; namespace= Some pkg}
+
+
+let to_string = function
+  | {classname; namespace= None} ->
+      classname
+  | {classname; namespace= Some pkg} ->
+      String.concat ~sep:"." [pkg; classname]
+
+
+let pp fmt = function
+  | {classname; namespace= None} ->
+      F.pp_print_string fmt classname
+  | {classname; namespace= Some pkg} ->
+      F.fprintf fmt "%s.%s" pkg classname
+
+
+let namespace {namespace} = namespace
+
+let classname {classname} = classname
+
+let is_int s =
+  try
+    ignore (int_of_string s) ;
+    true
+  with Failure _ -> false
+
+
+let get_outer_class_name {namespace; classname} =
+  String.rsplit2 classname ~on:'$' |> Option.map ~f:(fun (outer, _) -> {namespace; classname= outer})
+
+
+(*
+ Anonymous classes have two forms:
+ - classic anonymous classes: suffixes in form of $<int>.
+ - classes corresponding to lambda-expressions: they are manifested as $Lambda$.
+ - two forms above nested inside each other.
+ Also non-anonymous (user-defined) name can be nested as well (Class$NestedClass).
+ In general case anonymous class name looks something like
+ Class$NestedClass$1$17$5$Lambda$_1_2, and we need to return Class$NestedClass *)
+let get_user_defined_class_if_anonymous_inner {namespace; classname} =
+  let is_anonymous_name = function
+    | "Lambda" ->
+        true
+    | name when is_int name ->
+        true
+    | _ ->
+        false
+  in
+  let pieces = String.split classname ~on:'$' in
+  let first_anonymous_name = List.findi pieces ~f:(fun _index name -> is_anonymous_name name) in
+  Option.bind first_anonymous_name ~f:(fun (index, _name) ->
+      (* Everything before this index did not have anonymous prefixes. Deem it user defined. *)
+      match List.take pieces index with
+      | [] ->
+          (* This is a weird situation - our class _starts_ with an anonymous name.
+             This should not happen normally, but we can not rule this out completely since there is no physical limitations on
+             the bytecode names.
+             In this case, we return [None] because formally this is not an anonymous _inner_ class, but anonymous outermost class instead.
+             TODO: redesign this API so this case is modelled directly
+          *)
+          None
+      | list ->
+          (* Assemble back all pieces together *)
+          Some {namespace; classname= String.concat ~sep:"$" list} )
+
+
+let is_anonymous_inner_class_name t = get_user_defined_class_if_anonymous_inner t |> is_some
+
+let is_external_via_config t =
+  let namespace = namespace t in
+  Option.exists ~f:Config.csharp_namespace_is_external namespace
+
+
+let pp_with_verbosity ~verbose fmt t =
+  if verbose then pp fmt t else F.pp_print_string fmt (classname t)
+
+
+module Normalizer = HashNormalizer.Make (struct
+  type nonrec t = t [@@deriving equal]
+
+  let hash = Hashtbl.hash
+
+  let normalize t =
+    let classname = HashNormalizer.StringNormalizer.normalize t.classname in
+    let namespace =
+      IOption.map_changed t.namespace ~equal:phys_equal ~f:HashNormalizer.StringNormalizer.normalize
+    in
+    if phys_equal classname t.classname && phys_equal namespace t.namespace then t
+    else {classname; namespace}
+end)

infer/src/IR/CSharpClassName.mli

@@ -0,0 +1,52 @@
+(*
+ * Copyright (c) Facebook, Inc. and its affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ *)
+
+open! IStd
+
+type t [@@deriving compare, equal, yojson_of]
+
+module Map : Caml.Map.S with type key = t
+
+module Set : Caml.Set.S with type elt = t
+
+val make : namespace:string option -> classname:string -> t
+
+val from_string : string -> t
+
+val to_string : t -> string
+(** [to_string (from_string "X.Y.Z") = "X.Y.Z"] *)
+
+val pp : Format.formatter -> t -> unit
+(** [pp] includes namespace if any *)
+
+val pp_with_verbosity : verbose:bool -> Format.formatter -> t -> unit
+(** if [verbose] then print namespace if present, otherwise only print class *)
+
+val namespace : t -> string option
+
+val classname : t -> string
+
+val is_external_via_config : t -> bool
+(** Considered external based on config flags. *)
+
+val get_outer_class_name : t -> t option
+(** If this is an inner class, return the closest outer, e.g. A$B for A$B$C. None if the class is
+    outermost *)
+
+val is_anonymous_inner_class_name : t -> bool
+(** True if it is either "classic" anonymous csharp class: *)
+
+val get_user_defined_class_if_anonymous_inner : t -> t option
+(** If the current class is anonymous ([is_anonymous_inner_class_name] is true), return the
+    corresponding user defined (not anonymous) class this anonymous class belongs to.
+
+    In general case, BOTH anonymous classes and user-defined classes can be nested:
+    SomeClass$NestedClass$1$17$5. In this example, we should return SomeClass$NestedClass.
+
+    If this is not an anonymous class, returns [None]. *)
+
+module Normalizer : HashNormalizer.S with type t = t

infer/src/IR/CapturedVar.ml

@@ -10,6 +10,8 @@ module F = Format
 
 type t = {name: Mangled.t; typ: Typ.t; capture_mode: Pvar.capture_mode} [@@deriving compare]
 
+let make ~name ~typ ~capture_mode = {name; typ; capture_mode}
+
 let pp fmt {name; typ; capture_mode} =
   F.fprintf fmt "(%a,@,%a,@,%s)" Mangled.pp name (Typ.pp_full Pp.text) typ
     (Pvar.string_of_capture_mode capture_mode)

infer/src/IR/CapturedVar.mli

@@ -10,3 +10,5 @@ open! IStd
 type t = {name: Mangled.t; typ: Typ.t; capture_mode: Pvar.capture_mode} [@@deriving compare]
 
 val pp : Format.formatter -> t -> unit
+
+val make : name:Mangled.t -> typ:Typ.t -> capture_mode:Pvar.capture_mode -> t

infer/src/IR/Fieldname.ml

@@ -44,7 +44,6 @@ let to_simplified_string fld =
            String.concat ~sep:"." [class_only; fld.field_name] )
   else fld.field_name
 
-
 let to_full_string fld =
   (if is_java fld then dot_join else cc_join) (Typ.Name.name fld.class_name) fld.field_name
 

infer/src/IR/Ident.ml

@@ -61,6 +61,8 @@ let knormal = KNormal
 
 let kprimed = KPrimed
 
+let knone = KNone
+
 let equal_kind = [%compare.equal: kind]
 
 (* timestamp for a path identifier *)

infer/src/IR/Ident.mli

@@ -61,6 +61,8 @@ val knormal : kind
 
 val kfootprint : kind
 
+val knone : kind
+
 val name_spec : name
 (** Name used for spec variables *)
 
@@ -79,6 +81,8 @@ val name_to_string : name -> string
 val get_name : t -> name
 (** Name of the identifier. *)
 
+val create_with_stamp : kind -> name -> int -> t
+
 val create : kind -> int -> t
 (** Create an identifier with default name for the given kind *)
 

infer/src/IR/Procdesc.ml

@@ -452,6 +452,20 @@ module Node = struct
     let succs = get_succs node in
     let preds = get_preds node in
     NodeKey.compute node ~simple_key ~succs ~preds
+
+
+  let print_node node =
+    let print_node_list nl = List.iter ~f:(fun n -> Printf.printf "%d " (get_id n)) nl in
+    Printf.printf "id: %d preds: " (get_id node) ;
+    print_node_list node.preds ;
+    Printf.printf "succs: " ;
+    print_node_list node.succs ;
+    Printf.printf "exn: " ;
+    print_node_list node.exn ;
+    Location.pp_line Format.std_formatter node.loc ;
+    print_endline "" ;
+    print_endline (get_description Pp.text node) ;
+    ()
 end
 
 (* =============== END of module Node =============== *)
@@ -640,7 +654,6 @@ let set_start_node pdesc node = pdesc.start_node <- node
 (** Append the locals to the list of local variables *)
 let append_locals pdesc new_locals = pdesc.attributes.locals <- pdesc.attributes.locals @ new_locals
 
-(** Set the successor nodes and exception nodes, and build predecessor links *)
 let set_succs (node : Node.t) ~normal:succs_opt ~exn:exn_opt =
   let remove_pred pred_node (from_node : Node.t) =
     from_node.preds <- List.filter from_node.preds ~f:(fun pred -> not (Node.equal pred pred_node))
@@ -882,3 +895,8 @@ let load =
         |> SqliteUtils.check_result_code db ~log:"load bind proc_uid" ;
         SqliteUtils.result_single_column_option ~finalize:false ~log:"Procdesc.load" db stmt
         |> Option.bind ~f:SQLite.deserialize )
+
+
+let print_pdesc_nodes pdesc =
+  List.iter ~f:Node.print_node pdesc.nodes ;
+  print_endline ""

infer/src/IR/Procdesc.mli

@@ -187,6 +187,8 @@ module Node : sig
   val pp_stmt : Format.formatter -> stmt_nodekind -> unit
 
   val compute_key : t -> NodeKey.t
+
+  val print_node : t -> unit
 end
 
 (** Map with node id keys. *)
@@ -351,3 +353,5 @@ val shallow_copy_code_from_pdesc : orig_pdesc:t -> dest_pdesc:t -> unit
 module SQLite : SqliteUtils.Data with type t = t option
 
 val load : Procname.t -> t option
+
+val print_pdesc_nodes : t -> unit