Index of values

Add a downward call to the worklist the first time it is encountered.

From now on, most functions will pass init = false to add_to_do_aux.

Add some nodes to the todo field of the worklist, while enforcing some invariants.

Mark a new node as impacted, and simultaneouly mark that it is equivalent to nodes that are all initial nodes

Add a new edge in the graph explaining the results

Add a node to the sets of impacted nodes.

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 ~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.

Fill out the field upward_calls of the worklist.

Reset the reference to its default value.

Clear all the caches used internally by the functions of this module.

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

Propagate impact for all calls registered in downward_calls.

Propagate impact for one call registered in downward_calls.

Propagate impact from node node if it corresponds to a call statement.

Auxiliary function, used to refuse some nodes that should not go in the results

find_call_input_nodes pdg_caller s ?z input find all the nodes of pdg_caller that define the pdg input input above the call statement s.

Make the worklist reach a fixpoint, by propagating all possible source of impact as much as possible.

Build a set from another elt-indexed map or set.

Get the referenced value.

Impact of a set of nodes.

Nodes impacted in a given function

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

Build the initial value of the todo field, from a list of initial nodes

Compute the initial state of the worklist.

intersects s1 s2 returns true if and only if s1 and s2 have an element in common

Empty the todo field of the worklist by applying as many basic steps as possible: intra-procedural steps, plus basic inter-procedural steps on downward calls.

Purely intra-procedural propagation from one impacted node.

memo tbl k f returns the binding of k in tbl.

return true if the location in n is contained in skip, in which case the node should be skipped entirely

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

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

Impact of a list stmts coming from the same function

Transform a set of PDG nodes into a set of statements

Choose one node to process in the todo list, if one remains

Mark that n comes from an indirect impact, ie.

Extract the current results for a given function

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

Change the referenced value.

Export the shape of the set.

Computation of the skip field from the -impact-skip option

Computation of the skip field from a list of variables

Impact of a list of statements as a set of statements

Extract the node of the kf that are only part of the initial impact

Upward propagation in all the callers.