- Aug 22, 2005
-
-
Chris Lattner authored
llvm-svn: 22963
-
Chris Lattner authored
float %test2(float* %P) { %Q = load float* %P %R = add float %Q, %Q ret float %R } By returning the right result. llvm-svn: 22961
-
Chris Lattner authored
Make sure expressions only have one use before emitting them into a place that is conditionally executed llvm-svn: 22960
-
Chris Lattner authored
llvm-svn: 22959
-
- Aug 21, 2005
-
-
Chris Lattner authored
llvm-svn: 22953
-
Chris Lattner authored
simplifies BRTWOWAY into BR if one of the results is a fall-through. Unless I'm missing something, there is no reason to duplicate this in the target-specific code. llvm-svn: 22952
-
Chris Lattner authored
llvm-svn: 22951
-
Chris Lattner authored
it in the block. This codegens: int %test(bool %c) { %retval = select bool %c, int 17, int 1 ret int %retval } as: _test: rlwinm r2, r3, 0, 31, 31 li r2, 17 cmpwi cr0, r3, 0 bne .LBB_test_2 ; .LBB_test_1: ; li r2, 1 .LBB_test_2: ; or r3, r2, r2 blr instead of: _test: rlwinm r2, r3, 0, 31, 31 li r2, 17 li r4, 1 cmpwi cr0, r3, 0 bne .LBB_test_2 ; .LBB_test_1: ; or r2, r4, r4 .LBB_test_2: ; or r3, r2, r2 blr ... which is one fewer instruction. The savings are more significant for global address and constantfp nodes. llvm-svn: 22946
-
- Aug 20, 2005
-
-
Chris Lattner authored
This REALLY should be lowered by the legalizer! llvm-svn: 22941
-
- Aug 19, 2005
-
-
Chris Lattner authored
llvm-svn: 22935
-
Chris Lattner authored
llvm-svn: 22929
-
Chris Lattner authored
llvm-svn: 22926
-
Chris Lattner authored
llvm-svn: 22913
-
Nate Begeman authored
instruction. llvm-svn: 22901
-
Nate Begeman authored
llvm-svn: 22889
-
Nate Begeman authored
passed. llvm-svn: 22886
-
Nate Begeman authored
llvm-svn: 22884
-
Chris Lattner authored
the operand lists of a few other nodes. llvm-svn: 22883
-
Chris Lattner authored
llvm-svn: 22882
-
- Aug 18, 2005
-
-
Chris Lattner authored
llvm-svn: 22877
-
Jim Laskey authored
llvm-svn: 22870
-
Chris Lattner authored
llvm-svn: 22869
-
Chris Lattner authored
llvm-svn: 22866
-
Nate Begeman authored
as the argument to LIS rather than the result of HA16(constant). The DAG->DAG ISel was already doing the right thing. llvm-svn: 22865
-
Nate Begeman authored
Now for int foo() { return -1; } we generate: _foo: li r3, -1 blr instead of _foo: lis r2, -1 ori r3, r2, 65535 blr llvm-svn: 22864
-
Chris Lattner authored
to make the code follow people's expectations better. llvm-svn: 22861
-
Jim Laskey authored
llvm-svn: 22858
-
Nate Begeman authored
llvm-svn: 22857
-
Nate Begeman authored
llvm-svn: 22855
-
Nate Begeman authored
llvm-svn: 22854
-
Nate Begeman authored
llvm-svn: 22851
-
Nate Begeman authored
llvm-svn: 22850
-
Nate Begeman authored
llvm-svn: 22849
-
Jim Laskey authored
llvm-svn: 22848
-
Nate Begeman authored
several of the PowerPC opcodes that come in both negated and non-negated forms. llvm-svn: 22845
-
- Aug 17, 2005
-
-
Chris Lattner authored
llvm-svn: 22837
-
Chris Lattner authored
incomplete, but it is a start. It handles basic argument/retval stuff, immediates, add and sub. llvm-svn: 22836
-
Chris Lattner authored
llvm-svn: 22835
-
Chris Lattner authored
selector. Also, there is no difference between addSImm and addImm, so just use addImm, folding some branches. llvm-svn: 22819
-
Jim Laskey authored
llvm-svn: 22818
-