Interval Creation Process:
- The algorithm starts at the entry node and creates the first interval.
- It adds nodes to the current interval if ALL of their predecessors are already in the interval.
- When a node is found that doesn't satisfy this condition, it becomes a new header node, starting a new interval.
Key Stopping Condition: The crucial part of stopping node addition to an interval is the all_preds_in_interval
check.
Specifically:
- If all predecessors of a node are already in the current interval, the node is added to that interval.