A taken branch under a predict-not-taken policy

A 5-stage in-order pipeline (IF, ID, EX, MEM, WB) resolves conditional branches at the end of EX (the 3rd stage) and uses a simple predict-not-taken policy with no BTB. A branch is fetched, and the two instructions immediately behind it in program order are fetched speculatively (as fall-through) while the branch is still working its way through the pipeline. The branch turns out to be taken. How many fetched instructions must be squashed?

3 of 47 in Computer Architecture