Index of values

add x s returns a set containing all elements of s, plus x.

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

Add the given elements to the set, in order.

Add the given bindings to the map, in order.

Update a reference from a pure functional function.

Return the list of all bindings of the given map.

Return the number of elements of a set.

Return the number of bindings of a map.

Return one element of the given set, or raise Not_found if the set is empty.

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

Return one element of the given set, or None if the set is empty.

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

Returning a value to register in Frama-C's GUI

Total ordering between sets.

Total ordering between maps.

Computes both syntactic and semantic coverage information.

Computes the semantic coverage by function.

Compute cyclomatic complexity from base_metrics record type.

Compute and print the size (in bytes) of local variables on the CIL AST.

Main entry point to compute various metrics on Cabs AST instead of CIL AST.

Compute metrics on whole CIL AST

Functions analyzed by the value analysis

List of functions that can be syntactically reached from the function

consider_function vinfo returns false if the varinfo is not a function we are interested in.

consider_variable vinfo returns false if the varinfo is not an object variable we are interested in.

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

Set difference: diff s1 s2 contains the elements of s1 that are not in s2.

Test if two sets are disjoint.

Display the list of list of strings in a LablGTK table object

Return the list of all elements of the given set.

The empty set.

The empty map.

Initial empty values for metrics computing.

equal s1 s2 tests whether the sets s1 and s2 are equal, that is, contain equal elements.

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 f s checks if at least one element of the set satisfies the predicate f.

exists f m checks if at least one binding of the map satisfies the predicate f.

Is there some element satisfying the given predicate?

Get the filename containing the function definition

Get the filename where the definition of a varinfo occurs

filter f s returns the set of all elements in s that satisfy predicate f.

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

filter_map f s returns the set of all v such that f x = Some v for some element x of s.

filter_map f m applies the function f to every binding of m, and builds a map from the results.

find x s returns the element of s equal to x (according to Ord.compare), or raise Not_found if no such element exists.

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

find_first f s, where f is a monotonically increasing function, returns the lowest element e of s such that f e, or raises Not_found if no such element exists.

find_first f m, where f is a monotonically increasing function, returns the binding of m with the lowest key k such that f k, or raises Not_found if no such key exists.

find_first_opt f s, where f is a monotonically increasing function, returns an option containing the lowest element e of s such that f e, or None if no such element exists.

find_first_opt f m, where f is a monotonically increasing function, returns an option containing the binding of m with the lowest key k such that f k, or None if no such key exists.

find_last f s, where f is a monotonically decreasing function, returns the highest element e of s such that f e, or raises Not_found if no such element exists.

find_last f m, where f is a monotonically decreasing function, returns the binding of m with the highest key k such that f k, or raises Not_found if no such key exists.

find_last_opt f s, where f is a monotonically decreasing function, returns an option containing the highest element e of s such that f e, or None if no such element exists.

find_last_opt f m, where f is a monotonically decreasing function, returns an option containing the binding of m with the highest key k such that f k, or None if no such key exists.

find_opt x s returns the element of s equal to x (according to Ord.compare), or None if no such element exists.

find_opt x m returns Some v if the current value of x in m is v, or None if no binding for x exists.

Convert float to string with the following convention: if the float is an integer (ie, it has no digits after the decimal point), print it as such;, otherwise, print the first two digits after the decimal point.

fold f s init computes (f xN ... (f x2 (f x1 init))...), where x1 ... xN are the elements of s, in increasing order.

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

for_all f s checks if all elements of the set satisfy the predicate f.

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

Returns the coverage for a given function.

get_file_type extension sets the output type according to extension.

returns the given argument only if it is a valid function name (see Parameter_customize.get_c_ified_functions for more information), and abort otherwise.

Returns the computed metrics for the entire AST.

Computes and returns individual metrics per function.

always return the argument, even if the argument is not a function name.

What are the acceptable values for this parameter.

Helpers for metrics purposes for single increment steps

Initialize the main Metrics panel into an upper and lower part.

Set intersection.

Test whether a set is empty or not.

Test whether a map is empty or not.

Whether the Filepath is empty.

iter f s applies f in turn to all elements of s.

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

Build a JSON list with the varinfos in m, each as a JSON object with the varinfo name as key and additional attributes as values.

map f s is the set whose elements are f a0,f a1...

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 Map.S.map, but the function receives as arguments both the key and the associated value for each binding of the map.

Same as Map.S.min_binding, but returns the binding with the largest key in the given map.

Same as Map.S.min_binding_opt, but returns the binding with the largest key in the given map.

Same as Set.S.min_elt, but returns the largest element of the given set.

Same as Set.S.min_elt_opt, but returns the largest element of the given set.

mem x s tests whether x belongs to the set s.

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

Does the given element belong to the set?

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

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

Return the binding with the smallest key in the given map (with respect to the Ord.compare ordering), or None if the map is empty.

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

Return the smallest element of the given set (with respect to the Ord.compare ordering), or None if the set is empty.

mk_hdr level ppf hdr_strg produces a title from hdr_strg with an underline of the same length.

Handling entry points informations

of_list l creates a set from a list of elements.

Build a set from the given bindings

Build a map from the given bindings

Set the boolean to false.

Set the boolean to true.

To be used by the plugin to output the results of the option in a controlled way.

partition f s returns a pair of sets (s1, s2), where s1 is the set of all the elements of s that satisfy the predicate f, and s2 is the set of all the elements of s that do not satisfy f.

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

Pretty printers for base metrics as text or html.

Pretty print a varinfo set, with some additional information about the varinfo.

Pretty-prints the result of used_files in a verbose way.

Computes the set of global variables which are syntactically reachable from the entry point of the program.

register_metrics metrics_name display_function () adds a selectable choice for the metrics metrics_name and add a hook calling display_function whenever this metrics is selected and launched.

remove x s returns a set containing all elements of s, except x.

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

Reset metrics panel to pristine conditions by removing children from bottom container

Set the dependencies for the output of the option.

Set what are the acceptable values for this parameter.

singleton x returns the one-element set containing only x.

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

split x s returns a triple (l, present, r), where l is the set of elements of s that are strictly less than x; r is the set of elements of s that are strictly greater than x; present is false if s contains no element equal to x, or true if s contains an element equal to 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.

subset s1 s2 tests whether the set s1 is a subset of the set s2.

Matrix-like representation of the record in "Title: value" style

Iterate on the whole set, in descending order

Iterate on the whole map, in descending order of keys

Iterate on the whole set, in ascending order

Iterate on the whole map, in ascending order of keys

to_seq_from x s iterates on a subset of the elements of s in ascending order, from x or above.

to_seq_from k m iterates on a subset of the bindings of m, in ascending order of keys, from key k or above.

Set union.

union f m1 m2 computes a map whose keys are a subset of the keys of m1 and of m2.

update key f m returns a map containing the same bindings as m, except for the binding of key.

Computes the set of files defining all global variables syntactically reachable from the entry point of the program (as given by reachable_from_main).