x86 Instruction Reordering for Code Compression

TLDR: This work shows that reordering instructions within basic blocks using data ow constraints can improve code compression without changing the behavior of the code.

Abstract: Runtime executable code compression is a method which uses standard data compression methods and binary machine code transformations to achieve smaller le size, yet maintaining the ability to execute the compressed le as a regular executable. With a disassembler, an almost perfect instructional and functional level disassembly can be generated. Using the structural information of the compiled machine code each function can be split into so called basic blocks. In this work we show that reordering instructions within basic blocks using data ow constraints can improve code compression without changing the behavior of the code. We use two kinds of data aection (read, write) and 20 data types including registers: 8 basic x86 registers, 11 eags, and memory data. Due to the complexity of the reordering, some simplication is required. Our solution is to search local optimum of the compression on the function level and then combine the results to get a suboptimal global result. Using the reordering method better results can be achieved, namely the compression size gain for gzip can be as high as 1.24%, for lzma 0.68% on the tested executables.