package frama-c
Platform dedicated to the analysis of source code written in C
Install
Dune Dependency
Authors
-
MMichele Alberti
-
TThibaud Antignac
-
GGergö Barany
-
PPatrick Baudin
-
NNicolas Bellec
-
TThibaut Benjamin
-
AAllan Blanchard
-
LLionel Blatter
-
FFrançois Bobot
-
RRichard Bonichon
-
VVincent Botbol
-
QQuentin Bouillaguet
-
DDavid Bühler
-
ZZakaria Chihani
-
LLoïc Correnson
-
JJulien Crétin
-
PPascal Cuoq
-
ZZaynah Dargaye
-
BBasile Desloges
-
JJean-Christophe Filliâtre
-
PPhilippe Herrmann
-
MMaxime Jacquemin
-
FFlorent Kirchner
-
AAlexander Kogtenkov
-
RRemi Lazarini
-
TTristan Le Gall
-
JJean-Christophe Léchenet
-
MMatthieu Lemerre
-
DDara Ly
-
DDavid Maison
-
CClaude Marché
-
AAndré Maroneze
-
TThibault Martin
-
FFonenantsoa Maurica
-
MMelody Méaulle
-
BBenjamin Monate
-
YYannick Moy
-
PPierre Nigron
-
AAnne Pacalet
-
VValentin Perrelle
-
GGuillaume Petiot
-
DDario Pinto
-
VVirgile Prevosto
-
AArmand Puccetti
-
FFélix Ridoux
-
VVirgile Robles
-
JJan Rochel
-
MMuriel Roger
-
JJulien Signoles
-
NNicolas Stouls
-
KKostyantyn Vorobyov
-
BBoris Yakobowski
Maintainers
Sources
frama-c-29.0-Copper.tar.gz
sha256=d2fbb3b8d0ff83945872e9e6fa258e934a706360e698dae3b4d5f971addf7493
doc/src/frama-c-instantiate.core/basic_blocks.ml.html
Source file basic_blocks.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
(**************************************************************************) (* *) (* This file is part of Frama-C. *) (* *) (* Copyright (C) 2007-2024 *) (* CEA (Commissariat à l'énergie atomique et aux énergies *) (* alternatives) *) (* *) (* 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, version 2.1. *) (* *) (* It 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. *) (* *) (* See the GNU Lesser General Public License version 2.1 *) (* for more details (enclosed in the file licenses/LGPLv2.1). *) (* *) (**************************************************************************) open Cil open Cil_types open Cil_const open Logic_const let ptr_of t = TPtr(t, []) let const_of t = Cil.typeAddAttributes [Attr("const", [])] t let size_t () = Globals.Types.find_type Logic_typing.Typedef "size_t" let prepare_definition name fun_type = let vi = Cil.makeGlobalVar ~referenced:true name fun_type in vi.vdefined <- true ; let fd = Cil.emptyFunctionFromVI vi in Cil.setFormalsDecl vi fun_type ; fd.sformals <- Cil.getFormalsDecl vi ; fd let call_function lval vi args = let loc = Cil_datatype.Location.unknown in let _, typs, _, _ = Cil.splitFunctionTypeVI vi in let typs = Cil.argsToList typs in let gen_arg exp (_, typ, _) = if Cil_datatype.Typ.equal vi.vtype typ then exp else Cil.mkCast ~newt:typ exp in let args = List.map2 gen_arg args typs in Call(lval, (Cil.evar vi), args, loc) let rec string_of_typ_aux = function | TVoid(_) -> "void" | TInt(IBool, _) -> "bool" | TInt(IChar, _) -> "char" | TInt(ISChar, _) -> "schar" | TInt(IUChar, _) -> "uchar" | TInt(IInt, _) -> "int" | TInt(IUInt, _) -> "uint" | TInt(IShort, _) -> "short" | TInt(IUShort, _) -> "ushort" | TInt(ILong, _) -> "long" | TInt(IULong, _) -> "ulong" | TInt(ILongLong, _) -> "llong" | TInt(IULongLong, _) -> "ullong" | TFloat(FFloat, _) -> "float" | TFloat(FDouble, _) -> "double" | TFloat(FLongDouble, _) -> "ldouble" | TPtr(t, _) -> "ptr_" ^ string_of_typ t | TEnum (ei, _) -> "e_" ^ ei.ename | TComp (ci, _) when ci.cstruct -> "st_" ^ ci.cname | TComp (ci, _) -> "un_" ^ ci.cname | TArray (t, Some e, _) -> "arr" ^ (string_of_exp e) ^ "_" ^ string_of_typ t | t -> Options.fatal "unsupported type %a" Cil_printer.pp_typ t and string_of_typ t = string_of_typ_aux (Cil.unrollType t) and string_of_exp e = Format.asprintf "%a" Cil_printer.pp_exp e let size_var ?(name_ext="") t value = { l_var_info = make_logic_var_local ("__fc_" ^ name_ext ^ "len") t; l_type = Some t; l_tparams = []; l_labels = []; l_profile = []; l_body = LBterm value; } (** Features related to terms *) let cvar_to_tvar vi = tvar (cvar_to_lvar vi) let tminus ?loc t1 t2 = let minus, typ = match t1.term_type, t2.term_type with | Ctype(t1), Ctype(t2) when Cil.isPointerType t1 && Cil.isPointerType t2 -> MinusPP, Linteger | Ctype(t), _ when Cil.isPointerType t -> MinusPI, Ctype(t) | t, _ -> MinusA, t in term ?loc (TBinOp(minus, t1, t2)) typ let tplus ?loc t1 t2 = let plus = match t1.term_type with | Ctype(t) when Cil.isPointerType t -> PlusPI | _ -> PlusA in term ?loc (TBinOp(plus, t1, t2)) t1.term_type let tdivide ?loc t1 t2 = term ?loc (TBinOp(Div, t1, t2)) t1.term_type let ttype_of_pointed t = match Logic_utils.unroll_type t with | Ctype(TPtr(t, _)) | Ctype(TArray(t, _, _)) -> Ctype t | _ -> Options.fatal "ttype_of_pointed on a non pointer type" let tbuffer_range ?loc ptr len = let last = tminus ?loc len (tinteger ?loc 1) in let range = trange ?loc (Some (tinteger ?loc 0), Some last) in tplus ?loc ptr range let rec tunref_range ?loc ptr len = let typ = ttype_of_pointed ptr.term_type in let range = tbuffer_range ?loc ptr len in let tlval = (TMem range), TNoOffset in let tlval, typ = tunref_range_unfold ?loc tlval typ in term (TLval tlval) typ and tunref_range_unfold ?loc lval typ = match typ with | Ctype(TArray(typ, Some e, _)) -> let len = Logic_utils.expr_to_term ~coerce:true e in let last = tminus ?loc len (tinteger ?loc 1) in let range = trange ?loc (Some (tinteger ?loc 0), Some last) in let lval = addTermOffsetLval (TIndex(range, TNoOffset)) lval in tunref_range_unfold lval (Ctype typ) | _ -> lval, typ let taccess ?loc ptr offset = let get_lval = function | TLval(lval) -> lval | _ -> Options.fatal "unexpected non-lvalue on call to taccess" in match Logic_utils.unroll_type ptr.term_type with | Ctype(TPtr(_)) -> let address = tplus ?loc ptr offset in let lval = TLval(TMem(address), TNoOffset) in term ?loc lval (ttype_of_pointed ptr.term_type) | Ctype(TArray(_)) -> let lval = get_lval ptr.term_node in let lval = addTermOffsetLval (TIndex(offset, TNoOffset)) lval in term ?loc (TLval lval) (ttype_of_pointed ptr.term_type) | _ -> Options.fatal "taccess on a non pointer type" let sizeofpointed = function | Ctype(TPtr(t, _)) | Ctype(TArray(t, _, _)) -> Cil.bytesSizeOf t | _ -> Options.fatal "size_of_pointed on a non pointer type" let sizeof = function | Ctype t -> Cil.bytesSizeOf t | _ -> Options.fatal "sizeof on a non C type" let tunref_range_bytes_len ?loc ptr bytes_len = let sizeof = sizeofpointed ptr.term_type in if sizeof = 1 then tunref_range ?loc ptr bytes_len else let sizeof = tinteger ?loc sizeof in let len = tdivide ?loc bytes_len sizeof in tunref_range ?loc ptr len (** Features related to predicates *) let plet_len_div_size ?loc ?name_ext t bytes_len pred = let sizeof = sizeofpointed t in if sizeof = 1 then pred bytes_len else let len = tdivide ?loc bytes_len (tinteger ?loc sizeof) in let len_var = size_var ?name_ext Linteger len in plet ?loc len_var (pred (tvar len_var.l_var_info)) let pgeneric_valid_buffer ?loc validity lbl ptr len = let buffer = tbuffer_range ?loc ptr len in validity ?loc (lbl, buffer) let pgeneric_valid_len_bytes ?loc validity lbl ptr bytes_len = plet_len_div_size ?loc ptr.term_type bytes_len (pgeneric_valid_buffer ?loc validity lbl ptr) let pvalid_len_bytes ?loc = pgeneric_valid_len_bytes ?loc pvalid let pvalid_read_len_bytes ?loc = pgeneric_valid_len_bytes ?loc pvalid_read let pcorrect_len_bytes ?loc t bytes_len = let sizeof = tinteger ?loc (sizeofpointed t) in let modulo = term ?loc (TBinOp(Mod, bytes_len, sizeof)) Linteger in prel ?loc (Req, modulo, tinteger ?loc 0) let pbounds_incl_excl ?loc low value up = let geq_0 = prel ?loc (Rle, low, value) in let lt_len = prel ?loc (Rlt, value, up) in pand ?loc (geq_0, lt_len) let rec punfold_all_elems_eq ?loc t1 t2 len = assert(Cil_datatype.Logic_type.equal t1.term_type t2.term_type) ; pall_elems_eq ?loc 0 t1 t2 len and pall_elems_eq ?loc depth t1 t2 len = let ind = make_logic_var_quant ("j" ^ (string_of_int depth)) Linteger in let tind = tvar ind in let bounds = pbounds_incl_excl ?loc (tinteger 0) tind len in let t1_acc = taccess ?loc t1 tind in let t2_acc = taccess ?loc t2 tind in let eq = peq_unfold ?loc (depth+1) t1_acc t2_acc in pforall ?loc ([ind], (pimplies ?loc (bounds, eq))) and peq_unfold ?loc depth t1 t2 = match Logic_utils.unroll_type t1.term_type with | Ctype(TArray(_, Some len, _)) -> let len = Logic_utils.expr_to_term ~coerce:true len in pall_elems_eq ?loc depth t1 t2 len | _ -> prel ?loc (Req, t1, t2) let rec punfold_all_elems_pred ?loc t1 len pred = pall_elems_pred ?loc 0 t1 len pred and pall_elems_pred ?loc depth t1 len pred = let ind = make_logic_var_quant ("j" ^ (string_of_int depth)) Linteger in let tind = tvar ind in let bounds = pbounds_incl_excl ?loc (tinteger 0) tind len in let t1_acc = taccess ?loc t1 tind in let eq = punfold_pred ?loc depth t1_acc pred in pforall ?loc ([ind], (pimplies ?loc (bounds, eq))) and punfold_pred ?loc ?(dyn_len = None) depth t1 pred = match Logic_utils.unroll_type t1.term_type with | Ctype(TArray(_, opt_len, _)) -> let len = match opt_len, dyn_len with | Some len, None -> Logic_utils.expr_to_term ~coerce:true len | _ , Some len -> len | None, None -> Options.fatal "Unfolding array: cannot find a length" in pall_elems_pred ?loc (depth+1) t1 len pred | Ctype(TComp(ci, _)) -> pall_fields_pred ?loc depth t1 ci pred | _ -> pred ?loc t1 and pall_fields_pred ?loc ?(flex_mem_len=None) depth t1 ci pred = let eq dyn_len fi = let lval = match t1.term_node with TLval(lv) -> lv | _ -> assert false in let nlval = addTermOffsetLval (TField(fi, TNoOffset)) lval in let term = term ?loc (TLval nlval) (Ctype fi.ftype) in punfold_pred ?loc ~dyn_len depth term pred in let rec eqs_fields = function | [] -> [] | [ x ] -> [ eq flex_mem_len x ] | x :: l -> let x' = eq None x in x' :: (eqs_fields l) in pands (eqs_fields (Option.get ci.cfields)) let punfold_flexible_struct_pred ?loc the_struct bytes_len pred = let struct_len = tinteger ?loc (sizeof the_struct.term_type) in let ci = match the_struct.term_type with | Ctype(TComp(ci, _) as t) when Cil.has_flexible_array_member t -> ci | _ -> Options.fatal "Unfolding flexible on a non flexible structure" in let flex_type = Ctype (Extlib.last (Option.get ci.cfields)).ftype in let flex_len = tminus bytes_len struct_len in let pall_fields_pred len = pall_fields_pred ?loc ~flex_mem_len:(Some len) 0 the_struct ci pred in plet_len_div_size ?loc ~name_ext:"flex" flex_type flex_len pall_fields_pred let pseparated_memories ?loc p1 len1 p2 len2 = let b1 = tbuffer_range ?loc p1 len1 in let b2 = tbuffer_range ?loc p2 len2 in pseparated ?loc [ b1 ; b2 ] let make_behavior ?(name=Cil.default_behavior_name) ?(assumes=[]) ?(requires=[]) ?(ensures=[])?(assigns=WritesAny) ?(alloc=FreeAllocAny) ?(extension=[]) () = { b_name = name ; b_requires = requires ; b_assumes = assumes ; b_post_cond = ensures ; b_assigns = assigns ; b_allocation = alloc; b_extended = extension } let default_comp_disj bhvs = let b_names = List.filter (fun b -> not (String.equal Cil.default_behavior_name b)) (List.fold_left (fun l b -> b.b_name :: l) [] bhvs) in match b_names with | [] -> [], [] | _ -> [b_names], [b_names] let make_funspec bhvs ?(termination=None) ?(complete_disjoint=(default_comp_disj bhvs)) () = let complete, disjoint = complete_disjoint in { spec_behavior = bhvs ; spec_variant = None ; spec_terminates = termination ; spec_complete_behaviors = complete ; spec_disjoint_behaviors = disjoint }
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>