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
-
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-30.0-Zinc.tar.gz
sha256=3ac0f995261ec829a7bd042bf70fc29ac6379029eb9df30bcc044748eb4d2a56
doc/src/frama-c-alias.core/simplified.ml.html
Source file simplified.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
(**************************************************************************) (* *) (* This file is part of Frama-C. *) (* *) (* Copyright (C) 2007-2024 *) (* 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_datatype let nul_exp = Cil.kinteger64 ~loc:Location.unknown ~repr:"0.." ~kind:IInt Integer.zero let is_nul_exp = Cil_datatype.ExpStructEq.equal nul_exp module HL = Lval.Hashtbl module HE = Exp.Hashtbl let cached_lval = HL.create 23 let cached_exp = HE.create 37 let clear_cache () = HL.clear cached_lval; HE.clear cached_exp exception Explicit_pointer_address of location let check_cast_compatibility e to_type = let rec cast_preserves_indirection_level from_type to_type = let recurse = cast_preserves_indirection_level in match Cil.unrollType from_type, Cil.unrollType to_type with | TPtr (from_type, _), TPtr (to_type, _) -> recurse from_type to_type | TPtr _, _ -> false | _, TPtr _ -> false | _ -> true in let from_type = Cil.typeOf e in if Cil.need_cast to_type from_type && not (Cil.isZero e) && not (cast_preserves_indirection_level from_type to_type) then (* emit a warning for unsafe casts, but not for the NULL pointer *) Options.warning ~once:true ~source:(fst @@ e.eloc) ~wkey:Options.Warn.unsafe_cast "unsafe cast from %a to %a; analysis may be unsound" Printer.pp_typ from_type Printer.pp_typ to_type let rec simplify_offset o = match o with | NoOffset -> NoOffset | Field(f,o) -> Field(f, simplify_offset o) | Index(_e,o) -> Index(nul_exp, simplify_offset o) let rec simplify_lval (h,o) = try HL.find cached_lval (h,o) with Not_found -> let res = (simplify_host h, simplify_offset o) in HL.add cached_lval (h,o) res; res and simplify_host h = match h with | Var _ -> h | Mem e -> let simp_e = simplify_exp e in if is_nul_exp simp_e then raise (Explicit_pointer_address e.eloc) else Mem simp_e and simplify_exp e = try HE.find cached_exp e with Not_found -> let res = match e.enode with | CastE (typ, e) -> check_cast_compatibility e typ; simplify_exp e | Lval lv -> {e with enode = Lval (simplify_lval lv)} | StartOf lv -> {e with enode = Lval (simplify_lval lv)} | AddrOf lv -> {e with enode = AddrOf (simplify_lval lv)} | BinOp(PlusPI, e1, _, _) | BinOp(MinusPI, e1, _, _) -> begin match (simplify_exp e1).enode with | Lval _ | AddrOf _ as node -> {e with enode = node} | _ -> raise (Explicit_pointer_address e1.eloc) end | _ -> e in HE.add cached_exp e res; Options.debug ~level:9 "simplify_exp %a = %a" Printer.pp_exp e Printer.pp_exp res; res module LvalOrRef = struct type t = Lval of lval | Ref of lval let pretty l = let print f fmt x = match x with | Lval lv -> f fmt lv | Ref lv -> Format.fprintf fmt "&%a" f lv in if Options.is_debug_key_enabled Options.DebugKeys.lvals then print Cil_types_debug.pp_lval l else print Printer.pp_lval l let from_exp e = let e = simplify_exp e in match e.enode with Lval lv -> Some (Lval lv) | AddrOf lv -> Some (Ref lv) | _ -> None end module Lval = struct let simplify = simplify_lval end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>