RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-20 19:42:54 +02:00
Code Issues Projects Releases Wiki Activity
59,140 Commits 4 Branches 5 Tags 704 MiB
5d825988d0
Commit Graph

133 Commits

Author SHA1 Message Date
Dan Gohman
37bf232609 Floating-point add, sub, and mul are now spelled fadd, fsub, and fmul, 
respectively.

llvm-svn: 97531
 2010-03-02 01:11:08 +00:00
Dale Johannesen
08f0ab42b8 Add the problem I just hacked around in 96015/96020. 
The solution there produces correct code, but is seriously
deficient in several ways.

llvm-svn: 96039
 2010-02-12 23:16:24 +00:00
Chris Lattner
d9f55b7c3d move PR5945 here. 
llvm-svn: 94350
 2010-01-24 02:27:03 +00:00
Chris Lattner
91fafbd4e8 change the canonical form of "cond ? -1 : 0" to be 
"sext cond" instead of a select.  This simplifies some instcombine
code, matches the policy for zext (cond ? 1 : 0 -> zext), and allows
us to generate better code for a testcase on ppc.

llvm-svn: 94339
 2010-01-24 00:09:49 +00:00
Chris Lattner
744a23610a add a note 
llvm-svn: 94317
 2010-01-23 18:42:37 +00:00
Chris Lattner
320b635dfd constant materialization could be improved. 
llvm-svn: 92921
 2010-01-07 17:53:10 +00:00
Dan Gohman
62c8b40b66 Remove the IA-64 backend. 
llvm-svn: 76920
 2009-07-24 00:30:09 +00:00
Chris Lattner
da2b9a258f clarify: stub emission depends on the version of the linker you use, it has nothing 
to do with the target.  Also, the stub elimination optimization *requires* making the
stub explicit.

llvm-svn: 74682
 2009-07-02 01:24:34 +00:00
Dale Johannesen
edbdfb50e3 Add darwin stub removal to wishlist. 
llvm-svn: 74667
 2009-07-01 23:36:02 +00:00
Dale Johannesen
f56b6d64f9 Move some former testcases (low-probability codegen 
optimizations) into this wishlist.

llvm-svn: 59455
 2008-11-17 18:56:34 +00:00
Nate Begeman
9be47adde4 Implement ISD::TRAP support on PPC 
llvm-svn: 54644
 2008-08-11 17:36:31 +00:00
Chris Lattner
f2a9b32eec add a note 
llvm-svn: 47830
 2008-03-02 19:27:34 +00:00
Chris Lattner
4c67781884 Evan implemented this. 
llvm-svn: 47827
 2008-03-02 17:56:29 +00:00
Nate Begeman
9e8b2ffd52 additional missing feature 
llvm-svn: 46948
 2008-02-11 04:16:09 +00:00
Chris Lattner
dac9c1bcfe If someone wants to implement ppc TRAP, they can go for it :) 
llvm-svn: 46019
 2008-01-15 22:15:02 +00:00
Chris Lattner
cafc567fb7 Finally implement correct ordered comparisons for PPC, even though 
the code generated is not wonderful.  This turns a miscompilation into
a code quality bug (noted in the ppc readme).  This fixes PR642, which
is over 2 years old (!).  Nate, please review this.

llvm-svn: 45742
 2008-01-08 06:46:30 +00:00
Chris Lattner
e16166b78d implement __builtin_return_addr(0) on ppc. 
llvm-svn: 44700
 2007-12-08 06:59:59 +00:00
Chris Lattner
d4602cc0e7 Add some notes about better flag handling. 
llvm-svn: 41808
 2007-09-10 21:43:18 +00:00
Chris Lattner
0c048bb115 new example 
llvm-svn: 41318
 2007-08-23 15:16:03 +00:00
Chris Lattner
cea5e599ed add a note 
llvm-svn: 35530
 2007-03-31 07:06:25 +00:00
Chris Lattner
ee90a087a6 add a note 
llvm-svn: 35334
 2007-03-25 05:10:46 +00:00
Chris Lattner
6d8bbccee0 add a note 
llvm-svn: 35330
 2007-03-25 04:46:28 +00:00
Chris Lattner
31e202922a add a note 
llvm-svn: 34101
 2007-02-09 17:38:01 +00:00
Nate Begeman
e7902cc8ba Remove fixed item 
llvm-svn: 34081
 2007-02-09 04:19:54 +00:00
Chris Lattner
084d1d8706 A relatively simple PPC optimization. 
llvm-svn: 33709
 2007-01-31 19:49:20 +00:00
Nate Begeman
484e7a8b01 Update some of the llvm in the readme 
llvm-svn: 33630
 2007-01-29 21:21:22 +00:00
Chris Lattner
54dac5f09e move contents of PR587 to here. 
llvm-svn: 33333
 2007-01-18 07:34:57 +00:00
Chris Lattner
f50d87eb50 Rewrite the branch selector to be correct in the face of large functions. 
The algorithm it used before wasn't 100% correct, we now use an iterative
expansion model.  This fixes assembler errors when compiling 403.gcc with
tail merging enabled.

Change the way the branch selector works overall: Now, the isel generates
PPC::BCC instructions (as it used to) directly, and these BCC instructions
are emitted to the output or jitted directly if branches don't need
expansion.  Only if branches need expansion are instructions rewritten
and created.  This should make branch select faster, and eliminates the
Bxx instructions from the .td file.

llvm-svn: 31837
 2006-11-18 00:32:03 +00:00
Chris Lattner
15c49af63f add note about ugly codegen with preinc 
llvm-svn: 31617
 2006-11-10 01:33:53 +00:00
Chris Lattner
f64e5f5f3e add a note from viterbi 
llvm-svn: 31506
 2006-11-07 18:30:21 +00:00
Chris Lattner
838d0cbb0a this doesn't occur any more in mason 
llvm-svn: 31236
 2006-10-27 22:02:19 +00:00
Chris Lattner
6fe4efd730 the code in question is now: 
cmpw cr0, r7, r3
        ble cr0, LBB1_5 ;bb25
LBB1_8: ;bb17
        cmpw cr0, r8, r5
        bgt cr0, LBB1_2 ;bb

which is just as good as crnand.

llvm-svn: 31235
 2006-10-27 22:00:55 +00:00
Chris Lattner
b22754853b add note 
llvm-svn: 30937
 2006-10-13 20:20:58 +00:00
Nate Begeman
7bcce1a7f6 Fold AND and ROTL more often 
llvm-svn: 30577
 2006-09-22 05:01:56 +00:00
Chris Lattner
6b434ee662 item done 
llvm-svn: 30518
 2006-09-20 06:41:56 +00:00
Chris Lattner
102718b1b2 This is already done 
llvm-svn: 30512
 2006-09-20 04:59:33 +00:00
Chris Lattner
69390a3f80 Two improvements: 
1. Codegen this comparison:
     if (X == 0x8000)

as:

        cmplwi cr0, r3, 32768
        bne cr0, LBB1_2 ;cond_next

instead of:

        lis r2, 0
        ori r2, r2, 32768
        cmpw cr0, r3, r2
        bne cr0, LBB1_2 ;cond_next


2. Codegen this comparison:
      if (X == 0x12345678)

as:

        xoris r2, r3, 4660
        cmplwi cr0, r2, 22136
        bne cr0, LBB1_2 ;cond_next

instead of:

        lis r2, 4660
        ori r2, r2, 22136
        cmpw cr0, r3, r2
        bne cr0, LBB1_2 ;cond_next

llvm-svn: 30509
 2006-09-20 04:25:47 +00:00
Chris Lattner
ee42b9ae24 Add a note that we should match rlwnm better 
llvm-svn: 30508
 2006-09-20 03:59:25 +00:00
Chris Lattner
ce85ffa396 add a note 
llvm-svn: 30377
 2006-09-14 20:56:30 +00:00
Chris Lattner
9aafd2b441 Add a note 
llvm-svn: 29139
 2006-07-14 04:07:29 +00:00
Chris Lattner
abaaddc214 Implement Regression/CodeGen/PowerPC/bswap-load-store.ll by folding bswaps 
into i16/i32 load/stores.

llvm-svn: 29089
 2006-07-10 20:56:58 +00:00
Chris Lattner
477732bab9 Add a note about a note 
llvm-svn: 28355
 2006-05-17 19:02:25 +00:00
Nate Begeman
db854c6772 Yet more readme updating 
llvm-svn: 28172
 2006-05-08 20:54:02 +00:00
Nate Begeman
1ff4d8f2fe New note about something bad happening in target independent optimizers 
llvm-svn: 28170
 2006-05-08 20:08:28 +00:00
Nate Begeman
b8fa6337df Proving once again that I am not as smart as the compiler 
llvm-svn: 28169
 2006-05-08 19:09:24 +00:00
Nate Begeman
a706539a72 Fold more shifts into inserts, and update the README 
llvm-svn: 28168
 2006-05-08 17:38:32 +00:00
Nate Begeman
591488077e Update some stuff now that the new rlwimi code has gone in 
llvm-svn: 28162
 2006-05-08 02:52:38 +00:00
Chris Lattner
4978a4f2f4 New note, Nate, please check to see if I'm full of it :) 
llvm-svn: 28118
 2006-05-05 05:36:15 +00:00
Chris Lattner
cec07adf4d add a note, move an altivec todo to the altivec list. 
llvm-svn: 27654
 2006-04-13 16:48:00 +00:00
Chris Lattner
fa82c33ae7 add a note 
llvm-svn: 27360
 2006-04-02 07:20:00 +00:00