OPTIMIZING THE JAVA VIRTUAL MACHINE INSTRUCTION SET BY ...

148
CMCB_Name: The name of the compressed multicode block file to
process
BlockCounts: A map from a bytecode sequence to a count of the number
of times that it occurred, initially empty
BestSeq: The sequence of bytecodes that is the best candidate
for multicode substitution
Call DetermineCandidateCounts(CMCB_Name, BlockCount)
BestSeq = Call FindBestSeq(BlockCounts)
Function DetermineCandidateCounts(InputFile, BlockCounts) Returns Nothing
Read InputFile
For each line in the Compressed Multicode Block File
Let s represent the bytecode sequence on that line
Let c be the count for s
For each non-empty subsequence t, of s, such that t.length BestScore
BestSeq = k
BestScore = Score
End If
End For
Return BestSeq
End Function
Function ComputeScore(Sequence, Count) Returns Integer
Return Sequence.length * Count
End Function
Figure 7.4: An Algorithm for Identifying the Best Candidate Sequence in a Compressed
Multicode Block File