Optimization of 32-bit Unsigned Division by Constants on 64-bit Targets
Abstract
Granlund and Montgomery proposed an optimization method for unsigned integer division by constants [3]. Their method (called the GM method in this paper) was further improved in part by works such as [1] and [7], and is now adopted by major compilers including GCC, Clang, Microsoft Compiler, and Apple Clang. However, for example, for x/7, the generated code is designed for 32-bit CPUs and therefore does not fully exploit 64-bit capabilities. This paper proposes an optimization method for 32-bit unsigned division by constants targeting 64-bit CPUs. We implemented patches for LLVM/GCC and achieved speedups of 1.67x on Intel Xeon w9-3495X (Sapphire Rapids) and 1.98x on Apple M4 (Apple M-series SoC) in the microbenchmark described later. The LLVM patch has already been merged into llvm:main [6], demonstrating the practical applicability of the proposed method.
Cite
@article{arxiv.2604.07902,
title = {Optimization of 32-bit Unsigned Division by Constants on 64-bit Targets},
author = {Shigeo Mitsunari and Takashi Hoshino},
journal= {arXiv preprint arXiv:2604.07902},
year = {2026}
}