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-wp.core/Mstate.ml.html
Source file Mstate.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
(**************************************************************************) (* *) (* This file is part of WP plug-in of Frama-C. *) (* *) (* Copyright (C) 2007-2024 *) (* CEA (Commissariat a l'energie atomique et aux energies *) (* 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 Lang.F open Sigs type (_,_) eq = Equal : 'a -> ('a,'a) eq | NotEqual : ('a,'b) eq module Ident : sig type 'a t val create : 'a -> 'a t val get : 'a t -> 'a val eq : 'a t -> 'b t -> ('a,'b) eq end = struct let k = ref 0 type 'a t = int * 'a let get = snd let create s = incr k ; (!k,s) let eq (k,s) (k',_) = if k = k' then Obj.magic (Equal s) else NotEqual end (* -------------------------------------------------------------------------- *) (* --- L-Val Utility --- *) (* -------------------------------------------------------------------------- *) let index (host,ofs) k = host , ofs @ [Mindex k] let field (host,ofs) f = host , ofs @ [Mfield f] let host_eq a b = match a,b with | Mvar x , Mvar y -> Cil_datatype.Varinfo.equal x y | Mmem a , Mmem b -> a == b | _ -> false let ofs_eq a b = match a,b with | Mindex i , Mindex j -> i = j | Mfield f , Mfield g -> Cil_datatype.Fieldinfo.equal f g | _ -> false let rec offset_eq p q = match p,q with | [],[] -> true | a :: p , b :: q -> ofs_eq a b && offset_eq p q | _ -> false let equal a b = a == b || (host_eq (fst a) (fst b) && offset_eq (snd a) (snd b)) (* -------------------------------------------------------------------------- *) (* --- Memory State Pretty Printing Information --- *) (* -------------------------------------------------------------------------- *) type 'a operations = { apply : (term -> term) -> 'a -> 'a ; lookup : 'a -> term -> mval ; updates : 'a sequence -> Vars.t -> update Bag.t ; iter : (mval -> term -> unit) -> 'a -> unit ; } type 'a model = MODEL : 'a operations Ident.t * ('b -> 'a) -> 'b model let create (type s) (module M : Sigs.Model with type Sigma.t = s) = let op = { apply = M.apply ; lookup = M.lookup ; updates = M.updates ; iter = M.iter ; } in MODEL( Ident.create op , M.state ) type state = STATE : 'a operations Ident.t * 'a -> state let state model sigma = match model with MODEL(op,state) -> STATE(op,state sigma) let iter f = function STATE(m,s) -> (Ident.get m).iter f s let apply f = function STATE(m,s) -> STATE(m,(Ident.get m).apply f s) let lookup s e = match s with STATE(m,s) -> (Ident.get m).lookup s e let updates seq vars = match seq.pre , seq.post with STATE(p,u) , STATE(q,v) -> match Ident.eq p q with | Equal s -> s.updates { pre = u ; post = v } vars | NotEqual -> Bag.empty (* assert false *) (* -------------------------------------------------------------------------- *)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>