Index of values

A
add [State_builder.Hashtbl]

Add a new binding.

add_path_bounds [Slevel_analysis.Specific]
after [Region_analysis.Make]
all_nodes [Region_analysis_sig.Node.Graph]
analyze [Register]
analyze [Slevel_analysis]
analyze [Loop_analysis]
analyze [LoopAnalysis.Loop_analysis]
C
clear [State_builder.Hashtbl]

Clear the table.

cmp_kf_by_name [Slevel_analysis]
compile_node [Slevel_analysis.SpecificNoBranches]
compile_node [Slevel_analysis.Specific]
compile_node [Region_analysis_stmt.M]
compile_node [Region_analysis_sig.Node]
copy [Region_analysis_sig.Node.Dict]
create [Region_analysis_sig.Node.Edge_Dict]
create [Region_analysis_sig.Node.Dict]
D
display_results [Slevel_analysis]
dominates [Region_analysis_sig.Node.DomTree]
domtree_postfix_iter [Region_analysis_sig.Node.DomTree]
E
entry_node [Region_analysis_sig.Node.Graph]
exit_nodes [Region_analysis_sig.Node.Graph]
F
find [State_builder.Hashtbl]

Return the current binding of the given key.

find_all [State_builder.Hashtbl]

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

fold [State_builder.Hashtbl]
fold_bounds [Loop_analysis]
fold_bounds [LoopAnalysis.Loop_analysis]
fold_sorted [State_builder.Hashtbl]
G
get [Region_analysis_sig.Node.Edge_Dict]
get [Region_analysis_sig.Node.Dict]
get_bounds [Loop_analysis]
get_bounds [LoopAnalysis.Loop_analysis]
get_range [Parameter_sig.Int]

What is the possible range of values for this parameter.

I
incr [Parameter_sig.Int]

Increment the integer.

iter [State_builder.Hashtbl]
iter [Region_analysis_sig.Node.Edge_Dict]
iter [Region_analysis_sig.Node.Dict]
iter_preds [Region_analysis_sig.Node.Graph]
iter_sorted [State_builder.Hashtbl]
iter_succs [Region_analysis_sig.Node.Graph]
J
join [Slevel_analysis.SpecificNoBranches]
join [Slevel_analysis.Specific]
join [Region_analysis_stmt.M]
join [Region_analysis_sig.Node]
join2 [Slevel_analysis.SpecificNoBranches]
join2 [Slevel_analysis.Specific]
join2_stmts [Slevel_analysis.SpecificNoBranches]
join2_stmts [Slevel_analysis.Specific]
K
kf [Slevel_analysis.SpecificNoBranches]
kf [Slevel_analysis.Specific]
kf [Region_analysis_stmt.M]
L
length [State_builder.Hashtbl]

Length of the table.

M
main [Register]
max_elt [FCSet.S]

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

max_slevel_encountered [Slevel_analysis]
mem [State_builder.Hashtbl]
memo [State_builder.Hashtbl]

Memoization.

min_elt [FCSet.S]

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

mu [Slevel_analysis.SpecificNoBranches]
mu [Slevel_analysis.Specific]
mu [Region_analysis_stmt.M]
mu [Region_analysis_sig.Node]
N
nearest_elt_ge [FCSet.S]

nearest_elt_ge v s returns the smallest element of s that is bigger or equal to v.

nearest_elt_le [FCSet.S]

nearest_elt_le v s returns the largest element of s that is smaller or equal to v.

O
off [Parameter_sig.Bool]

Set the boolean to false.

on [Parameter_sig.Bool]

Set the boolean to true.

P
pretty [Region_analysis_sig.Node]
R
remove [State_builder.Hashtbl]
replace [State_builder.Hashtbl]

Add a new binding.

S
set [Region_analysis_sig.Node.Edge_Dict]
set [Region_analysis_sig.Node.Dict]
set_range [Parameter_sig.Int]

Set what is the possible range of values for this parameter.

split [FCSet.S]

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.

U
update_max_slevel_encountered [Slevel_analysis]