2004-08-10 20:42:36 +00:00
|
|
|
TODO:
|
2005-04-11 20:48:57 +00:00
|
|
|
* gpr0 allocation
|
2004-10-26 04:10:53 +00:00
|
|
|
* implement do-loop -> bdnz transform
|
2004-08-14 22:16:36 +00:00
|
|
|
* implement powerpc-64 for darwin
|
2004-08-29 22:02:43 +00:00
|
|
|
* use stfiwx in float->int
|
2005-07-26 18:59:06 +00:00
|
|
|
* be able to combine sequences like the following into 2 instructions:
|
|
|
|
lis r2, ha16(l2__ZTV4Cell)
|
|
|
|
la r2, lo16(l2__ZTV4Cell)(r2)
|
|
|
|
addi r2, r2, 8
|
2005-07-26 19:07:51 +00:00
|
|
|
|
Make FP_TO_UINT Illegal. This allows us to generate significantly better
codegen for FP_TO_UINT by using the legalizer's SELECT variant.
Implement a codegen improvement for SELECT_CC, selecting the false node in
the MBB that feeds the phi node. This allows us to codegen:
void foo(int *a, int b, int c) { int d = (a < b) ? 5 : 9; *a = d; }
as:
_foo:
li r2, 5
cmpw cr0, r4, r3
bgt .LBB_foo_2 ; entry
.LBB_foo_1: ; entry
li r2, 9
.LBB_foo_2: ; entry
stw r2, 0(r3)
blr
insted of:
_foo:
li r2, 5
li r5, 9
cmpw cr0, r4, r3
bgt .LBB_foo_2 ; entry
.LBB_foo_1: ; entry
or r2, r5, r5
.LBB_foo_2: ; entry
stw r2, 0(r3)
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@22784 91177308-0d34-0410-b5e6-96231b3b80d8
2005-08-14 01:17:16 +00:00
|
|
|
* Teach LLVM how to codegen this:
|
|
|
|
unsigned short foo(float a) { return a; }
|
|
|
|
as:
|
|
|
|
_foo:
|
|
|
|
fctiwz f0,f1
|
|
|
|
stfd f0,-8(r1)
|
|
|
|
lhz r3,-2(r1)
|
|
|
|
blr
|
|
|
|
not:
|
|
|
|
_foo:
|
|
|
|
fctiwz f0, f1
|
|
|
|
stfd f0, -8(r1)
|
|
|
|
lwz r2, -4(r1)
|
|
|
|
rlwinm r3, r2, 0, 16, 31
|
|
|
|
blr
|
|
|
|
|
|
|
|
|
2005-08-05 19:18:32 +00:00
|
|
|
* Support 'update' load/store instructions. These are cracked on the G5, but
|
|
|
|
are still a codesize win.
|
|
|
|
|
2005-08-09 22:30:57 +00:00
|
|
|
* Add a custom legalizer for the GlobalAddress node, to move the funky darwin
|
|
|
|
stub stuff from the instruction selector to the legalizer (exposing low-level
|
|
|
|
operations to the dag for optzn. For example, we want to codegen this:
|
|
|
|
|
|
|
|
int A = 0;
|
|
|
|
void B() { A++; }
|
|
|
|
as:
|
|
|
|
lis r9,ha16(_A)
|
|
|
|
lwz r2,lo16(_A)(r9)
|
|
|
|
addi r2,r2,1
|
|
|
|
stw r2,lo16(_A)(r9)
|
|
|
|
not:
|
|
|
|
lis r2, ha16(_A)
|
|
|
|
lwz r2, lo16(_A)(r2)
|
|
|
|
addi r2, r2, 1
|
|
|
|
lis r3, ha16(_A)
|
|
|
|
stw r2, lo16(_A)(r3)
|
|
|
|
|
2004-07-27 18:43:04 +00:00
|
|
|
* should hint to the branch select pass that it doesn't need to print the
|
|
|
|
second unconditional branch, so we don't end up with things like:
|
|
|
|
b .LBBl42__2E_expand_function_8_674 ; loopentry.24
|
|
|
|
b .LBBl42__2E_expand_function_8_42 ; NewDefault
|
|
|
|
b .LBBl42__2E_expand_function_8_42 ; NewDefault
|
2005-08-23 06:27:59 +00:00
|
|
|
|
2005-08-24 18:15:24 +00:00
|
|
|
===-------------------------------------------------------------------------===
|
|
|
|
|
2005-08-23 06:27:59 +00:00
|
|
|
* Codegen this:
|
|
|
|
|
|
|
|
void test2(int X) {
|
|
|
|
if (X == 0x12345678) bar();
|
|
|
|
}
|
|
|
|
|
|
|
|
as:
|
|
|
|
|
|
|
|
xoris r0,r3,0x1234
|
|
|
|
cmpwi cr0,r0,0x5678
|
|
|
|
beq cr0,L6
|
|
|
|
|
|
|
|
not:
|
|
|
|
|
|
|
|
lis r2, 4660
|
|
|
|
ori r2, r2, 22136
|
|
|
|
cmpw cr0, r3, r2
|
|
|
|
bne .LBB_test2_2
|
|
|
|
|
2005-08-24 18:15:24 +00:00
|
|
|
===-------------------------------------------------------------------------===
|
|
|
|
|
|
|
|
Lump the constant pool for each function into ONE pic object, and reference
|
|
|
|
pieces of it as offsets from the start. For functions like this (contrived
|
|
|
|
to have lots of constants obviously):
|
|
|
|
|
|
|
|
double X(double Y) { return (Y*1.23 + 4.512)*2.34 + 14.38; }
|
|
|
|
|
|
|
|
We generate:
|
|
|
|
|
|
|
|
_X:
|
|
|
|
lis r2, ha16(.CPI_X_0)
|
|
|
|
lfd f0, lo16(.CPI_X_0)(r2)
|
|
|
|
lis r2, ha16(.CPI_X_1)
|
|
|
|
lfd f2, lo16(.CPI_X_1)(r2)
|
|
|
|
fmadd f0, f1, f0, f2
|
|
|
|
lis r2, ha16(.CPI_X_2)
|
|
|
|
lfd f1, lo16(.CPI_X_2)(r2)
|
|
|
|
lis r2, ha16(.CPI_X_3)
|
|
|
|
lfd f2, lo16(.CPI_X_3)(r2)
|
|
|
|
fmadd f1, f0, f1, f2
|
|
|
|
blr
|
|
|
|
|
|
|
|
It would be better to materialize .CPI_X into a register, then use immediates
|
|
|
|
off of the register to avoid the lis's. This is even more important in PIC
|
|
|
|
mode.
|
|
|
|
|
|
|
|
===-------------------------------------------------------------------------===
|
2005-09-06 15:30:48 +00:00
|
|
|
|
|
|
|
Implement Newton-Rhapson method for improving estimate instructions to the
|
|
|
|
correct accuracy, and implementing divide as multiply by reciprocal when it has
|
|
|
|
more than one use. Itanium will want this too.
|