Editing Basic block (section)

==Definition==
The code in a basic block has:
* One [[entry point]], meaning that no code within it is the destination of a [[jump instruction]] anywhere in the program.
* One exit point, meaning that only the last instruction can cause the program to begin executing code in a different basic block.
Under these circumstances, whenever the first instruction in a basic block is executed, the rest of the instructions are necessarily executed exactly once and in order.<ref>{{cite conference |chapter=Masking wrong-successor Control Flow Errors employing data redundancy |last1=Yousefi |first1=Javad |title=2015 5th International Conference on Computer and Knowledge Engineering (ICCKE) |date= 2015|publisher=IEEE |pages=201–205 |doi=10.1109/ICCKE.2015.7365827 |isbn=978-1-4673-9280-8 }}</ref><ref>[http://portal.acm.org/citation.cfm?id=808480 "Global Common Subexpression Elimination"] by John Cocke.</ref>

The code may be [[source code]], [[assembly code]], or some other sequence of instructions.

More formally, a sequence of instructions forms a basic block if:
* The instruction in each position [[dominator (graph theory)|dominates]] (always executes before) all those in later positions.
* No other instruction executes between two instructions in the sequence.
This definition is more general than the intuitive one in some ways. For example, it allows unconditional jumps to labels not targeted by other jumps. This definition embodies the properties that make basic blocks easy to work with when constructing an algorithm.

The blocks to which control may transfer after reaching the end of a block are called that block's ''successors'', while the blocks from which control may have come when entering a block are called that block's ''predecessors''. The start of a basic block may be jumped to from more than one location.