Greedy Register Allocation in LLVM 3.0

LLVM has two new register allocators: Basic and Greedy. When LLVM 3.0 is released, the default optimizing register allocator will no longer be linear scan, but the new greedy register allocator. With its global live range splitting, the greedy algorithm generates code that is 1-2% smaller, and up to 10% faster than code produced by linear scan. Lessons learned from linear scanLinear scan has been

[rjj]

レジアロの微妙な最適化の沼に入り込みつつある気もするが、split-after-allocation方式はコンサバだけど効くってところか。