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
-
SSylvain Chiron
-
LLoïc Correnson
-
JJulien Crétin
-
PPascal Cuoq
-
ZZaynah Dargaye
-
BBasile Desloges
-
JJean-Christophe Filliâtre
-
PPhilippe Herrmann
-
MMaxime Jacquemin
-
BBenjamin Jorge
-
FFlorent Kirchner
-
AAlexander Kogtenkov
-
RRemi Lazarini
-
TTristan Le Gall
-
KKilyan Le Gallic
-
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
-
CCécile Ruet-Cros
-
JJulien Signoles
-
NNicolas Stouls
-
KKostyantyn Vorobyov
-
BBoris Yakobowski
Maintainers
Sources
frama-c-31.0-beta-Gallium.tar.gz
sha256=095ffbb3086a6cd963a03e3defab4f0dc32e9a43f026e552ec9ae346a6e20522
doc/src/mthread/mt_memory.ml.html
Source file mt_memory.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 331 332 333 334
(**************************************************************************) (* *) (* This file is part of Frama-C. *) (* *) (* Copyright (C) 2007-2025 *) (* 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_types open Cil open Locations (* Must be used inlined, as Machine.theMachine is mutable let pointer_size_bytes = Machine.sizeof_ptr () let int_size_bytes = Machine.sizeof_int () *) let size_char_in_bits = 8 module Types = struct type state = Cvalue.Model.t type value = Cvalue.V.t type zone = Zone.t type slice = Cvalue.V_Offsetmap.t type functions_states = state Cil_datatype.Stmt.Hashtbl.t type map_functions_states = state Cil_datatype.Stmt.Map.t type state_accesser = | Global | Local of functions_states let map_functions_states_to_get_state m = fun s -> try Cil_datatype.Stmt.Map.find s m with Not_found -> Cvalue.Model.bottom let functions_states_to_request h stmt = let state = try Cil_datatype.Stmt.Hashtbl.find h stmt with Not_found -> Cvalue.Model.bottom in Results.in_cvalue_state state let iter_requests = function | Global -> fun stmt f -> let requests = Results.(before stmt |> by_callstack |> List.map snd) in List.iter (fun request-> f request) requests | Local hs -> fun stmt f -> f (functions_states_to_request hs stmt) let merge_map_non_map_functions_states map h = Cil_datatype.Stmt.Hashtbl.fold (fun stmt state m -> let previous = try Cil_datatype.Stmt.Map.find stmt m with Not_found -> Cvalue.Model.bottom in let join = Cvalue.Model.join previous state in if join != previous then Cil_datatype.Stmt.Map.add stmt join m else m ) h map let merge_map_functions_states = Cil_datatype.Stmt.Map.merge (Extlib.merge_opt (fun _ -> Cvalue.Model.join)) (* -------------------------------------------------------------------------- *) (* --- Ids --- *) (* -------------------------------------------------------------------------- *) type pointer = Cil_types.varinfo * int module Pointer = struct include Datatype.Pair_with_collections(Cil_datatype.Varinfo)(Datatype.Int) let pretty fmt ((v, o) : pointer) = if o = 0 then Format.fprintf fmt "&%a" Printer.pp_varinfo v else Format.fprintf fmt "&%a+%d" Printer.pp_varinfo v o end end let typ_array_char = Cil_const.(mk_tarray ucharType None) let pretty_slice fmt s = Cvalue.V_Offsetmap.pretty_generic ~typ:typ_array_char () fmt s let location_with_size_aux p sbytes = Locations.loc_bytes_to_loc_bits p, Abstract_interp.Int.of_int (size_char_in_bits * sbytes) let location_with_size p sbytes = let locb, size = location_with_size_aux p sbytes in Locations.make_loc locb (Int_Base.inject size) let location_of_pointer (p : Types.pointer) = Location_Bytes.inject (Base.of_varinfo (fst p) ) (Ival.of_int (snd p)) let lval_from_pointer (v, offs) : lval = let loc = v.vdecl in let exp_var = mkAddrOrStartOf ~loc (var v) in let exp_offs = Cil.new_exp ~loc (Const (CInt64 (Integer.of_int offs, IInt, None))) in let exp' = new_exp ~loc (BinOp (PlusPI, exp_var, exp_offs, Cil_const.intPtrType)) in let lval = mkMem ~addr:exp' ~off:NoOffset in lval let read_int_pointer p state = let p = location_of_pointer p in let p = location_with_size p (Machine.sizeof_int ()) in Cvalue.Model.find state p (* TODO: restore warnings *) let read_slice ~p ~sbytes state = let loc_bits, size = location_with_size_aux p sbytes in match Cvalue.Model.copy_offsetmap loc_bits size state with | `Bottom -> assert (Cvalue.Model.equal state Cvalue.Model.bottom); Mt_options.fatal "Reading inside bottom state" | `Value offs -> offs let write_int_pointer p i state = let sbytes = Machine.sizeof_int () and value = Location_Bytes.inject Base.null (Ival.of_int i) in let pointer = location_of_pointer p in let p = location_with_size pointer sbytes in Mt_options.debug ~level:3 "# Write %a at %a, size %d bytes" Cvalue.V.pretty value Locations.pretty p sbytes; Cvalue.Model.add_binding ~exact:true state p value let replace_value_at_int_pointer p ~before ~after state = let sbytes = Machine.sizeof_int () in let value_after = Location_Bytes.inject Base.null (Ival.of_int after) in let value_before = Location_Bytes.inject Base.null (Ival.of_int before) in let pointer = location_of_pointer p in let p = location_with_size pointer sbytes in let cur = Cvalue.Model.find ~conflate_bottom:true state p in if Location_Bytes.equal cur value_before then Cvalue.Model.add_binding ~exact:true state p value_after else if Location_Bytes.is_included value_before cur then let v = Cvalue.V.(join (diff_if_one cur value_before) value_after) in Cvalue.Model.add_binding ~exact:true state p v else state let write_slice ~p ~sbytes ~slice ~exact state = let pointer = Locations.loc_bytes_to_loc_bits (location_of_pointer p) in Cvalue.Model.paste_offsetmap ~from:slice ~dst_loc:pointer ~size:(Abstract_interp.Int.of_int (sbytes * size_char_in_bits)) ~exact state let extract_fun value = try let b, _ = Location_Bytes.find_lonely_key value in (match b with | Base.Var (v, _) -> (try let f = Globals.Functions.get v in (match f.fundec with | Definition (_, _) -> `Success f | Declaration (_, f, _, _) -> `Failure (fun fmt -> Format.fprintf fmt "Missing@ definition@ for function@ '%s'." f.vname)) with Not_found -> `Failure (fun fmt -> Format.fprintf fmt "Expected@ pointer to@ function,@ received@ \ non-function@ value %a." Base.pretty b)) | _ -> raise Not_found) with Not_found -> (* find_loneley_key + above *) `Failure (fun fmt -> Format.fprintf fmt "Expected@ pointer@ to function,@ received %a." Cvalue.V.pretty value) let extract_pointer value = try let b, i = Location_Bytes.find_lonely_key value in (match b with | Base.Var (v, _) | Base.Allocated (v, _, _) -> (try `Success (v, Abstract_interp.Int.to_int_exn (Ival.project_int i)) with Ival.Not_Singleton_Int -> `Failure (fun fmt -> Format.fprintf fmt "Not@ a@ correct@ \ pointer@, incorrect@ offset: %a" Ival.pretty i) ) | _ -> raise Not_found) with Not_found -> (* find_loneley_key + above *) `Failure (fun fmt -> Format.fprintf fmt "Not@ a@ correct@ \ pointer '%a'@ (should be@ variable+offset)" Cvalue.V.pretty value) let extract_int value = try let b, i = Location_Bytes.find_lonely_key value in (match b with | Base.Null -> (try `Success (Abstract_interp.Int.to_int_exn (Ival.project_int i)) with Ival.Not_Singleton_Int -> `Failure (fun fmt -> Format.fprintf fmt "Non-integer value: %a" Ival.pretty i) ) | _ -> raise Not_found) with Not_found -> (* find_loneley_key + above *) `Failure (fun fmt -> Format.fprintf fmt "Non-integer value: %a" Cvalue.V.pretty value) let extract_int_possibly_zero value = try let b, i = Location_Bytes.find_lonely_key value in (match b with | Base.Null -> let fail = `Failure (fun fmt -> Format.fprintf fmt "Non-integer value: %a" Ival.pretty i) in (try ignore (Ival.cardinal_less_than i 3); (match Ival.fold_int (fun i l -> i :: l) i [] with | [v] -> `Success (Abstract_interp.Int.to_int_exn v, `Exact) | [v1; v2] -> (* Sorted in reverse direction *) let v1 = Abstract_interp.Int.to_int_exn v1 in let v2 = Abstract_interp.Int.to_int_exn v2 in if v2 = 0 then `Success (v1, `WithZero) else fail | [] | _ :: _ :: _ :: _ -> fail ) with Abstract_interp.Error_Top | Abstract_interp.Not_less_than -> fail) | _ -> raise Not_found) with Not_found -> (* find_loneley_key + above *) `Failure (fun fmt -> Format.fprintf fmt "Non-integer value: %a" Cvalue.V.pretty value) let extract_non_wide_string cstr = match cstr with | Base.CSString s -> `Success s | Base.CSWstring s -> `Failure (fun fmt -> Format.fprintf fmt "Wide string not supported (string@ '%s')" (Escape.escape_wstring s)) let extract_constant_string value = try match Location_Bytes.fold_i (fun b i l -> (b,i) :: l) value [] with | [Base.String (_, e), i] when Ival.is_zero i -> extract_non_wide_string e | _ -> `Failure (fun fmt -> Format.fprintf fmt "When decoding string, incorrect value@ '%a'" Cvalue.V.pretty value) with e -> `Failure (fun fmt -> Format.fprintf fmt "Not a correct string '%a'@. \ Conversion raised %s" Cvalue.V.pretty value (Printexc.to_string e)) (* *) let clear_non_globals = Cvalue.Model.filter_base (fun v -> not (Base.is_any_formal_or_local v)) (* *) let join_state s1 s2 = let r = Cvalue.Model.join s2 s1 in r, Cvalue.Model.equal r s1 = false let join_value v1 v2 = let r = Cvalue.V.join v1 v2 in r, Cvalue.V.equal r v1 = false let rec join_params l1 l2 = match l1, l2 with | [], [] -> ([], false) | [], l | l, [] -> Mt_options.warning "Joining parameters lists of different lengths"; (l, true) | x::xs , y::ys -> let v, recv = join_value x y and lv, recl = join_params xs ys in v :: lv, recv || recl let join_zone z1 z2 = let r = Zone.join z1 z2 in r, Zone.equal r z1 = false (* *) let is_frama_c_var v = String.starts_with ~prefix:"__FRAMAC_MTHREAD" v.vname let is_frama_c_base = function | Base.Var (v, _) | Base.Allocated (v, _, _) -> is_frama_c_var v | _ -> false let remove_frama_c_var_from_zone = Zone.filter_base (fun b -> not (is_frama_c_base b)) let remove_frama_c_var_from_mem = Cvalue.Model.filter_base (fun b -> not (is_frama_c_base b)) let int_to_value i = Cvalue.V.inject_ival (Ival.of_int i)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>