Index of modules

All these functions find the nodes needed for various kind of annotations.

Build graphs (PDG) for the function (see module Build.BuildPdg) to represent the dependencies between instructions in order to use it for slicing purposes.

Internal information about control dependencies

Dpd stands for 'dependence'.

If the marks provided by the user respect some constraints (see Mark), we have that, after the marks propagation, the mark of a node are always smaller than the sum of the marks of its dependencies.

To also use interprocedural propagation, the user can instantiate this functor.

Mapping between the function elements we are interested in and some information.

Program dependence graph main part : the nodes of the graph represent computations, and the edges represent the dependencies between these computations.

The keys can be used to identify an element of a function.

A node of the PDG : includes some information to know where it comes from.

set of nodes of the graph

PDG for a function

Program Dependences Graph.

This module can be useful to store some information about different elements of a function.

This module provides elements to mapped information (here called 'marks') to PDG elements and propagate it along the dependencies.

This module defines the types that are used to store the PDG of a function.

DataState is associated with a program point and provide the dependencies for the data, ie.

PDG (program dependence graph) access functions.

What we call a Signature a mapping between keys that represent either a function input or output, and some information.