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-pdg.core/api.ml.html
Source file api.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
(**************************************************************************) (* *) (* 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). *) (* *) (**************************************************************************) [@@@ warning "-32" ] open Pdg_types type t = PdgTypes.Pdg.t type t_nodes_and_undef = ((PdgTypes.Node.t * Locations.Zone.t option) list * Locations.Zone.t option) exception Top = PdgTypes.Pdg.Top exception Bottom = PdgTypes.Pdg.Bottom (**************************************************************************) let self = Pdg_tbl.self let get = Pdg_tbl.get let node_key = PdgTypes.Node.elem_key let from_same_fun pdg1 pdg2 = let kf1 = PdgTypes.Pdg.get_kf pdg1 in let kf2 = PdgTypes.Pdg.get_kf pdg2 in Kernel_function.equal kf1 kf2 (**************************************************************************) let find_decl_var_node = Sets.find_decl_var_node let find_entry_point_node = Sets.find_entry_point_node let find_top_input_node = Sets.find_top_input_node let find_simple_stmt_nodes = Sets.find_simple_stmt_nodes let find_stmt_and_blocks_nodes = Sets.find_stmt_and_blocks_nodes let find_stmt_node = Sets.find_stmt_node let find_label_node = Sets.find_label_node let find_location_nodes_at_stmt = Sets.find_location_nodes_at_stmt let find_location_nodes_at_begin = Sets.find_location_nodes_at_begin let find_location_nodes_at_end = Sets.find_location_nodes_at_end let find_call_ctrl_node = Sets.find_call_ctrl_node let find_call_input_node = Sets.find_call_num_input_node let find_call_output_node = Sets.find_call_output_node let find_input_node = Sets.find_input_node let find_ret_output_node = Sets.find_output_node let find_output_nodes = Sets.find_output_nodes let find_all_inputs_nodes = Sets.find_all_input_nodes let find_call_stmts = Sets.find_call_stmts let find_code_annot_nodes = Annot.find_code_annot_nodes let find_fun_precond_nodes = Annot.find_fun_precond_nodes let find_fun_postcond_nodes = Annot.find_fun_postcond_nodes let find_fun_variant_nodes = Annot.find_fun_variant_nodes let find_call_out_nodes_to_select = Sets.find_call_out_nodes_to_select let find_in_nodes_to_select_for_this_call = Sets.find_in_nodes_to_select_for_this_call (**************************************************************************) let direct_dpds = Sets.direct_dpds let direct_ctrl_dpds = Sets.direct_ctrl_dpds let direct_data_dpds = Sets.direct_data_dpds let direct_addr_dpds = Sets.direct_addr_dpds let all_dpds = Sets.find_nodes_all_dpds let all_ctrl_dpds = Sets.find_nodes_all_ctrl_dpds let all_data_dpds = Sets.find_nodes_all_data_dpds let all_addr_dpds = Sets.find_nodes_all_addr_dpds let direct_uses = Sets.direct_uses let direct_ctrl_uses = Sets.direct_ctrl_uses let direct_data_uses = Sets.direct_data_uses let direct_addr_uses = Sets.direct_addr_uses let all_uses = Sets.all_uses let = Sets.custom_related_nodes let iter_nodes = PdgTypes.Pdg.iter_nodes (**************************************************************************) let extract = Pdg_tbl.print_dot let pretty_node = Pdg_tbl.pretty_node let pretty_key = Pdg_tbl.pretty_key let pretty = Pdg_tbl.pretty (**************************************************************************) module Marks = Marks (**************************************************************************)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>