Index of values

A
add' [Pdg_aux.NS]
all_call_input_nodes [Pdg_aux]

all_call_input_nodes caller callee call_stmt find all the nodes above call_stmt in the pdg of caller that define the inputs of callee.

all_call_out_nodes [Pdg_aux]

all_call_out_nodes ~callee ~caller stmt find all the nodes of callee that define the Call/Out nodes of caller for the call to callee that occurs at stmt.

all_pragmas_kf [Register]
C
compute_from_nodes [Register]
compute_from_stmt [Register]
compute_multiple_stmts [Register]
compute_pragmas [Register]
compute_pragmas [Impact.Register]

Compute the impact analysis from the impact pragma in the program.

copy [Datatype.S]

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

D
default_edge_attributes [Reason_graph.Printer]
default_vertex_attributes [Reason_graph.Printer]
diff [Pdg_aux.NS]
dst [Reason_graph.Printer.E]
E
edge_attributes [Reason_graph.Printer]
empty [Reason_graph]
empty [Pdg_aux.NS]
exists [Parameter_sig.Set]

Is there some element satisfying the given predicate?

F
filter' [Pdg_aux.NS]
fold [Pdg_aux.NS]
for_all' [Pdg_aux.NS]
from_nodes [Register]
from_nodes [Impact.Register]

Compute the impact analysis of the given set of PDG nodes, that come from the given function.

from_stmt [Register]
from_stmt [Impact.Register]

Compute the impact analysis of the given statement.

G
get_subgraph [Reason_graph.Printer]
graph_attributes [Reason_graph.Printer]
I
impact_in_kf [Compute_impact]

Nodes impacted in a given function

in_kf [Reason_graph.AdditionalInfo]
initial_nodes [Compute_impact]

To compute the impact of a statement, find the initial PDG nodes that must be put in the worklist.

initial_nodes [Reason_graph.AdditionalInfo]
inter [Pdg_aux.NS]
intersects [Pdg_aux.NS]
is_empty [Pdg_aux.NS]
is_on [Options]
iter' [Pdg_aux.NS]
iter_edges_e [Reason_graph.Printer]
iter_vertex [Reason_graph.Printer]
K
keep_edge [Reason_graph.Printer]
M
main [Register]
make_type [Datatype.Hashtbl]
mem [Pdg_aux.NS]
mem [Parameter_sig.Set]

Does the given element belong to the set?

mem' [Pdg_aux.NS]
N
nearest_elt_ge [Datatype.Set]
nearest_elt_le [Datatype.Set]
node_kf [Reason_graph.Printer]
nodes_impacted [Compute_impact]

Impact of a list of PDG nodes as a set of nodes

nodes_impacted_by_nodes [Compute_impact]

Impact of a list of PDG nodes coming from the same function

nodes_impacted_by_stmts [Compute_impact]

Impact of a list stmts coming from the same function

nodes_origin [Reason_graph.AdditionalInfo]
nodes_to_stmts [Compute_impact]

Transform a set of PDG nodes into a set of statements

O
off [Parameter_sig.Bool]

Set the boolean to false.

on [Parameter_sig.Bool]

Set the boolean to true.

P
pp_stmt [Register]
pretty [Reason_graph.Printer.V]
pretty [Pdg_aux.NS]
pretty_node [Pdg_aux]
print_dot_graph [Reason_graph]
print_reason [Reason_graph]
print_results [Register]
R
remove [Pdg_aux.NS]
result_to_nodes [Compute_impact]

Transform the result of an analysis into a set of PDG nodes

S
skip [Compute_impact]

computed from the option -impact-skip

slice [Register]
src [Reason_graph.Printer.E]
stmts_impacted [Compute_impact]

Impact of a list of statements as a set of statements

T
to_dot_file [Reason_graph]
to_dot_formatter [Reason_graph]
U
union [Pdg_aux.NS]
V
vertex_attributes [Reason_graph.Printer]
vertex_name [Reason_graph.Printer]