package frama-c
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Platform dedicated to the analysis of source code written in C
Install
dune-project
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
-
JJordan Ischard
-
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
-
NNicky Mouha
-
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
-
FFabien Siron
-
NNicolas Stouls
-
HHugo Thievenaz
-
KKostyantyn Vorobyov
-
BBoris Yakobowski
Maintainers
Sources
frama-c-33.0-Arsenic.tar.gz
sha256=9c1cbffd28bb33c17a668107e39c96e4ae7378a3d8249f69b47afc7ee964e9b8
doc/src/frama-c-region.core/code.ml.html
Source file code.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(**************************************************************************) (* *) (* SPDX-License-Identifier LGPL-2.1 *) (* Copyright (C) *) (* CEA (Commissariat à l'énergie atomique et aux énergies alternatives) *) (* *) (**************************************************************************) open Cil_types open Cil_datatype open Memory module Vmap = Varinfo.Map (* -------------------------------------------------------------------------- *) (* --- L-Values & Expressions --- *) (* -------------------------------------------------------------------------- *) type value = node option let pointer v = match v with | Some p -> p | None -> Options.fatal "Not a pointer value" let rec add_lval (m:map) (s:stmt) (lv:lval) : node = let h = fst lv in add_loffset m s (add_lhost m s h) (Cil.typeOfLhost h) (snd lv) and add_lhost (m:map) (s:stmt) = function | Var x -> Memory.add_cvar m x | Mem e -> pointer @@ add_exp m s e and add_loffset (m:map) (s:stmt) (r:node) (ty:typ)= function | NoOffset -> r | Field(fd,ofs) -> add_loffset m s (add_field r fd) fd.ftype ofs | Index(e,ofs) -> let elt = Ast_types.direct_element_type ty in ignore @@ add_exp m s e ; add_loffset m s (add_index r elt) elt ofs and add_value m s e = ignore (add_exp m s e) and add_exp (m: map) (s:stmt) (e:exp) : value = match e.enode with | AddrOf lv | StartOf lv -> Some (add_lval m s lv) | Lval lv -> let rv = add_lval m s lv in Memory.add_read rv (Lval(s,lv)) ; Memory.add_value rv @@ Cil.typeOfLval lv | BinOp((PlusPI|MinusPI),p,k,tr) -> add_value m s k ; let vp = add_exp m s p in let te = Ast_types.pointed_type tr in Memory.add_shift (pointer vp) (Exp(s,e)) te ; vp | UnOp(_,e,_) -> add_value m s e ; None | BinOp(_,a,b,_) -> add_value m s a ; add_value m s b ; None | CastE(_,p) -> add_exp m s p | Const _ | SizeOf _ | SizeOfE _ | AlignOf _ | AlignOfE _ -> None (* -------------------------------------------------------------------------- *) (* --- Compound L-Values --- *) (* -------------------------------------------------------------------------- *) let is_comp lv = Ast_types.is_struct_or_union @@ Cil.typeOfLval lv (* -------------------------------------------------------------------------- *) (* --- Initializers --- *) (* -------------------------------------------------------------------------- *) let rec add_init (m:map) (s:stmt) (lv:lval) (iv:init) = match iv with | SingleInit { enode = Lval le } when is_comp le -> let r = add_lval m s lv in let v = add_lval m s le in Memory.merge r v | SingleInit e -> let r = add_lval m s lv in let tv = Cil.typeOfLval lv in let tr = if Ast_types.is_array tv then Ast_types.element_type tv else tv in let acs = Access.Init(s,lv,e) in Memory.add_init r acs tr ; Option.iter (Memory.add_points_to r) (add_exp m s e) | CompoundInit(_,fvs) -> List.iter (fun (ofs,iv) -> let lv = Cil.addOffsetLval ofs lv in add_init m s lv iv ) fvs (* -------------------------------------------------------------------------- *) (* --- Instructions --- *) (* -------------------------------------------------------------------------- *) let add_write ~map ~stmt ~acs (r:node) (e:exp) = Memory.add_write r acs ; match e.enode with | Lval le when is_comp le -> let v = add_lval map stmt le in Memory.merge r v | _ -> let v = add_exp map stmt e in Option.iter (Memory.add_points_to r) v let add_function (m:map) (s:stmt) (f:lhost) = match f with | Var _vf -> () | Mem e -> add_value m s e let add_returned (m:map) (s:stmt) lv = let r = add_lval m s lv in Memory.add_write r (Lval(s,lv)) ; r let add_kf_call m s r kf vs = Populate_spec.populate_funspec kf [`Assigns] ; let spec = Annotations.funspec kf in let formals = let rec bind fm xs vs = match xs , vs with | [] , _ -> fm | x::xs , [] -> bind (Vmap.add x pure fm) xs [] | x::xs , v::vs -> bind (Vmap.add x v fm) xs vs in bind Vmap.empty (Kernel_function.get_formals kf) vs in Annot.add_spec ~map:m ~called:s ~kf ~formals ~result:r spec let add_call m s r fct es = let vs = List.map (fun e -> Domain.scalar @@ add_exp m s e) es in match Kernel_function.get_called fct with | Some kf -> add_kf_call m s r kf vs | None -> begin match Dyncall.get s with | Some(_,kfs) -> List.iter (fun kf -> add_kf_call m s r kf vs) kfs | None -> Options.not_yet_implemented ~source:(fst @@ Stmt.loc s) "Dynamic call without @call annotation" end let add_instr ~map ~stmt = function | Skip _ -> () | Set(lv,e,_) -> let r = add_lval map stmt lv in add_write ~map ~stmt ~acs:(Lval(stmt,lv)) r e ; | Local_init(x,AssignInit iv,_) -> add_init map stmt (Var x,NoOffset) iv | Local_init(x,ConsInit (vf,args,kind), loc) -> let r = add_cvar map x in Memory.add_init r (Lval (stmt,Cil.var x)) x.vtype ; Cil.treat_constructor_as_func begin fun _res fct args _loc -> add_function map stmt fct; List.iter (add_value map stmt) args ; add_call map stmt (Some r) fct args end x vf args kind loc | Call(lr,f,es,_) -> add_function map stmt f; let r = Option.map (add_returned map stmt) lr in add_call map stmt r f es | Code_annot _ -> () | Asm _ -> Options.warning ~source:(fst @@ Stmt.loc stmt) "Inline assembly not supported (ignored)" (* -------------------------------------------------------------------------- *) (* --- Statements --- *) (* -------------------------------------------------------------------------- *) let rec add_stmt ~map ~kf ~result stmt = List.iter (Annot.add_code_annot ~map ~kf ~stmt ~result) (Annotations.code_annot stmt) ; match stmt.skind with | Instr instr -> add_instr ~map ~stmt instr ; | Return(None,_) -> () | Return(Some e,_) -> add_write ~map ~stmt ~acs:(Ret(stmt,e)) (Option.get result) e | Goto _ | Break _ | Continue _ -> () | If(e,sthen,selse,_) -> add_value map stmt e ; add_block ~map ~kf ~result sthen ; add_block ~map ~kf ~result selse ; | Switch(e,b,_,_) -> add_value map stmt e ; add_block ~map ~kf ~result b ; | Block b -> add_block ~map ~kf ~result b | Loop(_,b,_,_,_) -> add_block ~map ~kf ~result b | UnspecifiedSequence s -> add_block ~map ~kf ~result @@ Cil.block_from_unspecified_sequence s | Throw(exn,_) -> Option.iter (fun (e,_) -> add_value map stmt e) exn | TryCatch(b,handlers,_) -> add_block ~map ~kf ~result b ; List.iter (fun (c,b) -> add_catch ~map ~kf ~result c ; add_block ~map ~kf ~result b ) handlers | TryExcept(a,(ks,e),b,_) -> add_block ~map ~kf ~result a ; List.iter (add_instr ~map ~stmt) ks ; add_value map stmt e ; add_block ~map ~kf ~result b ; | TryFinally(a,b,_) -> add_block ~kf ~map ~result a ; add_block ~kf ~map ~result b ; and add_catch ~map ~kf ~result = function | Catch_all -> () | Catch_exn(_,xbs) -> List.iter (fun (_,b) -> add_block ~map ~kf ~result b) xbs and add_block ~map ~kf ~result b = List.iter (add_stmt ~map ~kf ~result) b.bstmts (* -------------------------------------------------------------------------- *) (* --- Function --- *) (* -------------------------------------------------------------------------- *) type domain = map let domain kf = let map = Memory.create () in let result = if Kernel_function.returns_void kf then None else Some (Memory.add_result map) in begin try let spec = Annotations.funspec kf in Annot.add_spec ~map ~kf ~result spec ; with Annotations.No_funspec _ -> () end ; begin try let decl = Kernel_function.get_definition kf in add_block ~map ~kf ~result decl.sbody ; with Kernel_function.No_Definition -> () end ; Memory.lock map ; map (* -------------------------------------------------------------------------- *)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>