RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-23 13:02:52 +02:00
Code Issues Projects Releases Wiki Activity
6,425 Commits 4 Branches 5 Tags 704 MiB
0cc143577c
Commit Graph

345 Commits

Author SHA1 Message Date
Chris Lattner
0cc143577c Add support for elimination of load instruction from global constants 
llvm-svn: 6912
 2003-06-26 05:06:25 +00:00
Chris Lattner
ebbc28f553 Instcombine: X * -1 -> -X 
llvm-svn: 6904
 2003-06-25 17:09:20 +00:00
Chris Lattner
0903331006 Fix bug: Mem2Reg/2003-06-26-IterativePromote.ll 
llvm-svn: 6901
 2003-06-25 14:58:56 +00:00
Chris Lattner
2cd94ee470 Fix bug: ADCE/2003-06-24-BadSuccessor.ll 
llvm-svn: 6891
 2003-06-24 23:02:45 +00:00
Chris Lattner
aac87d1e58 Do not mark ALL terminators live if any instruciton in the block is live. We only 
want to mark it live if it is an unconditional branch.  This fixes bug:
ADCE/2002-05-28-Crash.ll and makes this pass _much_ more useful.

llvm-svn: 6887
 2003-06-24 21:49:45 +00:00
Chris Lattner
867b7661cb Fix bug: SCCP/2003-06-24-OverdefinedPHIValue.ll 
llvm-svn: 6883
 2003-06-24 20:29:52 +00:00
Chris Lattner
e1051d9fcf Fix bug: TailDup/2003-06-24-Simpleloop.ll 
llvm-svn: 6881
 2003-06-24 19:48:06 +00:00
Chris Lattner
e1f9e715c6 Implement new transforms: 
Replace (cast (sub A, B) to bool) -> (setne A, B)
  Replace (cast (add A, B) to bool) -> (setne A, -B)

llvm-svn: 6873
 2003-06-23 21:59:52 +00:00
Chris Lattner
a98d464fd6 Add paranoia checking 
llvm-svn: 6856
 2003-06-22 20:46:00 +00:00
Chris Lattner
99633d8cd2 Test change 
llvm-svn: 6852
 2003-06-22 20:25:27 +00:00
Chris Lattner
6d372c7450 Initial checkin of Tail duplication pass. 
llvm-svn: 6846
 2003-06-22 20:10:28 +00:00
Chris Lattner
9a0da3e531 Instcombine cast (getelementptr Ptr, 0, 0, 0) to ... into: cast Ptr to ... 
This fixes type safety problems in a variety of benchmarks that were confusing
DSA.

llvm-svn: 6837
 2003-06-21 23:12:02 +00:00
Chris Lattner
29e8adc038 Implement the functionality of InstCombine/call.ll 
llvm-svn: 6783
 2003-06-19 17:00:31 +00:00
Chris Lattner
2b01ee820e Don't corrupt memory when removing an instruction from the program, but 
not the worklist

llvm-svn: 6733
 2003-06-17 03:57:18 +00:00
Chris Lattner
64ec8f36aa Fix bug: ADCE/2003-06-11-InvalidCFG.ll 
This was because we were deleting large chunks of functions without an exit block, because the post-dominance
information was not useful.  This broke crafty and twolf.

llvm-svn: 6698
 2003-06-16 12:10:45 +00:00
Chris Lattner
1bbfcd901c Fix bug: InstCombine/2003-06-05-BranchInvertInfLoop.ll 
llvm-svn: 6630
 2003-06-05 20:12:51 +00:00
Chris Lattner
95d21756aa Clean up previous code. 
Add new combination to turn seteq X, 0 -> not(cast X to bool)

llvm-svn: 6604
 2003-06-04 05:10:11 +00:00
Chris Lattner
b2ea03d03a Implement combination of boolean not with branch 
llvm-svn: 6599
 2003-06-04 04:46:00 +00:00
Chris Lattner
eaafbfd2df Implement xform: (X != 0) -> (bool)X 
llvm-svn: 6506
 2003-06-01 03:35:25 +00:00
Chris Lattner
1c10a30949 Okay totally give up on trying to optimize aggregates that cannot be completely 
broken up into their elements.  Too many programs break because of this.

llvm-svn: 6440
 2003-05-30 19:22:14 +00:00
Chris Lattner
bf8c1cb6a3 add a check that allows the SRoA pass to avoid breaking programs, even if their 
behavior is technically undefined

llvm-svn: 6438
 2003-05-30 18:09:57 +00:00
Chris Lattner
c9d950434b Fix bug: ScalarRepl/2003-05-30-MultiLevel.ll 
llvm-svn: 6428
 2003-05-30 05:26:30 +00:00
Chris Lattner
0d415b2dd3 Fix bug: ScalarRepl/2003-05-29-ArrayFail.ll 
llvm-svn: 6425
 2003-05-30 04:15:41 +00:00
Chris Lattner
58c7aaa0e5 Add comment 
llvm-svn: 6415
 2003-05-29 20:26:30 +00:00
Chris Lattner
416e30b07b Fix bug: Instcombine/2003-05-27-ConstExprCrash.ll 
llvm-svn: 6352
 2003-05-27 16:40:51 +00:00
Chris Lattner
8a6c3b5cbe * Actually USE the statistic that we made 
* Implement SRoA for arrays

llvm-svn: 6349
 2003-05-27 16:09:27 +00:00
Chris Lattner
5c093a1a93 Implementation of the simple "scalar replacement of aggregates" transformation 
llvm-svn: 6346
 2003-05-27 15:45:27 +00:00
Chris Lattner
1fde83c9b5 Fix bug: InstCombine/2003-05-26-CastMiscompile.ll 
llvm-svn: 6338
 2003-05-26 23:41:32 +00:00
Chris Lattner
e58f6153f4 Remove using declarations 
llvm-svn: 6306
 2003-05-22 22:00:07 +00:00
Chris Lattner
91c5d68261 Minor cleanups. 
This hunk:
-    } else if (Src->getNumOperands() == 2 && Src->use_size() == 1) {
+    } else if (Src->getNumOperands() == 2) {

Allows GEP folding to be more aggressive, which reduces the number of instructions
and can dramatically speed up BasicAA in some cases.

llvm-svn: 6286
 2003-05-22 19:07:21 +00:00
Misha Brukman
825e174bf7 Hopefully, the final fix for `[Pp]ropogate'. 
llvm-svn: 6251
 2003-05-20 21:01:22 +00:00
Misha Brukman
74cf3f5246 s/convertable/convertible/g 
llvm-svn: 6248
 2003-05-20 18:45:36 +00:00
Chris Lattner
d8234cfa3a Fix long standing bug 
llvm-svn: 6232
 2003-05-15 18:25:13 +00:00
Chris Lattner
6cb27840a7 Fix bug: LoopPreheaders/2003-05-12-PreheaderExitOfChild.ll 
llvm-svn: 6153
 2003-05-12 22:04:34 +00:00
Chris Lattner
a7ee27e0fd Handle va_arg instruction correctly 
llvm-svn: 6030
 2003-05-08 02:50:13 +00:00
Chris Lattner
e006ca4580 Fix spelling 
llvm-svn: 5983
 2003-05-02 19:26:34 +00:00
Chris Lattner
f13fe891d1 Fix Bug: LowerSwitch/2003-05-01-PHIProblem.ll 
llvm-svn: 5979
 2003-05-01 22:21:21 +00:00
Chris Lattner
5045ab0fac Fix another case where constexprs could cause a crash 
llvm-svn: 5972
 2003-04-30 22:34:06 +00:00
Chris Lattner
caa766b40f Fix constant folding of constexprs 
llvm-svn: 5971
 2003-04-30 22:19:10 +00:00
Chris Lattner
d2960ee802 Fix bug: ADCE/2003-04-25-PHIPostDominateProblem.ll 
llvm-svn: 5952
 2003-04-25 22:53:27 +00:00
Chris Lattner
c78cd5c758 Fix major problem with PHI node traversal: rechecking PHIs should go into 
the visit function.  The worklist is for when their lattice value changes.

llvm-svn: 5927
 2003-04-25 03:35:10 +00:00
Chris Lattner
7b67a6e77d Minor non-functional changes: 
* Spell propagate right
  * Improve performance of phi node handling
  * Delete using directive
  * Other minor changes

llvm-svn: 5920
 2003-04-25 02:50:03 +00:00
Chris Lattner
db6b7ba364 Remove unnecesary &*'s 
llvm-svn: 5872
 2003-04-23 16:37:45 +00:00
Chris Lattner
a9eaa10358 New pass to lower switch instructions to branch instructions 
llvm-svn: 5865
 2003-04-23 16:23:59 +00:00
Chris Lattner
d609c99c87 Minor cleanups 
llvm-svn: 5863
 2003-04-23 16:18:14 +00:00
Chris Lattner
bb00f755ed Change the interface to constant expressions to allow automatic folding 
llvm-svn: 5793
 2003-04-16 22:40:51 +00:00
Chris Lattner
731913bab3 Initial checkin of PRE on LLVM. This implementation is still lacking in 
several ways:

 * Load expressions are not PRE'd well.  Alias Analysis should be used to
   get accurate information when computing anticipatibility.
 * The expression collection implementation does not handle PHI nodes properly,
   thus the implementation misses many opportunities to PRE.
 * This code could be sped up quite a bit

Despite these flaws, the code seems to work well, and handles PR's as one
would expect.

llvm-svn: 5759
 2003-03-31 19:55:43 +00:00
Chris Lattner
b215db890f Move BreakCriticalEdges pass to lib/Transforms/Utils 
llvm-svn: 5754
 2003-03-21 21:43:19 +00:00
Chris Lattner
c51d7871ee Add the following instcombine xforms: 
- Implement simple reassociation: (A|c1)|(B|c2) == (A|B)|(c1|c2)
  - (A & C1)+(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
  - (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0

llvm-svn: 5743
 2003-03-11 00:12:48 +00:00
Chris Lattner
6eededc41f Implement: -A*-B == A*B 
llvm-svn: 5740
 2003-03-10 23:23:04 +00:00