Module ControlFlowGraphImplShared

Provides a predicate for the successor relation with split information, as well as logic used to construct the type TSplits representing sets of splits. Only sets of splits that can be reached are constructed, hence the predicates are mutually recursive.

Holds if first is the first element executed within control flow element cft.

Holds if last with completion c is a potential last element executed within control flow element cft.

Holds if succ is a control flow successor for pred, given that pred finishes with completion c.

An element with associated control flow.

An element that is a leaf in the control flow graph.

An element that is executed in post-order.

An element that is executed in pre-order.

An interface for implementing an entity to split on.

A split kind. Each control flow node can have at most one split of a given kind.

A set of control flow node splits. The set is represented by a list of splits, ordered by ascending rank.

A standard element that is executed in post-order.

A standard element that is executed in pre-order.

An element where the children are evaluated following a standard left-to-right evaluation. The actual evaluation order is determined by the predicate getChildElement().

Provides a set of splitting-related consistency queries.

Import this module into a .ql file of @kind graph to render a CFG. The graph is restricted to nodes from RelevantNode.