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

607 Commits

Author SHA1 Message Date
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
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
Chris Lattner
715b592fc4 Add new transformation: // (~A | ~B) == (~(A & B)) 
llvm-svn: 5738
 2003-03-10 23:13:59 +00:00
Chris Lattner
0f5ab645eb Generalize not and neg comparison testers to allow constant to be considered not'able and neg'able. This 
allows optimization of this:
int %test4(int %A, int %B) {
        %a = xor int %A, -1
        %c = and int %a, 5    ; 5 = ~c2
        %d = xor int %c, -1
        ret int %d
}

into this:
int %test4(int %A, int %B) {            ; No predecessors!
        %c.demorgan = or int %A, -6             ; <int> [#uses=1]
        ret int %c.demorgan
}

llvm-svn: 5736
 2003-03-10 23:06:50 +00:00
Chris Lattner
3eca9aaa0a Generalize (A+c1)+c2 optimization to work with all associative operators 
llvm-svn: 5733
 2003-03-10 21:43:22 +00:00
Chris Lattner
9dec4368c0 Minor change, no functionality diff 
llvm-svn: 5731
 2003-03-10 19:20:30 +00:00
Chris Lattner
5fbfe9b9a8 Fix bug: (x << 100) wasn't folded to 0, but (x >> 100) was (when x is unsigned) 
Implement new shift optimizations for shifting the result of a shift.

llvm-svn: 5729
 2003-03-10 19:16:08 +00:00
Chris Lattner
5e6fb8b8d5 Implement: (A|B)^B == A & (~B) 
llvm-svn: 5728
 2003-03-10 18:24:17 +00:00
Chris Lattner
bd009a8938 Implement %test7 in InstCombine/getelementptr.ll 
llvm-svn: 5704
 2003-03-05 22:33:14 +00:00
Chris Lattner
4eaaa99b93 Convert LICM over to use AliasSetTracker. Besides being nicer, this automatically 
allows LICM to use access sizes to help alias analysis be more precise.

llvm-svn: 5693
 2003-03-03 23:32:45 +00:00
Chris Lattner
a49e96dda5 Change the mem2reg interface to accept a TargetData argument 
llvm-svn: 5685
 2003-03-03 17:25:18 +00:00
Chris Lattner
09c35df4e9 Fix bug: LICM/2003-02-28-PromoteDifferentType.ll 
llvm-svn: 5675
 2003-02-28 19:21:40 +00:00
Chris Lattner
dec7727a9f Fix bug I introduced yesterday :( 
llvm-svn: 5669
 2003-02-28 16:54:17 +00:00
Chris Lattner
e2aebf5906 Fix bug: LICM/2003-02-27-PreheaderExitNodeUpdate.ll 
llvm-svn: 5667
 2003-02-28 03:07:54 +00:00
Chris Lattner
d64f135965 Fix bug: 2003-02-27-PreheaderExitNodeUpdate.ll by updating exit node info 
llvm-svn: 5664
 2003-02-27 22:48:57 +00:00
Chris Lattner
74b9aaa89c Add a new assertion to check that stuff is happening right 
Ironically the exit block modification code wasn't updating the exit block
information itself.  Fix this.

llvm-svn: 5659
 2003-02-27 22:31:07 +00:00
Chris Lattner
d40fa5ca2f Fix bug: 2003-02-27-StoreSinkPHIs.ll 
llvm-svn: 5658
 2003-02-27 21:59:36 +00:00
Chris Lattner
e8dda81b22 * Don't forget to update Loop information! 
* Remove bogus assertion: there may be a single outside predecessor and
    still need a new loop-preheader if the predecessor has multiple
    successors.  See bug: LICM/2003-02-27-PreheaderProblem.ll

llvm-svn: 5655
 2003-02-27 21:50:19 +00:00
Chris Lattner
b078b28fa5 * Significant changes to the preheader insertion pass: 
- Now we perform loop exit-block splitting to ensure exit blocks are
     always dominated by the loop header.
   - We now preserve dominance frontier information
   - This fixes bug: LICM/2003-02-26-LoopExitNotDominated.ll

llvm-svn: 5652
 2003-02-27 20:27:08 +00:00
Chris Lattner
92a8816086 Convert to work with new AliasAnalysis interface by conservatively assuming all pointers are arbitrarily large accesses 
llvm-svn: 5636
 2003-02-26 19:28:57 +00:00
Chris Lattner
497c0d443c Rename Instruction::hasSideEffects() -> mayWriteToMemory() 
llvm-svn: 5620
 2003-02-24 20:48:32 +00:00
Chris Lattner
1c1f11bd3f Initial implementation of Loop invariant memory->scalar promotion 
llvm-svn: 5613
 2003-02-24 03:52:32 +00:00
Chris Lattner
2e4c1c8640 Split mem2reg promotion into two parts: a function which does the work, and 
a pass which wraps the function.  This allows other passes to use the functionality

llvm-svn: 5610
 2003-02-22 23:57:48 +00:00
Chris Lattner
c24ffa9297 4 new transformations: 
* X*C + X --> X * (C+1)
  * X + X*C --> X * (C+1)
  * X - X*C --> X * (1-C)
  * X*C - X --> X * (C-1)

llvm-svn: 5592
 2003-02-18 19:57:07 +00:00
Chris Lattner
8306cc5c5c Add a variety of new transformations: 
* A & ~A == 0
  * A / (2^c) == A >> c  if unsigned
  * 0 / A == 0
  * 1.0 * A == A
  * A * (2^c) == A << c
  * A ^ ~A == -1
  * A | ~A == -1
  * 0 % X = 0
  * A % (2^c) == A & (c-1) if unsigned
  * A - (A & B) == A & ~B
  * -1 - A == ~A

llvm-svn: 5587
 2003-02-18 19:28:33 +00:00
Chris Lattner
aceb57a289 Fix typo 
llvm-svn: 5458
 2003-02-01 04:50:59 +00:00
Chris Lattner
7af7b1c82c Fix bug: ADCE/2003-01-22-PredecessorProblem.ll 
llvm-svn: 5405
 2003-01-23 02:12:18 +00:00
Chris Lattner
61d594690a Fix a huge performance problem in reassociate by introducing a 
rank map cache for instruction ranks

llvm-svn: 5030
 2002-12-15 03:56:00 +00:00
Chris Lattner
18fe81719d Minor changes: 
* Reword comment to make more clear
  * Don't print out BB's after modification made
  * Don't delete and new an instruction when we need to move something, just move it.

llvm-svn: 5029
 2002-12-15 03:49:50 +00:00
Chris Lattner
be53e88459 Remove dead code 
llvm-svn: 4952
 2002-12-07 18:42:13 +00:00
Chris Lattner
6c9d57c590 Fix bug: 2002-12-05-MissedConstProp.ll pointed out by Casey Carter 
llvm-svn: 4935
 2002-12-05 22:41:53 +00:00
Chris Lattner
b5027095e5 - Eliminated the deferred symbol table stuff in Module & Function, it really 
wasn't an optimization and it was causing lots of bugs.

llvm-svn: 4779
 2002-11-20 18:36:02 +00:00
Chris Lattner
0141841bc4 Fix warning 
llvm-svn: 4649
 2002-11-09 00:49:43 +00:00
Chris Lattner
f03f32d2e8 Fix spelling error 
llvm-svn: 4645
 2002-11-08 23:18:37 +00:00
Chris Lattner
aaf2fa34a5 Instcombine this away: 
%A = getelementptr [4 x int]* %M, long 0, long 0
        %B = getelementptr int* %A, long 2

llvm-svn: 4536
 2002-11-04 16:43:32 +00:00
Chris Lattner
ecddf3396f Add a transformation to turn: 
malloc Ty, C
int
  malloc [C x Ty], 1

llvm-svn: 4534
 2002-11-04 16:18:53 +00:00
Chris Lattner
b9fa84c1ed Make sure to _delete_ memory allocated by worklists 
llvm-svn: 4523
 2002-11-04 02:54:22 +00:00
Chris Lattner
b913f4e785 Fixes to the reassociate pass to make it respect dominance properties 
Huge thanks go to Casey Carter for writing this fix, reassociate is now
reoperational!

llvm-svn: 4471
 2002-10-31 17:12:59 +00:00
Chris Lattner
1ec9725ef8 BreakCriticalEdges should update dominance frontier information as well as 
other dominance stuff.  Patch contributed by Casey Carter

llvm-svn: 4457
 2002-10-31 02:44:36 +00:00
Misha Brukman
c9c721edf0 Fix spelling of `propagate'. 
llvm-svn: 4423
 2002-10-29 23:06:16 +00:00
Chris Lattner
b565d3ac5b - Rename AnalysisUsage::preservesAll to getPreservesAll & preservesCFG to 
setPreservesCFG to be less confusing.

llvm-svn: 4255
 2002-10-21 20:00:28 +00:00
Chris Lattner
d68e6d1718 - Fix bug: cee/2002-10-07-NoImmediateDominator.ll 
llvm-svn: 4081
 2002-10-08 21:53:51 +00:00
Chris Lattner
40df2d9d4c - Checkin LARGE number of Changes to CEE pass that will make it much more 
powerful, but that are largely disabled.  The basic idea here is that it
    is trying to forward branches across basic blocks that have PHI nodes in
    it, which are crucial to be able to handle cases like whet.ll.
    Unfortunately we are not updating SSA correctly, causing sim.c to die, and I
    don't have time to fix the regression now, so I must disable the
    functionality.

llvm-svn: 4077
 2002-10-08 21:34:15 +00:00
Chris Lattner
3cf20c3f14 Expose isCriticalEdge & SplitCriticalEdge methods from crit-edges pass 
llvm-svn: 4075
 2002-10-08 21:06:27 +00:00
Chris Lattner
b32252aa71 It is illegal for PHI nodes to have zero values, delete the code to handle them 
llvm-svn: 4071
 2002-10-08 17:07:39 +00:00
Chris Lattner
55c7ae3cdc Fold ashr -1, X into -1 
llvm-svn: 4070
 2002-10-08 16:16:40 +00:00
Chris Lattner
7cf9f6f4b1 Updates to work with recent Statistic's changes: 
* Renamed StatisticReporter.h/cpp to Statistic.h/cpp
    * Broke constructor to take two const char * arguments instead of one, so
      that indendation can be taken care of automatically.
    * Sort the list by pass name when printing
    * Make sure to print all statistics as a group, instead of randomly when
      the statistics dtors are called.
    * Updated ProgrammersManual with new semantics.

llvm-svn: 4002
 2002-10-01 22:38:41 +00:00
Chris Lattner
61e8de1c61 Fix bug in LICM that caused the previous big win. :( 
llvm-svn: 3980
 2002-09-29 22:26:07 +00:00
Chris Lattner
ef0e95bb42 Hoist the contents of Loops in depth first order in the dominator tree, 
rather than in random order.  This causes LICM to be DRAMATICALLY more
effective. For example, on bzip2.c, it is able to hoist 302 loads and
2380 total instructions, as opposed to 44/338 before.  This  obviously
makes other transformations much more powerful as well!

llvm-svn: 3978
 2002-09-29 21:46:09 +00:00
Chris Lattner
b731880895 Fix major bugs in dominator set & tree information updating 
llvm-svn: 3975
 2002-09-29 21:41:38 +00:00
Chris Lattner
0bbb8f6e06 - Further cleanups of LICM pass, remove extra work from previous implementation 
- Do not clone instructions then insert clone outside of loop.  Just move them.

llvm-svn: 3951
 2002-09-26 19:40:25 +00:00
Chris Lattner
0c66734ac5 Improve comments, doxygenize more 
llvm-svn: 3950
 2002-09-26 16:52:07 +00:00
Chris Lattner
21eb78d59d Clean up LICM significantly now that it is guaranteed to have loop preheaders 
llvm-svn: 3947
 2002-09-26 16:38:03 +00:00
Chris Lattner
9cdbd428b0 Change pass name to something sane 
llvm-svn: 3946
 2002-09-26 16:37:37 +00:00
Chris Lattner
fe9fba6f5b Loop invariant code motion now depends on the LoopPreheader pass. Dead code 
has not yet been removed.

llvm-svn: 3945
 2002-09-26 16:19:31 +00:00
Chris Lattner
f9676d651d - Cleanup break-crit-edges pass by making SplitCriticalEdge a member method. 
- break-crit-edges pass does not invalidate loop-preheader pass.

llvm-svn: 3944
 2002-09-26 16:18:51 +00:00
Chris Lattner
e5996b4c88 Checkin new loop-preheader insertion pass. 
llvm-svn: 3942
 2002-09-26 16:17:31 +00:00
Chris Lattner
7ab2bba3d3 Change LowerAllocations pass to 'require' TargetData instead of it being 
passed in.

llvm-svn: 3929
 2002-09-25 23:47:47 +00:00
Chris Lattner
7fafece8e0 Eliminate extraneous #include 
llvm-svn: 3916
 2002-09-24 21:18:40 +00:00
Chris Lattner
25ba5ac7ce - Do not expose Critical Edge breaking mechanics outside the BCE pass, thus 
removing it from Transforms/Local.h and from Transforms/Utils/*

llvm-svn: 3910
 2002-09-24 15:51:56 +00:00
Chris Lattner
1014aae962 Correlated Exprs pass now requires BCE pass instead of doing it manually 
llvm-svn: 3908
 2002-09-24 15:43:56 +00:00
Chris Lattner
49588769e0 - Expose passinfo from BreakCriticalEdges pass so that it may be "Required" 
by other passes.  Make BCE pass be in anonymous namespace now.

llvm-svn: 3907
 2002-09-24 15:43:12 +00:00
Chris Lattner
e62cdff96c Add new BreakCriticalEdges pass 
llvm-svn: 3903
 2002-09-24 00:08:39 +00:00
Chris Lattner
b6c408778a Optimize away cases like: 
%cast109 = cast uint %cast212 to short          ; <short> [#uses=1]
        %cast214 = cast short %cast109 to uint          ; <uint> [#uses=1]
        %cast215 = cast uint %cast214 to short          ; <short> [#uses=1]

llvm-svn: 3897
 2002-09-23 23:39:43 +00:00
Chris Lattner
2a53929c5d * Fix bug: CorrelatedExprs/2002-09-23-PHIUpdateBug.ll 
* Make sure "Changed" is updated correctly

llvm-svn: 3891
 2002-09-23 20:06:22 +00:00
Chris Lattner
5ccb21f41d Fix bug: test/Regression/Transforms/InstCombine/2002-09-17-GetElementPtrCrash.ll 
Thanks to Casey for finding it!

llvm-svn: 3783
 2002-09-17 21:05:42 +00:00
Vikram S. Adve
4bcec53ed7 Extract most of the transformation into an externally accessible 
function -- DecomposeArrayRef(GetElementPtrInst* GEP) -- that can
be invoked on a single instruction at a time.

llvm-svn: 3755
 2002-09-16 16:40:07 +00:00
Misha Brukman
2e598f0092 Function.h is unnecessary when Module.h is included. 
llvm-svn: 3716
 2002-09-14 03:04:02 +00:00
Chris Lattner
fb017cb38c - Change getelementptr instruction to use long indexes instead of uint 
indexes for sequential types.

llvm-svn: 3682
 2002-09-11 01:21:33 +00:00
Chris Lattner
5f4b79edaf Fix the last of the silly bugs I just introduced. :( 
llvm-svn: 3674
 2002-09-10 23:46:10 +00:00
Chris Lattner
5143d4a3b3 Add cannonicalization of shl X, 1 -> add X, X 
llvm-svn: 3671
 2002-09-10 23:04:09 +00:00
Chris Lattner
37c3a1d80c Clean up code due to auto-insert constructors 
llvm-svn: 3665
 2002-09-10 22:38:47 +00:00
Chris Lattner
da9702a8a1 Simplify code (somtimes dramatically), by using the new "auto-insert" feature 
of instruction constructors.

llvm-svn: 3656
 2002-09-10 17:04:02 +00:00
Chris Lattner
7787814c22 * Clean up code a little bit 
* Fix bug: test/Regression/Transforms/IndVarsSimplify/2002-09-09-PointerIndVar.ll

llvm-svn: 3644
 2002-09-10 05:24:05 +00:00
Chris Lattner
4f5abce7f6 Hack unneccesary now that shifts of pointers are no longer legal! 
llvm-svn: 3640
 2002-09-10 03:50:54 +00:00
Chris Lattner
c1de581f8e Fix Bug: test/Regression/Transforms/InstCombine/2002-09-08-PointerShiftBug.ll 
llvm-svn: 3626
 2002-09-08 21:39:07 +00:00
Chris Lattner
c30029172a Minor simplification 
llvm-svn: 3619
 2002-09-08 18:55:04 +00:00
Chris Lattner
bd03f18e04 Initial checkin of Correlated Expression Elimination Pass 
llvm-svn: 3599
 2002-09-06 18:41:55 +00:00
Chris Lattner
3ce5b343c5 - Renamed Type::isIntegral() to Type::isInteger() 
- Added new method Type::isIntegral() that is the same as isInteger, but
    also accepts bool.

llvm-svn: 3574
 2002-09-03 01:08:28 +00:00
Chris Lattner
cd49f0ec5d Add constant prop & DIE to InstCombine, so it cleans up after itself 
llvm-svn: 3568
 2002-09-02 04:59:56 +00:00
Chris Lattner
bb8f1a072b - Implement SCCP of getelementptr instructions 
- Implement SCCP of globals into ConstantExprs hopefully opening new
   opportunities for more SCCP.

llvm-svn: 3555
 2002-08-30 23:39:00 +00:00
Chris Lattner
a146c9e769 Really minor cleanups 
llvm-svn: 3549
 2002-08-30 22:53:30 +00:00
Chris Lattner
b0cbcfd5e4 - GCSE now no longer counts instructions not removed (due to no common 
dominator as being removed)
  - GCSE now uses new Value #'ing interface, instead of dealing with AA itself
  - GCSE worklist implementation much simpler, class cleaned up.

llvm-svn: 3533
 2002-08-30 20:22:29 +00:00
Chris Lattner
66b1127636 - instcombine demorgan's law: and (not A), (not B) == not (or A, B) 
llvm-svn: 3495
 2002-08-23 18:32:43 +00:00
Chris Lattner
20b85d96e4 Eliminated the MemAccessInst class, folding contents into GEP class. 
llvm-svn: 3487
 2002-08-22 23:37:20 +00:00
Chris Lattner
969c616d51 Load & StoreInst no longer derive from MemAccessInst, so we don't have 
to handle indexing anymore

llvm-svn: 3485
 2002-08-22 22:49:05 +00:00
Chris Lattner
8b8d72c1f2 Add capability of using pointer analysis to LICM 
llvm-svn: 3478
 2002-08-22 21:39:55 +00:00
Chris Lattner
5addf774a3 Remove long obsolete comments 
llvm-svn: 3476
 2002-08-22 21:25:54 +00:00
Chris Lattner
18826b07fe Instcombine PHI's of the form %PN = phi PN, X into X and 
%PN = phi PN, PN, PN into 0 (because the phi must not be reachable)

llvm-svn: 3470
 2002-08-22 20:22:01 +00:00
Chris Lattner
5b94b874d6 Convert GCSE pass to use new alias analysis infrastructure 
llvm-svn: 3463
 2002-08-22 18:24:48 +00:00
Chris Lattner
c4bd846e84 - Split Dominators.h into Dominators.h & PostDominators.h 
llvm-svn: 3432
 2002-08-21 23:43:50 +00:00
Chris Lattner
a154f5fa97 Remove an optimization that isn't. 
llvm-svn: 3419
 2002-08-21 22:10:06 +00:00
Chris Lattner
ad92b604b5 - instcombine (~(a < b)) into (a >= b) 
llvm-svn: 3406
 2002-08-20 18:24:26 +00:00
Chris Lattner
22116975ce - implemented instcombine of phi (X, X, X) -> X 
llvm-svn: 3397
 2002-08-20 15:35:35 +00:00
Chris Lattner
04d2780d12 Promote getelementptr instructions to constexprs if we can. 
llvm-svn: 3368
 2002-08-17 22:21:59 +00:00
Chris Lattner
caaca8d4c9 Handle more cases of cast-of-cast in more general forms. 
llvm-svn: 3347
 2002-08-15 16:15:25 +00:00
Chris Lattner
83f92a7237 Implement capability to fold this: 
uint %test4(int %A, int %B) {
        %COND = setlt int %A, %B                ; <bool> [#uses=1]
        %result = cast bool %COND to uint               ; <uint> [#uses=1]
        ret uint %result
}
into a single cast instruction.

llvm-svn: 3339
 2002-08-14 23:21:10 +00:00
Chris Lattner
80b897953e Avoid inserting an entry block unless we need it 
llvm-svn: 3336
 2002-08-14 21:35:02 +00:00
Chris Lattner
760f32d641 Fix bug introduced in last checkin due to CastInst not being visible 
llvm-svn: 3327
 2002-08-14 18:22:19 +00:00
Chris Lattner
980bf4b44d Remove support for NOT instruction 
llvm-svn: 3323
 2002-08-14 18:18:02 +00:00
Chris Lattner
34a9a81756 Remove extra #includes 
llvm-svn: 3322
 2002-08-14 18:17:32 +00:00
Chris Lattner
c264beb7c5 Remove support for unary operators 
llvm-svn: 3318
 2002-08-14 17:53:45 +00:00
Chris Lattner
890adeb7a2 - Fix InstCombine pass to not generate or process NOT instructions 
- Fixed testcases to not use them either.

llvm-svn: 3315
 2002-08-14 17:51:49 +00:00
Chris Lattner
b6a04772b5 - Rename ConstantGenericIntegral -> ConstantIntegral 
llvm-svn: 3300
 2002-08-13 17:50:24 +00:00
Chris Lattner
a6ba1b74ac * Factor a bunch of code by using ReplaceInstUsesWith 
* Move isMaxValue, isMinValue, isAllOnesValue to Constants.h

llvm-svn: 3290
 2002-08-12 21:17:25 +00:00
Chris Lattner
0a51808266 New functionality for instcombine: 
* New ReplaceInstUsesWith function to factor out tons of common code
     This needs to be used more in the future still, but it's a good start
   * New InsertNewInstBefore to allow multi-instruction replacements
   * Change getMaxValue functions to isAllOnesValue function, which doesn't
     have to CREATE/lookup a new constant.  Also the name is accurate
   * Add new isMaxValue, isMinValue, isMaxValueMinusOne, isMinValuePlusOne
     functions:  This should be moved to Constant* classes eventually
   * Implement xor X, ALLONES -> not X
   * Fold ALL setcc's of booleans away
   * Handle various SetCC's for integers against values at the end of their
     ranges, possibly off by one.  This implements the setcc-strength-reduce.ll
     testcase.

llvm-svn: 3286
 2002-08-09 23:47:40 +00:00
Chris Lattner
a21e315db4 - Cleaned up the interface to AnalysisUsage to take analysis class names 
instead of ::ID's.
 - Pass::getAnalysis<> now no longer takes an optional argument

llvm-svn: 3265
 2002-08-08 19:01:30 +00:00
Chris Lattner
62fb7f0304 Remove extraneous #includes 
llvm-svn: 3262
 2002-08-08 19:00:34 +00:00
Vikram S. Adve
bbe47f2e7d Eliminate cast instructions: use only GEPs in decomposed sequence. 
Don't decompose if there are 2 indices with 0 as first index.
Compute Changed flag correctly in runOnBasicBlock().

llvm-svn: 3233
 2002-08-03 13:21:15 +00:00
Chris Lattner
c840f0ec2a Fix bug: test/Regression/Transforms/InstCombine/2002-08-02-CastTest.ll 
Implement feature: Cast's can now be converted to bitwise AND expressions.

llvm-svn: 3225
 2002-08-02 20:00:25 +00:00
Chris Lattner
5d9be21256 * Cleanups of instcombine 
- Reenable gep (gep x) -> x
   - Make instcombine do dead instruction elimination where it's really
     easy.  Now visitors don't have to ensure they aren't not processing
     dead instructions.

llvm-svn: 3222
 2002-08-02 19:29:35 +00:00
Chris Lattner
b55222222e Fix bug: test/Regression/Transforms/GCSE/2002-05-21-NoSharedDominator.ll 
llvm-svn: 3215
 2002-08-02 18:06:01 +00:00
Chris Lattner
b9052f081a * Fix bug: test/Regression/Transforms/ADCE/2002-07-17-AssertionFailure.ll 
which was caused by us not running the "drop references of dead
  instructions" code when there were no basic blocks that were dead.

  We still don't want to do some of the stuff we do if there are dead
  basic blocks, but we DO want to drop references of dead instructions,
  so we factor the common code out to a new method.

llvm-svn: 3137
 2002-07-30 00:22:34 +00:00
Chris Lattner
72b8a38a26 Add code to ensure that no PHI nodes are left laying around with their 
arguments dropped.  This fixes bug:
   test/Regression/Transforms/ADCE/2002-07-17-PHIAssertion.ll

llvm-svn: 3134
 2002-07-29 23:40:46 +00:00
Chris Lattner
5aef91b716 Fix bug: test/Regression/Transforms/ADCE/2002-07-29-Segfault.ll 
llvm-svn: 3129
 2002-07-29 22:31:39 +00:00
Chris Lattner
ec2780457d * Standardize how analysis results/passes as printed with the print() virtual 
methods
* Eliminate AnalysisID:  Now it is just a typedef for const PassInfo*
* Simplify how AnalysisID's are initialized
* Eliminate Analysis/Writer.cpp/.h: incorporate printing functionality into
  the analyses themselves.

llvm-svn: 3116
 2002-07-27 01:12:17 +00:00
Chris Lattner
7a9eb848cd * Add support for different "PassType's" 
* Add new RegisterOpt/RegisterAnalysis templates for registering passes that
  are to show up in opt or analyze
* Register Analyses now
* Change optimizations to use RegisterOpt instead of RegisterPass
* Add support for different "PassType's"
* Add new RegisterOpt/RegisterAnalysis templates for registering passes that
  are to show up in opt or analyze
* Register Analyses now
* Change optimizations to use RegisterOpt instead of RegisterPass
* Remove getPassName implementations from various subclasses

llvm-svn: 3113
 2002-07-26 21:12:46 +00:00
Chris Lattner
ec1a192b16 *** empty log message *** 
llvm-svn: 3105
 2002-07-26 18:40:14 +00:00
Chris Lattner
05fe67c0d2 *** empty log message *** 
llvm-svn: 3075
 2002-07-25 06:17:51 +00:00
Chris Lattner
921e366a5c Merge ChangeAllocations into scalar.h 
llvm-svn: 3038
 2002-07-23 22:04:17 +00:00
Chris Lattner
c482880f9e *** empty log message *** 
llvm-svn: 3016
 2002-07-23 18:06:35 +00:00
Chris Lattner
606421d005 * Remove getPassName implementation 
* Register all Passes

llvm-svn: 3015
 2002-07-23 18:06:30 +00:00
Chris Lattner
24bcbdd155 *** empty log message *** 
llvm-svn: 3002
 2002-07-23 17:52:38 +00:00
Chris Lattner
83577a047e Disable folding g-e-p instructions into loads and stores. 
llvm-svn: 2870
 2002-07-10 22:37:17 +00:00
Chris Lattner
a590093513 *** empty log message *** 
llvm-svn: 2813
 2002-06-30 16:25:25 +00:00
Anand Shukla
85065832f1 changes to make it compatible with 64bit gcc 
llvm-svn: 2792
 2002-06-25 21:07:58 +00:00
Chris Lattner
dfd421a7df MEGAPATCH checkin. 
For details, See: docs/2002-06-25-MegaPatchInfo.txt

llvm-svn: 2779
 2002-06-25 16:13:24 +00:00
Chris Lattner
779f966ce5 Avoid deleting individual instructions until AFTER dead blocks have dropped 
their references.  This fixes bug:
    test/Regression/Transforms/ADCE/2002-05-28-Crash*.ll

llvm-svn: 2753
 2002-05-28 21:38:16 +00:00
Chris Lattner
b95dde758a Simplify the interface to local DCE and Constant prop 
llvm-svn: 2749
 2002-05-26 20:18:18 +00:00
Chris Lattner
9dde5c9df7 Fold add X, 0 for floating point types as well 
llvm-svn: 2734
 2002-05-23 17:11:38 +00:00
Chris Lattner
1f66858791 Fix and implement ADCE to finally work! 
llvm-svn: 2720
 2002-05-22 21:32:16 +00:00
Chris Lattner
1f2723a2c9 Use the new DEBUG(x) macro to allow debugging code to be enabled on the commandline 
llvm-svn: 2713
 2002-05-22 17:17:27 +00:00
Chris Lattner
245c8615e4 Fix bug: test/Regression/Transforms/SCCP/2002-05-21-InvalidSimplify.ll 
Improperly handling edges... by not marking them alive properly

llvm-svn: 2707
 2002-05-22 16:07:20 +00:00
Chris Lattner
bb7416fa7f New CFG Simplification pass: removed from the old DCE pass 
llvm-svn: 2700
 2002-05-21 20:49:37 +00:00
Chris Lattner
c3d944c4f7 Fix bug: test/Regression/Transforms/SCCP/2002-05-20-MissedIncomingValue.ll 
That was causing a miscompilation of strtol/atoi plus others

llvm-svn: 2669
 2002-05-20 20:48:03 +00:00
Chris Lattner
a524df6d1d * Make debug output conditional on #define 
* Add optimization to rank computation to not recursively search when
  unneccesary.
* More agressively negate expressions to open reassociation opportunities.
* Linearize (A+B)+(C+D) into ((A+B)+C)+D

llvm-svn: 2637
 2002-05-16 04:37:07 +00:00
Chris Lattner
fc21b26332 * Fix bug: test/Regression/Transforms/GCSE/2002-05-14-OperandSwap.ll 
By making sure to consider binary expressions identical if their operands
are backwards, but swappable.

llvm-svn: 2629
 2002-05-14 19:57:25 +00:00
Chris Lattner
8106c7a841 Fix bug: test/Regression/Transforms/InstCombine/2002-05-14-SubFailure.ll 
llvm-svn: 2627
 2002-05-14 16:44:07 +00:00
Chris Lattner
0ee0c26f4e Fix bug: test/Regression/Transforms/InstCombine/2002-05-14-TouchDeletedInst.ll 
"This testcase caused instcombine to fail because it got the same instruction on
it's worklist more than once (which is ok), but then deleted the instruction.
Since the inst stayed on the worklist, as soon as it came back up to be
processed, bad things happened, and opt asserted."

llvm-svn: 2623
 2002-05-14 15:24:07 +00:00
Chris Lattner
b7688286c1 Implement elimination of loads 
llvm-svn: 2620
 2002-05-14 05:02:40 +00:00