Because there is only one squash state machine for all the bit positions of a first-level filter, the cost is minimal.
we implement the delay via a small delay buffer that holds a few recently-completed instructions (e.g., 6-8) for potential replay in the near future, as shown in Figure 4.