Index of values

Add a new binding.

add annot to acc if it is not already in.

The nodes nodes define the searched location z.

kf doesn't define all the data that we are looking for: the undef zone must have been defined in its caller, let's find it.

To add a sensitive/unsensitive menu item to a factory.

Check if some assertions before s are identical to pred.

Clear the table.

Clear the caches local to this module.

Comparison: same spec than Pervasives.compare.

compute the mapping for the function

Deep copy: no possible sharing between x and copy x.

This function takes a function f to be applied to each bit of the read slice.

Datatype descriptor.

Equality: same spec than Pervasives.(=).

Return the current binding of the given key.

Return the list of all data associated with the given key.

Do backward and then forward propagations and compute the 3 statement sets : forward only,, forward and backward,, backward only.

fold f m folds a function f on bindings in m.

Same behavior as fold, except if two disjoint ranges r1 and r2 of a given base are mapped to the same value and boolean.

Must be used for equal in order to implement it by compare x y = 0 (with your own compare function).

Must be used for pretty in order to implement it by pretty_code provided by the datatype from your own internal_pretty_code function.

Try to find the statement set where data has the same value than before stmt.

kf_stmt_opt is used if we want to ask the lval to the user in a popup

Return the set of stmts (scope) where annot has the same value than in stmt and add to to_be_removed the annotations that are identical to annot in the statements that are both the scope and that are dominated by stmt.

Hash function: same spec than Hashtbl.hash.

Must be used if you want to implement a required function by fun x -> x.

Same spec than pretty_code, but must take care of the precedence of the context in order to put parenthesis if required.

Length of the table.

like for fold, the boolean in bool * y indicates if it is possible that the zone was not modified

map_and_merge f m1 m2 maps f on values in m1 and add_exact all elements of the mapped m1 to m2

mem_project f x must return true iff there is a value p of type Project.t in x such that f p returns true.

Memoization.

memo tbl k f returns the binding of k in tbl.

Memoization.

Must be a valid OCaml module name corresponding to the module name you are defining by applying the functor.

Unique name for this datatype.

Unique name of the datatype.

Must be used for mem_project if values of your type does never contain any project.

optlabel_func lab dft ty1 ty2 is equivalent to func ~label:(lab, Some dft) ty1 ty2

Packed version of the descriptor.

Must be used for internal_pretty_code if this pretty-printer must fail only when called.

Pretty print each value in an user-friendly way.

Pretty print each value in an ML-like style: the result must be a valid OCaml expression.

Add to stmt to lmap for all the locations modified by the statement.

How to rehashconsed values.

Add a new binding.

Must be non-empty.

List of representents of the descriptor.

Remove the annotations collected by check_asserts.

Must be used if you don't want to implement a required function.

binds the given variables to bottom, keeps the other unchanged.

A good prefix name to use for an OCaml variable of this type.