The tail node
1. A node ‘d’ of a flow graph dominates node ‘n’, if every path from the initial node to ‘n’ goes through ‘d’. 2. The dominators[head] containing the tail node in a flow graph detects the presence of a back edge. 3. A pre-header is a basic block introduced during the loop optimisation to hold […]