Module MakeImplCommon

The cost limits for the AccessPathFront to AccessPathApprox expansion.

The cost limits for the AccessPathApprox to AccessPath expansion.

Holds if arg is an argument of call with an argument position that matches parameter position ppos.

Gets the local call context given the call context and the callable that the contexts apply to.

Gets the type of n used for type pruning.

Gets the enclosing callable of n. Unlike n.getEnclosingCallable(), this predicate ensures that joins go from n to the result instead of the other way around.

The front of an access path. This is either a head or a nil.

An optional access path front.

The front of an approximated access path. This is either a head or a nil.

An optional approximated access path front.

A data-flow node that represents a call argument.

An optional Boolean value.

A call context to restrict the targets of virtual dispatch, prune local flow, and match the call sites of flow into a method with flow out of a method.

A Node at which a cast can occur such that the type should be checked.

An optional DataFlowCall.

A call context that is relevant for pruning local flow.

A node to which data can flow from a call. Either an ordinary out node or a post-update node associated with a call argument.

The value of a parameter at function entry, viewed as a node in a data flow graph.

An optional ParamNode.

A return context used to calculate flow summaries in reverse flow.

An extended return kind. A return kind describes how data can be returned from a callable. This can either be through a returned value or an updated parameter.

A node from which flow can return to the caller. This is either a regular ReturnNode or a PostUpdateNode corresponding to the value of a parameter.

A callable tagged with a relevant return kind.

Provides predicates releated to call-context sensitivity.

Given a call graph for a set of flow paths, this module calculates the type flow between parameter and argument nodes in the cases where it is possible for a type to first be weakened and then strengthened again. When the stronger types at the end-points of such a type flow path are incompatible, the relevant call edges can be excluded as impossible.