llvm/test/Transforms/ConstantHoisting
Sjoerd Meijer 05488db23f This implements a more optimal algorithm for selecting a base constant in
constant hoisting. It not only takes into account the number of uses and the
cost of expressions in which constants appear, but now also the resulting
integer range of the offsets. Thus, the algorithm maximizes the number of uses
within an integer range that will enable more efficient code generation. On
ARM, for example, this will enable code size optimisations because less
negative offsets will be created. Negative offsets/immediates are not supported
by Thumb1 thus preventing more compact instruction encoding.

Differential Revision: http://reviews.llvm.org/D21183



git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@275382 91177308-0d34-0410-b5e6-96231b3b80d8
2016-07-14 07:44:20 +00:00
..
AArch64
ARM This implements a more optimal algorithm for selecting a base constant in 2016-07-14 07:44:20 +00:00
PowerPC
X86 [PM] Port ConstantHoisting to the new Pass Manager 2016-07-02 00:16:47 +00:00