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
-
TThibaut Benjamin
-
AAllan Blanchard
-
LLionel Blatter
-
FFrançois Bobot
-
RRichard Bonichon
-
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
-
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
-
AAnne Pacalet
-
VValentin Perrelle
-
GGuillaume Petiot
-
DDario Pinto
-
VVirgile Prevosto
-
AArmand Puccetti
-
FFélix Ridoux
-
VVirgile Robles
-
MMuriel Roger
-
JJulien Signoles
-
NNicolas Stouls
-
KKostyantyn Vorobyov
-
BBoris Yakobowski
Maintainers
Sources
frama-c-27.1-Cobalt.tar.gz
sha256=5b13574a16a58971c27909bee94ae7f37b17d897852b40c768a3d4e2e09e39d2
doc/src/frama-c-inout.core/outputs.ml.html
Source file outputs.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
(**************************************************************************) (* *) (* This file is part of Frama-C. *) (* *) (* Copyright (C) 2007-2023 *) (* 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 Visitor open Locations class virtual do_it_ = object(self) inherit [Zone.t] Cumulative_analysis.cumulative_visitor as super val mutable outs = Zone.bottom method bottom = Zone.bottom method result = outs method! vstmt_aux s = match s.skind with | UnspecifiedSequence seq -> List.iter (fun (stmt,_,_,_,_) -> ignore(visitFramacStmt (self:>frama_c_visitor) stmt)) seq; Cil.SkipChildren (* do not visit the additional lvals *) | _ -> super#vstmt_aux s method join new_ = outs <- Zone.join new_ outs; (* For local initializations, counts the written variable as an output of the function, even if it is const; thus, [for_writing] is false in this case. *) method private do_assign ~for_writing lv = let ki = self#current_kinstr in let bits_loc = Eva.Results.(before_kinstr ki |> eval_address ~for_writing lv |> as_zone) in self#join bits_loc method! vinst i = let stmt = Option.get self#current_stmt in if Eva.Results.is_reachable stmt then (* noassert needed for Eval.memoize. Not really satisfactory *) begin let assign_lval lval = let for_writing = not (Cil.is_mutable_or_initialized lval) in self#do_assign ~for_writing lval in match i with | Set (lv,_,_) -> assign_lval lv | Call (lv_opt, exp, _, _) -> begin Option.iter assign_lval lv_opt; let callees = Eva.Results.(before stmt |> eval_callee exp) in match callees with | Ok callees -> let join_outputs kf = let inout = Operational_inputs.get_external_aux ~stmt kf in self#join inout.over_outputs in List.iter join_outputs callees | Error (Top | DisabledDomain) -> self#join Zone.top | Error Bottom -> () end | Local_init (v, AssignInit i, _) -> let rec aux lv = function | SingleInit _ -> self#do_assign ~for_writing:false lv | CompoundInit (ct, initl) -> (* Avoid folding the implicit zero-initializers of large arrays. *) if Cumulative_analysis.fold_implicit_initializer ct then let implicit = true in let doinit o i _ () = aux (Cil.addOffsetLval o lv) i in Cil.foldLeftCompound ~implicit ~doinit ~ct ~initl ~acc:() else (* For arrays of scalar elements, all the zone covered by the array is written. For arrays of structs containing padding bits, this is a sound over-approximation. *) self#do_assign ~for_writing:false lv in aux (Cil.var v) i | Local_init (v, ConsInit(f, _, _),_) -> if Cvalue.Model.is_top Eva.Results.(before stmt |> get_cvalue_model) then self#join Zone.top else begin let { Inout_type.over_outputs = z } = Operational_inputs.get_external_aux ?stmt:self#current_stmt (Globals.Functions.get f) in self#do_assign ~for_writing:false (Cil.var v); (* might be redundant with z in case f takes address of v as first argument, but this shouldn't hurt. *) self#join z end | Asm _ | Skip _ | Code_annot _ -> () end; Cil.SkipChildren method clean_kf_result kf r = Zone.filter_base (Eva.Logic_inout.accept_base ~formals:true ~locals:true kf) r method compute_funspec kf = let state = self#specialize_state_on_call kf in let behaviors = Eva.Logic_inout.valid_behaviors kf state in let assigns = Ast_info.merge_assigns behaviors in Eva.Logic_inout.assigns_outputs_to_zone state ~result:None assigns end module Analysis = Cumulative_analysis.Make( struct let analysis_name ="outputs" type t = Locations.Zone.t module T = Locations.Zone class virtual do_it = do_it_ end) let get_internal = Analysis.kernel_function let externalize kf x = Zone.filter_base (Eva.Logic_inout.accept_base ~formals:false ~locals:false kf) x module Externals = Kernel_function.Make_Table(Locations.Zone) (struct let name = "Inout.Outputs.Externals" let dependencies = [ Analysis.Memo.self ] let size = 17 end) let get_external = Externals.memo (fun kf -> externalize kf (get_internal kf)) let pretty_internal fmt kf = try Format.fprintf fmt "@[Out (internal) for function %a:@\n@[<hov 2> %a@]@]@\n" Kernel_function.pretty kf Zone.pretty (get_internal kf) with Not_found -> () let pretty_external fmt kf = try Format.fprintf fmt "@[Out (external) for function %a:@\n@[<hov 2> %a@]@]@\n" Kernel_function.pretty kf Zone.pretty (get_external kf) with Not_found -> () let () = Db.Outputs.self_internal := Analysis.Memo.self; Db.Outputs.self_external := Externals.self; Db.Outputs.get_internal := get_internal; Db.Outputs.get_external := get_external; Db.Outputs.compute := (fun kf -> ignore (get_internal kf)); Db.Outputs.display := pretty_internal; Db.Outputs.display_external := pretty_external; Db.Outputs.statement := Analysis.statement (* Local Variables: compile-command: "make -C ../../.." End: *)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>