|
|
|
(*
|
|
|
|
* Copyright (c) 2009 - 2013 Monoidics ltd.
|
|
|
|
* Copyright (c) 2013 - present Facebook, Inc.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This source code is licensed under the BSD style license found in the
|
|
|
|
* LICENSE file in the root directory of this source tree. An additional grant
|
|
|
|
* of patent rights can be found in the PATENTS file in the same directory.
|
|
|
|
*)
|
|
|
|
|
|
|
|
(** Symbolic Execution *)
|
|
|
|
|
|
|
|
module L = Logging
|
|
|
|
module F = Format
|
|
|
|
|
|
|
|
let rec fldlist_assoc fld = function
|
|
|
|
| [] -> raise Not_found
|
|
|
|
| (fld', x, _):: l -> if Sil.fld_equal fld fld' then x else fldlist_assoc fld l
|
|
|
|
|
|
|
|
let rec unroll_type tenv typ off =
|
|
|
|
match (typ, off) with
|
|
|
|
| Sil.Tvar _, _ ->
|
|
|
|
let typ' = Tenv.expand_type tenv typ in
|
|
|
|
unroll_type tenv typ' off
|
|
|
|
| Sil.Tstruct { Sil.instance_fields; static_fields }, Sil.Off_fld (fld, _) ->
|
|
|
|
begin
|
|
|
|
try fldlist_assoc fld (instance_fields @ static_fields)
|
|
|
|
with Not_found ->
|
|
|
|
L.d_strln ".... Invalid Field Access ....";
|
|
|
|
L.d_strln ("Fld : " ^ Ident.fieldname_to_string fld);
|
|
|
|
L.d_str "Type : "; Sil.d_typ_full typ; L.d_ln ();
|
|
|
|
raise (Exceptions.Bad_footprint __POS__)
|
|
|
|
end
|
|
|
|
| Sil.Tarray (typ', _), Sil.Off_index _ ->
|
|
|
|
typ'
|
|
|
|
| _, Sil.Off_index (Sil.Const (Sil.Cint i)) when Sil.Int.iszero i ->
|
|
|
|
typ
|
|
|
|
| _ ->
|
|
|
|
L.d_strln ".... Invalid Field Access ....";
|
|
|
|
L.d_str "Fld : "; Sil.d_offset off; L.d_ln ();
|
|
|
|
L.d_str "Type : "; Sil.d_typ_full typ; L.d_ln ();
|
|
|
|
assert false
|
|
|
|
|
|
|
|
(** Given a node, returns a list of pvar of blocks that have been nullified in the block. *)
|
|
|
|
let get_blocks_nullified node =
|
|
|
|
let null_blocks = IList.flatten(IList.map (fun i -> match i with
|
|
|
|
| Sil.Nullify(pvar, _, true) when Sil.is_block_pvar pvar -> [pvar]
|
|
|
|
| _ -> []) (Cfg.Node.get_instrs node)) in
|
|
|
|
null_blocks
|
|
|
|
|
|
|
|
(** Given a proposition and an objc block checks whether by existentially quantifying
|
|
|
|
captured variables in the block we obtain a leak. *)
|
|
|
|
let check_block_retain_cycle tenv caller_pname prop block_nullified =
|
|
|
|
let mblock = Sil.pvar_get_name block_nullified in
|
|
|
|
let block_pname = Procname.mangled_objc_block (Mangled.to_string mblock) in
|
|
|
|
let block_captured =
|
|
|
|
match AttributesTable.load_attributes block_pname with
|
|
|
|
| Some attributes ->
|
|
|
|
fst (IList.split attributes.ProcAttributes.captured)
|
|
|
|
| None ->
|
|
|
|
[] in
|
|
|
|
let prop' = Cfg.remove_seed_captured_vars_block block_captured prop in
|
|
|
|
let prop'' = Prop.prop_rename_fav_with_existentials prop' in
|
|
|
|
let _ : Prop.normal Prop.t = Abs.abstract_junk ~original_prop: prop caller_pname tenv prop'' in
|
|
|
|
()
|
|
|
|
|
|
|
|
(** Apply function [f] to the expression at position [offlist] in [strexp].
|
|
|
|
If not found, expand [strexp] and apply [f] to [None].
|
|
|
|
The routine should maintain the invariant that strexp and typ correspond to
|
|
|
|
each other exactly, without involving any re - interpretation of some type t
|
|
|
|
as the t array. The [fp_root] parameter indicates whether the kind of the
|
|
|
|
root expression of the corresponding pointsto predicate is a footprint identifier.
|
|
|
|
The function can expand a list of higher - order [hpara_psto] predicates, if
|
|
|
|
the list is stored at [offlist] in [strexp] initially. The expanded list
|
|
|
|
is returned as a part of the result. All these happen under [p], so that it
|
|
|
|
is sound to call the prover with [p]. Finally, before running this function,
|
|
|
|
the tool should run strexp_extend_value in rearrange.ml for the same strexp
|
|
|
|
and offlist, so that all the necessary extensions of strexp are done before
|
|
|
|
this function. If the tool follows this protocol, it will never hit the assert
|
|
|
|
false cases for field and array accesses. *)
|
|
|
|
let rec apply_offlist
|
|
|
|
pdesc tenv p fp_root nullify_struct (root_lexp, strexp, typ) offlist
|
|
|
|
(f: Sil.exp option -> Sil.exp) inst lookup_inst =
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let pp_error () =
|
|
|
|
L.d_strln ".... Invalid Field ....";
|
|
|
|
L.d_str "strexp : "; Sil.d_sexp strexp; L.d_ln ();
|
|
|
|
L.d_str "offlist : "; Sil.d_offset_list offlist; L.d_ln ();
|
|
|
|
L.d_str "type : "; Sil.d_typ_full typ; L.d_ln ();
|
|
|
|
L.d_str "prop : "; Prop.d_prop p; L.d_ln (); L.d_ln () in
|
|
|
|
match offlist, strexp with
|
|
|
|
| [], Sil.Eexp (e, inst_curr) ->
|
|
|
|
let inst_is_uninitialized = function
|
|
|
|
| Sil.Ialloc ->
|
|
|
|
(* java allocation initializes with default values *)
|
|
|
|
!Config.curr_language <> Config.Java
|
|
|
|
| Sil.Iinitial -> true
|
|
|
|
| _ -> false in
|
|
|
|
let is_hidden_field () =
|
|
|
|
match State.get_instr () with
|
|
|
|
| Some (Sil.Letderef (_, Sil.Lfield (_, fieldname, _), _, _)) ->
|
|
|
|
Ident.fieldname_is_hidden fieldname
|
|
|
|
| _ -> false in
|
|
|
|
let inst_new = match inst with
|
|
|
|
| Sil.Ilookup when inst_is_uninitialized inst_curr && not (is_hidden_field()) ->
|
|
|
|
(* we are in a lookup of an uninitialized value *)
|
|
|
|
lookup_inst := Some inst_curr;
|
|
|
|
let alloc_attribute_opt =
|
|
|
|
if inst_curr = Sil.Iinitial then None
|
|
|
|
else Prop.get_undef_attribute p root_lexp in
|
|
|
|
let deref_str = Localise.deref_str_uninitialized alloc_attribute_opt in
|
|
|
|
let err_desc = Errdesc.explain_memory_access deref_str p (State.get_loc ()) in
|
|
|
|
let exn = (Exceptions.Uninitialized_value (err_desc, __POS__)) in
|
|
|
|
let pre_opt = State.get_normalized_pre (Abs.abstract_no_symop pname) in
|
|
|
|
Reporting.log_warning pname ~pre: pre_opt exn;
|
|
|
|
Sil.update_inst inst_curr inst
|
|
|
|
| Sil.Ilookup -> (* a lookup does not change an inst unless it is inst_initial *)
|
|
|
|
lookup_inst := Some inst_curr;
|
|
|
|
inst_curr
|
|
|
|
| _ -> Sil.update_inst inst_curr inst in
|
|
|
|
let e' = f (Some e) in
|
|
|
|
(e', Sil.Eexp (e', inst_new), typ, None)
|
|
|
|
| [], Sil.Estruct (fesl, inst') ->
|
|
|
|
if not nullify_struct then (f None, Sil.Estruct (fesl, inst'), typ, None)
|
|
|
|
else if fp_root then (pp_error(); assert false)
|
|
|
|
else
|
|
|
|
begin
|
|
|
|
L.d_strln "WARNING: struct assignment treated as nondeterministic assignment";
|
|
|
|
(f None, Prop.create_strexp_of_type (Some tenv) Prop.Fld_init typ inst, typ, None)
|
|
|
|
end
|
|
|
|
| [], Sil.Earray _ ->
|
|
|
|
let offlist' = (Sil.Off_index Sil.exp_zero):: offlist in
|
|
|
|
apply_offlist
|
|
|
|
pdesc tenv p fp_root nullify_struct (root_lexp, strexp, typ) offlist' f inst lookup_inst
|
|
|
|
| (Sil.Off_fld _):: _, Sil.Earray _ ->
|
|
|
|
let offlist_new = Sil.Off_index(Sil.exp_zero) :: offlist in
|
|
|
|
apply_offlist
|
|
|
|
pdesc tenv p fp_root nullify_struct (root_lexp, strexp, typ) offlist_new f inst lookup_inst
|
|
|
|
| (Sil.Off_fld (fld, fld_typ)):: offlist', Sil.Estruct (fsel, inst') ->
|
|
|
|
begin
|
|
|
|
let typ' = Tenv.expand_type tenv typ in
|
|
|
|
let struct_typ =
|
|
|
|
match typ' with
|
|
|
|
| Sil.Tstruct struct_typ ->
|
|
|
|
struct_typ
|
|
|
|
| _ -> assert false in
|
|
|
|
let t' = unroll_type tenv typ (Sil.Off_fld (fld, fld_typ)) in
|
|
|
|
try
|
|
|
|
let _, se' = IList.find (fun fse -> Ident.fieldname_equal fld (fst fse)) fsel in
|
|
|
|
let res_e', res_se', res_t', res_pred_insts_op' =
|
|
|
|
apply_offlist
|
|
|
|
pdesc tenv p fp_root nullify_struct
|
|
|
|
(root_lexp, se', t') offlist' f inst lookup_inst in
|
|
|
|
let replace_fse fse = if Sil.fld_equal fld (fst fse) then (fld, res_se') else fse in
|
|
|
|
let res_se = Sil.Estruct (IList.map replace_fse fsel, inst') in
|
|
|
|
let replace_fta (f, t, a) = if Sil.fld_equal fld f then (fld, res_t', a) else (f, t, a) in
|
|
|
|
let instance_fields' = IList.map replace_fta struct_typ.Sil.instance_fields in
|
|
|
|
let res_t =
|
|
|
|
Sil.Tstruct { struct_typ with Sil.instance_fields = instance_fields' } in
|
|
|
|
(res_e', res_se, res_t, res_pred_insts_op')
|
|
|
|
with Not_found ->
|
|
|
|
pp_error();
|
|
|
|
assert false
|
|
|
|
(* This case should not happen. The rearrangement should
|
|
|
|
have materialized all the accessed cells. *)
|
|
|
|
end
|
|
|
|
| (Sil.Off_fld _):: _, _ ->
|
|
|
|
pp_error();
|
|
|
|
assert false
|
|
|
|
|
|
|
|
| (Sil.Off_index idx):: offlist', Sil.Earray (size, esel, inst1) ->
|
|
|
|
let nidx = Prop.exp_normalize_prop p idx in
|
|
|
|
begin
|
|
|
|
let typ' = Tenv.expand_type tenv typ in
|
|
|
|
let t', size' = match typ' with Sil.Tarray (t', size') -> (t', size') | _ -> assert false in
|
|
|
|
try
|
|
|
|
let idx_ese', se' = IList.find (fun ese -> Prover.check_equal p nidx (fst ese)) esel in
|
|
|
|
let res_e', res_se', res_t', res_pred_insts_op' =
|
|
|
|
apply_offlist
|
|
|
|
pdesc tenv p fp_root nullify_struct
|
|
|
|
(root_lexp, se', t') offlist' f inst lookup_inst in
|
|
|
|
let replace_ese ese =
|
|
|
|
if Sil.exp_equal idx_ese' (fst ese)
|
|
|
|
then (idx_ese', res_se')
|
|
|
|
else ese in
|
|
|
|
let res_se = Sil.Earray(size, IList.map replace_ese esel, inst1) in
|
|
|
|
let res_t = Sil.Tarray(res_t', size') in
|
|
|
|
(res_e', res_se, res_t, res_pred_insts_op')
|
|
|
|
with Not_found ->
|
|
|
|
(* return a nondeterministic value if the index is not found after rearrangement *)
|
|
|
|
L.d_str "apply_offlist: index "; Sil.d_exp idx;
|
|
|
|
L.d_strln " not materialized -- returning nondeterministic value";
|
|
|
|
let res_e' = Sil.Var (Ident.create_fresh Ident.kprimed) in
|
|
|
|
(res_e', strexp, typ, None)
|
|
|
|
end
|
|
|
|
| (Sil.Off_index _):: _, _ ->
|
|
|
|
pp_error();
|
|
|
|
raise (Exceptions.Internal_error (Localise.verbatim_desc "Array out of bounds in Symexec"))
|
|
|
|
(* This case should not happen. The rearrangement should
|
|
|
|
have materialized all the accessed cells. *)
|
|
|
|
|
|
|
|
(** Given [lexp |-> se: typ], if the location [offlist] exists in [se],
|
|
|
|
function [ptsto_lookup p (lexp, se, typ) offlist id] returns a tuple.
|
|
|
|
The first component of the tuple is an expression at position [offlist] in [se].
|
|
|
|
The second component is an expansion of the predicate [lexp |-> se: typ],
|
|
|
|
where the entity at [offlist] in [se] is expanded if the entity is a list of
|
|
|
|
higher - order parameters [hpara_psto]. If this expansion happens,
|
|
|
|
the last component of the tuple is a list of pi - sigma pairs obtained
|
|
|
|
by instantiating the [hpara_psto] list. Otherwise, the last component is None.
|
|
|
|
All these steps happen under [p]. So, we can call a prover with [p].
|
|
|
|
Finally, before running this function, the tool should run strexp_extend_value
|
|
|
|
in rearrange.ml for the same se and offlist, so that all the necessary
|
|
|
|
extensions of se are done before this function. *)
|
|
|
|
let ptsto_lookup pdesc tenv p (lexp, se, typ, st) offlist id =
|
|
|
|
let f =
|
|
|
|
function Some exp -> exp | None -> Sil.Var id in
|
|
|
|
let fp_root =
|
|
|
|
match lexp with Sil.Var id -> Ident.is_footprint id | _ -> false in
|
|
|
|
let lookup_inst = ref None in
|
|
|
|
let e', se', typ', pred_insts_op' =
|
|
|
|
apply_offlist
|
|
|
|
pdesc tenv p fp_root false (lexp, se, typ) offlist f Sil.inst_lookup lookup_inst in
|
|
|
|
let lookup_uninitialized = (* true if we have looked up an uninitialized value *)
|
|
|
|
match !lookup_inst with
|
|
|
|
| Some (Sil.Iinitial | Sil.Ialloc | Sil.Ilookup) -> true
|
|
|
|
| _ -> false in
|
|
|
|
let ptsto' = Prop.mk_ptsto lexp se' (Sil.Sizeof (typ', st)) in
|
|
|
|
(e', ptsto', pred_insts_op', lookup_uninitialized)
|
|
|
|
|
|
|
|
(** [ptsto_update p (lexp,se,typ) offlist exp] takes
|
|
|
|
[lexp |-> se: typ], and updates [se] by replacing the
|
|
|
|
expression at [offlist] with [exp]. Then, it returns
|
|
|
|
the updated pointsto predicate. If [lexp |-> se: typ] gets
|
|
|
|
expanded during this update, the generated pi - sigma list from
|
|
|
|
the expansion gets returned, and otherwise, None is returned.
|
|
|
|
All these happen under the proposition [p], so it is ok call
|
|
|
|
prover with [p]. Finally, before running this function,
|
|
|
|
the tool should run strexp_extend_value in rearrange.ml for the same
|
|
|
|
se and offlist, so that all the necessary extensions of se are done
|
|
|
|
before this function. *)
|
|
|
|
let ptsto_update pdesc tenv p (lexp, se, typ, st) offlist exp =
|
|
|
|
let f _ = exp in
|
|
|
|
let fp_root =
|
|
|
|
match lexp with Sil.Var id -> Ident.is_footprint id | _ -> false in
|
|
|
|
let lookup_inst = ref None in
|
|
|
|
let _, se', typ', pred_insts_op' =
|
|
|
|
let pos = State.get_path_pos () in
|
|
|
|
apply_offlist
|
|
|
|
pdesc tenv p fp_root true (lexp, se, typ) offlist f (State.get_inst_update pos) lookup_inst in
|
|
|
|
let ptsto' = Prop.mk_ptsto lexp se' (Sil.Sizeof (typ', st)) in
|
|
|
|
(ptsto', pred_insts_op')
|
|
|
|
|
|
|
|
let update_iter iter pi sigma =
|
|
|
|
let iter' = Prop.prop_iter_update_current_by_list iter sigma in
|
|
|
|
IList.fold_left (Prop.prop_iter_add_atom false) iter' pi
|
|
|
|
|
|
|
|
(** Precondition: se should not include hpara_psto
|
|
|
|
that could mean nonempty heaps. *)
|
|
|
|
let rec execute_nullify_se = function
|
|
|
|
| Sil.Eexp _ ->
|
|
|
|
Sil.Eexp (Sil.exp_zero, Sil.inst_nullify)
|
|
|
|
| Sil.Estruct (fsel, _) ->
|
|
|
|
let fsel' = IList.map (fun (fld, se) -> (fld, execute_nullify_se se)) fsel in
|
|
|
|
Sil.Estruct (fsel', Sil.inst_nullify)
|
|
|
|
| Sil.Earray (size, esel, _) ->
|
|
|
|
let esel' = IList.map (fun (idx, se) -> (idx, execute_nullify_se se)) esel in
|
|
|
|
Sil.Earray (size, esel', Sil.inst_nullify)
|
|
|
|
|
|
|
|
(** Do pruning for conditional [if (e1 != e2) ] if [positive] is true
|
|
|
|
and [(if (e1 == e2)] if [positive] is false *)
|
|
|
|
let prune_ne positive e1 e2 prop =
|
|
|
|
let is_inconsistent =
|
|
|
|
if positive then Prover.check_equal prop e1 e2
|
|
|
|
else Prover.check_disequal prop e1 e2 in
|
|
|
|
if is_inconsistent then Propset.empty
|
|
|
|
else
|
|
|
|
let conjoin = if positive then Prop.conjoin_neq else Prop.conjoin_eq in
|
|
|
|
let new_prop = conjoin ~footprint: (!Config.footprint) e1 e2 prop in
|
|
|
|
if Prover.check_inconsistency new_prop then Propset.empty
|
|
|
|
else Propset.singleton new_prop
|
|
|
|
|
|
|
|
(** Do pruning for conditional "if ([e1] CMP [e2])" if [positive] is
|
|
|
|
true and "if (!([e1] CMP [e2]))" if [positive] is false, where CMP
|
|
|
|
is "<" if [is_strict] is true and "<=" if [is_strict] is false.
|
|
|
|
*)
|
|
|
|
let prune_ineq ~is_strict positive prop e1 e2 =
|
|
|
|
if Sil.exp_equal e1 e2 then
|
|
|
|
if (positive && not is_strict) || (not positive && is_strict) then
|
|
|
|
Propset.singleton prop
|
|
|
|
else Propset.empty
|
|
|
|
else
|
|
|
|
(* build the pruning condition and its negation, as explained in
|
|
|
|
the comment above *)
|
|
|
|
(* build [e1] CMP [e2] *)
|
|
|
|
let cmp = if is_strict then Sil.Lt else Sil.Le in
|
|
|
|
let e1_cmp_e2 = Sil.BinOp (cmp, e1, e2) in
|
|
|
|
(* build !([e1] CMP [e2]) *)
|
|
|
|
let dual_cmp = if is_strict then Sil.Le else Sil.Lt in
|
|
|
|
let not_e1_cmp_e2 = Sil.BinOp (dual_cmp, e2, e1) in
|
|
|
|
(* take polarity into account *)
|
|
|
|
let (prune_cond, not_prune_cond) =
|
|
|
|
if positive then (e1_cmp_e2, not_e1_cmp_e2)
|
|
|
|
else (not_e1_cmp_e2, e1_cmp_e2) in
|
|
|
|
let is_inconsistent = Prover.check_atom prop (Prop.mk_inequality not_prune_cond) in
|
|
|
|
if is_inconsistent then Propset.empty
|
|
|
|
else
|
|
|
|
let footprint = !Config.footprint in
|
|
|
|
let prop_with_ineq = Prop.conjoin_eq ~footprint prune_cond Sil.exp_one prop in
|
|
|
|
Propset.singleton prop_with_ineq
|
|
|
|
|
|
|
|
let rec prune_polarity positive condition prop =
|
|
|
|
match condition with
|
|
|
|
| Sil.Var _ | Sil.Lvar _ ->
|
|
|
|
prune_ne positive condition Sil.exp_zero prop
|
|
|
|
| Sil.Const (Sil.Cint i) when Sil.Int.iszero i ->
|
|
|
|
if positive then Propset.empty else Propset.singleton prop
|
|
|
|
| Sil.Const (Sil.Cint _) | Sil.Sizeof _ | Sil.Const (Sil.Cstr _) | Sil.Const (Sil.Cclass _) ->
|
|
|
|
if positive then Propset.singleton prop else Propset.empty
|
|
|
|
| Sil.Const _ ->
|
|
|
|
assert false
|
|
|
|
| Sil.Cast (_, condition') ->
|
|
|
|
prune_polarity positive condition' prop
|
|
|
|
| Sil.UnOp (Sil.LNot, condition', _) ->
|
|
|
|
prune_polarity (not positive) condition' prop
|
|
|
|
| Sil.UnOp _ ->
|
|
|
|
assert false
|
|
|
|
| Sil.BinOp (Sil.Eq, e, Sil.Const (Sil.Cint i))
|
|
|
|
| Sil.BinOp (Sil.Eq, Sil.Const (Sil.Cint i), e) when Sil.Int.iszero i && not (Sil.Int.isnull i) ->
|
|
|
|
prune_polarity (not positive) e prop
|
|
|
|
| Sil.BinOp (Sil.Eq, e1, e2) ->
|
|
|
|
prune_ne (not positive) e1 e2 prop
|
|
|
|
| Sil.BinOp (Sil.Ne, e, Sil.Const (Sil.Cint i))
|
|
|
|
| Sil.BinOp (Sil.Ne, Sil.Const (Sil.Cint i), e) when Sil.Int.iszero i && not (Sil.Int.isnull i) ->
|
|
|
|
prune_polarity positive e prop
|
|
|
|
| Sil.BinOp (Sil.Ne, e1, e2) ->
|
|
|
|
prune_ne positive e1 e2 prop
|
|
|
|
| Sil.BinOp (Sil.Ge, e2, e1) | Sil.BinOp (Sil.Le, e1, e2) ->
|
|
|
|
prune_ineq ~is_strict:false positive prop e1 e2
|
|
|
|
| Sil.BinOp (Sil.Gt, e2, e1) | Sil.BinOp (Sil.Lt, e1, e2) ->
|
|
|
|
prune_ineq ~is_strict:true positive prop e1 e2
|
|
|
|
| Sil.BinOp (Sil.LAnd, condition1, condition2) ->
|
|
|
|
let pruner = if positive then prune_polarity_inter else prune_polarity_union in
|
|
|
|
pruner positive condition1 condition2 prop
|
|
|
|
| Sil.BinOp (Sil.LOr, condition1, condition2) ->
|
|
|
|
let pruner = if positive then prune_polarity_union else prune_polarity_inter in
|
|
|
|
pruner positive condition1 condition2 prop
|
|
|
|
| Sil.BinOp _ | Sil.Lfield _ | Sil.Lindex _ ->
|
|
|
|
prune_ne positive condition Sil.exp_zero prop
|
|
|
|
|
|
|
|
and prune_polarity_inter positive condition1 condition2 prop =
|
|
|
|
let res = ref Propset.empty in
|
|
|
|
let pset1 = prune_polarity positive condition1 prop in
|
|
|
|
let do_p p =
|
|
|
|
res := Propset.union (prune_polarity positive condition2 p) !res in
|
|
|
|
Propset.iter do_p pset1;
|
|
|
|
!res
|
|
|
|
|
|
|
|
and prune_polarity_union positive condition1 condition2 prop =
|
|
|
|
let pset1 = prune_polarity positive condition1 prop in
|
|
|
|
let pset2 = prune_polarity positive condition2 prop in
|
|
|
|
Propset.union pset1 pset2
|
|
|
|
|
|
|
|
let prune_prop condition prop =
|
|
|
|
match condition with
|
|
|
|
| Sil.Const (Sil.Cint i) when Sil.Int.iszero i -> Propset.empty
|
|
|
|
| Sil.Const (Sil.Cint _) -> Propset.singleton prop
|
|
|
|
| _ -> prune_polarity true condition prop
|
|
|
|
|
|
|
|
let dangerous_functions =
|
|
|
|
let dangerous_list = ["gets"] in
|
|
|
|
ref ((IList.map Procname.from_string_c_fun) dangerous_list)
|
|
|
|
|
|
|
|
let check_inherently_dangerous_function caller_pname callee_pname =
|
|
|
|
if IList.exists (Procname.equal callee_pname) !dangerous_functions then
|
|
|
|
let exn =
|
|
|
|
Exceptions.Inherently_dangerous_function
|
|
|
|
(Localise.desc_inherently_dangerous_function callee_pname) in
|
|
|
|
let pre_opt = State.get_normalized_pre (Abs.abstract_no_symop caller_pname) in
|
|
|
|
Reporting.log_warning caller_pname ~pre: pre_opt exn
|
|
|
|
|
|
|
|
let proc_is_defined proc_name =
|
|
|
|
match AttributesTable.load_attributes proc_name with
|
|
|
|
| Some attributes ->
|
|
|
|
attributes.ProcAttributes.is_defined
|
|
|
|
| None ->
|
|
|
|
false
|
|
|
|
|
|
|
|
let call_should_be_skipped callee_pname summary =
|
|
|
|
(* check skip flag *)
|
|
|
|
Specs.get_flag callee_pname proc_flag_skip <> None
|
|
|
|
(* skip abstract methods *)
|
|
|
|
|| summary.Specs.attributes.ProcAttributes.is_abstract
|
|
|
|
(* treat calls with no specs as skip functions in angelic mode *)
|
|
|
|
|| (!Config.angelic_execution && Specs.get_specs_from_payload summary == [])
|
|
|
|
|
|
|
|
(** In case of constant string dereference, return the result immediately *)
|
|
|
|
let check_constant_string_dereference lexp =
|
|
|
|
let string_lookup s n =
|
|
|
|
let c = try Char.code (String.get s (Sil.Int.to_int n)) with Invalid_argument _ -> 0 in
|
|
|
|
Sil.exp_int (Sil.Int.of_int c) in
|
|
|
|
match lexp with
|
|
|
|
| Sil.BinOp(Sil.PlusPI, Sil.Const (Sil.Cstr s), e)
|
|
|
|
| Sil.Lindex (Sil.Const (Sil.Cstr s), e) ->
|
|
|
|
let value = match e with
|
|
|
|
| Sil.Const (Sil.Cint n)
|
|
|
|
when Sil.Int.geq n Sil.Int.zero &&
|
|
|
|
Sil.Int.leq n (Sil.Int.of_int (String.length s)) ->
|
|
|
|
string_lookup s n
|
|
|
|
| _ -> Sil.exp_get_undefined false in
|
|
|
|
Some value
|
|
|
|
| Sil.Const (Sil.Cstr s) ->
|
|
|
|
Some (string_lookup s Sil.Int.zero)
|
|
|
|
| _ -> None
|
|
|
|
|
|
|
|
(** Normalize an expression and check for arithmetic problems *)
|
|
|
|
let exp_norm_check_arith pname prop exp =
|
|
|
|
match Prop.find_arithmetic_problem (State.get_path_pos ()) prop exp with
|
|
|
|
| Some (Prop.Div0 div), prop' ->
|
|
|
|
let desc = Errdesc.explain_divide_by_zero div (State.get_node ()) (State.get_loc ()) in
|
|
|
|
let exn = Exceptions.Divide_by_zero (desc, __POS__) in
|
|
|
|
let pre_opt = State.get_normalized_pre (Abs.abstract_no_symop pname) in
|
|
|
|
Reporting.log_warning pname ~pre: pre_opt exn;
|
|
|
|
Prop.exp_normalize_prop prop exp, prop'
|
|
|
|
| Some (Prop.UminusUnsigned (e, typ)), prop' ->
|
|
|
|
let desc =
|
|
|
|
Errdesc.explain_unary_minus_applied_to_unsigned_expression
|
|
|
|
e typ (State.get_node ()) (State.get_loc ()) in
|
|
|
|
let exn = Exceptions.Unary_minus_applied_to_unsigned_expression (desc, __POS__) in
|
|
|
|
let pre_opt = State.get_normalized_pre (Abs.abstract_no_symop pname) in
|
|
|
|
Reporting.log_warning pname ~pre: pre_opt exn;
|
|
|
|
Prop.exp_normalize_prop prop exp, prop'
|
|
|
|
| None, prop' -> Prop.exp_normalize_prop prop exp, prop'
|
|
|
|
|
|
|
|
(** Check if [cond] is testing for NULL a pointer already dereferenced *)
|
|
|
|
let check_already_dereferenced pname cond prop =
|
|
|
|
let find_hpred lhs =
|
|
|
|
try Some (IList.find (function
|
|
|
|
| Sil.Hpointsto (e, _, _) -> Sil.exp_equal e lhs
|
|
|
|
| _ -> false) (Prop.get_sigma prop))
|
|
|
|
with Not_found -> None in
|
|
|
|
let rec is_check_zero = function
|
|
|
|
| Sil.Var id ->
|
|
|
|
Some id
|
|
|
|
| Sil.UnOp(Sil.LNot, e, _) ->
|
|
|
|
is_check_zero e
|
|
|
|
| Sil.BinOp ((Sil.Eq | Sil.Ne), Sil.Const Sil.Cint i, Sil.Var id)
|
|
|
|
| Sil.BinOp ((Sil.Eq | Sil.Ne), Sil.Var id, Sil.Const Sil.Cint i) when Sil.Int.iszero i ->
|
|
|
|
Some id
|
|
|
|
| _ -> None in
|
|
|
|
let dereferenced_line = match is_check_zero cond with
|
|
|
|
| Some id ->
|
|
|
|
(match find_hpred (Prop.exp_normalize_prop prop (Sil.Var id)) with
|
|
|
|
| Some (Sil.Hpointsto (_, se, _)) ->
|
|
|
|
(match Tabulation.find_dereference_without_null_check_in_sexp se with
|
|
|
|
| Some n -> Some (id, n)
|
|
|
|
| None -> None)
|
|
|
|
| _ -> None)
|
|
|
|
| None ->
|
|
|
|
None in
|
|
|
|
match dereferenced_line with
|
|
|
|
| Some (id, (n, _)) ->
|
|
|
|
let desc =
|
|
|
|
Errdesc.explain_null_test_after_dereference
|
|
|
|
(Sil.Var id) (State.get_node ()) n (State.get_loc ()) in
|
|
|
|
let exn =
|
|
|
|
(Exceptions.Null_test_after_dereference (desc, __POS__)) in
|
|
|
|
let pre_opt = State.get_normalized_pre (Abs.abstract_no_symop pname) in
|
|
|
|
Reporting.log_warning pname ~pre: pre_opt exn
|
|
|
|
| None -> ()
|
|
|
|
|
|
|
|
(** Check whether symbolic execution de-allocated a stack variable or a constant string,
|
|
|
|
raising an exception in that case *)
|
|
|
|
let check_deallocate_static_memory prop_after =
|
|
|
|
let check_deallocated_attribute = function
|
|
|
|
| Sil.Lvar pv, Sil.Aresource ({ Sil.ra_kind = Sil.Rrelease } as ra)
|
|
|
|
when Sil.pvar_is_local pv || Sil.pvar_is_global pv ->
|
|
|
|
let freed_desc = Errdesc.explain_deallocate_stack_var pv ra in
|
|
|
|
raise (Exceptions.Deallocate_stack_variable freed_desc)
|
|
|
|
| Sil.Const (Sil.Cstr s), Sil.Aresource ({ Sil.ra_kind = Sil.Rrelease } as ra) ->
|
|
|
|
let freed_desc = Errdesc.explain_deallocate_constant_string s ra in
|
|
|
|
raise (Exceptions.Deallocate_static_memory freed_desc)
|
|
|
|
| _ -> () in
|
|
|
|
let exp_att_list = Prop.get_all_attributes prop_after in
|
|
|
|
IList.iter check_deallocated_attribute exp_att_list;
|
|
|
|
prop_after
|
|
|
|
|
|
|
|
let method_exists right_proc_name methods =
|
|
|
|
if !Config.curr_language = Config.Java then
|
|
|
|
IList.exists (fun meth_name -> Procname.equal right_proc_name meth_name) methods
|
|
|
|
else (* ObjC/C++ case : The attribute map will only exist when we have code for the method or
|
|
|
|
the method has been called directly somewhere. It can still be that this is not the
|
|
|
|
case but we have a model for the method. *)
|
|
|
|
match AttributesTable.load_attributes right_proc_name with
|
|
|
|
| Some attrs -> attrs.ProcAttributes.is_defined
|
|
|
|
| None -> Specs.summary_exists_in_models right_proc_name
|
|
|
|
|
|
|
|
let resolve_method tenv class_name proc_name =
|
|
|
|
let found_class =
|
|
|
|
let visited = ref Typename.Set.empty in
|
|
|
|
let rec resolve class_name =
|
|
|
|
visited := Typename.Set.add class_name !visited;
|
|
|
|
let right_proc_name =
|
|
|
|
Procname.replace_class proc_name (Typename.name class_name) in
|
|
|
|
match Tenv.lookup tenv class_name with
|
|
|
|
| Some { Sil.csu = Csu.Class _; def_methods; superclasses } ->
|
|
|
|
if method_exists right_proc_name def_methods then
|
|
|
|
Some right_proc_name
|
|
|
|
else
|
|
|
|
(match superclasses with
|
|
|
|
| super_classname:: _ ->
|
|
|
|
if not (Typename.Set.mem super_classname !visited)
|
|
|
|
then resolve super_classname
|
|
|
|
else None
|
|
|
|
| _ -> None)
|
|
|
|
| _ -> None in
|
|
|
|
resolve class_name in
|
|
|
|
match found_class with
|
|
|
|
| None ->
|
|
|
|
Logging.d_strln
|
|
|
|
("Couldn't find method in the hierarchy of type "^(Typename.name class_name));
|
|
|
|
proc_name
|
|
|
|
| Some proc_name ->
|
|
|
|
proc_name
|
|
|
|
|
|
|
|
let resolve_typename prop receiver_exp =
|
|
|
|
let typexp_opt =
|
|
|
|
let rec loop = function
|
|
|
|
| [] -> None
|
|
|
|
| Sil.Hpointsto(e, _, typexp) :: _ when Sil.exp_equal e receiver_exp -> Some typexp
|
|
|
|
| _ :: hpreds -> loop hpreds in
|
|
|
|
loop (Prop.get_sigma prop) in
|
|
|
|
match typexp_opt with
|
|
|
|
| Some (Sil.Sizeof (Sil.Tstruct { Sil.struct_name = None }, _)) -> None
|
|
|
|
| Some (Sil.Sizeof (Sil.Tstruct { Sil.csu = Csu.Class ck; struct_name = Some name }, _)) ->
|
|
|
|
Some (Typename.TN_csu (Csu.Class ck, name))
|
|
|
|
| _ -> None
|
|
|
|
|
|
|
|
exception Cannot_convert_string_to_typ of string
|
|
|
|
|
|
|
|
(** Lookup Java types by name *)
|
|
|
|
let lookup_java_typ_from_string tenv typ_str =
|
|
|
|
let rec loop = function
|
|
|
|
| "" | "void" -> Sil.Tvoid
|
|
|
|
| "int" -> Sil.Tint Sil.IInt
|
|
|
|
| "byte" -> Sil.Tint Sil.IShort
|
|
|
|
| "short" -> Sil.Tint Sil.IShort
|
|
|
|
| "boolean" -> Sil.Tint Sil.IBool
|
|
|
|
| "char" -> Sil.Tint Sil.IChar
|
|
|
|
| "long" -> Sil.Tint Sil.ILong
|
|
|
|
| "float" -> Sil.Tfloat Sil.FFloat
|
|
|
|
| "double" -> Sil.Tfloat Sil.FDouble
|
|
|
|
| typ_str when String.contains typ_str '[' ->
|
|
|
|
let stripped_typ = String.sub typ_str 0 ((String.length typ_str) - 2) in
|
|
|
|
let array_typ_size = Sil.exp_get_undefined false in
|
|
|
|
Sil.Tptr (Sil.Tarray (loop stripped_typ, array_typ_size), Sil.Pk_pointer)
|
|
|
|
| typ_str ->
|
|
|
|
(* non-primitive/non-array type--resolve it in the tenv *)
|
|
|
|
let typename = Typename.TN_csu (Csu.Class Csu.Java, (Mangled.from_string typ_str)) in
|
|
|
|
match Tenv.lookup tenv typename with
|
|
|
|
| Some struct_typ -> Sil.Tstruct struct_typ
|
|
|
|
| _ -> raise (Cannot_convert_string_to_typ typ_str) in
|
|
|
|
loop typ_str
|
|
|
|
|
|
|
|
(** If the dynamic type of the receiver actual T_actual is a subtype of the reciever type T_formal
|
|
|
|
in the signature of [pname], resolve [pname] to T_actual.[pname]. *)
|
|
|
|
let resolve_virtual_pname tenv prop actuals callee_pname call_flags : Procname.t list =
|
|
|
|
let resolve receiver_exp pname prop = match resolve_typename prop receiver_exp with
|
|
|
|
| Some class_name -> resolve_method tenv class_name pname
|
|
|
|
| None -> pname in
|
|
|
|
let get_receiver_typ pname fallback_typ =
|
|
|
|
match pname with
|
|
|
|
| Procname.Java pname_java ->
|
|
|
|
(try
|
|
|
|
let receiver_typ_str = Procname.java_get_class_name pname_java in
|
|
|
|
Sil.Tptr (lookup_java_typ_from_string tenv receiver_typ_str, Sil.Pk_pointer)
|
|
|
|
with Cannot_convert_string_to_typ _ -> fallback_typ)
|
|
|
|
| _ ->
|
|
|
|
fallback_typ in
|
|
|
|
let receiver_types_equal pname actual_receiver_typ =
|
|
|
|
(* the type of the receiver according to the function signature *)
|
|
|
|
let formal_receiver_typ = get_receiver_typ pname actual_receiver_typ in
|
|
|
|
Sil.typ_equal formal_receiver_typ actual_receiver_typ in
|
|
|
|
let do_resolve called_pname receiver_exp actual_receiver_typ =
|
|
|
|
if receiver_types_equal called_pname actual_receiver_typ
|
|
|
|
then resolve receiver_exp called_pname prop
|
|
|
|
else called_pname in
|
|
|
|
match actuals with
|
|
|
|
| _ when not (call_flags.Sil.cf_virtual || call_flags.Sil.cf_interface) ->
|
|
|
|
(* if this is not a virtual or interface call, there's no need for resolution *)
|
|
|
|
[callee_pname]
|
|
|
|
| (receiver_exp, actual_receiver_typ) :: _ ->
|
|
|
|
if !Config.curr_language <> Config.Java then
|
|
|
|
(* default mode for Obj-C/C++/Java virtual calls: resolution only *)
|
|
|
|
[do_resolve callee_pname receiver_exp actual_receiver_typ]
|
|
|
|
else if Config.sound_dynamic_dispatch then
|
|
|
|
let targets =
|
|
|
|
if call_flags.Sil.cf_virtual
|
|
|
|
then
|
|
|
|
(* virtual call--either [called_pname] or an override in some subtype may be called *)
|
|
|
|
callee_pname :: call_flags.Sil.cf_targets
|
|
|
|
else
|
|
|
|
(* interface call--[called_pname] has no implementation), we don't want to consider *)
|
|
|
|
call_flags.Sil.cf_targets in (* interface call, don't want to consider *)
|
|
|
|
(* return true if (receiver typ of [target_pname]) <: [actual_receiver_typ] *)
|
|
|
|
let may_dispatch_to target_pname =
|
|
|
|
let target_receiver_typ = get_receiver_typ target_pname actual_receiver_typ in
|
|
|
|
Prover.Subtyping_check.check_subtype tenv target_receiver_typ actual_receiver_typ in
|
|
|
|
let resolved_pname = do_resolve callee_pname receiver_exp actual_receiver_typ in
|
|
|
|
let feasible_targets = IList.filter may_dispatch_to targets in
|
|
|
|
(* make sure [resolved_pname] is not a duplicate *)
|
|
|
|
if IList.mem Procname.equal resolved_pname feasible_targets
|
|
|
|
then feasible_targets
|
|
|
|
else resolved_pname :: feasible_targets
|
|
|
|
else
|
|
|
|
begin
|
|
|
|
match call_flags.Sil.cf_targets with
|
|
|
|
| target :: _ when call_flags.Sil.cf_interface &&
|
|
|
|
receiver_types_equal callee_pname actual_receiver_typ ->
|
|
|
|
(* "production mode" of dynamic dispatch for Java: unsound, but faster. the handling
|
|
|
|
is restricted to interfaces: if we can't resolve an interface call, we pick the
|
|
|
|
first implementation of the interface and call it *)
|
|
|
|
[target]
|
|
|
|
| _ ->
|
|
|
|
(* default mode for Java virtual calls: resolution only *)
|
|
|
|
[do_resolve callee_pname receiver_exp actual_receiver_typ]
|
|
|
|
end
|
|
|
|
| _ -> failwith "A virtual call must have a receiver"
|
|
|
|
|
|
|
|
|
|
|
|
(** Resolve the name of the procedure to call based on the type of the arguments *)
|
|
|
|
let resolve_java_pname tenv prop args pname_java call_flags : Procname.java =
|
|
|
|
let resolve_from_args resolved_pname_java args =
|
|
|
|
let parameters = Procname.java_get_parameters resolved_pname_java in
|
|
|
|
if IList.length args <> IList.length parameters then
|
|
|
|
resolved_pname_java
|
|
|
|
else
|
|
|
|
let resolved_params =
|
|
|
|
IList.fold_left2
|
|
|
|
(fun accu (arg_exp, _) name ->
|
|
|
|
match resolve_typename prop arg_exp with
|
|
|
|
| Some class_name ->
|
|
|
|
(Procname.split_classname (Typename.name class_name)) :: accu
|
|
|
|
| None -> name :: accu)
|
|
|
|
[] args (Procname.java_get_parameters resolved_pname_java) |> IList.rev in
|
|
|
|
Procname.java_replace_parameters resolved_pname_java resolved_params in
|
|
|
|
let resolved_pname_java, other_args =
|
|
|
|
match args with
|
|
|
|
| [] ->
|
|
|
|
pname_java, []
|
|
|
|
| (first_arg, _) :: other_args when call_flags.Sil.cf_virtual ->
|
|
|
|
let resolved =
|
|
|
|
begin
|
|
|
|
match resolve_typename prop first_arg with
|
|
|
|
| Some class_name ->
|
|
|
|
begin
|
|
|
|
match resolve_method tenv class_name (Procname.Java pname_java) with
|
|
|
|
| Procname.Java resolved_pname_java ->
|
|
|
|
resolved_pname_java
|
|
|
|
| _ ->
|
|
|
|
pname_java
|
|
|
|
end
|
|
|
|
| None ->
|
|
|
|
pname_java
|
|
|
|
end in
|
|
|
|
resolved, other_args
|
|
|
|
| _ :: other_args when Procname.is_constructor (Procname.Java pname_java) ->
|
|
|
|
pname_java, other_args
|
|
|
|
| args ->
|
|
|
|
pname_java, args in
|
|
|
|
resolve_from_args resolved_pname_java other_args
|
|
|
|
|
|
|
|
|
|
|
|
(** Resolve the procedure name and run the analysis of the resolved procedure
|
|
|
|
if not already analyzed *)
|
|
|
|
let resolve_and_analyze
|
|
|
|
tenv caller_pdesc prop args callee_proc_name call_flags : Procname.t * Specs.summary option =
|
|
|
|
(* TODO (#9333890): Fix conflict with method overloading by encoding in the procedure name
|
|
|
|
whether the method is defined or generated by the specialization *)
|
|
|
|
let analyze_ondemand resolved_pname : unit =
|
|
|
|
if Procname.equal resolved_pname callee_proc_name then
|
|
|
|
Ondemand.analyze_proc_name ~propagate_exceptions:true caller_pdesc callee_proc_name
|
|
|
|
else
|
|
|
|
(* Create the type sprecialized procedure description and analyze it directly *)
|
|
|
|
Option.may
|
|
|
|
(fun specialized_pdesc ->
|
|
|
|
Ondemand.analyze_proc_desc ~propagate_exceptions:true caller_pdesc specialized_pdesc)
|
|
|
|
(match Ondemand.get_proc_desc resolved_pname with
|
|
|
|
| Some resolved_proc_desc ->
|
|
|
|
Some resolved_proc_desc
|
|
|
|
| None ->
|
|
|
|
begin
|
|
|
|
Option.map
|
|
|
|
(fun callee_proc_desc ->
|
|
|
|
Cfg.specialize_types callee_proc_desc resolved_pname args)
|
|
|
|
(Ondemand.get_proc_desc callee_proc_name)
|
|
|
|
end) in
|
|
|
|
let resolved_pname = match callee_proc_name with
|
|
|
|
| Procname.Java callee_proc_name_java ->
|
|
|
|
Procname.Java
|
|
|
|
(resolve_java_pname tenv prop args callee_proc_name_java call_flags)
|
|
|
|
| _ ->
|
|
|
|
callee_proc_name in
|
|
|
|
analyze_ondemand resolved_pname;
|
|
|
|
resolved_pname, Specs.get_summary resolved_pname
|
|
|
|
|
|
|
|
|
|
|
|
(** recognize calls to the constructor java.net.URL and splits the argument string
|
|
|
|
to be only the protocol. *)
|
|
|
|
let call_constructor_url_update_args pname actual_params =
|
|
|
|
let url_pname =
|
|
|
|
Procname.Java
|
|
|
|
(Procname.java
|
|
|
|
((Some "java.net"), "URL") None "<init>"
|
|
|
|
[(Some "java.lang"), "String"] Procname.Non_Static) in
|
|
|
|
if (Procname.equal url_pname pname) then
|
|
|
|
(match actual_params with
|
|
|
|
| [this; (Sil.Const (Sil.Cstr s), atype)] ->
|
|
|
|
let parts = Str.split (Str.regexp_string "://") s in
|
|
|
|
(match parts with
|
|
|
|
| frst:: _ ->
|
|
|
|
if frst = "http" ||
|
|
|
|
frst = "ftp" ||
|
|
|
|
frst = "https" ||
|
|
|
|
frst = "mailto" ||
|
|
|
|
frst = "jar"
|
|
|
|
then
|
|
|
|
[this; (Sil.Const (Sil.Cstr frst), atype)]
|
|
|
|
else actual_params
|
|
|
|
| _ -> actual_params)
|
|
|
|
| [this; _, atype] -> [this; (Sil.Const (Sil.Cstr "file"), atype)]
|
|
|
|
| _ -> actual_params)
|
|
|
|
else actual_params
|
|
|
|
|
|
|
|
|
|
|
|
(* This method handles ObjC method calls, in particular the fact that calling a method with nil *)
|
|
|
|
(* returns nil. The exec_call function is either standard call execution or execution of ObjC *)
|
|
|
|
(* getters and setters using a builtin. *)
|
|
|
|
let handle_objc_method_call actual_pars actual_params pre tenv ret_ids pdesc callee_pname loc
|
|
|
|
path exec_call =
|
|
|
|
let path_description =
|
|
|
|
"Message " ^
|
|
|
|
(Procname.to_simplified_string callee_pname) ^
|
|
|
|
" with receiver nil returns nil." in
|
|
|
|
let receiver = (match actual_pars with
|
|
|
|
| (e, _):: _ -> e
|
|
|
|
| _ -> raise
|
|
|
|
(Exceptions.Internal_error
|
|
|
|
(Localise.verbatim_desc
|
|
|
|
"In Objective-C instance method call there should be a receiver."))) in
|
|
|
|
let is_receiver_null =
|
|
|
|
match actual_pars with
|
|
|
|
| (e, _) :: _
|
|
|
|
when Sil.exp_equal e Sil.exp_zero ||
|
|
|
|
Option.is_some (Prop.get_objc_null_attribute pre e) -> true
|
|
|
|
| _ -> false in
|
|
|
|
let add_objc_null_attribute_or_nullify_result prop =
|
|
|
|
match ret_ids with
|
|
|
|
| [ret_id] ->
|
|
|
|
(match Prop.find_equal_formal_path receiver prop with
|
|
|
|
| Some info ->
|
|
|
|
Prop.add_or_replace_exp_attribute prop (Sil.Var ret_id) (Sil.Aobjc_null info)
|
|
|
|
| None -> Prop.conjoin_eq (Sil.Var ret_id) Sil.exp_zero prop)
|
|
|
|
| _ -> prop in
|
|
|
|
if is_receiver_null
|
|
|
|
then (* objective-c instance method with a null receiver just return objc_null(res) *)
|
|
|
|
let path = Paths.Path.add_description path path_description in
|
|
|
|
L.d_strln
|
|
|
|
("Object-C method " ^
|
|
|
|
Procname.to_string callee_pname ^
|
|
|
|
" called with nil receiver. Returning 0/nil");
|
|
|
|
(* We wish to nullify the result. However, in some cases,
|
|
|
|
we want to add the attribute OBJC_NULL to it so that we *)
|
|
|
|
(* can keep track of how this object became null,
|
|
|
|
so that in a NPE we can separate it into a different error type *)
|
|
|
|
[(add_objc_null_attribute_or_nullify_result pre, path)]
|
|
|
|
else
|
|
|
|
let res = exec_call tenv ret_ids pdesc callee_pname loc actual_params pre path in
|
|
|
|
let is_undef =
|
|
|
|
Option.is_some (Prop.get_undef_attribute pre receiver) in
|
|
|
|
if !Config.footprint && not is_undef then
|
|
|
|
let res_null = (* returns: (objc_null(res) /\ receiver=0) or an empty list of results *)
|
|
|
|
let pre_with_attr_or_null = add_objc_null_attribute_or_nullify_result pre in
|
|
|
|
let propset = prune_ne false receiver Sil.exp_zero pre_with_attr_or_null in
|
|
|
|
if Propset.is_empty propset then []
|
|
|
|
else
|
|
|
|
let prop = IList.hd (Propset.to_proplist propset) in
|
|
|
|
let path = Paths.Path.add_description path path_description in
|
|
|
|
[(prop, path)] in
|
|
|
|
res_null @ res
|
|
|
|
else res (* Not known if receiver = 0 and not footprint. Standard tabulation *)
|
|
|
|
|
|
|
|
let normalize_params pdesc prop actual_params =
|
|
|
|
let norm_arg (p, args) (e, t) =
|
|
|
|
let e', p' = exp_norm_check_arith pdesc p e in
|
|
|
|
(p', (e', t) :: args) in
|
|
|
|
let prop, args = IList.fold_left norm_arg (prop, []) actual_params in
|
|
|
|
(prop, IList.rev args)
|
|
|
|
|
|
|
|
let do_error_checks node_opt instr pname pdesc = match node_opt with
|
|
|
|
| Some node ->
|
|
|
|
if !Config.curr_language = Config.Java then
|
|
|
|
PrintfArgs.check_printf_args_ok node instr pname pdesc
|
|
|
|
| None ->
|
|
|
|
()
|
|
|
|
|
|
|
|
let add_strexp_to_footprint strexp abducted_pv typ prop =
|
|
|
|
let abducted_lvar = Sil.Lvar abducted_pv in
|
|
|
|
let lvar_pt_fpvar =
|
|
|
|
let sizeof_exp = Sil.Sizeof (typ, Sil.Subtype.subtypes) in
|
|
|
|
Prop.mk_ptsto abducted_lvar strexp sizeof_exp in
|
|
|
|
let sigma_fp = Prop.get_sigma_footprint prop in
|
|
|
|
Prop.normalize (Prop.replace_sigma_footprint (lvar_pt_fpvar :: sigma_fp) prop)
|
|
|
|
|
|
|
|
let add_to_footprint abducted_pv typ prop =
|
|
|
|
let fresh_fp_var = Sil.Var (Ident.create_fresh Ident.kfootprint) in
|
|
|
|
let prop' = add_strexp_to_footprint (Sil.Eexp (fresh_fp_var, Sil.Inone)) abducted_pv typ prop in
|
|
|
|
prop', fresh_fp_var
|
|
|
|
|
|
|
|
(* the current abduction mechanism treats struct values differently than all other types. abduction
|
|
|
|
on struct values adds a a struct whose fields are initialized to fresh footprint vars to the
|
|
|
|
footprint. regular abduction just adds a fresh footprint value of the correct type to the
|
|
|
|
footprint. we can get rid of this special case if we fix the abduction on struct values *)
|
|
|
|
let add_struct_value_to_footprint tenv abducted_pv typ prop =
|
|
|
|
let struct_strexp =
|
|
|
|
Prop.create_strexp_of_type (Some tenv) Prop.Fld_init typ Sil.inst_none in
|
|
|
|
let prop' = add_strexp_to_footprint struct_strexp abducted_pv typ prop in
|
|
|
|
prop', struct_strexp
|
|
|
|
|
|
|
|
let add_constraints_on_retval pdesc prop ret_exp typ callee_pname callee_loc =
|
|
|
|
if Procname.is_infer_undefined callee_pname then prop
|
|
|
|
else
|
|
|
|
let is_rec_call pname = (* TODO: (t7147096) extend this to detect mutual recursion *)
|
|
|
|
Procname.equal pname (Cfg.Procdesc.get_proc_name pdesc) in
|
|
|
|
let already_has_abducted_retval p abducted_ret_pv =
|
|
|
|
IList.exists
|
|
|
|
(fun hpred -> match hpred with
|
|
|
|
| Sil.Hpointsto (Sil.Lvar pv, _, _) -> Sil.pvar_equal pv abducted_ret_pv
|
|
|
|
| _ -> false)
|
|
|
|
(Prop.get_sigma_footprint p) in
|
|
|
|
(* find an hpred [abducted_pvar] |-> A in [prop] and add [exp] = A to prop *)
|
|
|
|
let bind_exp_to_abducted_val exp_to_bind abducted_pvar prop =
|
|
|
|
let bind_exp prop = function
|
|
|
|
| Sil.Hpointsto (Sil.Lvar pv, Sil.Eexp (rhs, _), _)
|
|
|
|
when Sil.pvar_equal pv abducted_pvar ->
|
|
|
|
Prop.conjoin_eq exp_to_bind rhs prop
|
|
|
|
| _ -> prop in
|
|
|
|
IList.fold_left bind_exp prop (Prop.get_sigma prop) in
|
|
|
|
(* To avoid obvious false positives, assume skip functions do not return null pointers *)
|
|
|
|
let add_ret_non_null exp typ prop =
|
|
|
|
match typ with
|
|
|
|
| Sil.Tptr _ -> Prop.conjoin_neq exp Sil.exp_zero prop
|
|
|
|
| _ -> prop in
|
|
|
|
let add_tainted_post ret_exp callee_pname prop =
|
|
|
|
Prop.add_or_replace_exp_attribute prop ret_exp (Sil.Ataint callee_pname) in
|
|
|
|
|
|
|
|
if !Config.angelic_execution && not (is_rec_call callee_pname) then
|
|
|
|
(* introduce a fresh program variable to allow abduction on the return value *)
|
|
|
|
let abducted_ret_pv = Sil.mk_pvar_abducted_ret callee_pname callee_loc in
|
|
|
|
(* prevent introducing multiple abducted retvals for a single call site in a loop *)
|
|
|
|
if already_has_abducted_retval prop abducted_ret_pv then prop
|
|
|
|
else
|
|
|
|
let prop' =
|
|
|
|
if !Config.footprint then
|
|
|
|
let (prop', fresh_fp_var) = add_to_footprint abducted_ret_pv typ prop in
|
|
|
|
Prop.conjoin_eq ~footprint: true ret_exp fresh_fp_var prop'
|
|
|
|
else
|
|
|
|
(* bind return id to the abducted value pointed to by the pvar we introduced *)
|
|
|
|
bind_exp_to_abducted_val ret_exp abducted_ret_pv prop in
|
|
|
|
let prop'' = add_ret_non_null ret_exp typ prop' in
|
|
|
|
if !Config.taint_analysis && Taint.returns_tainted callee_pname then
|
|
|
|
add_tainted_post ret_exp { Sil.taint_source = callee_pname; taint_kind = Unknown } prop''
|
|
|
|
else prop''
|
|
|
|
else add_ret_non_null ret_exp typ prop
|
|
|
|
|
|
|
|
let execute_letderef ?(report_deref_errors=true) pname pdesc tenv id rhs_exp typ loc prop_ =
|
|
|
|
let execute_letderef_ pdesc tenv id loc acc_in iter =
|
|
|
|
let iter_ren = Prop.prop_iter_make_id_primed id iter in
|
|
|
|
let prop_ren = Prop.prop_iter_to_prop iter_ren in
|
|
|
|
match Prop.prop_iter_current iter_ren with
|
|
|
|
| (Sil.Hpointsto(lexp, strexp, Sil.Sizeof (typ, st)), offlist) ->
|
|
|
|
let contents, new_ptsto, pred_insts_op, lookup_uninitialized =
|
|
|
|
ptsto_lookup pdesc tenv prop_ren (lexp, strexp, typ, st) offlist id in
|
|
|
|
let update acc (pi, sigma) =
|
|
|
|
let pi' = Sil.Aeq (Sil.Var(id), contents):: pi in
|
|
|
|
let sigma' = new_ptsto:: sigma in
|
|
|
|
let iter' = update_iter iter_ren pi' sigma' in
|
|
|
|
let prop' = Prop.prop_iter_to_prop iter' in
|
|
|
|
let prop'' =
|
|
|
|
if lookup_uninitialized then
|
|
|
|
Prop.add_or_replace_exp_attribute prop' (Sil.Var id) (Sil.Adangling Sil.DAuninit)
|
|
|
|
else prop' in
|
|
|
|
prop'' :: acc in
|
|
|
|
begin
|
|
|
|
match pred_insts_op with
|
|
|
|
| None -> update acc_in ([],[])
|
|
|
|
| Some pred_insts -> IList.rev (IList.fold_left update acc_in pred_insts)
|
|
|
|
end
|
|
|
|
| (Sil.Hpointsto _, _) ->
|
|
|
|
Errdesc.warning_err loc "no offset access in execute_letderef -- treating as skip@.";
|
|
|
|
(Prop.prop_iter_to_prop iter_ren) :: acc_in
|
|
|
|
| _ ->
|
|
|
|
(* The implementation of this case means that we
|
|
|
|
ignore this dereferencing operator. When the analyzer treats
|
|
|
|
numerical information and arrays more precisely later, we
|
|
|
|
should change the implementation here. *)
|
|
|
|
assert false in
|
|
|
|
try
|
|
|
|
let n_rhs_exp, prop = exp_norm_check_arith pname prop_ rhs_exp in
|
|
|
|
let n_rhs_exp' = Prop.exp_collapse_consecutive_indices_prop typ n_rhs_exp in
|
|
|
|
match check_constant_string_dereference n_rhs_exp' with
|
|
|
|
| Some value ->
|
|
|
|
[Prop.conjoin_eq (Sil.Var id) value prop]
|
|
|
|
| None ->
|
|
|
|
let exp_get_undef_attr exp =
|
|
|
|
let fold_undef_pname callee_opt attr =
|
|
|
|
if Option.is_none callee_opt && Sil.attr_is_undef attr then Some attr
|
|
|
|
else callee_opt in
|
|
|
|
IList.fold_left fold_undef_pname None (Prop.get_exp_attributes prop exp) in
|
|
|
|
let prop' =
|
|
|
|
if !Config.angelic_execution then
|
|
|
|
(* when we try to deref an undefined value, add it to the footprint *)
|
|
|
|
match exp_get_undef_attr n_rhs_exp' with
|
|
|
|
| Some (Sil.Aundef (callee_pname, callee_loc, _)) ->
|
|
|
|
add_constraints_on_retval pdesc prop n_rhs_exp' typ callee_pname callee_loc
|
|
|
|
| _ -> prop
|
|
|
|
else prop in
|
|
|
|
let iter_list =
|
|
|
|
Rearrange.rearrange ~report_deref_errors pdesc tenv n_rhs_exp' typ prop' loc in
|
|
|
|
IList.rev (IList.fold_left (execute_letderef_ pdesc tenv id loc) [] iter_list)
|
|
|
|
with Rearrange.ARRAY_ACCESS ->
|
|
|
|
if (!Config.array_level = 0) then assert false
|
|
|
|
else
|
|
|
|
let undef = Sil.exp_get_undefined false in
|
|
|
|
[Prop.conjoin_eq (Sil.Var id) undef prop_]
|
|
|
|
|
|
|
|
let execute_set ?(report_deref_errors=true) pname pdesc tenv lhs_exp typ rhs_exp loc prop_ =
|
|
|
|
let execute_set_ pdesc tenv rhs_exp acc_in iter =
|
|
|
|
let (lexp, strexp, typ, st, offlist) =
|
|
|
|
match Prop.prop_iter_current iter with
|
|
|
|
| (Sil.Hpointsto(lexp, strexp, Sil.Sizeof (typ, st)), offlist) ->
|
|
|
|
(lexp, strexp, typ, st, offlist)
|
|
|
|
| _ -> assert false in
|
|
|
|
let p = Prop.prop_iter_to_prop iter in
|
|
|
|
let new_ptsto, pred_insts_op =
|
|
|
|
ptsto_update pdesc tenv p (lexp, strexp, typ, st) offlist rhs_exp in
|
|
|
|
let update acc (pi, sigma) =
|
|
|
|
let sigma' = new_ptsto:: sigma in
|
|
|
|
let iter' = update_iter iter pi sigma' in
|
|
|
|
let prop' = Prop.prop_iter_to_prop iter' in
|
|
|
|
prop' :: acc in
|
|
|
|
match pred_insts_op with
|
|
|
|
| None -> update acc_in ([],[])
|
|
|
|
| Some pred_insts -> IList.fold_left update acc_in pred_insts in
|
|
|
|
try
|
|
|
|
let n_lhs_exp, prop_' = exp_norm_check_arith pname prop_ lhs_exp in
|
|
|
|
let n_rhs_exp, prop = exp_norm_check_arith pname prop_' rhs_exp in
|
|
|
|
let prop = Prop.replace_objc_null prop n_lhs_exp n_rhs_exp in
|
|
|
|
let n_lhs_exp' = Prop.exp_collapse_consecutive_indices_prop typ n_lhs_exp in
|
|
|
|
let iter_list = Rearrange.rearrange ~report_deref_errors pdesc tenv n_lhs_exp' typ prop loc in
|
|
|
|
IList.rev (IList.fold_left (execute_set_ pdesc tenv n_rhs_exp) [] iter_list)
|
|
|
|
with Rearrange.ARRAY_ACCESS ->
|
|
|
|
if (!Config.array_level = 0) then assert false
|
|
|
|
else [prop_]
|
|
|
|
|
|
|
|
(** Execute [instr] with a symbolic heap [prop].*)
|
|
|
|
let rec sym_exec tenv current_pdesc _instr (prop_: Prop.normal Prop.t) path
|
|
|
|
: (Prop.normal Prop.t * Paths.Path.t) list =
|
|
|
|
let current_pname = Cfg.Procdesc.get_proc_name current_pdesc in
|
|
|
|
State.set_instr _instr; (* mark instruction last seen *)
|
|
|
|
State.set_prop_tenv_pdesc prop_ tenv current_pdesc; (* mark prop,tenv,pdesc last seen *)
|
|
|
|
SymOp.pay(); (* pay one symop *)
|
|
|
|
let ret_old_path pl = (* return the old path unchanged *)
|
|
|
|
IList.map (fun p -> (p, path)) pl in
|
|
|
|
let skip_call prop path callee_pname loc ret_ids ret_typ_opt actual_args =
|
|
|
|
let exn = Exceptions.Skip_function (Localise.desc_skip_function callee_pname) in
|
|
|
|
Reporting.log_info current_pname exn;
|
|
|
|
L.d_strln
|
|
|
|
("Undefined function " ^ Procname.to_string callee_pname
|
|
|
|
^ ", returning undefined value.");
|
|
|
|
(match Specs.get_summary current_pname with
|
|
|
|
| None -> ()
|
|
|
|
| Some summary ->
|
|
|
|
Specs.CallStats.trace
|
|
|
|
summary.Specs.stats.Specs.call_stats callee_pname loc
|
|
|
|
(Specs.CallStats.CR_skip) !Config.footprint);
|
|
|
|
call_unknown_or_scan
|
|
|
|
tenv false current_pdesc prop path ret_ids ret_typ_opt actual_args callee_pname loc in
|
|
|
|
let instr = match _instr with
|
|
|
|
| Sil.Call (ret, exp, par, loc, call_flags) ->
|
|
|
|
let exp' = Prop.exp_normalize_prop prop_ exp in
|
|
|
|
let instr' = match exp' with
|
|
|
|
| Sil.Const (Sil.Cclosure c) ->
|
|
|
|
let proc_exp = Sil.Const (Sil.Cfun c.name) in
|
|
|
|
let proc_exp' = Prop.exp_normalize_prop prop_ proc_exp in
|
|
|
|
let par' = IList.map (fun (id_exp, _, typ) -> (id_exp, typ)) c.captured_vars in
|
|
|
|
Sil.Call (ret, proc_exp', par' @ par, loc, call_flags)
|
|
|
|
| _ ->
|
|
|
|
Sil.Call (ret, exp', par, loc, call_flags) in
|
|
|
|
instr'
|
|
|
|
| _ -> _instr in
|
|
|
|
match instr with
|
|
|
|
| Sil.Letderef (id, rhs_exp, typ, loc) ->
|
|
|
|
execute_letderef current_pname current_pdesc tenv id rhs_exp typ loc prop_
|
|
|
|
|> ret_old_path
|
|
|
|
| Sil.Set (lhs_exp, typ, rhs_exp, loc) ->
|
|
|
|
execute_set current_pname current_pdesc tenv lhs_exp typ rhs_exp loc prop_
|
|
|
|
|> ret_old_path
|
|
|
|
| Sil.Prune (cond, loc, true_branch, ik) ->
|
|
|
|
let prop__ = Prop.nullify_exp_with_objc_null prop_ cond in
|
|
|
|
let check_condition_always_true_false () =
|
|
|
|
let report_condition_always_true_false i =
|
|
|
|
let skip_loop = match ik with
|
|
|
|
| Sil.Ik_while | Sil.Ik_for ->
|
|
|
|
not (Sil.Int.iszero i) (* skip wile(1) and for (;1;) *)
|
|
|
|
| Sil.Ik_dowhile ->
|
|
|
|
true (* skip do..while *)
|
|
|
|
| Sil.Ik_land_lor ->
|
|
|
|
true (* skip subpart of a condition obtained from compilation of && and || *)
|
|
|
|
| _ -> false in
|
|
|
|
true_branch && not skip_loop in
|
|
|
|
(* in comparisons, nil is translated as (void * ) 0 rather than 0 *)
|
|
|
|
let is_comparison_to_nil = function
|
|
|
|
| Sil.Cast ((Sil.Tptr (Sil.Tvoid, _)), exp) ->
|
|
|
|
!Config.curr_language = Config.C_CPP && Sil.exp_is_zero exp
|
|
|
|
| _ -> false in
|
|
|
|
match Prop.exp_normalize_prop Prop.prop_emp cond with
|
|
|
|
| Sil.Const (Sil.Cint i) when report_condition_always_true_false i ->
|
|
|
|
let node = State.get_node () in
|
|
|
|
let desc = Errdesc.explain_condition_always_true_false i cond node loc in
|
|
|
|
let exn =
|
|
|
|
Exceptions.Condition_always_true_false (desc, not (Sil.Int.iszero i), __POS__) in
|
|
|
|
let pre_opt = State.get_normalized_pre (Abs.abstract_no_symop current_pname) in
|
|
|
|
Reporting.log_warning current_pname ~pre: pre_opt exn
|
|
|
|
| Sil.BinOp ((Sil.Eq | Sil.Ne), lhs, rhs)
|
|
|
|
when true_branch && !Config.footprint && not (is_comparison_to_nil rhs) ->
|
|
|
|
(* iOS: check that NSNumber *'s are not used in conditionals without comparing to nil *)
|
|
|
|
let lhs_normal = Prop.exp_normalize_prop prop__ lhs in
|
|
|
|
let is_nsnumber = function
|
|
|
|
| Sil.Tvar (Typename.TN_csu (Csu.Class _, name)) ->
|
|
|
|
Mangled.to_string name = "NSNumber"
|
|
|
|
| _ -> false in
|
|
|
|
let lhs_is_ns_ptr () =
|
|
|
|
IList.exists
|
|
|
|
(function
|
|
|
|
| Sil.Hpointsto (_, Sil.Eexp (exp, _), Sil.Sizeof (Sil.Tptr (typ, _), _)) ->
|
|
|
|
Sil.exp_equal exp lhs_normal && is_nsnumber typ
|
|
|
|
| _ -> false)
|
|
|
|
(Prop.get_sigma prop__) in
|
|
|
|
if not (Sil.exp_is_zero lhs_normal) && lhs_is_ns_ptr () then
|
|
|
|
let node = State.get_node () in
|
|
|
|
let desc = Errdesc.explain_bad_pointer_comparison lhs node loc in
|
|
|
|
let exn = Exceptions.Bad_pointer_comparison (desc, __POS__) in
|
|
|
|
Reporting.log_warning current_pname exn
|
|
|
|
| _ -> () in
|
|
|
|
if not !Config.report_runtime_exceptions then
|
|
|
|
check_already_dereferenced current_pname cond prop__;
|
|
|
|
check_condition_always_true_false ();
|
|
|
|
let n_cond, prop = exp_norm_check_arith current_pname prop__ cond in
|
|
|
|
ret_old_path (Propset.to_proplist (prune_prop n_cond prop))
|
|
|
|
| Sil.Call (ret_ids, Sil.Const (Sil.Cfun callee_pname), args, loc, _)
|
|
|
|
when Builtin.is_registered callee_pname ->
|
|
|
|
let sym_exe_builtin = Builtin.get callee_pname in
|
|
|
|
sym_exe_builtin
|
|
|
|
{
|
|
|
|
pdesc = current_pdesc;
|
|
|
|
instr;
|
|
|
|
tenv;
|
|
|
|
prop_;
|
|
|
|
path;
|
|
|
|
ret_ids;
|
|
|
|
args;
|
|
|
|
proc_name = callee_pname;
|
|
|
|
loc;
|
|
|
|
}
|
|
|
|
| Sil.Call (ret_ids,
|
|
|
|
Sil.Const (Sil.Cfun ((Procname.Java callee_pname_java) as callee_pname)),
|
|
|
|
actual_params, loc, call_flags)
|
|
|
|
when Config.lazy_dynamic_dispatch ->
|
|
|
|
let norm_prop, norm_args = normalize_params current_pname prop_ actual_params in
|
|
|
|
let exec_skip_call skipped_pname ret_type =
|
|
|
|
skip_call norm_prop path skipped_pname loc ret_ids (Some ret_type) norm_args in
|
|
|
|
let resolved_pname, summary_opt =
|
|
|
|
resolve_and_analyze tenv current_pdesc norm_prop norm_args callee_pname call_flags in
|
|
|
|
begin
|
|
|
|
match summary_opt with
|
|
|
|
| None ->
|
|
|
|
let ret_typ_str = Procname.java_get_return_type callee_pname_java in
|
|
|
|
let ret_typ =
|
|
|
|
match lookup_java_typ_from_string tenv ret_typ_str with
|
|
|
|
| Sil.Tstruct _ as typ -> Sil.Tptr (typ, Sil.Pk_pointer)
|
|
|
|
| typ -> typ in
|
|
|
|
exec_skip_call resolved_pname ret_typ
|
|
|
|
| Some summary when call_should_be_skipped resolved_pname summary ->
|
|
|
|
exec_skip_call resolved_pname summary.Specs.attributes.ProcAttributes.ret_type
|
|
|
|
| Some summary ->
|
|
|
|
sym_exec_call current_pdesc tenv norm_prop path ret_ids norm_args summary loc
|
|
|
|
end
|
|
|
|
|
|
|
|
| Sil.Call (ret_ids,
|
|
|
|
Sil.Const (Sil.Cfun ((Procname.Java _) as callee_pname)),
|
|
|
|
actual_params, loc, call_flags) ->
|
|
|
|
do_error_checks (Paths.Path.curr_node path) instr current_pname current_pdesc;
|
|
|
|
let norm_prop, norm_args = normalize_params current_pname prop_ actual_params in
|
|
|
|
let url_handled_args =
|
|
|
|
call_constructor_url_update_args callee_pname norm_args in
|
|
|
|
let resolved_pnames =
|
|
|
|
resolve_virtual_pname tenv norm_prop url_handled_args callee_pname call_flags in
|
|
|
|
let exec_one_pname pname =
|
|
|
|
Ondemand.analyze_proc_name ~propagate_exceptions:true current_pdesc pname;
|
|
|
|
let exec_skip_call ret_type =
|
|
|
|
skip_call norm_prop path pname loc ret_ids (Some ret_type) url_handled_args in
|
|
|
|
match Specs.get_summary pname with
|
|
|
|
| None ->
|
|
|
|
let ret_typ_str = match pname with
|
|
|
|
| Procname.Java pname_java ->
|
|
|
|
Procname.java_get_return_type pname_java
|
|
|
|
| _ ->
|
|
|
|
"unknown_return_type" in
|
|
|
|
let ret_typ =
|
|
|
|
match lookup_java_typ_from_string tenv ret_typ_str with
|
|
|
|
| Sil.Tstruct _ as typ -> Sil.Tptr (typ, Sil.Pk_pointer)
|
|
|
|
| typ -> typ in
|
|
|
|
exec_skip_call ret_typ
|
|
|
|
| Some summary when call_should_be_skipped pname summary ->
|
|
|
|
exec_skip_call summary.Specs.attributes.ProcAttributes.ret_type
|
|
|
|
| Some summary ->
|
|
|
|
sym_exec_call current_pdesc tenv norm_prop path ret_ids url_handled_args summary loc in
|
|
|
|
IList.fold_left (fun acc pname -> exec_one_pname pname @ acc) [] resolved_pnames
|
|
|
|
|
|
|
|
| Sil.Call (ret_ids, Sil.Const (Sil.Cfun callee_pname), actual_params, loc, call_flags) ->
|
|
|
|
(** Generic fun call with known name *)
|
|
|
|
let (prop_r, n_actual_params) = normalize_params current_pname prop_ actual_params in
|
|
|
|
let resolved_pname =
|
|
|
|
match resolve_virtual_pname tenv prop_r n_actual_params callee_pname call_flags with
|
|
|
|
| resolved_pname :: _ -> resolved_pname
|
|
|
|
| [] -> callee_pname in
|
|
|
|
|
|
|
|
Ondemand.analyze_proc_name ~propagate_exceptions:true current_pdesc resolved_pname;
|
|
|
|
|
|
|
|
let callee_pdesc_opt = Ondemand.get_proc_desc resolved_pname in
|
|
|
|
|
|
|
|
let ret_typ_opt = Option.map Cfg.Procdesc.get_ret_type callee_pdesc_opt in
|
|
|
|
let sentinel_result =
|
|
|
|
if !Config.curr_language = Config.C_CPP then
|
|
|
|
sym_exe_check_variadic_sentinel_if_present
|
|
|
|
{ Builtin.pdesc = current_pdesc;
|
|
|
|
instr;
|
|
|
|
tenv;
|
|
|
|
prop_ = prop_r;
|
|
|
|
path;
|
|
|
|
ret_ids;
|
|
|
|
args = actual_params;
|
|
|
|
proc_name = callee_pname;
|
|
|
|
loc;
|
|
|
|
}
|
|
|
|
else [(prop_r, path)] in
|
|
|
|
let do_call (prop, path) =
|
|
|
|
let attrs_opt = Option.map Cfg.Procdesc.get_attributes callee_pdesc_opt in
|
|
|
|
let objc_property_accessor =
|
|
|
|
match attrs_opt with
|
|
|
|
| Some attrs -> attrs.ProcAttributes.objc_accessor
|
|
|
|
| None -> None in
|
|
|
|
let summary = Specs.get_summary resolved_pname in
|
|
|
|
let should_skip resolved_pname summary =
|
|
|
|
match summary with
|
|
|
|
| None -> true
|
|
|
|
| Some summary -> call_should_be_skipped resolved_pname summary in
|
|
|
|
if should_skip resolved_pname summary then
|
|
|
|
(* If it's an ObjC getter or setter, call the builtin rather than skipping *)
|
|
|
|
match objc_property_accessor with
|
|
|
|
| Some objc_property_accessor ->
|
|
|
|
handle_objc_method_call
|
|
|
|
n_actual_params n_actual_params prop tenv ret_ids
|
|
|
|
current_pdesc callee_pname loc path
|
|
|
|
(sym_exec_objc_accessor objc_property_accessor ret_typ_opt)
|
|
|
|
| None ->
|
|
|
|
skip_call prop path resolved_pname loc ret_ids ret_typ_opt n_actual_params
|
|
|
|
else
|
|
|
|
sym_exec_call
|
|
|
|
current_pdesc tenv prop path ret_ids n_actual_params (Option.get summary) loc in
|
|
|
|
IList.flatten (IList.map do_call sentinel_result)
|
|
|
|
| Sil.Call (ret_ids, fun_exp, actual_params, loc, call_flags) -> (** Call via function pointer *)
|
|
|
|
let (prop_r, n_actual_params) = normalize_params current_pname prop_ actual_params in
|
|
|
|
if call_flags.Sil.cf_is_objc_block then
|
|
|
|
Rearrange.check_call_to_objc_block_error current_pdesc prop_r fun_exp loc;
|
|
|
|
Rearrange.check_dereference_error current_pdesc prop_r fun_exp loc;
|
|
|
|
if call_flags.Sil.cf_noreturn then begin
|
|
|
|
L.d_str "Unknown function pointer with noreturn attribute ";
|
|
|
|
Sil.d_exp fun_exp; L.d_strln ", diverging.";
|
|
|
|
execute_diverge prop_r path
|
|
|
|
end else begin
|
|
|
|
L.d_str "Unknown function pointer "; Sil.d_exp fun_exp;
|
|
|
|
L.d_strln ", returning undefined value.";
|
|
|
|
let callee_pname = Procname.from_string_c_fun "__function_pointer__" in
|
|
|
|
call_unknown_or_scan
|
|
|
|
tenv false current_pdesc prop_r path ret_ids None n_actual_params callee_pname loc
|
|
|
|
end
|
|
|
|
| Sil.Nullify (pvar, _, deallocate) ->
|
|
|
|
begin
|
|
|
|
let eprop = Prop.expose prop_ in
|
|
|
|
match IList.partition
|
|
|
|
(function
|
|
|
|
| Sil.Hpointsto (Sil.Lvar pvar', _, _) -> Sil.pvar_equal pvar pvar'
|
|
|
|
| _ -> false) (Prop.get_sigma eprop) with
|
|
|
|
| [Sil.Hpointsto(e, se, typ)], sigma' ->
|
|
|
|
let sigma'' = match deallocate with
|
|
|
|
| false ->
|
|
|
|
let se' = execute_nullify_se se in
|
|
|
|
Sil.Hpointsto(e, se', typ):: sigma'
|
|
|
|
| true -> sigma' in
|
|
|
|
let eprop_res = Prop.replace_sigma sigma'' eprop in
|
|
|
|
ret_old_path [Prop.normalize eprop_res]
|
|
|
|
| _ -> assert false
|
|
|
|
end
|
|
|
|
| Sil.Abstract _ ->
|
|
|
|
let node = State.get_node () in
|
|
|
|
let blocks_nullified = get_blocks_nullified node in
|
|
|
|
IList.iter (check_block_retain_cycle tenv current_pname prop_) blocks_nullified;
|
|
|
|
if Prover.check_inconsistency prop_
|
|
|
|
then
|
|
|
|
ret_old_path []
|
|
|
|
else
|
|
|
|
ret_old_path
|
|
|
|
[Abs.remove_redundant_array_elements current_pname tenv
|
|
|
|
(Abs.abstract current_pname tenv prop_)]
|
|
|
|
| Sil.Remove_temps (temps, _) ->
|
|
|
|
ret_old_path [Prop.exist_quantify (Sil.fav_from_list temps) prop_]
|
|
|
|
| Sil.Declare_locals (ptl, _) ->
|
|
|
|
let sigma_locals =
|
|
|
|
let add_None (x, y) = (x, Sil.Sizeof (y, Sil.Subtype.exact), None) in
|
|
|
|
let sigma_locals () =
|
|
|
|
IList.map
|
|
|
|
(Prop.mk_ptsto_lvar (Some tenv) Prop.Fld_init Sil.inst_initial)
|
|
|
|
(IList.map add_None ptl) in
|
|
|
|
run_in_re_execution_mode (* no footprint vars for locals *)
|
|
|
|
sigma_locals () in
|
|
|
|
let sigma' = Prop.get_sigma prop_ @ sigma_locals in
|
|
|
|
let prop' = Prop.normalize (Prop.replace_sigma sigma' prop_) in
|
|
|
|
ret_old_path [prop']
|
|
|
|
| Sil.Stackop _ -> (* this should be handled at the propset level *)
|
|
|
|
assert false
|
|
|
|
| Sil.Goto_node (node_e, _) ->
|
|
|
|
let n_node_e, prop = exp_norm_check_arith current_pname prop_ node_e in
|
|
|
|
begin
|
|
|
|
match n_node_e with
|
|
|
|
| Sil.Const (Sil.Cint i) ->
|
|
|
|
let node_id = Sil.Int.to_int i in
|
|
|
|
State.set_goto_node node_id;
|
|
|
|
[(prop, path)]
|
|
|
|
| _ -> (* target not known, do nothing as the next nodes
|
|
|
|
are set to the possible targets by the front-end *)
|
|
|
|
[(prop, path)]
|
|
|
|
end
|
|
|
|
and execute_diverge prop path =
|
|
|
|
State.add_diverging_states (Paths.PathSet.from_renamed_list [(prop, path)]); (* diverge *)
|
|
|
|
[]
|
|
|
|
|
|
|
|
(** Like sym_exec but for generated instructions.
|
|
|
|
If errors occur and [mask_errors] is false, just treat as skip.*)
|
|
|
|
and sym_exec_generated mask_errors tenv pdesc instrs ppl =
|
|
|
|
let exe_instr instr (p, path) =
|
|
|
|
L.d_str "Executing Generated Instruction "; Sil.d_instr instr; L.d_ln ();
|
|
|
|
try sym_exec tenv pdesc instr p path
|
|
|
|
with exn when exn_not_failure exn && mask_errors ->
|
|
|
|
let err_name, _, ml_source, _ , _, _, _ = Exceptions.recognize_exception exn in
|
|
|
|
let loc = (match ml_source with
|
|
|
|
| Some ml_loc -> "at " ^ (ml_loc_to_string ml_loc)
|
|
|
|
| None -> "") in
|
|
|
|
L.d_warning
|
|
|
|
("Generated Instruction Failed with: " ^
|
|
|
|
(Localise.to_string err_name)^loc ); L.d_ln();
|
|
|
|
[(p, path)] in
|
|
|
|
let f plist instr = IList.flatten (IList.map (exe_instr instr) plist) in
|
|
|
|
IList.fold_left f ppl instrs
|
|
|
|
|
|
|
|
and add_constraints_on_actuals_by_ref tenv prop actuals_by_ref callee_pname callee_loc =
|
|
|
|
(* replace an hpred of the form actual_var |-> _ with new_hpred in prop *)
|
|
|
|
let replace_actual_hpred actual_var new_hpred prop =
|
|
|
|
let sigma' =
|
|
|
|
IList.map
|
|
|
|
(function
|
|
|
|
| Sil.Hpointsto (lhs, _, _) when Sil.exp_equal lhs actual_var -> new_hpred
|
|
|
|
| hpred -> hpred)
|
|
|
|
(Prop.get_sigma prop) in
|
|
|
|
Prop.normalize (Prop.replace_sigma sigma' prop) in
|
|
|
|
if !Config.angelic_execution then
|
|
|
|
let add_actual_by_ref_to_footprint prop (actual, actual_typ) =
|
|
|
|
match actual with
|
|
|
|
| Sil.Lvar actual_pv ->
|
|
|
|
(* introduce a fresh program variable to allow abduction on the return value *)
|
|
|
|
let abducted_ref_pv =
|
|
|
|
Sil.mk_pvar_abducted_ref_param callee_pname actual_pv callee_loc in
|
|
|
|
let already_has_abducted_retval p =
|
|
|
|
IList.exists
|
|
|
|
(fun hpred -> match hpred with
|
|
|
|
| Sil.Hpointsto (Sil.Lvar pv, _, _) -> Sil.pvar_equal pv abducted_ref_pv
|
|
|
|
| _ -> false)
|
|
|
|
(Prop.get_sigma_footprint p) in
|
|
|
|
(* prevent introducing multiple abducted retvals for a single call site in a loop *)
|
|
|
|
if already_has_abducted_retval prop then prop
|
|
|
|
else
|
|
|
|
if !Config.footprint then
|
|
|
|
let prop', abduced_strexp = match actual_typ with
|
|
|
|
| Sil.Tptr ((Sil.Tstruct _) as typ, _) ->
|
|
|
|
(* for struct types passed by reference, do abduction on the fields of the
|
|
|
|
struct *)
|
|
|
|
add_struct_value_to_footprint tenv abducted_ref_pv typ prop
|
|
|
|
| Sil.Tptr (typ, _) ->
|
|
|
|
(* for pointer types passed by reference, do abduction directly on the pointer *)
|
|
|
|
let (prop', fresh_fp_var) =
|
|
|
|
add_to_footprint abducted_ref_pv typ prop in
|
|
|
|
prop', Sil.Eexp (fresh_fp_var, Sil.Inone)
|
|
|
|
| typ ->
|
|
|
|
failwith
|
|
|
|
("No need for abduction on non-pointer type " ^
|
|
|
|
(Sil.typ_to_string typ)) in
|
|
|
|
(* replace [actual] |-> _ with [actual] |-> [fresh_fp_var] *)
|
|
|
|
let filtered_sigma =
|
|
|
|
IList.map
|
|
|
|
(function
|
|
|
|
| Sil.Hpointsto (lhs, _, typ_exp) when Sil.exp_equal lhs actual ->
|
|
|
|
Sil.Hpointsto (lhs, abduced_strexp, typ_exp)
|
|
|
|
| hpred -> hpred)
|
|
|
|
(Prop.get_sigma prop') in
|
|
|
|
Prop.normalize (Prop.replace_sigma filtered_sigma prop')
|
|
|
|
else
|
|
|
|
(* bind actual passed by ref to the abducted value pointed to by the synthetic pvar *)
|
|
|
|
let prop' =
|
|
|
|
let filtered_sigma =
|
|
|
|
IList.filter
|
|
|
|
(function
|
|
|
|
| Sil.Hpointsto (lhs, _, _) when Sil.exp_equal lhs actual ->
|
|
|
|
false
|
|
|
|
| _ -> true)
|
|
|
|
(Prop.get_sigma prop) in
|
|
|
|
Prop.normalize (Prop.replace_sigma filtered_sigma prop) in
|
|
|
|
IList.fold_left
|
|
|
|
(fun p hpred ->
|
|
|
|
match hpred with
|
|
|
|
| Sil.Hpointsto (Sil.Lvar pv, rhs, texp) when Sil.pvar_equal pv abducted_ref_pv ->
|
|
|
|
let new_hpred = Sil.Hpointsto (actual, rhs, texp) in
|
|
|
|
Prop.normalize (Prop.replace_sigma (new_hpred :: (Prop.get_sigma prop')) p)
|
|
|
|
| _ -> p)
|
|
|
|
prop'
|
|
|
|
(Prop.get_sigma prop')
|
|
|
|
| _ -> assert false in
|
|
|
|
IList.fold_left add_actual_by_ref_to_footprint prop actuals_by_ref
|
|
|
|
else
|
|
|
|
(* non-angelic mode; havoc each var passed by reference by assigning it to a fresh id *)
|
|
|
|
let havoc_actual_by_ref (actual, actual_typ) prop =
|
|
|
|
let actual_pt_havocd_var =
|
|
|
|
let havocd_var = Sil.Var (Ident.create_fresh Ident.kprimed) in
|
|
|
|
let sizeof_exp = Sil.Sizeof (Sil.typ_strip_ptr actual_typ, Sil.Subtype.subtypes) in
|
|
|
|
Prop.mk_ptsto actual (Sil.Eexp (havocd_var, Sil.Inone)) sizeof_exp in
|
|
|
|
replace_actual_hpred actual actual_pt_havocd_var prop in
|
|
|
|
IList.fold_left (fun p var -> havoc_actual_by_ref var p) prop actuals_by_ref
|
|
|
|
|
|
|
|
and check_untainted exp caller_pname callee_pname prop =
|
|
|
|
match Prop.get_taint_attribute prop exp with
|
|
|
|
| Some (Sil.Ataint source_pname) ->
|
|
|
|
let err_desc =
|
|
|
|
Errdesc.explain_tainted_value_reaching_sensitive_function
|
|
|
|
prop
|
|
|
|
exp
|
|
|
|
source_pname
|
|
|
|
callee_pname
|
|
|
|
(State.get_loc ()) in
|
|
|
|
let exn =
|
|
|
|
Exceptions.Tainted_value_reaching_sensitive_function
|
|
|
|
(err_desc, __POS__) in
|
|
|
|
Reporting.log_warning caller_pname exn;
|
|
|
|
Prop.add_or_replace_exp_attribute prop exp (Sil.Auntaint)
|
|
|
|
| _ ->
|
|
|
|
if !Config.footprint then
|
|
|
|
let untaint_attr = Sil.Const (Sil.Cattribute (Sil.Auntaint)) in
|
|
|
|
(* add untained(n_lexp) to the footprint *)
|
|
|
|
Prop.conjoin_neq ~footprint:true exp untaint_attr prop
|
|
|
|
else prop
|
|
|
|
|
|
|
|
(** execute a call for an unknown or scan function *)
|
|
|
|
and call_unknown_or_scan tenv is_scan pdesc pre path
|
|
|
|
ret_ids ret_type_option actual_pars callee_pname loc =
|
|
|
|
let remove_file_attribute prop =
|
|
|
|
let do_exp p (e, _) =
|
|
|
|
let do_attribute q = function
|
|
|
|
| Sil.Aresource res_action as res
|
|
|
|
when res_action.Sil.ra_res = Sil.Rfile ->
|
|
|
|
Prop.remove_attribute res q
|
|
|
|
| _ -> q in
|
|
|
|
IList.fold_left do_attribute p (Prop.get_exp_attributes p e) in
|
|
|
|
IList.fold_left do_exp prop actual_pars in
|
|
|
|
let add_tainted_pre prop actuals caller_pname callee_pname =
|
|
|
|
if !Config.taint_analysis then
|
|
|
|
match Taint.accepts_sensitive_params callee_pname with
|
|
|
|
| [] -> prop
|
|
|
|
| param_nums ->
|
|
|
|
let check_taint_if_nums_match (prop_acc, param_num) (actual_exp, _actual_typ) =
|
|
|
|
let prop_acc' =
|
|
|
|
if IList.exists (fun num -> num = param_num) param_nums
|
|
|
|
then check_untainted actual_exp caller_pname callee_pname prop_acc
|
|
|
|
else prop_acc in
|
|
|
|
prop_acc', param_num + 1 in
|
|
|
|
IList.fold_left
|
|
|
|
check_taint_if_nums_match
|
|
|
|
(prop, 0)
|
|
|
|
actuals
|
|
|
|
|> fst
|
|
|
|
else prop in
|
|
|
|
let actuals_by_ref =
|
|
|
|
IList.filter
|
|
|
|
(function
|
|
|
|
| Sil.Lvar _, Sil.Tptr _ -> true
|
|
|
|
| _ -> false)
|
|
|
|
actual_pars in
|
|
|
|
let pre_final =
|
|
|
|
(* in Java, assume that skip functions close resources passed as params *)
|
|
|
|
let pre_1 = if !Config.curr_language = Config.Java then remove_file_attribute pre else pre in
|
|
|
|
let pre_2 = match ret_ids, ret_type_option with
|
|
|
|
| [ret_id], Some ret_typ ->
|
|
|
|
add_constraints_on_retval pdesc pre_1 (Sil.Var ret_id) ret_typ callee_pname loc
|
|
|
|
| _ -> pre_1 in
|
|
|
|
let pre_3 = add_constraints_on_actuals_by_ref tenv pre_2 actuals_by_ref callee_pname loc in
|
|
|
|
let caller_pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
add_tainted_pre pre_3 actual_pars caller_pname callee_pname in
|
|
|
|
if is_scan (* if scan function, don't mark anything with undef attributes *)
|
|
|
|
then [(Tabulation.remove_constant_string_class pre_final, path)]
|
|
|
|
else
|
|
|
|
(* otherwise, add undefined attribute to retvals and actuals passed by ref *)
|
|
|
|
let exps_to_mark =
|
|
|
|
let ret_exps = IList.map (fun ret_id -> Sil.Var ret_id) ret_ids in
|
|
|
|
IList.fold_left
|
|
|
|
(fun exps_to_mark (exp, _) -> exp :: exps_to_mark) ret_exps actuals_by_ref in
|
|
|
|
let path_pos = State.get_path_pos () in
|
|
|
|
[(Prop.mark_vars_as_undefined pre_final exps_to_mark callee_pname loc path_pos, path)]
|
|
|
|
|
|
|
|
and sym_exe_check_variadic_sentinel
|
|
|
|
?(fails_on_nil = false) n_formals (sentinel, null_pos)
|
|
|
|
{ Builtin.pdesc; tenv; prop_; path; args; proc_name; loc; }
|
|
|
|
=
|
|
|
|
(* from clang's lib/Sema/SemaExpr.cpp: *)
|
|
|
|
(* "nullPos" is the number of formal parameters at the end which *)
|
|
|
|
(* effectively count as part of the variadic arguments. This is *)
|
|
|
|
(* useful if you would prefer to not have *any* formal parameters, *)
|
|
|
|
(* but the language forces you to have at least one. *)
|
|
|
|
let first_var_arg_pos = if null_pos > n_formals then 0 else n_formals - null_pos in
|
|
|
|
let nargs = IList.length args in
|
|
|
|
(* sentinels start counting from the last argument to the function *)
|
|
|
|
let sentinel_pos = nargs - sentinel - 1 in
|
|
|
|
let mk_non_terminal_argsi (acc, i) a =
|
|
|
|
if i < first_var_arg_pos || i >= sentinel_pos then (acc, i +1)
|
|
|
|
else ((a, i):: acc, i +1) in
|
|
|
|
(* IList.fold_left reverses the arguments *)
|
|
|
|
let non_terminal_argsi = fst (IList.fold_left mk_non_terminal_argsi ([], 0) args) in
|
|
|
|
let check_allocated result ((lexp, typ), i) =
|
|
|
|
(* simulate a Letderef for [lexp] *)
|
|
|
|
let tmp_id_deref = Ident.create_fresh Ident.kprimed in
|
|
|
|
let letderef = Sil.Letderef (tmp_id_deref, lexp, typ, loc) in
|
|
|
|
try
|
|
|
|
sym_exec_generated false tenv pdesc [letderef] result
|
|
|
|
with e when exn_not_failure e ->
|
|
|
|
if not fails_on_nil then
|
|
|
|
let deref_str = Localise.deref_str_nil_argument_in_variadic_method proc_name nargs i in
|
|
|
|
let err_desc =
|
|
|
|
Errdesc.explain_dereference ~use_buckets: true ~is_premature_nil: true
|
|
|
|
deref_str prop_ loc in
|
|
|
|
raise (Exceptions.Premature_nil_termination (err_desc, __POS__))
|
|
|
|
else
|
|
|
|
raise e in
|
|
|
|
(* IList.fold_left reverses the arguments back so that we report an *)
|
|
|
|
(* error on the first premature nil argument *)
|
|
|
|
IList.fold_left check_allocated [(prop_, path)] non_terminal_argsi
|
|
|
|
|
|
|
|
and sym_exe_check_variadic_sentinel_if_present
|
|
|
|
({ Builtin.prop_; path; proc_name; } as builtin_args) =
|
|
|
|
match Specs.proc_resolve_attributes proc_name with
|
|
|
|
| None ->
|
|
|
|
[(prop_, path)]
|
|
|
|
| Some callee_attributes ->
|
|
|
|
match Sil.get_sentinel_func_attribute_value
|
|
|
|
callee_attributes.ProcAttributes.func_attributes with
|
|
|
|
| None -> [(prop_, path)]
|
|
|
|
| Some sentinel_arg ->
|
|
|
|
let formals = callee_attributes.ProcAttributes.formals in
|
|
|
|
sym_exe_check_variadic_sentinel (IList.length formals) sentinel_arg builtin_args
|
|
|
|
|
|
|
|
and sym_exec_objc_getter field_name ret_typ_opt tenv ret_ids pdesc pname loc args prop =
|
|
|
|
L.d_strln ("No custom getter found. Executing the ObjC builtin getter with ivar "^
|
|
|
|
(Ident.fieldname_to_string field_name)^".");
|
|
|
|
let ret_id =
|
|
|
|
match ret_ids with
|
|
|
|
| [ret_id] -> ret_id
|
|
|
|
| _ -> assert false in
|
|
|
|
let ret_typ =
|
|
|
|
match ret_typ_opt with
|
|
|
|
| Some ret_typ -> ret_typ
|
|
|
|
| None -> assert false in
|
|
|
|
match args with
|
|
|
|
| [(lexp, typ)] ->
|
|
|
|
let typ' = (match Tenv.expand_type tenv typ with
|
|
|
|
| Sil.Tstruct _ as s -> s
|
|
|
|
| Sil.Tptr (t, _) -> Tenv.expand_type tenv t
|
|
|
|
| _ -> assert false) in
|
|
|
|
let field_access_exp = Sil.Lfield (lexp, field_name, typ') in
|
|
|
|
execute_letderef
|
|
|
|
~report_deref_errors:false pname pdesc tenv ret_id field_access_exp ret_typ loc prop
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
and sym_exec_objc_setter field_name _ tenv _ pdesc pname loc args prop =
|
|
|
|
L.d_strln ("No custom setter found. Executing the ObjC builtin setter with ivar "^
|
|
|
|
(Ident.fieldname_to_string field_name)^".");
|
|
|
|
match args with
|
|
|
|
| (lexp1, typ1) :: (lexp2, typ2)::_ ->
|
|
|
|
let typ1' = (match Tenv.expand_type tenv typ1 with
|
|
|
|
| Sil.Tstruct _ as s -> s
|
|
|
|
| Sil.Tptr (t, _) -> Tenv.expand_type tenv t
|
|
|
|
| _ -> assert false) in
|
|
|
|
let field_access_exp = Sil.Lfield (lexp1, field_name, typ1') in
|
|
|
|
execute_set ~report_deref_errors:false pname pdesc tenv field_access_exp typ2 lexp2 loc prop
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
and sym_exec_objc_accessor property_accesor ret_typ_opt tenv ret_ids pdesc _ loc args prop path
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
let f_accessor =
|
|
|
|
match property_accesor with
|
|
|
|
| ProcAttributes.Objc_getter field_name -> sym_exec_objc_getter field_name
|
|
|
|
| ProcAttributes.Objc_setter field_name -> sym_exec_objc_setter field_name in
|
|
|
|
(* we want to execute in the context of the current procedure, not in the context of callee_pname,
|
|
|
|
since this is the procname of the setter/getter method *)
|
|
|
|
let cur_pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
f_accessor ret_typ_opt tenv ret_ids pdesc cur_pname loc args prop
|
|
|
|
|> IList.map (fun p -> (p, path))
|
|
|
|
|
|
|
|
(** Perform symbolic execution for a function call *)
|
|
|
|
and sym_exec_call pdesc tenv pre path ret_ids actual_pars summary loc =
|
|
|
|
let caller_pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let callee_pname = Specs.get_proc_name summary in
|
|
|
|
let ret_typ = Specs.get_ret_type summary in
|
|
|
|
let check_return_value_ignored () =
|
|
|
|
(* check if the return value of the call is ignored, and issue a warning *)
|
|
|
|
let is_ignored = match ret_typ, ret_ids with
|
|
|
|
| Sil.Tvoid, _ -> false
|
|
|
|
| Sil.Tint _, _ when not (proc_is_defined callee_pname) ->
|
|
|
|
(* if the proc returns Tint and is not defined, *)
|
|
|
|
(* don't report ignored return value *)
|
|
|
|
false
|
|
|
|
| _, [] -> true
|
|
|
|
| _, [id] -> Errdesc.id_is_assigned_then_dead (State.get_node ()) id
|
|
|
|
| _ -> false in
|
|
|
|
if is_ignored
|
|
|
|
&& Specs.get_flag callee_pname proc_flag_ignore_return = None then
|
|
|
|
let err_desc = Localise.desc_return_value_ignored callee_pname loc in
|
|
|
|
let exn = (Exceptions.Return_value_ignored (err_desc, __POS__)) in
|
|
|
|
let pre_opt = State.get_normalized_pre (Abs.abstract_no_symop caller_pname) in
|
|
|
|
Reporting.log_warning caller_pname ~pre: pre_opt exn in
|
|
|
|
check_inherently_dangerous_function caller_pname callee_pname;
|
|
|
|
begin
|
|
|
|
let formal_types = IList.map (fun (_, typ) -> typ) (Specs.get_formals summary) in
|
|
|
|
let rec comb actual_pars formal_types =
|
|
|
|
match actual_pars, formal_types with
|
|
|
|
| [], [] -> actual_pars
|
|
|
|
| (e, t_e):: etl', _:: tl' ->
|
|
|
|
(e, t_e) :: comb etl' tl'
|
|
|
|
| _,[] ->
|
|
|
|
Errdesc.warning_err
|
|
|
|
(State.get_loc ())
|
|
|
|
"likely use of variable-arguments function, or function prototype missing@.";
|
|
|
|
L.d_warning
|
|
|
|
"likely use of variable-arguments function, or function prototype missing";
|
|
|
|
L.d_ln();
|
|
|
|
L.d_str "actual parameters: "; Sil.d_exp_list (IList.map fst actual_pars); L.d_ln ();
|
|
|
|
L.d_str "formal parameters: "; Sil.d_typ_list formal_types; L.d_ln ();
|
|
|
|
actual_pars
|
|
|
|
| [], _ ->
|
|
|
|
L.d_str ("**** ERROR: Procedure " ^ Procname.to_string callee_pname);
|
|
|
|
L.d_strln (" mismatch in the number of parameters ****");
|
|
|
|
L.d_str "actual parameters: "; Sil.d_exp_list (IList.map fst actual_pars); L.d_ln ();
|
|
|
|
L.d_str "formal parameters: "; Sil.d_typ_list formal_types; L.d_ln ();
|
|
|
|
raise (Exceptions.Wrong_argument_number __POS__) in
|
|
|
|
let actual_params = comb actual_pars formal_types in
|
|
|
|
(* Actual parameters are associated to their formal
|
|
|
|
parameter type if there are enough formal parameters, and
|
|
|
|
to their actual type otherwise. The latter case happens
|
|
|
|
with variable - arguments functions *)
|
|
|
|
check_return_value_ignored ();
|
|
|
|
(* In case we call an objc instance method we add and extra spec *)
|
|
|
|
(* were the receiver is null and the semantics of the call is nop*)
|
|
|
|
if (!Config.curr_language <> Config.Java) && !Config.objc_method_call_semantics &&
|
|
|
|
(Specs.get_attributes summary).ProcAttributes.is_objc_instance_method then
|
|
|
|
handle_objc_method_call actual_pars actual_params pre tenv ret_ids pdesc callee_pname loc
|
|
|
|
path Tabulation.exe_function_call
|
|
|
|
else (* non-objective-c method call. Standard tabulation *)
|
|
|
|
Tabulation.exe_function_call
|
|
|
|
tenv ret_ids pdesc callee_pname loc actual_params pre path
|
|
|
|
end
|
|
|
|
|
|
|
|
(** perform symbolic execution for a single prop, and check for junk *)
|
|
|
|
and sym_exec_wrapper handle_exn tenv pdesc instr ((prop: Prop.normal Prop.t), path)
|
|
|
|
: Paths.PathSet.t =
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let prop_primed_to_normal p = (** Rename primed vars with fresh normal vars, and return them *)
|
|
|
|
let fav = Prop.prop_fav p in
|
|
|
|
Sil.fav_filter_ident fav Ident.is_primed;
|
|
|
|
let ids_primed = Sil.fav_to_list fav in
|
|
|
|
let ids_primed_normal =
|
|
|
|
IList.map (fun id -> (id, Ident.create_fresh Ident.knormal)) ids_primed in
|
|
|
|
let ren_sub =
|
|
|
|
Sil.sub_of_list (IList.map
|
|
|
|
(fun (id1, id2) -> (id1, Sil.Var id2)) ids_primed_normal) in
|
|
|
|
let p' = Prop.normalize (Prop.prop_sub ren_sub p) in
|
|
|
|
let fav_normal = Sil.fav_from_list (IList.map snd ids_primed_normal) in
|
|
|
|
p', fav_normal in
|
|
|
|
let prop_normal_to_primed fav_normal p = (* rename given normal vars to fresh primed *)
|
|
|
|
if Sil.fav_to_list fav_normal = [] then p
|
|
|
|
else Prop.exist_quantify fav_normal p in
|
|
|
|
try
|
|
|
|
let pre_process_prop p =
|
|
|
|
let p', fav =
|
|
|
|
if Sil.instr_is_auxiliary instr
|
|
|
|
then p, Sil.fav_new ()
|
|
|
|
else prop_primed_to_normal p in
|
|
|
|
let p'' =
|
|
|
|
let map_res_action e ra = (* update the vpath in resource attributes *)
|
|
|
|
let vpath, _ = Errdesc.vpath_find p' e in
|
|
|
|
{ ra with Sil.ra_vpath = vpath } in
|
|
|
|
Prop.attribute_map_resource p' map_res_action in
|
|
|
|
p'', fav in
|
|
|
|
let post_process_result fav_normal p path =
|
|
|
|
let p' = prop_normal_to_primed fav_normal p in
|
|
|
|
State.set_path path None;
|
|
|
|
let node_has_abstraction node =
|
|
|
|
let instr_is_abstraction = function
|
|
|
|
| Sil.Abstract _ -> true
|
|
|
|
| _ -> false in
|
|
|
|
IList.exists instr_is_abstraction (Cfg.Node.get_instrs node) in
|
|
|
|
let curr_node = State.get_node () in
|
|
|
|
match Cfg.Node.get_kind curr_node with
|
|
|
|
| Cfg.Node.Prune_node _ when not (node_has_abstraction curr_node) ->
|
|
|
|
(* don't check for leaks in prune nodes, unless there is abstraction anyway,*)
|
|
|
|
(* but force them into either branch *)
|
|
|
|
p'
|
|
|
|
| _ ->
|
|
|
|
check_deallocate_static_memory (Abs.abstract_junk ~original_prop: p pname tenv p') in
|
|
|
|
L.d_str "Instruction "; Sil.d_instr instr; L.d_ln ();
|
|
|
|
let prop', fav_normal = pre_process_prop prop in
|
|
|
|
let res_list =
|
|
|
|
run_with_abs_val_equal_zero (* no exp abstraction during sym exe *)
|
|
|
|
(fun () -> sym_exec tenv pdesc instr prop' path)
|
|
|
|
() in
|
|
|
|
let res_list_nojunk =
|
|
|
|
IList.map
|
|
|
|
(fun (p, path) -> (post_process_result fav_normal p path, path))
|
|
|
|
res_list in
|
|
|
|
let results =
|
|
|
|
IList.map
|
|
|
|
(fun (p, path) -> (Prop.prop_rename_primed_footprint_vars p, path))
|
|
|
|
res_list_nojunk in
|
|
|
|
L.d_strln "Instruction Returns";
|
|
|
|
Propgraph.d_proplist prop (IList.map fst results); L.d_ln ();
|
|
|
|
State.mark_instr_ok ();
|
|
|
|
Paths.PathSet.from_renamed_list results
|
|
|
|
with exn when Exceptions.handle_exception exn && !Config.footprint ->
|
|
|
|
handle_exn exn; (* calls State.mark_instr_fail *)
|
|
|
|
if !Config.nonstop
|
|
|
|
then
|
|
|
|
(* in nonstop mode treat the instruction as skip *)
|
|
|
|
(Paths.PathSet.from_renamed_list [(prop, path)])
|
|
|
|
else
|
|
|
|
Paths.PathSet.empty
|
|
|
|
|
|
|
|
(** {2 Lifted Abstract Transfer Functions} *)
|
|
|
|
|
|
|
|
let lifted_sym_exec
|
|
|
|
handle_exn tenv pdesc (pset : Paths.PathSet.t) node (instrs : Sil.instr list)
|
|
|
|
: Paths.PathSet.t =
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let exe_instr_prop instr p tr (pset1: Paths.PathSet.t) =
|
|
|
|
let pset2 =
|
|
|
|
if Tabulation.prop_is_exn pname p && not (Sil.instr_is_auxiliary instr)
|
|
|
|
&& Cfg.Node.get_kind node <> Cfg.Node.exn_handler_kind
|
|
|
|
(* skip normal instructions if an exception was thrown,
|
|
|
|
unless this is an exception handler node *)
|
|
|
|
then
|
|
|
|
begin
|
|
|
|
L.d_str "Skipping instr "; Sil.d_instr instr; L.d_strln " due to exception";
|
|
|
|
Paths.PathSet.from_renamed_list [(p, tr)]
|
|
|
|
end
|
|
|
|
else sym_exec_wrapper handle_exn tenv pdesc instr (p, tr) in
|
|
|
|
Paths.PathSet.union pset2 pset1 in
|
|
|
|
let exe_instr_pset (pset, stack) instr = (** handle a single instruction at the set level *)
|
|
|
|
let pp_stack_instr pset' =
|
|
|
|
L.d_str "Stack Instruction "; Sil.d_instr instr; L.d_ln ();
|
|
|
|
L.d_strln "Stack Instruction Returns";
|
|
|
|
Propset.d Prop.prop_emp (Paths.PathSet.to_propset pset'); L.d_ln () in
|
|
|
|
match instr, stack with
|
|
|
|
| Sil.Stackop (Sil.Push, _), _ ->
|
|
|
|
pp_stack_instr pset;
|
|
|
|
(pset, pset :: stack)
|
|
|
|
| Sil.Stackop (Sil.Swap, _), (pset':: stack') ->
|
|
|
|
pp_stack_instr pset';
|
|
|
|
(pset', pset:: stack')
|
|
|
|
| Sil.Stackop (Sil.Pop, _), (pset':: stack') ->
|
|
|
|
let pset'' = Paths.PathSet.union pset pset' in
|
|
|
|
pp_stack_instr pset'';
|
|
|
|
(pset'', stack')
|
|
|
|
| Sil.Stackop _, _ -> (* should not happen *)
|
|
|
|
assert false
|
|
|
|
| _ ->
|
|
|
|
let pset' = Paths.PathSet.fold (exe_instr_prop instr) pset Paths.PathSet.empty in
|
|
|
|
(pset', stack) in
|
|
|
|
let stack = [] in
|
|
|
|
let pset', stack' = IList.fold_left exe_instr_pset (pset, stack) instrs in
|
|
|
|
if stack' != [] then assert false; (* final stack must be empty *)
|
|
|
|
pset'
|
|
|
|
|
|
|
|
(* ============== START of ModelBuiltins ============== *)
|
|
|
|
module ModelBuiltins = struct
|
|
|
|
(** This module contains models for the builtin functions supported *)
|
|
|
|
|
|
|
|
let execute___no_op prop path: Builtin.ret_typ =
|
|
|
|
[(prop, path)]
|
|
|
|
|
|
|
|
(** model va_arg as always returning 0 *)
|
|
|
|
let execute___builtin_va_arg { Builtin.pdesc; tenv; prop_; path; ret_ids; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args, ret_ids with
|
|
|
|
| [_; _; (lexp3, typ3)], _ ->
|
|
|
|
let instr' = Sil.Set (lexp3, typ3, Sil.exp_zero, loc) in
|
|
|
|
sym_exec_generated true tenv pdesc [instr'] [(prop_, path)]
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let mk_empty_array size =
|
|
|
|
Sil.Earray (size, [], Sil.inst_none)
|
|
|
|
|
|
|
|
(* Make a rearranged array. As it is rearranged when it appears in a precondition
|
|
|
|
it requires that the function is called with the array allocated. If not infer
|
|
|
|
return a null pointer deref *)
|
|
|
|
let mk_empty_array_rearranged size =
|
|
|
|
Sil.Earray (size, [], Sil.inst_rearrange true (State.get_loc ()) (State.get_path_pos ()))
|
|
|
|
|
|
|
|
let extract_array_type typ =
|
|
|
|
if (!Config.curr_language = Config.Java) then
|
|
|
|
match typ with
|
|
|
|
| Sil.Tptr ( Sil.Tarray (typ', _), _) -> Some typ'
|
|
|
|
| _ -> None
|
|
|
|
else
|
|
|
|
match typ with
|
|
|
|
| Sil.Tptr (typ', _) | Sil.Tarray (typ', _) ->
|
|
|
|
Some typ'
|
|
|
|
| _ -> None
|
|
|
|
|
|
|
|
(** Return a result from a procedure call. *)
|
|
|
|
let return_result e prop ret_ids =
|
|
|
|
match ret_ids with
|
|
|
|
| [ret_id] -> Prop.conjoin_eq e (Sil.Var ret_id) prop
|
|
|
|
| _ -> prop
|
|
|
|
|
|
|
|
(* Add an array of typ pointed to by lexp to prop_ if it doesnt exist alread*)
|
|
|
|
(* Return the new prop and the array size *)
|
|
|
|
(* Return None if it fails to add the array *)
|
|
|
|
let add_array_to_prop pdesc prop_ lexp typ =
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop_ lexp in
|
|
|
|
begin
|
|
|
|
try
|
|
|
|
let hpred = IList.find (function
|
|
|
|
| Sil.Hpointsto(e, _, _) -> Sil.exp_equal e n_lexp
|
|
|
|
| _ -> false) (Prop.get_sigma prop) in
|
|
|
|
match hpred with
|
|
|
|
| Sil.Hpointsto(_, Sil.Earray(size, _, _), _) ->
|
|
|
|
Some (size, prop)
|
|
|
|
| _ -> None (* e points to something but not an array *)
|
|
|
|
with Not_found -> (* e is not allocated, so we can add the array *)
|
|
|
|
let otyp' = (extract_array_type typ) in
|
|
|
|
match otyp' with
|
|
|
|
| Some typ' ->
|
|
|
|
let size = Sil.Var(Ident.create_fresh Ident.kfootprint) in
|
|
|
|
let s = mk_empty_array_rearranged size in
|
|
|
|
let hpred =
|
|
|
|
Prop.mk_ptsto n_lexp s (Sil.Sizeof(Sil.Tarray(typ', size), Sil.Subtype.exact)) in
|
|
|
|
let sigma = Prop.get_sigma prop in
|
|
|
|
let sigma_fp = Prop.get_sigma_footprint prop in
|
|
|
|
let prop'= Prop.replace_sigma (hpred:: sigma) prop in
|
|
|
|
let prop''= Prop.replace_sigma_footprint (hpred:: sigma_fp) prop' in
|
|
|
|
let prop''= Prop.normalize prop'' in
|
|
|
|
Some (size, prop'')
|
|
|
|
| _ -> None
|
|
|
|
end
|
|
|
|
|
|
|
|
(* Add an array in prop if it is not allocated.*)
|
|
|
|
let execute___require_allocated_array { Builtin.pdesc; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(lexp, typ)] when IList.length ret_ids <= 1 ->
|
|
|
|
(match add_array_to_prop pdesc prop_ lexp typ with
|
|
|
|
| None -> []
|
|
|
|
| Some (_, prop) -> [(prop, path)])
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute___get_array_size { Builtin.pdesc; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(lexp, typ)] when IList.length ret_ids <= 1 ->
|
|
|
|
(match add_array_to_prop pdesc prop_ lexp typ with
|
|
|
|
| None -> []
|
|
|
|
| Some (size, prop) -> [(return_result size prop ret_ids, path)])
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute___set_array_size { Builtin.pdesc; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args, ret_ids with
|
|
|
|
| [(lexp, typ); (size, _)], []->
|
|
|
|
(match add_array_to_prop pdesc prop_ lexp typ with
|
|
|
|
| None -> []
|
|
|
|
| Some (_, prop_a) -> (* Invariant: prop_a has an array pointed to by lexp *)
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop__ = exp_norm_check_arith pname prop_a lexp in
|
|
|
|
let n_size, prop = exp_norm_check_arith pname prop__ size in
|
|
|
|
let hpred, sigma' = IList.partition (function
|
|
|
|
| Sil.Hpointsto(e, _, _) -> Sil.exp_equal e n_lexp
|
|
|
|
| _ -> false) (Prop.get_sigma prop) in
|
|
|
|
(match hpred with
|
|
|
|
| [Sil.Hpointsto(e, Sil.Earray(_, esel, inst), t)] ->
|
|
|
|
let hpred' = Sil.Hpointsto (e, Sil.Earray (n_size, esel, inst), t) in
|
|
|
|
let prop' = Prop.replace_sigma (hpred':: sigma') prop in
|
|
|
|
[(Prop.normalize prop', path)]
|
|
|
|
| _ -> [])) (* by construction of prop_a this case is impossible *)
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute___print_value { Builtin.pdesc; prop_; path; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
L.err "__print_value: ";
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let do_arg (lexp, _) =
|
|
|
|
let n_lexp, _ = exp_norm_check_arith pname prop_ lexp in
|
|
|
|
L.err "%a " (Sil.pp_exp pe_text) n_lexp in
|
|
|
|
IList.iter do_arg args;
|
|
|
|
L.err "@.";
|
|
|
|
[(prop_, path)]
|
|
|
|
|
|
|
|
let is_undefined_opt prop n_lexp =
|
|
|
|
let is_undef =
|
|
|
|
Option.is_some (Prop.get_undef_attribute prop n_lexp) in
|
|
|
|
is_undef && (!Config.angelic_execution || !Config.optimistic_cast)
|
|
|
|
|
|
|
|
(** Creates an object in the heap with a given type,
|
|
|
|
when the object is not known to be null or when it doesn't
|
|
|
|
appear already in the heap. *)
|
|
|
|
let create_type tenv n_lexp typ prop =
|
|
|
|
let prop_type =
|
|
|
|
try
|
|
|
|
let _ = IList.find (function
|
|
|
|
| Sil.Hpointsto(e, _, _) -> Sil.exp_equal e n_lexp
|
|
|
|
| _ -> false) (Prop.get_sigma prop) in
|
|
|
|
prop
|
|
|
|
with Not_found ->
|
|
|
|
let mhpred =
|
|
|
|
match typ with
|
|
|
|
| Sil.Tptr (typ', _) ->
|
|
|
|
let sexp = Sil.Estruct ([], Sil.inst_none) in
|
|
|
|
let typ'' = Tenv.expand_type tenv typ' in
|
|
|
|
let texp = Sil.Sizeof (typ'', Sil.Subtype.subtypes) in
|
|
|
|
let hpred = Prop.mk_ptsto n_lexp sexp texp in
|
|
|
|
Some hpred
|
|
|
|
| Sil.Tarray _ ->
|
|
|
|
let size = Sil.Var(Ident.create_fresh Ident.kfootprint) in
|
|
|
|
let sexp = mk_empty_array size in
|
|
|
|
let texp = Sil.Sizeof (typ, Sil.Subtype.subtypes) in
|
|
|
|
let hpred = Prop.mk_ptsto n_lexp sexp texp in
|
|
|
|
Some hpred
|
|
|
|
| _ -> None in
|
|
|
|
match mhpred with
|
|
|
|
| Some hpred ->
|
|
|
|
let sigma = Prop.get_sigma prop in
|
|
|
|
let sigma_fp = Prop.get_sigma_footprint prop in
|
|
|
|
let prop'= Prop.replace_sigma (hpred:: sigma) prop in
|
|
|
|
let prop''=
|
|
|
|
let has_normal_variables =
|
|
|
|
Sil.fav_exists (Sil.exp_fav n_lexp) Ident.is_normal in
|
|
|
|
if (is_undefined_opt prop n_lexp) || has_normal_variables
|
|
|
|
then prop'
|
|
|
|
else Prop.replace_sigma_footprint (hpred:: sigma_fp) prop' in
|
|
|
|
let prop''= Prop.normalize prop'' in
|
|
|
|
prop''
|
|
|
|
| None -> prop in
|
|
|
|
let sil_is_null = Sil.BinOp (Sil.Eq, n_lexp, Sil.exp_zero) in
|
|
|
|
let sil_is_nonnull = Sil.UnOp (Sil.LNot, sil_is_null, None) in
|
|
|
|
let null_case = Propset.to_proplist (prune_prop sil_is_null prop) in
|
|
|
|
let non_null_case = Propset.to_proplist (prune_prop sil_is_nonnull prop_type) in
|
|
|
|
if ((IList.length non_null_case) > 0) && (!Config.footprint) then
|
|
|
|
non_null_case
|
|
|
|
else if ((IList.length non_null_case) > 0) && (is_undefined_opt prop n_lexp) then
|
|
|
|
non_null_case
|
|
|
|
else null_case @ non_null_case
|
|
|
|
|
|
|
|
let execute___get_type_of { Builtin.pdesc; tenv; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(lexp, typ)] when IList.length ret_ids <= 1 ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop_ lexp in
|
|
|
|
let props = create_type tenv n_lexp typ prop in
|
|
|
|
let aux prop =
|
|
|
|
begin
|
|
|
|
try
|
|
|
|
let hpred = IList.find (function
|
|
|
|
| Sil.Hpointsto(e, _, _) -> Sil.exp_equal e n_lexp
|
|
|
|
| _ -> false) (Prop.get_sigma prop) in
|
|
|
|
match hpred with
|
|
|
|
| Sil.Hpointsto(_, _, texp) ->
|
|
|
|
(return_result texp prop ret_ids), path
|
|
|
|
| _ -> assert false
|
|
|
|
with Not_found -> (return_result Sil.exp_zero prop ret_ids), path
|
|
|
|
end in
|
|
|
|
(IList.map aux props)
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(** replace the type of the ptsto rooted at [root_e] with [texp] in [prop] *)
|
|
|
|
let replace_ptsto_texp prop root_e texp =
|
|
|
|
let process_sigma sigma =
|
|
|
|
let sigma1, sigma2 =
|
|
|
|
IList.partition (function
|
|
|
|
| Sil.Hpointsto(e, _, _) -> Sil.exp_equal e root_e
|
|
|
|
| _ -> false) sigma in
|
|
|
|
match sigma1 with
|
|
|
|
| [Sil.Hpointsto(e, se, _)] -> (Sil.Hpointsto (e, se, texp)) :: sigma2
|
|
|
|
| _ -> sigma in
|
|
|
|
let sigma = Prop.get_sigma prop in
|
|
|
|
let sigma_fp = Prop.get_sigma_footprint prop in
|
|
|
|
let prop'= Prop.replace_sigma (process_sigma sigma) prop in
|
|
|
|
let prop''= Prop.replace_sigma_footprint (process_sigma sigma_fp) prop' in
|
|
|
|
Prop.normalize prop''
|
|
|
|
|
|
|
|
let execute___instanceof_cast ~instof
|
|
|
|
{ Builtin.pdesc; tenv; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(val1_, typ1); (texp2_, _)] when IList.length ret_ids <= 1 ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let val1, prop__ = exp_norm_check_arith pname prop_ val1_ in
|
|
|
|
let texp2, prop = exp_norm_check_arith pname prop__ texp2_ in
|
|
|
|
let is_cast_to_reference =
|
|
|
|
match typ1 with
|
|
|
|
| Sil.Tptr (_, Sil.Pk_reference) -> true
|
|
|
|
| _ -> false in
|
|
|
|
(* In Java, we throw an exception, in C++ we return 0 in case of a cast to a pointer, *)
|
|
|
|
(* and throw an exception in case of a cast to a reference. *)
|
|
|
|
let should_throw_exception =
|
|
|
|
!Config.curr_language = Config.Java || is_cast_to_reference in
|
|
|
|
let deal_with_failed_cast val1 _ texp1 texp2 =
|
|
|
|
Tabulation.raise_cast_exception
|
|
|
|
__POS__ None texp1 texp2 val1 in
|
|
|
|
let exe_one_prop prop =
|
|
|
|
if Sil.exp_equal texp2 Sil.exp_zero then
|
|
|
|
[(return_result Sil.exp_zero prop ret_ids, path)]
|
|
|
|
else
|
|
|
|
begin
|
|
|
|
try
|
|
|
|
let hpred = IList.find (function
|
|
|
|
| Sil.Hpointsto (e1, _, _) -> Sil.exp_equal e1 val1
|
|
|
|
| _ -> false) (Prop.get_sigma prop) in
|
|
|
|
match hpred with
|
|
|
|
| Sil.Hpointsto (_, _, texp1) ->
|
|
|
|
let pos_type_opt, neg_type_opt =
|
|
|
|
Prover.Subtyping_check.subtype_case_analysis tenv texp1 texp2 in
|
|
|
|
let mk_res type_opt res_e = match type_opt with
|
|
|
|
| None -> []
|
|
|
|
| Some texp1' ->
|
|
|
|
let prop' =
|
|
|
|
if Sil.exp_equal texp1 texp1' then prop
|
|
|
|
else replace_ptsto_texp prop val1 texp1' in
|
|
|
|
[(return_result res_e prop' ret_ids, path)] in
|
|
|
|
if instof then (* instanceof *)
|
|
|
|
begin
|
|
|
|
let pos_res = mk_res pos_type_opt Sil.exp_one in
|
|
|
|
let neg_res = mk_res neg_type_opt Sil.exp_zero in
|
|
|
|
pos_res @ neg_res
|
|
|
|
end
|
|
|
|
else (* cast *)
|
|
|
|
if not should_throw_exception then (* C++ case when negative cast returns 0 *)
|
|
|
|
let pos_res = mk_res pos_type_opt val1 in
|
|
|
|
let neg_res = mk_res neg_type_opt Sil.exp_zero in
|
|
|
|
pos_res @ neg_res
|
|
|
|
else
|
|
|
|
begin
|
|
|
|
if (!Config.footprint = true) then
|
|
|
|
begin
|
|
|
|
match pos_type_opt with
|
|
|
|
| None -> deal_with_failed_cast val1 typ1 texp1 texp2
|
|
|
|
| Some _ -> mk_res pos_type_opt val1
|
|
|
|
end
|
|
|
|
else (* !Config.footprint = false *)
|
|
|
|
begin
|
|
|
|
match neg_type_opt with
|
|
|
|
| Some _ ->
|
|
|
|
if is_undefined_opt prop val1 then mk_res pos_type_opt val1
|
|
|
|
else deal_with_failed_cast val1 typ1 texp1 texp2
|
|
|
|
| None -> mk_res pos_type_opt val1
|
|
|
|
end
|
|
|
|
end
|
|
|
|
| _ -> []
|
|
|
|
with Not_found ->
|
|
|
|
[(return_result val1 prop ret_ids, path)]
|
|
|
|
end in
|
|
|
|
let props = create_type tenv val1 typ1 prop in
|
|
|
|
IList.flatten (IList.map exe_one_prop props)
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute___instanceof builtin_args
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
execute___instanceof_cast ~instof:true builtin_args
|
|
|
|
|
|
|
|
let execute___cast builtin_args
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
execute___instanceof_cast ~instof:false builtin_args
|
|
|
|
|
|
|
|
let set_resource_attribute prop path n_lexp loc ra_res =
|
|
|
|
let prop' = match Prop.get_resource_attribute prop n_lexp with
|
|
|
|
| Some (Sil.Aresource (_ as ra)) ->
|
|
|
|
Prop.add_or_replace_exp_attribute
|
|
|
|
prop
|
|
|
|
n_lexp
|
|
|
|
(Sil.Aresource { ra with Sil.ra_res = ra_res })
|
|
|
|
| _ ->
|
|
|
|
( let pname = Sil.mem_alloc_pname Sil.Mnew in
|
|
|
|
let ra =
|
|
|
|
{ Sil.ra_kind = Sil.Racquire;
|
|
|
|
Sil.ra_res = ra_res;
|
|
|
|
Sil.ra_pname = pname;
|
|
|
|
Sil.ra_loc = loc;
|
|
|
|
Sil.ra_vpath = None } in
|
|
|
|
Prop.add_or_replace_exp_attribute prop n_lexp (Sil.Aresource ra)) in
|
|
|
|
[(prop', path)]
|
|
|
|
|
|
|
|
(** Set the attibute of the value as file *)
|
|
|
|
let execute___set_file_attribute { Builtin.pdesc; prop_; path; ret_ids; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args, ret_ids with
|
|
|
|
| [(lexp, _)], _ ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop_ lexp in
|
|
|
|
set_resource_attribute prop path n_lexp loc Sil.Rfile
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(** Set the attibute of the value as lock *)
|
|
|
|
let execute___set_lock_attribute { Builtin.pdesc; prop_; path; ret_ids; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args, ret_ids with
|
|
|
|
| [(lexp, _)], _ ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop_ lexp in
|
|
|
|
set_resource_attribute prop path n_lexp loc Sil.Rlock
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(** Set the resource attribute of the first real argument of method as ignore,
|
|
|
|
the first argument is assumed to be "this" *)
|
|
|
|
let execute___method_set_ignore_attribute
|
|
|
|
{ Builtin.pdesc; prop_; path; ret_ids; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args, ret_ids with
|
|
|
|
| [_ ; (lexp, _)], _ ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop_ lexp in
|
|
|
|
set_resource_attribute prop path n_lexp loc Sil.Rignore
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(** Set the attibute of the value as memory *)
|
|
|
|
let execute___set_mem_attribute { Builtin.pdesc; prop_; path; ret_ids; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args, ret_ids with
|
|
|
|
| [(lexp, _)], _ ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop_ lexp in
|
|
|
|
set_resource_attribute prop path n_lexp loc (Sil.Rmemory Sil.Mnew)
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(** report an error if [lexp] is tainted; otherwise, add untained([lexp]) as a precondition *)
|
|
|
|
let execute___check_untainted
|
|
|
|
{ Builtin.pdesc; prop_; path; ret_ids; args; proc_name = callee_pname; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args, ret_ids with
|
|
|
|
| [(lexp, _)], _ ->
|
|
|
|
let caller_pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith caller_pname prop_ lexp in
|
|
|
|
[(check_untainted n_lexp caller_pname callee_pname prop, path)]
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(** take a pointer to a struct, and return the value of a hidden field in the struct *)
|
|
|
|
let execute___get_hidden_field { Builtin.pdesc; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(lexp, _)] ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop_ lexp in
|
|
|
|
let ret_val = ref None in
|
|
|
|
let return_val p = match !ret_val with
|
|
|
|
| Some e -> return_result e p ret_ids
|
|
|
|
| None -> p in
|
|
|
|
let foot_var = lazy (Sil.Var (Ident.create_fresh Ident.kfootprint)) in
|
|
|
|
let filter_fld_hidden (f, _ ) = Ident.fieldname_is_hidden f in
|
|
|
|
let has_fld_hidden fsel = IList.exists filter_fld_hidden fsel in
|
|
|
|
let do_hpred in_foot hpred = match hpred with
|
|
|
|
| Sil.Hpointsto(e, Sil.Estruct (fsel, inst), texp)
|
|
|
|
when Sil.exp_equal e n_lexp && (not (has_fld_hidden fsel)) ->
|
|
|
|
let foot_e = Lazy.force foot_var in
|
|
|
|
ret_val := Some foot_e;
|
|
|
|
let se = Sil.Eexp(foot_e, Sil.inst_none) in
|
|
|
|
let fsel' = (Ident.fieldname_hidden, se) :: fsel in
|
|
|
|
Sil.Hpointsto(e, Sil.Estruct (fsel', inst), texp)
|
|
|
|
| Sil.Hpointsto(e, Sil.Estruct (fsel, _), _)
|
|
|
|
when Sil.exp_equal e n_lexp && not in_foot && has_fld_hidden fsel ->
|
|
|
|
let set_ret_val () =
|
|
|
|
match IList.find filter_fld_hidden fsel with
|
|
|
|
| _, Sil.Eexp(e, _) -> ret_val := Some e
|
|
|
|
| _ -> () in
|
|
|
|
set_ret_val();
|
|
|
|
hpred
|
|
|
|
| _ -> hpred in
|
|
|
|
let sigma' = IList.map (do_hpred false) (Prop.get_sigma prop) in
|
|
|
|
let sigma_fp' = IList.map (do_hpred true) (Prop.get_sigma_footprint prop) in
|
|
|
|
let prop' = Prop.replace_sigma_footprint sigma_fp' (Prop.replace_sigma sigma' prop) in
|
|
|
|
let prop'' = return_val (Prop.normalize prop') in
|
|
|
|
[(prop'', path)]
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(** take a pointer to a struct and a value,
|
|
|
|
and set a hidden field in the struct to the given value *)
|
|
|
|
let execute___set_hidden_field { Builtin.pdesc; prop_; path; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(lexp1, _); (lexp2, _)] ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp1, prop__ = exp_norm_check_arith pname prop_ lexp1 in
|
|
|
|
let n_lexp2, prop = exp_norm_check_arith pname prop__ lexp2 in
|
|
|
|
let foot_var = lazy (Sil.Var (Ident.create_fresh Ident.kfootprint)) in
|
|
|
|
let filter_fld_hidden (f, _ ) = Ident.fieldname_is_hidden f in
|
|
|
|
let has_fld_hidden fsel = IList.exists filter_fld_hidden fsel in
|
|
|
|
let do_hpred in_foot hpred = match hpred with
|
|
|
|
| Sil.Hpointsto(e, Sil.Estruct (fsel, inst), texp)
|
|
|
|
when Sil.exp_equal e n_lexp1 && not in_foot ->
|
|
|
|
let se = Sil.Eexp(n_lexp2, Sil.inst_none) in
|
|
|
|
let fsel' =
|
|
|
|
(Ident.fieldname_hidden, se) ::
|
|
|
|
(IList.filter (fun x -> not (filter_fld_hidden x)) fsel) in
|
|
|
|
Sil.Hpointsto(e, Sil.Estruct (fsel', inst), texp)
|
|
|
|
| Sil.Hpointsto(e, Sil.Estruct (fsel, inst), texp)
|
|
|
|
when Sil.exp_equal e n_lexp1 && in_foot && not (has_fld_hidden fsel) ->
|
|
|
|
let foot_e = Lazy.force foot_var in
|
|
|
|
let se = Sil.Eexp(foot_e, Sil.inst_none) in
|
|
|
|
let fsel' = (Ident.fieldname_hidden, se) :: fsel in
|
|
|
|
Sil.Hpointsto(e, Sil.Estruct (fsel', inst), texp)
|
|
|
|
| _ -> hpred in
|
|
|
|
let sigma' = IList.map (do_hpred false) (Prop.get_sigma prop) in
|
|
|
|
let sigma_fp' = IList.map (do_hpred true) (Prop.get_sigma_footprint prop) in
|
|
|
|
let prop' = Prop.replace_sigma_footprint sigma_fp' (Prop.replace_sigma sigma' prop) in
|
|
|
|
let prop'' = Prop.normalize prop' in
|
|
|
|
[(prop'', path)]
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(* Update the objective-c hidden counter by applying the operation op and the operand delta.*)
|
|
|
|
(* Eg. op=+/- delta is an integer *)
|
|
|
|
let execute___objc_counter_update
|
|
|
|
suppress_npe_report op delta
|
|
|
|
{ Builtin.pdesc; tenv; prop_; path; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(lexp, typ)] ->
|
|
|
|
let typ' = (match Tenv.expand_type tenv typ with
|
|
|
|
| Sil.Tstruct _ as s -> s
|
|
|
|
| Sil.Tptr(t, _) -> Tenv.expand_type tenv t
|
|
|
|
| s' ->
|
|
|
|
L.d_str
|
|
|
|
("Trying to update hidden field of not a struc. Type: " ^
|
|
|
|
(Sil.typ_to_string s'));
|
|
|
|
assert false) in
|
|
|
|
(* Assumes that lexp is a temp n$1 that has the value of the object. *)
|
|
|
|
(* This is the case as a call f(o) it's translates as n$1=*&o; f(n$1) *)
|
|
|
|
(* n$2 = *n$1.hidden *)
|
|
|
|
let tmp = Ident.create_fresh Ident.knormal in
|
|
|
|
let hidden_field = Sil.Lfield(lexp, Ident.fieldname_hidden, typ') in
|
|
|
|
let counter_to_tmp = Sil.Letderef(tmp, hidden_field, typ', loc) in
|
|
|
|
(* *n$1.hidden = (n$2 +/- delta) *)
|
|
|
|
let update_counter =
|
|
|
|
Sil.Set
|
|
|
|
(hidden_field,
|
|
|
|
typ',
|
|
|
|
Sil.BinOp(op, Sil.Var tmp, Sil.Const (Sil.Cint delta)),
|
|
|
|
loc) in
|
|
|
|
let update_counter_instrs =
|
|
|
|
[ counter_to_tmp; update_counter; Sil.Remove_temps([tmp], loc) ] in
|
|
|
|
sym_exec_generated
|
|
|
|
suppress_npe_report tenv pdesc update_counter_instrs [(prop_, path)]
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(* Given a list of args checks if the first is the flag
|
|
|
|
indicating whether is a call to retain/release for which*)
|
|
|
|
(* we have to suppress NPE report or not.
|
|
|
|
If the flag is present it is removed from the list of args. *)
|
|
|
|
let get_suppress_npe_flag args =
|
|
|
|
match args with
|
|
|
|
| (Sil.Const (Sil.Cint i), Sil.Tint Sil.IBool):: args' when Sil.Int.isone i ->
|
|
|
|
false, args' (* this is a CFRelease/CFRetain *)
|
|
|
|
| _ -> true, args
|
|
|
|
|
|
|
|
let execute___objc_retain_impl
|
|
|
|
({ Builtin.prop_; args; ret_ids; } as builtin_args)
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
let suppress_npe_report, args' = get_suppress_npe_flag args in
|
|
|
|
match args' with
|
|
|
|
| [(lexp, _)] ->
|
|
|
|
let prop = return_result lexp prop_ ret_ids in
|
|
|
|
execute___objc_counter_update
|
|
|
|
suppress_npe_report (Sil.PlusA) (Sil.Int.one)
|
|
|
|
{ builtin_args with Builtin.prop_ = prop; args = args'; }
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute___objc_retain builtin_args
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
if !Config.objc_memory_model_on then
|
|
|
|
execute___objc_retain_impl builtin_args
|
|
|
|
else execute___no_op builtin_args.Builtin.prop_ builtin_args.Builtin.path
|
|
|
|
|
|
|
|
let execute___objc_retain_cf builtin_args
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
execute___objc_retain_impl builtin_args
|
|
|
|
|
|
|
|
let execute___objc_release_impl
|
|
|
|
({ Builtin.args; }
|
|
|
|
as builtin_args)
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
let suppress_npe_flag, args' = get_suppress_npe_flag args in
|
|
|
|
execute___objc_counter_update
|
|
|
|
suppress_npe_flag Sil.MinusA Sil.Int.one
|
|
|
|
{ builtin_args with Builtin.args = args'; }
|
|
|
|
|
|
|
|
let execute___objc_release builtin_args
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
if !Config.objc_memory_model_on then
|
|
|
|
execute___objc_release_impl builtin_args
|
|
|
|
else execute___no_op builtin_args.Builtin.prop_ builtin_args.Builtin.path
|
|
|
|
|
|
|
|
let execute___objc_release_cf builtin_args
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
execute___objc_release_impl builtin_args
|
|
|
|
|
|
|
|
(** Set the attibute of the value as objc autoreleased *)
|
|
|
|
let execute___set_autorelease_attribute
|
|
|
|
{ Builtin.pdesc; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args, ret_ids with
|
|
|
|
| [(lexp, _)], _ ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let prop = return_result lexp prop_ ret_ids in
|
|
|
|
if !Config.objc_memory_model_on then
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop lexp in
|
|
|
|
let prop' = Prop.add_or_replace_exp_attribute prop n_lexp Sil.Aautorelease in
|
|
|
|
[(prop', path)]
|
|
|
|
else execute___no_op prop path
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(** Release all the objects in the pool *)
|
|
|
|
let execute___release_autorelease_pool
|
|
|
|
({ Builtin.prop_; path; } as builtin_args)
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
if !Config.objc_memory_model_on then
|
|
|
|
let autoreleased_objects = Prop.get_atoms_with_attribute Sil.Aautorelease prop_ in
|
|
|
|
let prop_without_attribute = Prop.remove_attribute Sil.Aautorelease prop_ in
|
|
|
|
let call_release res exp =
|
|
|
|
match res with
|
|
|
|
| (prop', path'):: _ ->
|
|
|
|
(try
|
|
|
|
let hpred = IList.find (function
|
|
|
|
| Sil.Hpointsto(e1, _, _) -> Sil.exp_equal e1 exp
|
|
|
|
| _ -> false) (Prop.get_sigma prop_) in
|
|
|
|
match hpred with
|
|
|
|
| Sil.Hpointsto(_, _, Sil.Sizeof (typ, _)) ->
|
|
|
|
let res1 =
|
|
|
|
execute___objc_release
|
|
|
|
{ builtin_args with
|
|
|
|
Builtin.args = [(exp, typ)];
|
|
|
|
prop_ = prop';
|
|
|
|
path = path'; } in
|
|
|
|
res1
|
|
|
|
| _ -> res
|
|
|
|
with Not_found -> res)
|
|
|
|
| [] -> res in
|
|
|
|
IList.fold_left call_release [(prop_without_attribute, path)] autoreleased_objects
|
|
|
|
else execute___no_op prop_ path
|
|
|
|
|
|
|
|
let set_attr pdesc prop path exp attr =
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop exp in
|
|
|
|
[(Prop.add_or_replace_exp_attribute prop n_lexp attr, path)]
|
|
|
|
|
|
|
|
(** Set attibute att *)
|
|
|
|
let execute___set_attr attr { Builtin.pdesc; prop_; path; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(lexp, _)] -> set_attr pdesc prop_ path lexp attr
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(** Set the attibute of the value as resource/locked*)
|
|
|
|
let execute___set_locked_attribute
|
|
|
|
({ Builtin.pdesc; loc; } as builtin_args)
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
(* ra_kind = Racquire in following indicates locked *)
|
|
|
|
let ra = {
|
|
|
|
Sil.ra_kind = Sil.Racquire;
|
|
|
|
ra_res = Sil.Rlock;
|
|
|
|
ra_pname = pname;
|
|
|
|
ra_loc = loc;
|
|
|
|
ra_vpath = None; } in
|
|
|
|
execute___set_attr (Sil.Aresource ra) builtin_args
|
|
|
|
|
|
|
|
(** Set the attibute of the value as resource/unlocked*)
|
|
|
|
let execute___set_unlocked_attribute
|
|
|
|
({ Builtin.pdesc; loc; } as builtin_args)
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
(* ra_kind = Rrelease in following indicates unlocked *)
|
|
|
|
let ra = {
|
|
|
|
Sil.ra_kind = Sil.Rrelease;
|
|
|
|
ra_res = Sil.Rlock;
|
|
|
|
ra_pname = pname;
|
|
|
|
ra_loc = loc;
|
|
|
|
ra_vpath = None; } in
|
|
|
|
execute___set_attr (Sil.Aresource ra) builtin_args
|
|
|
|
|
|
|
|
(** Set the attibute of the value as tainted *)
|
|
|
|
let execute___set_taint_attribute
|
|
|
|
({ Builtin.pdesc; args; prop_; path; })
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| (exp, _) :: [(Sil.Const (Sil.Cstr taint_kind_str), _)] ->
|
|
|
|
let taint_source = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let taint_kind = match taint_kind_str with
|
|
|
|
| "UnverifiedSSLSocket" -> Sil.UnverifiedSSLSocket
|
|
|
|
| "SharedPreferenceData" -> Sil.SharedPreferencesData
|
|
|
|
| other_str -> failwith ("Unrecognized taint kind " ^ other_str) in
|
|
|
|
set_attr pdesc prop_ path exp (Sil.Ataint { Sil.taint_source; taint_kind})
|
|
|
|
| _ ->
|
|
|
|
(* note: we can also get this if [taint_kind] is not a string literal *)
|
|
|
|
raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute___objc_cast { Builtin.pdesc; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(val1_, _); (texp2_, _)] when IList.length ret_ids <= 1 ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let val1, prop__ = exp_norm_check_arith pname prop_ val1_ in
|
|
|
|
let texp2, prop = exp_norm_check_arith pname prop__ texp2_ in
|
|
|
|
(try
|
|
|
|
let hpred = IList.find (function
|
|
|
|
| Sil.Hpointsto(e1, _, _) -> Sil.exp_equal e1 val1
|
|
|
|
| _ -> false) (Prop.get_sigma prop) in
|
|
|
|
match hpred, texp2 with
|
|
|
|
| Sil.Hpointsto(val1, _, _), Sil.Sizeof (_, _) ->
|
|
|
|
let prop' = replace_ptsto_texp prop val1 texp2 in
|
|
|
|
[(return_result val1 prop' ret_ids, path)]
|
|
|
|
| _ -> [(return_result val1 prop ret_ids, path)]
|
|
|
|
with Not_found -> [(return_result val1 prop ret_ids, path)])
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute_abort { Builtin.proc_name; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
raise
|
|
|
|
(Exceptions.Precondition_not_found
|
|
|
|
(Localise.verbatim_desc (Procname.to_string proc_name), __POS__))
|
|
|
|
|
|
|
|
let execute_exit { Builtin.prop_; path; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
execute_diverge prop_ path
|
|
|
|
|
|
|
|
let _execute_free mk loc acc iter =
|
|
|
|
match Prop.prop_iter_current iter with
|
|
|
|
| (Sil.Hpointsto(lexp, _, _), []) ->
|
|
|
|
let prop = Prop.prop_iter_remove_curr_then_to_prop iter in
|
|
|
|
let pname = Sil.mem_dealloc_pname mk in
|
|
|
|
let ra =
|
|
|
|
{ Sil.ra_kind = Sil.Rrelease;
|
|
|
|
Sil.ra_res = Sil.Rmemory mk;
|
|
|
|
Sil.ra_pname = pname;
|
|
|
|
Sil.ra_loc = loc;
|
|
|
|
Sil.ra_vpath = None } in
|
|
|
|
(* mark value as freed *)
|
|
|
|
let p_res =
|
|
|
|
Prop.add_or_replace_exp_attribute_check_changed
|
|
|
|
Tabulation.check_attr_dealloc_mismatch
|
|
|
|
prop
|
|
|
|
lexp
|
|
|
|
(Sil.Aresource ra) in
|
|
|
|
p_res :: acc
|
|
|
|
| (Sil.Hpointsto _, _ :: _) -> assert false (* alignment error *)
|
|
|
|
| _ -> assert false (* should not happen *)
|
|
|
|
|
|
|
|
let _execute_free_nonzero mk pdesc tenv instr prop lexp typ loc =
|
|
|
|
try
|
|
|
|
begin
|
|
|
|
match Prover.is_root prop lexp lexp with
|
|
|
|
| None ->
|
|
|
|
L.d_strln ".... Alignment Error: Freed a non root ....";
|
|
|
|
assert false
|
|
|
|
| Some _ ->
|
|
|
|
let prop_list =
|
|
|
|
IList.fold_left (_execute_free mk loc) []
|
|
|
|
(Rearrange.rearrange pdesc tenv lexp typ prop loc) in
|
|
|
|
IList.rev prop_list
|
|
|
|
end
|
|
|
|
with Rearrange.ARRAY_ACCESS ->
|
|
|
|
if (!Config.array_level = 0) then assert false
|
|
|
|
else begin
|
|
|
|
L.d_strln ".... Array containing allocated heap cells ....";
|
|
|
|
L.d_str " Instr: "; Sil.d_instr instr; L.d_ln ();
|
|
|
|
L.d_str " PROP: "; Prop.d_prop prop; L.d_ln ();
|
|
|
|
raise (Exceptions.Array_of_pointsto __POS__)
|
|
|
|
end
|
|
|
|
|
|
|
|
let execute_free mk { Builtin.pdesc; instr; tenv; prop_; path; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(lexp, typ)] ->
|
|
|
|
begin
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop_ lexp in
|
|
|
|
let prop_nonzero = (* case n_lexp!=0 *)
|
|
|
|
Propset.to_proplist (prune_polarity true n_lexp prop) in
|
|
|
|
let prop_zero = (* case n_lexp==0 *)
|
|
|
|
Propset.to_proplist (prune_polarity false n_lexp prop) in
|
|
|
|
let plist =
|
|
|
|
prop_zero @ (* model: if 0 then skip else _execute_free_nonzero *)
|
|
|
|
IList.flatten (IList.map (fun p ->
|
|
|
|
_execute_free_nonzero mk pdesc tenv instr p
|
|
|
|
(Prop.exp_normalize_prop p lexp) typ loc) prop_nonzero) in
|
|
|
|
IList.map (fun p -> (p, path)) plist
|
|
|
|
end
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute_alloc mk can_return_null
|
|
|
|
{ Builtin.pdesc; tenv; prop_; path; ret_ids; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let rec evaluate_char_sizeof e = match e with
|
|
|
|
| Sil.Var _ -> e
|
|
|
|
| Sil.UnOp (uop, e', typ) ->
|
|
|
|
Sil.UnOp (uop, evaluate_char_sizeof e', typ)
|
|
|
|
| Sil.BinOp (bop, e1', e2') ->
|
|
|
|
Sil.BinOp (bop, evaluate_char_sizeof e1', evaluate_char_sizeof e2')
|
|
|
|
| Sil.Const _ | Sil.Cast _ | Sil.Lvar _ | Sil.Lfield _ | Sil.Lindex _ -> e
|
|
|
|
| Sil.Sizeof (Sil.Tarray(Sil.Tint ik, size), _) when Sil.ikind_is_char ik ->
|
|
|
|
evaluate_char_sizeof size
|
|
|
|
| Sil.Sizeof _ -> e in
|
|
|
|
let handle_sizeof_exp size_exp =
|
|
|
|
Sil.Sizeof (Sil.Tarray (Sil.Tint Sil.IChar, size_exp), Sil.Subtype.exact) in
|
|
|
|
let size_exp = match args with
|
|
|
|
| [(size_exp, _)] -> (* for malloc and __new *)
|
|
|
|
size_exp
|
|
|
|
| [(num_obj, _); (base_exp, _)] -> (* for __new_array *)
|
|
|
|
Sil.BinOp (Sil.Mult, num_obj, base_exp)
|
|
|
|
| _ ->
|
|
|
|
raise (Exceptions.Wrong_argument_number __POS__) in
|
|
|
|
let ret_id = match ret_ids with
|
|
|
|
| [ret_id] -> ret_id
|
|
|
|
| _ -> Ident.create_fresh Ident.kprimed in
|
|
|
|
let size_exp', prop =
|
|
|
|
let n_size_exp, prop = exp_norm_check_arith pname prop_ size_exp in
|
|
|
|
let n_size_exp' = evaluate_char_sizeof n_size_exp in
|
|
|
|
Prop.exp_normalize_prop prop n_size_exp', prop in
|
|
|
|
let cnt_te = handle_sizeof_exp size_exp' in
|
|
|
|
let id_new = Ident.create_fresh Ident.kprimed in
|
|
|
|
let exp_new = Sil.Var id_new in
|
|
|
|
let ptsto_new =
|
|
|
|
Prop.mk_ptsto_exp (Some tenv) Prop.Fld_init (exp_new, cnt_te, None) Sil.Ialloc in
|
|
|
|
let prop_plus_ptsto =
|
|
|
|
let pname = Sil.mem_alloc_pname mk in
|
|
|
|
let prop' = Prop.normalize (Prop.prop_sigma_star prop [ptsto_new]) in
|
|
|
|
let ra =
|
|
|
|
{ Sil.ra_kind = Sil.Racquire;
|
|
|
|
Sil.ra_res = Sil.Rmemory mk;
|
|
|
|
Sil.ra_pname = pname;
|
|
|
|
Sil.ra_loc = loc;
|
|
|
|
Sil.ra_vpath = None } in
|
|
|
|
(* mark value as allocated *)
|
|
|
|
Prop.add_or_replace_exp_attribute prop' exp_new (Sil.Aresource ra) in
|
|
|
|
let prop_alloc = Prop.conjoin_eq (Sil.Var ret_id) exp_new prop_plus_ptsto in
|
|
|
|
if can_return_null then
|
|
|
|
let prop_null = Prop.conjoin_eq (Sil.Var ret_id) Sil.exp_zero prop in
|
|
|
|
[(prop_alloc, path); (prop_null, path)]
|
|
|
|
else [(prop_alloc, path)]
|
|
|
|
|
|
|
|
let execute___cxx_typeid ({ Builtin.pdesc; tenv; prop_; args; loc} as r)
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| type_info_exp :: rest ->
|
|
|
|
(let res = execute_alloc Sil.Mnew false { r with args = [type_info_exp] } in
|
|
|
|
match rest with
|
|
|
|
| [(field_exp, _); (lexp, typ)] ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp, prop = exp_norm_check_arith pname prop_ lexp in
|
|
|
|
let typ =
|
|
|
|
try
|
|
|
|
let hpred = IList.find (function
|
|
|
|
| Sil.Hpointsto (e, _, _) -> Sil.exp_equal e n_lexp
|
|
|
|
| _ -> false) (Prop.get_sigma prop) in
|
|
|
|
match hpred with
|
|
|
|
| Sil.Hpointsto (_, _, Sil.Sizeof (dynamic_type, _)) -> dynamic_type
|
|
|
|
| _ -> typ
|
|
|
|
with Not_found -> typ in
|
|
|
|
let typ_string = Sil.typ_to_string typ in
|
|
|
|
let set_instr = Sil.Set (field_exp, Sil.Tvoid, Sil.Const (Sil.Cstr typ_string), loc) in
|
|
|
|
sym_exec_generated true tenv pdesc [set_instr] res
|
|
|
|
| _ -> res)
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute_pthread_create { Builtin.pdesc; tenv; prop_; path; ret_ids; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [_; _; start_routine; arg] ->
|
|
|
|
let routine_name = Prop.exp_normalize_prop prop_ (fst start_routine) in
|
|
|
|
let routine_arg = Prop.exp_normalize_prop prop_ (fst arg) in
|
|
|
|
(match routine_name, (snd start_routine) with
|
|
|
|
| Sil.Lvar pvar, _ ->
|
|
|
|
let fun_name = Sil.pvar_get_name pvar in
|
|
|
|
let fun_string = Mangled.to_string fun_name in
|
|
|
|
L.d_strln ("pthread_create: calling function " ^ fun_string);
|
|
|
|
begin
|
|
|
|
match Specs.get_summary (Procname.from_string_c_fun fun_string) with
|
|
|
|
| None -> assert false
|
|
|
|
| Some callee_summary ->
|
|
|
|
sym_exec_call
|
|
|
|
pdesc tenv prop_ path ret_ids [(routine_arg, snd arg)] callee_summary loc
|
|
|
|
end
|
|
|
|
| _ ->
|
|
|
|
L.d_str "pthread_create: unknown function ";
|
|
|
|
Sil.d_exp routine_name; L.d_strln ", skipping call.";
|
|
|
|
[(prop_, path)])
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute_skip { Builtin.prop_; path; } : Builtin.ret_typ =
|
|
|
|
[(prop_, path)]
|
|
|
|
|
|
|
|
let execute_scan_function skip_n_arguments
|
|
|
|
{ Builtin.pdesc; tenv; prop_; path; ret_ids; args; proc_name; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| _ when IList.length args >= skip_n_arguments ->
|
|
|
|
let varargs = ref args in
|
|
|
|
for _ = 1 to skip_n_arguments do varargs := IList.tl !varargs done;
|
|
|
|
call_unknown_or_scan tenv true pdesc prop_ path ret_ids None !varargs proc_name loc
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute__unwrap_exception { Builtin.pdesc; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(ret_exn, _)] ->
|
|
|
|
begin
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_ret_exn, prop = exp_norm_check_arith pname prop_ ret_exn in
|
|
|
|
match n_ret_exn with
|
|
|
|
| Sil.Const (Sil.Cexn exp) ->
|
|
|
|
let prop_with_exn = return_result exp prop ret_ids in
|
|
|
|
[(prop_with_exn, path)]
|
|
|
|
| _ -> assert false
|
|
|
|
end
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute_return_first_argument { Builtin.pdesc; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| (arg1_, _):: _ ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let arg1, prop = exp_norm_check_arith pname prop_ arg1_ in
|
|
|
|
let prop' = return_result arg1 prop ret_ids in
|
|
|
|
[(prop', path)]
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
let execute___split_get_nth { Builtin.pdesc; prop_; path; ret_ids; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(lexp1, _); (lexp2, _); (lexp3, _)] ->
|
|
|
|
let pname = Cfg.Procdesc.get_proc_name pdesc in
|
|
|
|
let n_lexp1, prop__ = exp_norm_check_arith pname prop_ lexp1 in
|
|
|
|
let n_lexp2, prop___ = exp_norm_check_arith pname prop__ lexp2 in
|
|
|
|
let n_lexp3, prop = exp_norm_check_arith pname prop___ lexp3 in
|
|
|
|
(match n_lexp1, n_lexp2, n_lexp3 with
|
|
|
|
| Sil.Const (Sil.Cstr str1), Sil.Const (Sil.Cstr str2), Sil.Const (Sil.Cint n_sil) ->
|
|
|
|
(let n = Sil.Int.to_int n_sil in
|
|
|
|
try
|
|
|
|
let parts = Str.split (Str.regexp_string str2) str1 in
|
|
|
|
let n_part = IList.nth parts n in
|
|
|
|
let res = Sil.Const (Sil.Cstr n_part) in
|
|
|
|
[(return_result res prop ret_ids, path)]
|
|
|
|
with Not_found -> assert false)
|
|
|
|
| _ -> [(prop, path)])
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(* forces the expression passed as parameter to be assumed true at the point where this
|
|
|
|
builtin is called, diverges if this causes an inconsistency *)
|
|
|
|
let execute___infer_assume { Builtin.prop_; path; args; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
match args with
|
|
|
|
| [(lexp, _)] ->
|
|
|
|
let prop_assume = Prop.conjoin_eq lexp (Sil.exp_bool true) prop_ in
|
|
|
|
if Prover.check_inconsistency prop_assume
|
|
|
|
then execute_diverge prop_assume path
|
|
|
|
else [(prop_assume, path)]
|
|
|
|
| _ -> raise (Exceptions.Wrong_argument_number __POS__)
|
|
|
|
|
|
|
|
(* creates a named error state *)
|
|
|
|
let execute___infer_fail { Builtin.pdesc; tenv; prop_; path; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
let error_str =
|
|
|
|
match args with
|
|
|
|
| [(lexp_msg, _)] ->
|
|
|
|
begin
|
|
|
|
match Prop.exp_normalize_prop prop_ lexp_msg with
|
|
|
|
| Sil.Const (Sil.Cstr str) -> str
|
|
|
|
| _ -> assert false
|
|
|
|
end
|
|
|
|
| _ ->
|
|
|
|
raise (Exceptions.Wrong_argument_number __POS__) in
|
|
|
|
let set_instr =
|
|
|
|
Sil.Set (Sil.Lvar Sil.custom_error, Sil.Tvoid, Sil.Const (Sil.Cstr error_str), loc) in
|
|
|
|
sym_exec_generated true tenv pdesc [set_instr] [(prop_, path)]
|
|
|
|
|
|
|
|
(* translate builtin assertion failure *)
|
|
|
|
let execute___assert_fail { Builtin.pdesc; tenv; prop_; path; args; loc; }
|
|
|
|
: Builtin.ret_typ =
|
|
|
|
let error_str =
|
|
|
|
match args with
|
|
|
|
| l when IList.length l = 4 ->
|
|
|
|
Config.default_failure_name
|
|
|
|
| _ ->
|
|
|
|
raise (Exceptions.Wrong_argument_number __POS__) in
|
|
|
|
let set_instr =
|
|
|
|
Sil.Set (Sil.Lvar Sil.custom_error, Sil.Tvoid, Sil.Const (Sil.Cstr error_str), loc) in
|
|
|
|
sym_exec_generated true tenv pdesc [set_instr] [(prop_, path)]
|
|
|
|
|
|
|
|
let __assert_fail = Builtin.register
|
|
|
|
"__assert_fail" execute___assert_fail
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* model for va_arg *)
|
|
|
|
"__builtin_va_arg" execute___builtin_va_arg
|
|
|
|
let _ = Builtin.register
|
|
|
|
"__builtin_va_copy" execute_skip
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* model va_end as skip *)
|
|
|
|
"__builtin_va_end" execute_skip
|
|
|
|
let _ = Builtin.register
|
|
|
|
"__builtin_va_start" execute_skip
|
|
|
|
let __cast = Builtin.register
|
|
|
|
(* [__cast(val,typ)] implements java's [typ(val)] *)
|
|
|
|
"__cast" execute___cast
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* report a taint error if the parameter is tainted, and assume it is untainted afterward *)
|
|
|
|
"__check_untainted" execute___check_untainted
|
|
|
|
let __delete = Builtin.register
|
|
|
|
(* like free *)
|
|
|
|
"__delete" (execute_free Sil.Mnew)
|
|
|
|
let __delete_array = Builtin.register
|
|
|
|
(* like free *)
|
|
|
|
"__delete_array" (execute_free Sil.Mnew_array)
|
|
|
|
let __exit = Builtin.register
|
|
|
|
(* _exit from C library *)
|
|
|
|
"_exit" execute_exit
|
|
|
|
let __get_array_size = Builtin.register
|
|
|
|
(* return the size of the array passed as a parameter *)
|
|
|
|
"__get_array_size" execute___get_array_size
|
|
|
|
let __require_allocated_array = Builtin.register
|
|
|
|
(* require the parameter to point to an allocated array *)
|
|
|
|
"__require_allocated_array" execute___require_allocated_array
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* return the value of a hidden field in the struct *)
|
|
|
|
"__get_hidden_field" execute___get_hidden_field
|
|
|
|
let __get_type_of = Builtin.register
|
|
|
|
(* return the get the type of the allocated object passed as a parameter *)
|
|
|
|
"__get_type_of" execute___get_type_of
|
|
|
|
let __infer_assume = Builtin.register
|
|
|
|
(* infer assume, diverging on inconsistencies *)
|
|
|
|
"__infer_assume" execute___infer_assume
|
|
|
|
let __infer_fail = Builtin.register
|
|
|
|
(* externally create new errors *)
|
|
|
|
"__infer_fail" execute___infer_fail
|
|
|
|
let __instanceof = Builtin.register
|
|
|
|
(* [__instanceof(val,typ)] implements java's [val instanceof typ] *)
|
|
|
|
"__instanceof" execute___instanceof
|
|
|
|
let _ = Builtin.register
|
|
|
|
"__method_set_ignore_attribute" execute___method_set_ignore_attribute
|
|
|
|
let __new = Builtin.register
|
|
|
|
(* like malloc, but always succeeds *)
|
|
|
|
"__new" (execute_alloc Sil.Mnew false)
|
|
|
|
let __new_array = Builtin.register
|
|
|
|
(* like malloc, but always succeeds *)
|
|
|
|
"__new_array" (execute_alloc Sil.Mnew_array false)
|
|
|
|
let __objc_alloc = Builtin.register
|
|
|
|
(* Objective C alloc *)
|
|
|
|
"__objc_alloc" (execute_alloc Sil.Mobjc true)
|
|
|
|
let __objc_alloc_no_fail = Builtin.register
|
|
|
|
(* like __objc_alloc, but does not return nil *)
|
|
|
|
"__objc_alloc_no_fail" (execute_alloc Sil.Mobjc false)
|
|
|
|
let __objc_cast = Builtin.register
|
|
|
|
(* objective-c "cast" *)
|
|
|
|
"__objc_cast" execute___objc_cast
|
|
|
|
let __objc_release = Builtin.register
|
|
|
|
(* objective-c "release" *)
|
|
|
|
"__objc_release" execute___objc_release
|
|
|
|
let __objc_release_autorelease_pool = Builtin.register
|
|
|
|
(* set the attribute of the parameter as autorelease *)
|
|
|
|
"__objc_release_autorelease_pool" execute___release_autorelease_pool
|
|
|
|
let __objc_release_cf = Builtin.register
|
|
|
|
(* objective-c "release" *)
|
|
|
|
"__objc_release_cf" execute___objc_release_cf
|
|
|
|
let __objc_retain = Builtin.register
|
|
|
|
(* objective-c "retain" *)
|
|
|
|
"__objc_retain" execute___objc_retain
|
|
|
|
let __objc_retain_cf = Builtin.register
|
|
|
|
"__objc_retain_cf" execute___objc_retain_cf
|
|
|
|
let __cxx_typeid = Builtin.register
|
|
|
|
(* C++ "typeid" *)
|
|
|
|
"__cxx_typeid" execute___cxx_typeid
|
|
|
|
let __placement_delete = Builtin.register
|
|
|
|
(* placement delete is skip *)
|
|
|
|
"__placement_delete" execute_skip
|
|
|
|
let __placement_new = Builtin.register
|
|
|
|
(* placement new returns the first argument *)
|
|
|
|
"__placement_new" execute_return_first_argument
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* print a value as seen by the engine *)
|
|
|
|
"__print_value" execute___print_value
|
|
|
|
let __set_array_size = Builtin.register
|
|
|
|
(* set the size of the array passed as a parameter *)
|
|
|
|
"__set_array_size" execute___set_array_size
|
|
|
|
let __set_autorelease_attribute = Builtin.register
|
|
|
|
(* set the attribute of the parameter as autorelease *)
|
|
|
|
"__set_autorelease_attribute" execute___set_autorelease_attribute
|
|
|
|
let __set_file_attribute = Builtin.register
|
|
|
|
(* set the attribute of the parameter as file *)
|
|
|
|
"__set_file_attribute" execute___set_file_attribute
|
|
|
|
let __set_lock_attribute = Builtin.register
|
|
|
|
(* set the attribute of the parameter as file *)
|
|
|
|
"__set_lock_attribute" execute___set_lock_attribute
|
|
|
|
let __set_mem_attribute = Builtin.register
|
|
|
|
(* set the attribute of the parameter as memory *)
|
|
|
|
"__set_mem_attribute" execute___set_mem_attribute
|
|
|
|
let __set_observer_attribute = Builtin.register
|
|
|
|
(* set the observer attribute of the parameter *)
|
|
|
|
"__set_observer_attribute" (execute___set_attr Sil.Aobserver)
|
|
|
|
let __set_unsubscribed_observer_attribute = Builtin.register
|
|
|
|
(* set the unregistered observer attribute of the parameter *)
|
|
|
|
"__set_unsubscribed_observer_attribute"
|
|
|
|
(execute___set_attr Sil.Aunsubscribed_observer)
|
|
|
|
let __split_get_nth = Builtin.register
|
|
|
|
(* splits a string given a separator and returns the nth string *)
|
|
|
|
"__split_get_nth" execute___split_get_nth
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* set a hidden field in the struct to the given value *)
|
|
|
|
"__set_hidden_field" execute___set_hidden_field
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* set the attribute of the parameter as tainted *)
|
|
|
|
"__set_taint_attribute" execute___set_taint_attribute
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* set the attribute of the parameter as untainted *)
|
|
|
|
"__set_untaint_attribute" (execute___set_attr Sil.Auntaint)
|
|
|
|
let __set_locked_attribute = Builtin.register
|
|
|
|
(* set the attribute of the parameter as locked *)
|
|
|
|
"__set_locked_attribute" execute___set_locked_attribute
|
|
|
|
let __set_unlocked_attribute = Builtin.register
|
|
|
|
(* set the attribute of the parameter as unlocked *)
|
|
|
|
"__set_unlocked_attribute" execute___set_unlocked_attribute
|
|
|
|
let _ = Builtin.register
|
|
|
|
"__throw" execute_skip
|
|
|
|
let __unwrap_exception = Builtin.register
|
|
|
|
(* unwrap an exception *)
|
|
|
|
"__unwrap_exception" execute__unwrap_exception
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* abort from C library *)
|
|
|
|
"abort" execute_abort
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* exit from C library *)
|
|
|
|
"exit" execute_exit
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* free from C library, requires allocated memory *)
|
|
|
|
"free" (execute_free Sil.Mmalloc)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* fscanf from C library *)
|
|
|
|
"fscanf" (execute_scan_function 2)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* vsscanf from C library *)
|
|
|
|
"fwscanf" (execute_scan_function 2)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* malloc from C library *)
|
|
|
|
"malloc" (execute_alloc Sil.Mmalloc true)
|
|
|
|
let malloc_no_fail = Builtin.register
|
|
|
|
(* malloc from ObjC library *)
|
|
|
|
"malloc_no_fail" (execute_alloc Sil.Mmalloc false)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* register execution handler for pthread_create *)
|
|
|
|
"pthread_create" execute_pthread_create
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* scanf from C library *)
|
|
|
|
"scanf" (execute_scan_function 1)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* sscanf from C library *)
|
|
|
|
"sscanf" (execute_scan_function 2)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* vsscanf from C library *)
|
|
|
|
"swscanf" (execute_scan_function 2)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* vfwscanf from C library *)
|
|
|
|
"vfscanf" (execute_scan_function 2)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* vsscanf from C library *)
|
|
|
|
"vfwscanf" (execute_scan_function 2)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* vscanf from C library *)
|
|
|
|
"vscanf" (execute_scan_function 1)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* vsscanf from C library *)
|
|
|
|
"vsscanf" (execute_scan_function 2)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* vsscanf from C library *)
|
|
|
|
"vswscanf" (execute_scan_function 2)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* vsscanf from C library *)
|
|
|
|
"vwscanf" (execute_scan_function 1)
|
|
|
|
let _ = Builtin.register
|
|
|
|
(* vsscanf from C library *)
|
|
|
|
"wscanf" (execute_scan_function 1)
|
|
|
|
|
|
|
|
let execute_objc_alloc_no_fail
|
|
|
|
symb_state typ
|
|
|
|
{ Builtin.pdesc; tenv; ret_ids; loc; } =
|
|
|
|
let alloc_fun = Sil.Const (Sil.Cfun __objc_alloc_no_fail) in
|
|
|
|
let ptr_typ = Sil.Tptr (typ, Sil.Pk_pointer) in
|
|
|
|
let sizeof_typ = Sil.Sizeof (typ, Sil.Subtype.exact) in
|
|
|
|
let alloc_instr = Sil.Call (ret_ids, alloc_fun, [sizeof_typ, ptr_typ], loc, Sil.cf_default) in
|
|
|
|
sym_exec_generated false tenv pdesc [alloc_instr] symb_state
|
|
|
|
|
|
|
|
let execute_objc_NSArray_alloc_no_fail
|
|
|
|
({ Builtin.tenv; } as builtin_args) symb_state =
|
|
|
|
let nsarray_typ_ =
|
|
|
|
Sil.Tvar (Typename.TN_csu (Csu.Class Csu.Objc, Mangled.from_string "NSArray")) in
|
|
|
|
let nsarray_typ = Tenv.expand_type tenv nsarray_typ_ in
|
|
|
|
execute_objc_alloc_no_fail symb_state nsarray_typ builtin_args
|
|
|
|
|
|
|
|
let execute_NSArray_arrayWithObjects_count builtin_args =
|
|
|
|
let n_formals = 1 in
|
|
|
|
let res = sym_exe_check_variadic_sentinel ~fails_on_nil: true n_formals (0,1) builtin_args in
|
|
|
|
execute_objc_NSArray_alloc_no_fail builtin_args res
|
|
|
|
|
|
|
|
let execute_NSArray_arrayWithObjects builtin_args =
|
|
|
|
let n_formals = 1 in
|
|
|
|
let res = sym_exe_check_variadic_sentinel n_formals (0,1) builtin_args in
|
|
|
|
execute_objc_NSArray_alloc_no_fail builtin_args res
|
|
|
|
|
|
|
|
let _ =
|
|
|
|
let method_kind = Procname.mangled_of_objc_method_kind Procname.Class_objc_method in
|
|
|
|
Builtin.register_procname
|
|
|
|
(Procname.ObjC_Cpp
|
|
|
|
(Procname.objc_cpp "NSArray" "arrayWithObjects:count:" method_kind))
|
|
|
|
execute_NSArray_arrayWithObjects_count
|
|
|
|
let _ =
|
|
|
|
let method_kind = Procname.mangled_of_objc_method_kind Procname.Class_objc_method in
|
|
|
|
Builtin.register_procname
|
|
|
|
(Procname.ObjC_Cpp
|
|
|
|
(Procname.objc_cpp "NSArray" "arrayWithObjects:" method_kind))
|
|
|
|
execute_NSArray_arrayWithObjects
|
|
|
|
|
|
|
|
let execute_objc_NSDictionary_alloc_no_fail
|
|
|
|
symb_state
|
|
|
|
({ Builtin.tenv; } as builtin_args) =
|
|
|
|
let nsdictionary_typ_ =
|
|
|
|
Sil.Tvar (Typename.TN_csu (Csu.Class Csu.Objc, Mangled.from_string "NSDictionary")) in
|
|
|
|
let nsdictionary_typ =
|
|
|
|
Tenv.expand_type tenv nsdictionary_typ_ in
|
|
|
|
execute_objc_alloc_no_fail symb_state nsdictionary_typ builtin_args
|
|
|
|
|
|
|
|
let execute___objc_dictionary_literal builtin_args =
|
|
|
|
let n_formals = 1 in
|
|
|
|
let res' =
|
|
|
|
sym_exe_check_variadic_sentinel ~fails_on_nil: true n_formals (0,1) builtin_args in
|
|
|
|
execute_objc_NSDictionary_alloc_no_fail res' builtin_args
|
|
|
|
|
|
|
|
let __objc_dictionary_literal =
|
|
|
|
let method_kind = Procname.mangled_of_objc_method_kind Procname.Class_objc_method in
|
|
|
|
let pname =
|
|
|
|
Procname.ObjC_Cpp
|
|
|
|
(Procname.objc_cpp "NSDictionary" "__objc_dictionary_literal:" method_kind) in
|
|
|
|
Builtin.register_procname pname execute___objc_dictionary_literal;
|
|
|
|
pname
|
|
|
|
|
|
|
|
end
|
|
|
|
(* ============== END of ModelBuiltins ============== *)
|