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-Gallium.tar.gz
sha256=a94384f00d53791cbb4b4d83ab41607bc71962d42461f02d71116c4ff6dca567
doc/src/frama-c-studia.core/reads.ml.html
Source file reads.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
(**************************************************************************) (* *) (* 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). *) (* *) (**************************************************************************) (** Find the statements that reads a given zone, using Inout. (Thus, only operational reads are found.) *) open Cil_types open Locations type t = | Direct of Cil_types.stmt | Indirect of Cil_types.stmt class find_read zlval = object inherit Visitor.frama_c_inplace val mutable res : t list = [] method! vstmt_aux stmt = let aux_call lvopt _kf args _loc = let z = Inout.stmt_inputs stmt in if Zone.intersects z zlval then begin (* Computes what is read to evaluate [args] and [lvopt] *) let deps = List.map (Inout.expr_inputs stmt) args in let deps = List.fold_left Zone.join Zone.bottom deps in let deps = match lvopt with | None -> deps | Some lv -> let dlv = Eva.Results.(before stmt |> address_deps lv) in Zone.join dlv deps in let direct = Zone.intersects deps zlval in (* now determine if the functions called at [stmt] read directly or indirectly [zlval] *) let aux_kf (direct, indirect) kf = let inputs = Inout.kf_inputs kf in (* TODO: change to this once we can get "full" inputs through Inout. Currently, non operational inputs disappear, and this function is not suitable. let inout = !Db.Operational_inputs.get_internal_precise ~stmt kf in let inputs = inout.Inout_type.over_inputs in *) if Zone.intersects inputs zlval then if Eva.Analysis.use_spec_instead_of_definition kf then (* Direct, as there is no body for this function. *) (true, indirect) else (direct, true) (* Indirect effect *) else (direct, indirect) (* this function pointer does not read [zlval] *) in let kfs = Eva.Results.callee stmt in let direct, indirect = List.fold_left aux_kf (direct, false) kfs in if direct then res <- Direct stmt :: res; if indirect then res <- Indirect stmt :: res; end in match stmt.skind with | Instr (Call (lvopt, f, args, loc)) -> aux_call lvopt f args loc; Cil.SkipChildren | Instr (Local_init(v, ConsInit(f, args, k), l)) -> Cil.treat_constructor_as_func aux_call v f args k l; Cil.SkipChildren | Instr _ -> let z = Inout.stmt_inputs stmt in if Zone.intersects z zlval then begin res <- Direct stmt :: res end; Cil.SkipChildren | If (e, _, _, _) | Switch (e, _, _, _) | Return (Some e, _) -> let z = Inout.expr_inputs stmt e in if Zone.intersects z zlval then begin res <- Direct stmt :: res end; Cil.DoChildren | _ -> Cil.DoChildren method result = res end let compute z = let vis = new find_read z in let aux_kf_fundec kf = let all_in = Inout.kf_inputs kf in if Zone.intersects all_in z then begin let fundec = Kernel_function.get_definition kf in ignore (Visitor.visitFramacFunction (vis :> Visitor.frama_c_visitor) fundec;) end in let aux_kf kf = if Kernel_function.is_definition kf then aux_kf_fundec kf in Globals.Functions.iter aux_kf; vis#result
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>