You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

72 lines
2.0 KiB

(*
* Copyright (c) 2016 - 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.
*)
open! IStd
module IdMap = Var.Map
type astate = AccessPath.Raw.t IdMap.t
include IdMap
let pp fmt astate =
IdMap.pp ~pp_value:AccessPath.Raw.pp fmt astate
let (<=) ~lhs ~rhs =
if phys_equal lhs rhs
then true
else
try
IdMap.for_all
(fun id lhs_ap ->
let rhs_ap = IdMap.find id rhs in
let eq = AccessPath.Raw.equal lhs_ap rhs_ap in
if not eq && Config.debug_exceptions
then
failwithf "Id %a maps to both %a and %a@."
Var.pp id
AccessPath.Raw.pp lhs_ap
AccessPath.Raw.pp rhs_ap;
eq)
lhs
with Not_found -> false
(* in principle, could do a join here if the access paths have the same root. but they should
always be equal if we are using the map correctly *)
let check_invariant ap1 ap2 = function
| Var.ProgramVar pvar when Pvar.is_frontend_tmp pvar ->
(* Sawja reuses temporary variables which sometimes breaks this invariant *)
(* TODO: fix (13370224) *)
()
| id ->
if not (AccessPath.Raw.equal ap1 ap2)
then
failwithf "Id %a maps to both %a and %a@."
Var.pp id
AccessPath.Raw.pp ap1
AccessPath.Raw.pp ap2
let join astate1 astate2 =
if phys_equal astate1 astate2
then astate1
else
IdMap.merge
(fun var ap1_opt ap2_opt -> match ap1_opt, ap2_opt with
| Some ap1, Some ap2 ->
if Config.debug_exceptions then check_invariant ap1 ap2 var;
ap1_opt
| Some _, None -> ap1_opt
| None, Some _ -> ap2_opt
| None, None -> None)
astate1
astate2
let widen ~prev ~next ~num_iters:_ =
join prev next