RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-25 20:23:11 +01:00
Code Issues Projects Releases Wiki Activity
9,415 Commits 4 Branches 5 Tags 704 MiB
d6d41b5e23
Commit Graph

471 Commits

Author SHA1 Message Date
Chris Lattner
16b7ed1eaa whoops, don't accidentally lose variable names 
llvm-svn: 8955
 2003-10-07 22:58:41 +00:00
Chris Lattner
f507e6e58e Fix bug: InstCombine/cast.ll:test11 / PR#7 
llvm-svn: 8954
 2003-10-07 22:54:13 +00:00
Chris Lattner
e8b656a62f Refactor code a bit 
llvm-svn: 8952
 2003-10-07 22:32:43 +00:00
Chris Lattner
a18861ff29 Bill contributed this major rewrite of the -lowerswitch pass to make it generate 
logarithmic conditional branch sequences instead of linear sequences.  Thanks Bill!

llvm-svn: 8928
 2003-10-07 18:46:23 +00:00
Chris Lattner
edb06ce061 Fix bug in previous checkin 
llvm-svn: 8922
 2003-10-07 15:17:02 +00:00
Chris Lattner
e6955c77e0 Minor speedups for the instcombine pass 
llvm-svn: 8894
 2003-10-06 17:11:01 +00:00
Chris Lattner
d1c3f771f8 Change the interface to PromoteMemToReg to also take a DominatorTree 
llvm-svn: 8883
 2003-10-05 21:20:13 +00:00
Chris Lattner
40a236b9ea Initial checkin of the LLVM->LLVM transform to support code generators which 
do not support stack unwinding yet

llvm-svn: 8869
 2003-10-05 19:14:42 +00:00
Chris Lattner
5206a78804 simplify-cfg is really a function pass 
llvm-svn: 8868
 2003-10-05 19:14:16 +00:00
Chris Lattner
059033218b Implement InstCombine/add.ll:test17 & 18 
llvm-svn: 8817
 2003-10-02 15:11:26 +00:00
Chris Lattner
cdf12dfd03 Fix bug: IndVarsSimplify/2003-09-23-NotAtTop.ll 
llvm-svn: 8689
 2003-09-23 20:26:48 +00:00
Misha Brukman
db8303670b Credits now go into the top-level CREDITS.TXT 
llvm-svn: 8662
 2003-09-22 21:57:56 +00:00
Chris Lattner
68f6d33416 Squelch warning 
llvm-svn: 8659
 2003-09-22 20:33:34 +00:00
Chris Lattner
d4de2760aa Rename Function::getEntryNode -> getEntryBlock 
llvm-svn: 8625
 2003-09-20 14:39:18 +00:00
Chris Lattner
7bf15fccb9 Fix a really obvious huge gaping bug, add a comment 
llvm-svn: 8620
 2003-09-20 05:24:00 +00:00
Chris Lattner
bf7dd80e7c Expose the TCE pass 
llvm-svn: 8619
 2003-09-20 05:14:13 +00:00
Chris Lattner
70c9cbd5c6 New transformation: tail recursion elimination 
llvm-svn: 8618
 2003-09-20 05:03:31 +00:00
Chris Lattner
ef92d8eebb Implement InstCombine/and.ll:test(15|16) 
llvm-svn: 8607
 2003-09-19 19:05:02 +00:00
Chris Lattner
b8d0545d27 pull a large nested conditional out into its own function 
llvm-svn: 8605
 2003-09-19 17:17:26 +00:00
Chris Lattner
219dd8b23d Implement InstCombine/add.ll:test(15|16) 
llvm-svn: 8604
 2003-09-19 15:35:42 +00:00
Chris Lattner
3a26b0d3be Make sure to cannonicalize loops before running indvar simplify 
llvm-svn: 8502
 2003-09-12 16:45:01 +00:00
Chris Lattner
f277240919 Do not return success after checking only the FIRST USE of a gep instruction. 
Instead, check all uses.
This fixes bug: ScalarRepl/2003-09-12-IncorrectPromote.ll
This also fixes the miscompilation of Ptrdist/bc

llvm-svn: 8493
 2003-09-12 16:02:12 +00:00
Chris Lattner
b12390cc41 Minor optimization efficiency improvement: 
- Run mem2reg promotion first
  - Only rerun passes if the previous thing changed something

llvm-svn: 8490
 2003-09-12 15:36:03 +00:00
Chris Lattner
9036a399f1 Simplify code 
Implement InstCombine/mul.ll:test9

llvm-svn: 8488
 2003-09-11 22:24:54 +00:00
Misha Brukman
ddbf126a18 Apostrophes are only used for possession and quoting. 
llvm-svn: 8473
 2003-09-11 16:58:31 +00:00
Chris Lattner
8a901c4d27 Integrate functionality of the mem2reg pass directly into this pass to make 
the combination more effective

llvm-svn: 8471
 2003-09-11 16:45:55 +00:00
Chris Lattner
3d39abeeb7 Renamed DominatorTree::Node::getNode() -> getBlock() 
llvm-svn: 8469
 2003-09-11 16:26:13 +00:00
Misha Brukman
d8279c4406 Spell `definite' correctly. 
llvm-svn: 8467
 2003-09-11 15:32:37 +00:00
Chris Lattner
b859bf2fb5 Unwind instructions are intrinsically alive, just like returns 
llvm-svn: 8462
 2003-09-10 20:38:14 +00:00
Chris Lattner
58d4183a25 Fix spell-o's 
llvm-svn: 8431
 2003-09-10 05:29:43 +00:00
Chris Lattner
df4ad7b311 Spelling fixes. I think that "cannonical" is ok, but "canonical" appears to 
be the canonical form for the word

llvm-svn: 8430
 2003-09-10 05:24:46 +00:00
Chris Lattner
501ec018c7 Fix up file header 
llvm-svn: 8428
 2003-09-10 05:10:34 +00:00
Misha Brukman
cac883668e Spell `occurrence' correctly. 
llvm-svn: 8425
 2003-09-09 21:54:45 +00:00
Chris Lattner
4ad8720f91 Add support for the unwind instruction 
llvm-svn: 8408
 2003-09-08 18:54:55 +00:00
Chris Lattner
03b8e81aef Do not hoist volatile loads 
llvm-svn: 8399
 2003-09-08 18:17:14 +00:00
Chris Lattner
c3019e3d22 Fix bug: TailDuplicate/2003-08-31-UnreachableBlocks.ll 
llvm-svn: 8276
 2003-08-31 21:17:44 +00:00
Chris Lattner
09777aa277 ScalarRepl does not modify the CFG. Say so! 
llvm-svn: 8243
 2003-08-31 00:45:13 +00:00
Chris Lattner
663f967b7b Use new interface, simplifies code 
llvm-svn: 8242
 2003-08-31 00:22:27 +00:00
Chris Lattner
491ea39105 Fix bug: SCCP/2003-08-26-InvokeHandling.ll 
llvm-svn: 8152
 2003-08-27 01:08:35 +00:00
Chris Lattner
aa004bbc69 Fix bug: LowerSwitch/2003-08-23-EmptySwitch.ll 
llvm-svn: 8087
 2003-08-23 22:54:34 +00:00
Chris Lattner
4d5a165218 Fix bug: TailDup/2003-08-23-InvalidatedPointers.ll 
llvm-svn: 8078
 2003-08-23 20:08:30 +00:00
Misha Brukman
cda7f97dbb The word dependent' has no a'. 
llvm-svn: 8030
 2003-08-21 22:14:26 +00:00
Chris Lattner
7190bb52f3 Fix grammar, add comment 
llvm-svn: 7967
 2003-08-18 22:54:06 +00:00
Misha Brukman
56f7db4178 Spell `necessary' correctly. 
llvm-svn: 7944
 2003-08-18 14:43:39 +00:00
Brian Gaeke
4651096037 Factory methods for function passes now return type FunctionPass *. 
llvm-svn: 7839
 2003-08-14 06:09:32 +00:00
Chris Lattner
2b7babcc41 Implement instcombine optimizations: 
(A <setcc1> B) logicalop (A <setcc2> B)  -> (A <setcc3> B) or true or false

Where setcc[123] is one of the 6 setcc instructions, and logicalop is one of: And, Or, Xor

llvm-svn: 7828
 2003-08-13 20:16:26 +00:00
Chris Lattner
7ba3220999 Generalize some of the add tests to allow for reassociation to take place 
llvm-svn: 7825
 2003-08-13 19:01:45 +00:00
Brian Gaeke
77c65be59e Factory methods for FunctionPasses now return type FunctionPass *. 
llvm-svn: 7823
 2003-08-13 18:18:15 +00:00
Chris Lattner
4e543f7021 Assign arguments different ranks so they get grouped together 
llvm-svn: 7813
 2003-08-13 16:16:26 +00:00
Chris Lattner
374473c778 Implement InstCombine/2003-08-12-AllocaNonNull.ll 
llvm-svn: 7807
 2003-08-13 05:38:46 +00:00
Chris Lattner
f8fbdb5ded Do not cannonicalize (X != 0) into (cast X to bool) 
llvm-svn: 7806
 2003-08-13 05:33:12 +00:00
Chris Lattner
5c9ccccd96 Change cannonicalization rules: add X,X is represented as multiplies, multiplies 
of a power of two are represented as a shift.

llvm-svn: 7803
 2003-08-13 04:18:28 +00:00
Chris Lattner
3e52e8ce5a Allow pulling logical operations through shifts. 
This implements InstCombine/shift.ll:test14*

llvm-svn: 7793
 2003-08-12 21:53:41 +00:00
Chris Lattner
7105c4aad0 Fix bug: Reassociate/2003-08-12-InfiniteLoop.ll 
llvm-svn: 7792
 2003-08-12 21:45:24 +00:00
Chris Lattner
c8d2398084 Assign finer grained ranks, make sure to reassociate top-level after reassociating bottom level 
llvm-svn: 7787
 2003-08-12 20:14:27 +00:00
Chris Lattner
2e2432d69e Simplify code 
llvm-svn: 7783
 2003-08-12 19:17:27 +00:00
Chris Lattner
c9c1d9f778 Implement testcases InstCombine/or.ll:test16/test17 
llvm-svn: 7782
 2003-08-12 19:11:07 +00:00
Tanya Lattner
6fbe85279f Fixed minor bug in SafeToHoist and made some changes suggested by Chris. 
llvm-svn: 7614
 2003-08-05 20:39:02 +00:00
Tanya Lattner
48745a598c Fixed LICM bug that hoists trapping instructions that are not guaranteed to execute. 
llvm-svn: 7612
 2003-08-05 18:45:46 +00:00
Chris Lattner
686e94e760 DEBUG got moved to Support/Debug.h 
llvm-svn: 7492
 2003-08-01 22:15:03 +00:00
Chris Lattner
c5b0f39c96 Instcombine: (A >> c1) << c2 for signed integers 
llvm-svn: 7295
 2003-07-24 18:38:56 +00:00
Chris Lattner
bf9589bf1f Reorganization of code, no functional changes. 
Now it shoudl be a bit more efficient

llvm-svn: 7292
 2003-07-24 17:52:58 +00:00
Chris Lattner
785e8453f0 Allow folding several instructions into casts, which can simplify a lot 
of codes.  For example,
short kernel (short t1) {
  t1 >>= 8; t1 <<= 8;
  return t1;
}

became:

short %kernel(short %t1.1) {
        %tmp.3 = shr short %t1.1, ubyte 8               ; <short> [#uses=1]
        %tmp.5 = cast short %tmp.3 to int               ; <int> [#uses=1]
        %tmp.7 = shl int %tmp.5, ubyte 8                ; <int> [#uses=1]
        %tmp.8 = cast int %tmp.7 to short               ; <short> [#uses=1]
        ret short %tmp.8
}

before, now it becomes:
short %kernel(short %t1.1) {
        %tmp.3 = shr short %t1.1, ubyte 8               ; <short> [#uses=1]
        %tmp.8 = shl short %tmp.3, ubyte 8              ; <short> [#uses=1]
        ret short %tmp.8
}

which will become:
short %kernel(short %t1.1) {
        %tmp.3 = and short %t1.1, 0xFF00
        ret short %tmp.3
}

This implements cast-set.ll:test4 and test5

llvm-svn: 7290
 2003-07-24 17:35:25 +00:00
Chris Lattner
6d10220481 Add comments 
llvm-svn: 7283
 2003-07-23 21:41:57 +00:00
Chris Lattner
ac8a2be5e4 Remove explicit check for: not (not X) = X, it is already handled because xor is commutative 
- InstCombine: (X & C1) ^ C2 --> (X & C1) | C2 iff (C1&C2) == 0
  - InstCombine: (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2

llvm-svn: 7282
 2003-07-23 21:37:07 +00:00
Chris Lattner
f453a39185 InstCombine: (X ^ C1) & C2 --> (X & C2) iff (C1&C2) == 0 
llvm-svn: 7272
 2003-07-23 19:36:21 +00:00
Chris Lattner
80d9c3a900 - InstCombine: (X | C1) & C2 --> X & C2 iff C1 & C1 == 0 
- InstCombine: (X | C) & C --> C
  - InstCombine: (X | C1) & C2 --> (X | (C1&C2)) & C2

llvm-svn: 7269
 2003-07-23 19:25:52 +00:00
Chris Lattner
76c1da471c IC: (X & C1) | C2 --> (X | C2) & (C1|C2) 
IC: (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)

We are now guaranteed that all 'or's will be inside of 'and's, and all 'and's
will be inside of 'xor's, if the second operands are constants.

llvm-svn: 7264
 2003-07-23 18:29:44 +00:00
Chris Lattner
4b43cd9700 IC: (X ^ C1) & C2 --> (X & C2) ^ (C1&C2) 
Minor code cleanup

llvm-svn: 7262
 2003-07-23 17:57:01 +00:00
Chris Lattner
ae691a3068 InstCombine: (X ^ 4) == 8 --> X == 12 
llvm-svn: 7260
 2003-07-23 17:26:36 +00:00
Chris Lattner
b07de65646 IC: (X & 5) == 13 --> false 
IC: (X | 8) == 4  --> false

llvm-svn: 7257
 2003-07-23 17:02:11 +00:00
Chris Lattner
6ad460b336 Simplify code by using ConstantInt::getRawValue instead of checking to see 
whether the constant is signed or unsigned, then casting

llvm-svn: 7252
 2003-07-23 15:22:26 +00:00
Chris Lattner
74a266d229 Fix bug: TailDup/2003-07-22-InfiniteLoop.ll 
llvm-svn: 7243
 2003-07-23 03:32:41 +00:00
Chris Lattner
7594fa7280 - InstCombine (cast (xor A, B) to bool) ==> (setne A, B) 
- InstCombine (cast (and X, (1 << size(X)-1)) to bool) ==> x < 0

llvm-svn: 7241
 2003-07-22 21:46:59 +00:00
John Criswell
98946bac5b Added code that checks to see if a global variable is external before replacing 
a load of the global variable with the variable's constant value.

llvm-svn: 7216
 2003-07-21 19:42:57 +00:00
John Criswell
dbaf5f719c Dinakar and I fixed a bug where we were trying to get the initializer of 
an external constant.  Since external constants don't have initializers, we
were failing on an assert() call in llvm/GlobalVariable.h.

llvm-svn: 7193
 2003-07-17 19:06:55 +00:00
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