A | |
access_from [From_register] | |
add [FCMap.S] | add x y m returns a map containing the same bindings as
m , plus a binding of x to y .
|
add [State_builder.Hashtbl] |
Add a new binding.
|
B | |
bind_locals [From_compute.Make] |
Bind all the given variables to
Assigned \from \nothing .
|
bindings [FCMap.S] |
Return the list of all bindings of the given map.
|
bottom [From_compute.Make.Computer] | |
bottom_from [From_compute.Make] | |
C | |
call_for_individual_froms [Callwise] | |
call_froms_stack [Callwise] |
The state of the callwise From analysis.
|
call_stack [From_compute.Make] | |
callwise_states_with_formals [From_compute.Make.Computer] | |
cardinal [FCMap.S] |
Return the number of bindings of a map.
|
choose [FCMap.S] |
Return one binding of the given map, or raise
Not_found if
the map is empty.
|
cleanup [Functionwise.To_Use] | |
cleanup_and_save [Functionwise.To_Use] | |
cleanup_and_save [From_compute.To_Use] |
Clean the given from (that have been computed for the given function),
optionally save them, and return the cleant result.
|
clear [State_builder.Hashtbl] |
Clear the table.
|
compare [FCMap.S] |
Total ordering between maps.
|
compare [From_register.SortCalls] | |
compute [From_compute.Make] | |
compute_and_return [From_compute.Make] |
Compute the dependencies of the given function, and return them
|
compute_call_from_value_states [Callwise] | |
compute_memdeps [Mem_dependencies] | |
compute_pathdeps [Path_dependencies] | |
compute_using_cfg [From_compute.Make] | |
compute_using_prototype [From_compute.Make] | |
compute_using_prototype_for_state [From_compute] |
Function that compute the Froms from a given prototype, called
in the given state
|
D | |
display [From_register] | |
display_one_from [From_compute.Make.Computer] | |
doEdge [From_compute.Make.Computer] | |
E | |
eliminate_additional [From_compute.Make.Computer] | |
empty [FCMap.S] |
The empty map.
|
empty_from [From_compute.Make] | |
end_record [Callwise] | |
equal [FCMap.S] | 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 [FCMap.S] | exists p m checks if at least one binding of the map
satisfy the predicate p .
|
externalize [From_compute.Make] | |
F | |
filter [FCMap.S] | filter p m returns the map with all the bindings in m
that satisfy predicate p .
|
find [FCMap.S] | find x m returns the current binding of x in m ,
or raises Not_found if no such binding exists.
|
find [State_builder.Hashtbl] |
Return the current binding of the given key.
|
find [From_compute.Make] | |
find_all [State_builder.Hashtbl] |
Return the list of all data associated with the given key.
|
find_deps_lval_no_transitivity [From_compute] | |
find_deps_no_transitivity [From_compute] |
Direct computation of the dependencies on expressions, offsets and
lvals.
|
fold [FCMap.S] | 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.
|
fold [State_builder.Hashtbl] | |
fold_sorted [State_builder.Hashtbl] | |
for_all [FCMap.S] | for_all p m checks if all the bindings of the map
satisfy the predicate p .
|
force_compute [Functionwise] | |
force_compute_all [Functionwise] | |
force_compute_all_calldeps [Callwise] | |
G | |
get_from_call [Functionwise.To_Use] | |
get_from_call [From_compute.To_Use] |
How to find the Froms for a given call during the analysis.
|
get_value_state [Functionwise.To_Use] | |
get_value_state [From_compute.To_Use] |
How to find the state of Value at a given statement during the analysis.
|
I | |
is_empty [FCMap.S] |
Test whether a map is empty or not.
|
iter [FCMap.S] | iter f m applies f to all bindings in map m .
|
iter [State_builder.Hashtbl] | |
iter_callwise_calls_sorted [From_register] | |
iter_sorted [State_builder.Hashtbl] | |
J | |
join [From_compute.Make.Computer] | |
join [From_compute.ZoneStmtMap] | |
join_and_is_included [From_compute.Make.Computer] | |
K | |
keep_base [Functionwise.To_Use] | |
keep_base [From_compute.To_Use] |
Return true if the given base is in scope after a call to the given
function.
|
L | |
length [State_builder.Hashtbl] |
Length of the table.
|
lval_to_precise_loc_with_deps [From_compute.Make] | |
lval_to_zone_with_deps [From_compute.Make] | |
M | |
main [From_register_gui] | |
main [From_register] | |
map [FCMap.S] | 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 .
|
mapi [FCMap.S] |
Same as
FCMap.S.map , but the function receives as arguments both the
key and the associated value for each binding of the map.
|
max_binding [FCMap.S] |
Same as
FCMap.S.min_binding , but returns the largest binding
of the given map.
|
mem [FCMap.S] | mem x m returns true if m contains a binding for x ,
and false otherwise.
|
mem [State_builder.Hashtbl] | |
memo [Functionwise.To_Use] | |
memo [State_builder.Hashtbl] |
Memoization.
|
merge [FCMap.S] | merge f m1 m2 computes a map whose keys is a subset of keys of m1
and of m2 .
|
merge_call_froms [Callwise] | |
merge_deps [From_compute.Make] |
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
|
min_binding [FCMap.S] |
Return the smallest binding of the given map
(with respect to the
Ord.compare ordering), or raise
Not_found if the map is empty.
|
P | |
partition [FCMap.S] | 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 .
|
pretty [From_compute.Make.Computer] | |
pretty_with_indirect [From_register] | |
R | |
rebuild_additional_deps [From_compute.Make] |
Recreate the
additional_deps field from additional_deps_table
|
record_callwise_dependencies_in_db [Callwise] | |
record_for_individual_froms [Callwise] | |
remove [FCMap.S] | remove x m returns a map containing the same bindings as
m , except for x which is unbound in the returned map.
|
remove [State_builder.Hashtbl] | |
replace [State_builder.Hashtbl] |
Add a new binding.
|
S | |
singleton [FCMap.S] | singleton x y returns the one-element map that contains a binding y
for x .
|
split [FCMap.S] | 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 .
|
substitute [From_compute.Make.Computer] | |
T | |
transfer_assign [From_compute.Make.Computer] |
Handle an assignement
lv = ... , the dependencies of the right-hand
side being stored in deps_right .
|
transfer_conditional_exp [From_compute.Make.Computer] | |
transfer_guard [From_compute.Make.Computer] | |
transfer_instr [From_compute.Make.Computer] | |
transfer_stmt [From_compute.Make.Computer] |