Index of values

add x y m returns a map containing the same bindings as m, plus a binding of x to y.

Add a new binding.

Bind all the given variables to Assigned \from \nothing.

Return the list of all bindings of the given map.

The state of the callwise From analysis.

Return the number of bindings of a map.

Return one binding of the given map, or raise Not_found if the map is empty.

Clean the given from (that have been computed for the given function), optionally save them, and return the cleant result.

Clear the table.

Total ordering between maps.

Compute the dependencies of the given function, and return them

Function that compute the Froms from a given prototype, called in the given state

The empty map.

equal cmp m1 m2 tests whether the maps m1 and m2 are equal, that is, contain equal keys and associate them with equal data.

exists p m checks if at least one binding of the map satisfy the predicate p.

filter p m returns the map with all the bindings in m that satisfy predicate p.

find x m returns the current binding of x in m, or raises Not_found if no such binding exists.

Return the current binding of the given key.

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

Direct computation of the dependencies on expressions, offsets and lvals.

fold f m a computes (f kN dN ... (f k1 d1 a)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.

for_all p m checks if all the bindings of the map satisfy the predicate p.

How to find the Froms for a given call during the analysis.

How to find the state of Value at a given statement during the analysis.

Test whether a map is empty or not.

iter f m applies f to all bindings in map m.

Return true if the given base is in scope after a call to the given function.

Length of the table.

map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a.

Same as FCMap.S.map, but the function receives as arguments both the key and the associated value for each binding of the map.

Same as FCMap.S.min_binding, but returns the largest binding of the given map.

mem x m returns true if m contains a binding for x, and false otherwise.

Memoization.

merge f m1 m2 computes a map whose keys is a subset of keys of m1 and of m2.

given a Function_Froms.Deps.t, apply f on both components and merge the result: depending directly on an indirect dependency -> indirect, depending indirectly on a direct dependency -> indirect

Return the smallest binding of the given map (with respect to the Ord.compare ordering), or raise Not_found if the map is empty.

partition p m returns a pair of maps (m1, m2), where m1 contains all the bindings of s that satisfy the predicate p, and m2 is the map with all the bindings of s that do not satisfy p.

Recreate the additional_deps field from additional_deps_table

remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map.

Add a new binding.

singleton x y returns the one-element map that contains a binding y for x.

split x m returns a triple (l, data, r), where l is the map with all the bindings of m whose key is strictly less than x; r is the map with all the bindings of m whose key is strictly greater than x; data is None if m contains no binding for x, or Some v if m binds v to x.

Handle an assignement lv = ..., the dependencies of the right-hand side being stored in deps_right.