What is Control-flow graph?
A graph representing a program's execution flow, with basic blocks as nodes and branches between them as edges. It is used to detect loops and analyze data flow.
Field: Compilers
Control-flow graph in the explanations
A control-flow graph has basic blocks as nodes and, as edges, the possible transitions from one block to the next: both targets of a conditional branch, or falling through to the following block.
In a control-flow graph, what do the nodes and edges repres…Since execution order within a block is fixed, local optimization is easy, and a control-flow graph with blocks as nodes represents overall flow.
Which describes a basic block?Liveness analysis traverses the control-flow graph to determine, at each point in the program, whether a value may be read later (whether it is live).
What does liveness analysis, done in preparation for regist…
Questions that mention Control-flow graph (3)
Related terms
Basic block Loop unrolling Register allocation Abstract syntax tree Common subexpression elimination Constant folding Function inlining Instruction scheduling Intermediate representation JIT compilation