package mopsa
MOPSA: A Modular and Open Platform for Static Analysis using Abstract Interpretation
Install
Dune Dependency
Authors
Maintainers
Sources
mopsa-analyzer-v1.1.tar.gz
md5=fdee20e988343751de440b4f6b67c0f4
sha512=f5cbf1328785d3f5ce40155dada2d95e5de5cce4f084ea30cfb04d1ab10cc9403a26cfb3fa55d0f9da72244482130fdb89c286a9aed0d640bba46b7c00e09500
doc/src/combiners_common/common.ml.html
Source file common.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323
(****************************************************************************) (* *) (* This file is part of MOPSA, a Modular Open Platform for Static Analysis. *) (* *) (* Copyright (C) 2017-2019 The MOPSA Project. *) (* *) (* This program is free software: you can redistribute it and/or modify *) (* it under the terms of the GNU Lesser General Public License as published *) (* by the Free Software Foundation, either version 3 of the License, or *) (* (at your option) any later version. *) (* *) (* This program is distributed in the hope that it will be useful, *) (* but WITHOUT ANY WARRANTY; without even the implied warranty of *) (* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *) (* GNU Lesser General Public License for more details. *) (* *) (* You should have received a copy of the GNU Lesser General Public License *) (* along with this program. If not, see <http://www.gnu.org/licenses/>. *) (* *) (****************************************************************************) (** Common utility definitions used by combiners *) open Core.All open Mopsa_utils (** Kinds of domain combiners *) type combiner = | Sequence | Compose | Product (** GADT identifiers used by domain combiners *) type _ id += | C_empty : unit id | C_pair : combiner * 'a id * 'b id -> ('a*'b) id let () = register_id { eq = ( let f : type a b. witness -> a id -> b id -> (a,b) Eq.eq option = fun next id1 id2 -> match id1, id2 with | C_empty, C_empty -> Some Eq | C_pair(c1,x1,y1), C_pair(c2,x2,y2) -> if c1 = c2 then match equal_id x1 x2 with | None -> None | Some Eq -> match equal_id y1 y2 with | None -> None | Some Eq -> Some Eq else None | _ -> next.eq id1 id2 in f ); } (** GADT identifiers used by value combiners *) type _ id += V_empty : unit id type _ id += V_pair : 'a id * 'b id -> ('a*'b) id let () = register_id { eq = ( let f : type a b. witness -> a id -> b id -> (a,b) Eq.eq option = fun next id1 id2 -> match id1, id2 with | V_empty, V_empty -> Some Eq | V_pair(x1,y1), V_pair(x2,y2) -> begin match equal_id x1 x2 with | None -> None | Some Eq -> match equal_id y1 y2 with | None -> None | Some Eq -> Some Eq end | _ -> next.eq id1 id2 in f ); } (** [sat_targets ~domains ~targets] checks whether a combiner containing [domains] satisifies some route [targets] *) let sat_targets ~targets ~domains = match targets with | None -> true | Some s -> not (DomainSet.is_empty (DomainSet.inter s domains)) type accessor += | Ax_pair_left | Ax_pair_right let () = register_accessor { print = (fun next fmt -> function | Ax_pair_right -> Format.pp_print_string fmt "right" | Ax_pair_left -> Format.pp_print_string fmt "left" | t -> next fmt t ); compare = (fun next t1 t2 -> match t1, t2 with | Ax_pair_right, Ax_pair_right -> 0 | Ax_pair_left, Ax_pair_left -> 0 | _ -> compare t1 t2 ); } (** Manager of the left argument in a pair of domains *) let fst_pair_man (man:('a, 'b * 'c) man) : ('a, 'b) man = { man with get = get_pair_fst man; set = set_pair_fst man; add_change = (fun stmt path change_map -> man.add_change stmt (Ax_pair_left :: path) change_map); } (** Manager of the right argument in a pair of domains *) let snd_pair_man (man:('a, 'b * 'c) man) : ('a, 'c) man = { man with get = get_pair_snd man; set = set_pair_snd man; add_change = (fun stmt path change_map -> man.add_change stmt (Ax_pair_right :: path) change_map); } (** Find the manager of a domain given the manager of a combiner containing it *) let rec find_domain_man : type b c. target:b id -> tree:c id -> ('a,c) man -> ('a,b) man = fun ~target ~tree man -> match tree with | C_empty -> raise Not_found | C_pair(_,left,right) -> begin try find_domain_man ~target ~tree:left (fst_pair_man man) with Not_found -> find_domain_man ~target ~tree:right (snd_pair_man man) end | _ -> match equal_id target tree with | Some Eq -> man | None -> raise Not_found (** Check whether a domain is part of a combiner tree *) let rec mem_domain : type b c. target:b id -> tree:c id -> bool = fun ~target ~tree -> match tree with | C_empty -> false | C_pair(_,left,right) -> mem_domain ~target ~tree:left || mem_domain ~target ~tree:right | _ -> match equal_id target tree with | Some Eq -> true | None -> false let pp_domains fmt s = Format.(pp_print_list ~pp_sep:(fun fmt () -> pp_print_string fmt ", ") pp_print_string) fmt (DomainSet.elements s) (** Apply transfer functions [f1] and [f2] in cascade. Function [f1] is called first. When [f1] returns [None] or not-handled cases, [f2] is called. Note that not-handled cases are joined in order to call [f2] only once. *) let cascade_call targets f1 domains1 f2 domains2 = match sat_targets ~targets ~domains:domains1, sat_targets ~targets ~domains:domains2 with | false, false -> (* Both domains do not provide an [exec] for such targets *) Exceptions.panic "switch: targets '%a' not found in %a nor %a" (OptionExt.print pp_domains) targets pp_domains domains1 pp_domains domains2 | true, false -> (* Only [D1] provides a transfer function for such targets *) let f = f1 targets in (fun cmd man flow -> f cmd (fst_pair_man man) flow) | false, true -> (* Only [D2] provides a transfer function for such targets *) let f = f2 targets in (fun cmd man flow -> f cmd (snd_pair_man man) flow) | true, true -> (* Both [D1] and [D2] provide a transfer function for such targets *) let ff1 = f1 targets in let ff2 = f2 targets in (fun cmd man flow -> match ff1 cmd (fst_pair_man man) flow with | None -> ff2 cmd (snd_pair_man man) flow | Some ret1 -> (* Collect cases not handled by [D1] and pass them to [D2] *) match Cases.partition (fun c flow -> match c with NotHandled -> true | _ -> false) ret1 with | None, _ -> Some ret1 | Some not_handled1, handled1 -> (* Fusion all not-handled cases to speedup the analysis *) let not_handled1' = Cases.remove_duplicates man.lattice not_handled1 in (* Call [D2] on not-handled cases *) let ret2 = not_handled1' >>=? fun _ flow -> ff2 cmd (snd_pair_man man) flow in OptionExt.neutral2 Cases.join handled1 ret2) let cascade_stateless_call targets f1 domains1 f2 domains2 = match sat_targets ~targets ~domains:domains1, sat_targets ~targets ~domains:domains2 with | false, false -> (* Both domains do not provide an [exec] for such targets *) Exceptions.panic "switch: targets '%a' not found in %a nor %a" (OptionExt.print pp_domains) targets pp_domains domains1 pp_domains domains2 | true, false -> (* Only [D1] provides a transfer function for such targets *) f1 targets | false, true -> (* Only [D2] provides a transfer function for such targets *) f2 targets | true, true -> (* Both [D1] and [D2] provide a transfer function for such targets *) let ff1 = f1 targets in let ff2 = f2 targets in (fun cmd man flow -> match ff1 cmd man flow with | None -> ff2 cmd man flow | Some ret1 -> (* Collect cases not handled by [D1] and pass them to [D2] *) match Cases.partition (fun c flow -> match c with NotHandled -> true | _ -> false) ret1 with | None, _ -> Some ret1 | Some not_handled1, handled1 -> (* Fusion all not-handled cases to speedup the analysis *) let not_handled1' = Cases.remove_duplicates man.lattice not_handled1 in (* Call [D2] on not-handled cases *) let ret2 = not_handled1' >>=? fun _ flow -> ff2 cmd man flow in OptionExt.neutral2 Cases.join handled1 ret2) let broadcast_call targets f1 domains1 f2 domains2 = match sat_targets ~targets ~domains:domains1, sat_targets ~targets ~domains:domains2 with | false, false -> (* Both domains do not provide an [exec] for such targets *) Exceptions.panic "broadcast_call: targets '%a' not found in %a nor %a" (OptionExt.print pp_domains) targets pp_domains domains1 pp_domains domains2 | true, false -> (* Only [D1] provides a transfer function for such targets *) let f = f1 targets in (fun cmd man flow -> f cmd (fst_pair_man man) flow) | false, true -> (* Only [D2] provides a transfer function for such targets *) let f = f2 targets in (fun cmd man flow -> f cmd (snd_pair_man man) flow) | true, true -> (* Both [D1] and [D2] provide a transfer function for such targets *) let ff1 = f1 targets in let ff2 = f2 targets in (fun cmd man flow -> OptionExt.neutral2 Cases.join (ff1 cmd (fst_pair_man man) flow) (ff2 cmd (snd_pair_man man) flow)) let broadcast_stateless_call targets f1 domains1 f2 domains2 = match sat_targets ~targets ~domains:domains1, sat_targets ~targets ~domains:domains2 with | false, false -> (* Both domains do not provide an [exec] for such targets *) Exceptions.panic "broadcast_stateless_call: targets '%a' not found in %a nor %a" (OptionExt.print pp_domains) targets pp_domains domains1 pp_domains domains2 | true, false -> (* Only [D1] provides a transfer function for such targets *) f1 targets | false, true -> (* Only [D2] provides a transfer function for such targets *) f2 targets | true, true -> (* Both [D1] and [D2] provide a transfer function for such targets *) let ff1 = f1 targets in let ff2 = f2 targets in (fun cmd man flow -> OptionExt.neutral2 Cases.join (ff1 cmd man flow) (ff2 cmd man flow)) let broadcast_init f1 f2 prog man flow = match f1 prog (fst_pair_man man) flow with | None -> f2 prog (snd_pair_man man) flow | Some r1 -> match r1 >>%? f2 prog (snd_pair_man man) with | None -> Some r1 | Some r2 -> Some r2 let broadcast_stateless_init f1 f2 prog man flow = match f1 prog man flow with | None -> f2 prog man flow | Some r1 -> match r1 >>%? f2 prog man with | None -> Some r1 | Some r2 -> Some r2
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>