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/parsing/ast.ml.html
Source file ast.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 324 325 326 327 328 329 330
(****************************************************************************) (* *) (* 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/>. *) (* *) (****************************************************************************) (** Abstract syntax tree for C stubs. It is similar to the CST except: - predicates are expanded. - types and variables are resolved using the context of the Clang parser. - calls to sizeof are resolved using Clang's target information. - stubs and cases record their locals and assignments. *) open Mopsa_utils open Mopsa_c_parser open Location type stub = { stub_name : string; stub_params : var list; stub_locals : local with_range list; stub_assigns : assigns with_range list; stub_body : section list; stub_range : range; } (** {2 Stub sections} *) (** ***************** *) and section = | S_case of case | S_leaf of leaf and leaf = | S_local of local with_range | S_assumes of assumes with_range | S_requires of requires with_range | S_assigns of assigns with_range | S_ensures of ensures with_range | S_free of free with_range | S_message of message with_range and case = { case_label : string; case_body : leaf list; case_locals : local with_range list; case_assigns : assigns with_range list; case_range : range; } (** {2 Leaf sections} *) (** ********************** *) and requires = formula with_range and ensures = formula with_range and assumes = formula with_range and local = { lvar : var; lval : local_value; } and local_value = | L_new of resource | L_call of C_AST.func with_range (** function *) * expr with_range list (* arguments *) and assigns = { assign_target : expr with_range; assign_offset : interval list; } and free = expr with_range and message = { message_kind: message_kind; message_body: string; } and message_kind = Cst.message_kind = | WARN | UNSOUND (** {2 Expressions} *) (** *=*=*=*=*=*=*=* *) and expr_kind = | E_top of C_AST.type_qual | E_int of Z.t | E_float of float | E_string of string | E_char of int | E_invalid | E_var of var | E_unop of unop * expr with_range | E_binop of binop * expr with_range * expr with_range | E_addr_of of expr with_range | E_deref of expr with_range | E_cast of C_AST.type_qual * bool (** is it explicit? *) * expr with_range | E_subscript of expr with_range * expr with_range | E_member of expr with_range * int * string | E_arrow of expr with_range * int * string | E_conditional of expr with_range * expr with_range * expr with_range | E_builtin_call of builtin * expr with_range list | E_raise of string | E_return and expr = { kind : expr_kind; typ : C_AST.type_qual; } and log_binop = Cst.log_binop and binop = Cst.binop and unop = Cst.unop and set = | S_interval of interval | S_resource of resource and interval ={ itv_lb: expr with_range; (** lower bound *) itv_open_lb: bool; (** open lower bound *) itv_ub: expr with_range; (** upper bound *) itv_open_ub: bool; (** open upper bound *) } and resource = string and var = C_AST.variable and builtin = Cst.builtin (** {2 Formulas} *) (** ************ *) and formula = | F_expr of expr with_range | F_bool of bool | F_binop of log_binop * formula with_range * formula with_range | F_not of formula with_range | F_forall of var * set * formula with_range | F_exists of var * set * formula with_range | F_in of expr with_range * set | F_otherwise of formula with_range * expr with_range | F_if of formula with_range * formula with_range * formula with_range (** {2 Utility functions} *) (** ********************* *) let compare_var v1 v2 = Compare.compose [ (fun () -> compare v1.C_AST.var_unique_name v2.C_AST.var_unique_name); (fun () -> compare v1.C_AST.var_uid v2.C_AST.var_uid); ] let compare_resource r1 r2 = compare r1 r2 (** {2 Pretty printers} *) (** ******************* *) open Format let pp_var fmt v = pp_print_string fmt v.C_AST.var_org_name let pp_resource = pp_print_string let pp_builtin = Cst.pp_builtin let pp_list pp sep fmt l = pp_print_list ~pp_sep:(fun fmt () -> fprintf fmt sep) pp fmt l let pp_opt pp fmt o = match o with | None -> () | Some x -> pp fmt x let rec pp_expr fmt exp = match exp.content.kind with | E_top(t) -> fprintf fmt "⊤(%a)" pp_c_qual_typ t | E_int n -> Z.pp_print fmt n | E_float f -> pp_print_float fmt f | E_string s -> fprintf fmt "\"%s\"" s | E_char c -> if c >= 32 && c < 127 then fprintf fmt "'%c'" (Char.chr c) else fprintf fmt "%d" c | E_invalid -> fprintf fmt "INVALID" | E_var v -> pp_var fmt v | E_unop (op, e) -> fprintf fmt "%a(%a)" pp_unop op pp_expr e | E_binop (op, e1, e2) -> fprintf fmt "(%a) %a (%a)" pp_expr e1 pp_binop op pp_expr e2 | E_addr_of e -> fprintf fmt "&(%a)" pp_expr e | E_deref e -> fprintf fmt "*(%a)" pp_expr e | E_cast(t, explicit, e) -> if explicit then fprintf fmt "(%a) %a" pp_c_qual_typ t pp_expr e else pp_expr fmt e | E_subscript(a, i) -> fprintf fmt "%a[%a]" pp_expr a pp_expr i | E_member(s, i, f) -> fprintf fmt "%a.%s" pp_expr s f | E_arrow(p, i, f) -> fprintf fmt "%a->%s" pp_expr p f | E_conditional(c,e1,e2) -> fprintf fmt "%a?%a:%a" pp_expr c pp_expr e1 pp_expr e2 | E_builtin_call(f, args) -> fprintf fmt "%a(%a)" pp_builtin f (pp_list pp_expr ", ") args | E_return -> pp_print_string fmt "return" | E_raise msg -> fprintf fmt "raise(\"%s\")" msg and pp_unop = Cst.pp_unop and pp_binop = Cst.pp_binop and pp_c_qual_typ fmt t = Format.pp_print_string fmt (C_print.string_of_type_qual t) let rec pp_formula fmt (f:formula with_range) = match f.content with | F_expr e -> pp_expr fmt e | F_bool true -> pp_print_string fmt "true" | F_bool false -> pp_print_string fmt "false" | F_binop (op, f1, f2) -> fprintf fmt "(%a) %a (%a)" pp_formula f1 pp_log_binop op pp_formula f2 | F_not f -> fprintf fmt "not (%a)" pp_formula f | F_forall (x, set, f) -> fprintf fmt "∀ %a %a ∈ %a: @[%a@]" pp_c_qual_typ x.C_AST.var_type pp_var x pp_set set pp_formula f | F_exists (x, set, f) -> fprintf fmt "∃ %a %a ∈ %a: @[%a@]" pp_c_qual_typ x.C_AST.var_type pp_var x pp_set set pp_formula f | F_in (x, set) -> fprintf fmt "%a ∈ %a" pp_expr x pp_set set | F_otherwise (f, e) -> fprintf fmt "%a otherwise %a" pp_formula f pp_expr e | F_if (c,f1,f2) -> fprintf fmt "if %a then %a else %a end" pp_formula c pp_formula f1 pp_formula f2 and pp_log_binop = Cst.pp_log_binop and pp_set fmt = function | S_interval itv -> pp_interval fmt itv | S_resource(r) -> pp_resource fmt r and pp_interval fmt i = fprintf fmt "%s%a, %a%s" (if i.itv_open_lb then "]" else "[") pp_expr i.itv_lb pp_expr i.itv_ub (if i.itv_open_ub then "[" else "]") let rec pp_local fmt local = let local = get_content local in fprintf fmt "local : %a %a = @[%a@];" pp_c_qual_typ local.lvar.var_type pp_var local.lvar pp_local_value local.lval and pp_local_value fmt v = match v with | L_new resource -> fprintf fmt "new %a" pp_resource resource | L_call (f, args) -> fprintf fmt "%s(%a)" f.content.func_org_name (pp_list pp_expr ", ") args let pp_requires fmt requires = fprintf fmt "requires : @[%a@];" pp_formula requires.content let pp_assigns fmt assigns = fprintf fmt "assigns : %a%a;" pp_expr assigns.content.assign_target (pp_print_list ~pp_sep:(fun fmt () -> ()) pp_interval) assigns.content.assign_offset let pp_assumes fmt (assumes:assumes with_range) = fprintf fmt "assumes : @[%a@];" pp_formula assumes.content let pp_ensures fmt ensures = fprintf fmt "ensures : @[%a@];" pp_formula ensures.content let pp_free fmt free = fprintf fmt "free : %a;" pp_expr free.content let pp_message fmt msg = match msg.content.message_kind with | WARN -> fprintf fmt "warn: \"%s\";" msg.content.message_body | UNSOUND -> fprintf fmt "unsound: \"%s\";" msg.content.message_body let pp_leaf_section fmt sec = match sec with | S_local local -> pp_local fmt local | S_assumes assumes -> pp_assumes fmt assumes | S_requires requires -> pp_requires fmt requires | S_assigns assigns -> pp_assigns fmt assigns | S_ensures ensures -> pp_ensures fmt ensures | S_free free -> pp_free fmt free | S_message msg -> pp_message fmt msg let pp_leaf_sections fmt secs = pp_print_list ~pp_sep:(fun fmt () -> fprintf fmt "@\n") pp_leaf_section fmt secs let pp_case fmt case = fprintf fmt "case \"%s\":@\n @[<v 2>%a@]" case.case_label pp_leaf_sections case.case_body let pp_section fmt sec = match sec with | S_leaf leaf -> pp_leaf_section fmt leaf | S_case case -> pp_case fmt case let pp_sections fmt secs = pp_print_list ~pp_sep:(fun fmt () -> fprintf fmt "@\n") pp_section fmt secs
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>