OPTIMIZING THE JAVA VIRTUAL MACHINE INSTRUCTION SET BY ...

149
BlockList: A list of the bytecode sequences
Prefix: A sequence of bytecodes
Suffix: A sequence of bytecodes
For each key k, in BlockCounts
Add k to BlockList
End for
Sort BlockList into descending order by sequence length
For each element, e, in BlockList
If BlockCounts[e] > 0 and e contains BestSeq
Count = BlockCounts[e]
For each non-empty subsequence of e, e’
BlockCounts[e’] -= Count
End For
Let Prefix hold all of the bytecodes in e before the occurrence
of BestSeq
Let Suffix hold all of the bytecodes in e after the occurrence
of BestSeq
For each non-empty subsequence of Prefix, p
BlockCounts[p] += Count
End For
For each non-empty subsequence of Suffix, s
BlockCounts[s] += Count
End For
End If
End for
Figure 7.5: An Algorithm for Updating the BlockCounts Data Structure to Prevent
Overlapping Sequences from being Counted