In computer science, a control flow graph (CFG)
is a representation
, using graph
notation, of all paths that might be traversed through a program
during its execution
. Each node
in the graph
represents a basic block
, i.e. a straight-line piece of code without any jumps or jump targets; jump targets start a block, and jumps end a block. Directed edges
are used to represent jumps in the control flow. There are, in most presentations, two specially designated blocks: the entry block
, through which control enters into the flow graph, and the exit block
, through which all control flow leaves.
The CFG is essential to many compiler optimizations and static analysis tools.
Reachability is another graph property useful in optimization. If a block/subgraph is not connected from the subgraph containing the entry block, that block is unreachable during any execution, and so is unreachable code; it can be safely removed. If the exit block is unreachable from the entry block, it indicates an infinite loop (not all infinite loops are detectable, of course. See Halting problem). Again, dead code and some infinite loops are possible even if the programmer didn't explicitly code that way: optimizations like constant propagation and constant folding followed by jump threading could collapse multiple basic blocks into one, cause edges to be removed from a CFG, etc., thus possibly disconnecting parts of the graph.
These terms are commonly used when discussing control flow graphs.entry block
: block through which all control flow enters the graphexit block
: block through which all control flow leaves the graphback edge
: an edge that points to an ancestor in a depth-first (DFS
) traversal of the graphcritical edge
: an edge which is neither the only edge leaving its source block, nor the only edge entering its destination block. These edges must be split
(a new block must be created in the middle of the edge) in order to insert computations on the edge.abnormal edge
: an edge whose destination is unknown. These edges tend to inhibit optimization. Exception handling
constructs can produce them.impossible edge
: (also known as a fake edge
) An edge which has been added to the graph solely to preserve the property that the exit block postdominates all blocks. It cannot ever be traversed.dominator
: block M dominates
block N if every path from the entry that reaches block N has to pass through block M. The entry block dominates all blocks.postdominator
: block M postdominates
block N if every path from N to the exit has to pass through block M. The exit block postdominates all blocks.immediate dominator
: block M immediately dominates
block N if M dominates N, and there is no intervening block P such that M dominates P and P dominates N. In other words, M is the last dominator on any path from entry to N. Each block has a unique immediate dominator, if it has any at all.immediate postdominator
: Analogous to immediate dominator
: An ancillary data structure depicting the dominator relationships. There is an arc from Block M to Block N if M is an immediate dominator of N. This graph is a tree, since each block has a unique immediate dominator. This tree is rooted at the entry block. Can be calculated efficiently using Lengauer-Tarjan's algorithm.postdominator tree
: Analogous to dominator tree
. This tree is rooted at the exit block.loop header
: Sometimes called the entry point
of the loop, a dominator that is the target of a loop-forming back edge. Dominates all blocks in the loop body.loop pre-header
: Suppose block M is a dominator with several incoming edges, some of them being back edges (so M is a loop header). It is advantageous to several optimization passes to break M up into two blocks Mpre
. The contents of M and back edges are moved to Mloop
, the rest of the edges are moved to point into Mpre
, and a new edge from Mpre
is inserted (so that Mpre
is the immediate dominator of Mloop
). In the beginning, Mpre
would be empty, but passes like loop-invariant code motion
could populate it. Mpre
is called the loop pre-header
, and Mloop
would be the loop header.
Consider the following fragment of code:
0: (A) t0 = read_num
1: (A) if t0 mod 2 == 0 goto 4
2: (B) print t0 + " is odd."
3: (B) goto 5
4: (C) print t0 + " is even."
5: (D) end program
In the above, we have 4 basic blocks: A from 0 to 1, B from 2 to 3, C at 4 and D at 5. In particular, in this case, A is the "entry block", D the "exit block" and lines 4 and 5 are jump targets. A graph for this fragment has edges from A to B, A to C, B to D and C to D.