maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
12,737 Commits 23 Branches 0 Tags 2.2 GiB
Commit Graph

669 Commits

Author SHA1 Message Date
Chris Lattner edda1af35a Make LICM itself a bit more efficient, and make the generated code more efficient too: don't insert a store in every exit block, because a particular block may be exited to more than once by a loop 
llvm-svn: 10369
 2003-12-10 15:56:24 +00:00
Chris Lattner aaaea51090 Implement instruction sinking out of loops. This still can do a little bit 
better job, but this is the majority of the work.  This implements
LICM/sink*.ll

llvm-svn: 10358
 2003-12-10 06:41:05 +00:00
Chris Lattner 6c237bcdf2 Do not insert one entry PHI nodes in split exit blocks! 
llvm-svn: 10348
 2003-12-09 23:12:55 +00:00
Chris Lattner 65c1193d55 Refactor code a little bit, eliminating the gratuitous InstVisitor, which 
should make subsequent changes simpler.  This also allows us to hoist vaarg
and vanext instructions

llvm-svn: 10342
 2003-12-09 19:32:44 +00:00
Chris Lattner c05176843e Fine grainify namespacification 
Code cleanups
Make LICM::SafeToHoist marginally more efficient

llvm-svn: 10341
 2003-12-09 17:18:00 +00:00
Chris Lattner 50663a1a78 Implement: TailCallElim/accum_recursion_constant_arg.ll 
Also make sure to clean up any PHI nodes that are inserted which are pointless.

llvm-svn: 10333
 2003-12-08 23:37:35 +00:00
Chris Lattner 198e620752 Implement: test/Regression/Transforms/TailCallElim/accum_recursion.ll 
We now insert accumulator variables as necessary to eliminate tail recursion
more aggressively.  This is still fairly limited, but allows us to transform
fib/factorial, and other functions into nice happy loops.  :)

llvm-svn: 10332
 2003-12-08 23:19:26 +00:00
Chris Lattner a7b6f3ab9c Cleanup and restructure the code to make it easier to read and maintain. 
The only functionality change is that we now implement:
  Regression/Transforms/TailCallElim/intervening-inst.ll

Which is really kinda pointless, because it means that trivially dead code
does not interfere with -tce, but trivially dead code probably wouldn't be
around anytime when this pass is run anyway.

The point of including this change it to support other more aggressive
transformations when we have the analysis capabilities to do so.

llvm-svn: 10312
 2003-12-08 05:34:54 +00:00
Chris Lattner 8427bffb9a * Finegrainify namespacification 
* Transform: free <ty>* (cast <ty2>* X to <ty>*) into free <ty2>* X

llvm-svn: 10303
 2003-12-07 01:24:23 +00:00
Chris Lattner 40d2aeb28f Finegrainify namespacification 
Fix regressions ScalarRepl/basictest.ll & arraytest.ll

llvm-svn: 10287
 2003-12-02 17:43:55 +00:00
Chris Lattner 52310702a1 Do not use index type to determine what it is indexing into! 
llvm-svn: 10226
 2003-11-25 21:09:18 +00:00
Chris Lattner 4cc2cc5c58 Do not crash when deleing a region with a dead invoke instruction 
llvm-svn: 10161
 2003-11-22 02:13:08 +00:00
Chris Lattner 1ad805977d Finegrainify namespacification 
The module stripping pass should not strip symbols on external globals

llvm-svn: 10157
 2003-11-22 01:29:35 +00:00
Chris Lattner a29600046d Minor cleanups and simplifications 
llvm-svn: 10127
 2003-11-21 16:52:05 +00:00
Chris Lattner 2af517281d Start using the nicer terminator auto-insertion API 
llvm-svn: 10111
 2003-11-20 18:25:24 +00:00
Chris Lattner 841dd53555 Fix PR116 
llvm-svn: 10032
 2003-11-16 21:39:27 +00:00
Chris Lattner d76fe4ea7d Implement feature: InstCombine/2003-11-13-ConstExprCastCall.ll 
llvm-svn: 9981
 2003-11-13 19:17:02 +00:00
Brian Gaeke 960707c335 Put all LLVM code into the llvm namespace, as per bug 109. 
llvm-svn: 9903
 2003-11-11 22:41:34 +00:00
Chris Lattner 4474336166 Adjust to new critical edge interface 
llvm-svn: 9853
 2003-11-10 04:10:50 +00:00
Misha Brukman ad03afcb34 Declare FunctionPasses as such so that they can be used in FunctionPassManager. 
llvm-svn: 9768
 2003-11-07 17:20:18 +00:00
Chris Lattner 7c94d1171a Fix flawed logic that was breaking several SPEC benchmarks, including gzip and crafty. 
llvm-svn: 9731
 2003-11-05 17:31:36 +00:00
Chris Lattner 8f2f598024 Fix bug with previous implementation: 
-      // ~(c-X) == X-(c-1) == X+(-c+1)
+      // ~(c-X) == X-c-1 == X+(-c-1)

Implement: C - ~X == X + (1+C)
llvm-svn: 9715
 2003-11-05 01:06:05 +00:00
Chris Lattner e580666532 Minor cleanup, plus implement InstCombine/xor.ll:test17 
llvm-svn: 9711
 2003-11-04 23:50:51 +00:00
Chris Lattner 0f68fa6569 Implement InstCombine/xor.ll:test(15|16) 
llvm-svn: 9708
 2003-11-04 23:37:10 +00:00
Chris Lattner 6444c37488 Implement InstCombine/cast-set.ll:test6[a]. This improves code generated for 
a hot function in em3d

llvm-svn: 9673
 2003-11-03 05:17:03 +00:00
Chris Lattner 1693079e92 Implement InstCombine/cast-set.ll: test1, test2, test7 
llvm-svn: 9670
 2003-11-03 04:25:02 +00:00
Chris Lattner af7893203b Fix bug with zero sized casts 
llvm-svn: 9667
 2003-11-03 01:29:41 +00:00
Chris Lattner d4d987dd4a Fix bug in previous checkin 
llvm-svn: 9656
 2003-11-02 06:54:48 +00:00
Chris Lattner f4ad165e8b Implement transmogriphication of allocation instructions 
llvm-svn: 9654
 2003-11-02 05:57:39 +00:00
Chris Lattner 686767f3f6 Fix bug: 2003-10-29-CallSiteResolve.ll & PR70 
llvm-svn: 9600
 2003-10-30 00:46:41 +00:00
Chris Lattner bcb0f4bf2e Fix PR66 & ScalarRepl/2003-10-29-ArrayProblem.ll 
llvm-svn: 9585
 2003-10-29 17:55:44 +00:00
John Criswell 4436c49787 Added LLVM copyright notice to Makefiles. 
llvm-svn: 9312
 2003-10-20 22:26:57 +00:00
John Criswell 482202a601 Added LLVM project notice to the top of every C++ source file. 
Header files will be on the way.

llvm-svn: 9298
 2003-10-20 19:43:21 +00:00
Chris Lattner b94550e537 Change the Opcode enum for PHI nodes from "Instruction::PHINode" to "Instruction::PHI" to be more consistent with the other instructions. 
llvm-svn: 9269
 2003-10-19 21:34:28 +00:00
Chris Lattner f0fc9be634 ADd support for the new varargs instructions 
llvm-svn: 9225
 2003-10-18 05:56:52 +00:00
Chris Lattner 50b6858e2e This code does not require random access use_lists 
llvm-svn: 9156
 2003-10-16 16:49:12 +00:00
Chris Lattner f95d9b99b3 Decrease usage of use_size() 
llvm-svn: 9135
 2003-10-15 16:48:29 +00:00
Chris Lattner 178957028b Wrap code at 80 columns 
llvm-svn: 9073
 2003-10-13 05:04:27 +00:00
Chris Lattner c4622a6955 Add support to the loop canonicalization pass to make it transform loops to 
have a SINGLE backedge.  This is useful to, for example, the -indvars pass.

This implements testcase LoopSimplify/single-backedge.ll and closes PR#34

llvm-svn: 9065
 2003-10-13 00:37:13 +00:00
Chris Lattner 72272a70b8 Rename loop preheaders pass to loop simplify 
llvm-svn: 9061
 2003-10-12 21:52:28 +00:00
Chris Lattner 55d4788397 File is renamed to LoopSimplify.cpp 
llvm-svn: 9059
 2003-10-12 21:44:18 +00:00
Chris Lattner 154e4d5dea First step in renaming the preheaders pass to loopsimplify 
llvm-svn: 9058
 2003-10-12 21:43:28 +00:00
Chris Lattner 9703c02ce4 The preheader insertion pass only depends on the CFG. Mark it as such, which 
allows GCCAS to only run it once.

llvm-svn: 9056
 2003-10-12 19:33:10 +00:00
Misha Brukman 8b2bd4ed47 Fix spelling. 
llvm-svn: 9027
 2003-10-10 17:57:28 +00:00
Chris Lattner 35e56e7372 Update comment 
llvm-svn: 8965
 2003-10-08 16:56:11 +00:00
Chris Lattner 0bbbe5d4c8 Use a set to keep track of which edges have been noticed as executable already 
to avoid reprocessing PHI nodes needlessly.  This speeds up the big bad PHI
testcase 43%: from 104.9826 to 73.5157s

llvm-svn: 8964
 2003-10-08 16:55:34 +00:00
Chris Lattner 7324f7cd03 Minor fixes here and there 
llvm-svn: 8963
 2003-10-08 16:21:03 +00:00
Chris Lattner 71ac22ffb5 Avoid building data structures we don't really need. This improves the runtime 
of a test that Bill Wendling sent me from 228.5s to 105s.  Obviously there is
more improvement to be had, but this is a nice speedup which should be "felt"
by many programs.

llvm-svn: 8962
 2003-10-08 15:47:41 +00:00
Chris Lattner 950fc785ae whoops, don't accidentally lose variable names 
llvm-svn: 8955
 2003-10-07 22:58:41 +00:00
Chris Lattner 75b4d1deec Fix bug: InstCombine/cast.ll:test11 / PR#7 
llvm-svn: 8954
 2003-10-07 22:54:13 +00:00
Chris Lattner aec3d948cf Refactor code a bit 
llvm-svn: 8952
 2003-10-07 22:32:43 +00:00
Chris Lattner ed922162e1 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 800aaaf207 Fix bug in previous checkin 
llvm-svn: 8922
 2003-10-07 15:17:02 +00:00
Chris Lattner e8ed4ef039 Minor speedups for the instcombine pass 
llvm-svn: 8894
 2003-10-06 17:11:01 +00:00
Chris Lattner a906bacfdd Change the interface to PromoteMemToReg to also take a DominatorTree 
llvm-svn: 8883
 2003-10-05 21:20:13 +00:00
Chris Lattner a43b8f4b2f 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 5ed281d7d7 simplify-cfg is really a function pass 
llvm-svn: 8868
 2003-10-05 19:14:16 +00:00
Chris Lattner b9cde76e60 Implement InstCombine/add.ll:test17 & 18 
llvm-svn: 8817
 2003-10-02 15:11:26 +00:00
Chris Lattner 295b907cee Fix bug: IndVarsSimplify/2003-09-23-NotAtTop.ll 
llvm-svn: 8689
 2003-09-23 20:26:48 +00:00
Misha Brukman e051f86a3d Credits now go into the top-level CREDITS.TXT 
llvm-svn: 8662
 2003-09-22 21:57:56 +00:00
Chris Lattner 2caaaba3e9 Squelch warning 
llvm-svn: 8659
 2003-09-22 20:33:34 +00:00
Chris Lattner 5dac64f629 Rename Function::getEntryNode -> getEntryBlock 
llvm-svn: 8625
 2003-09-20 14:39:18 +00:00
Chris Lattner b6ac976247 Fix a really obvious huge gaping bug, add a comment 
llvm-svn: 8620
 2003-09-20 05:24:00 +00:00
Chris Lattner 0016085602 Expose the TCE pass 
llvm-svn: 8619
 2003-09-20 05:14:13 +00:00
Chris Lattner 2e9014cb1b New transformation: tail recursion elimination 
llvm-svn: 8618
 2003-09-20 05:03:31 +00:00
Chris Lattner 2da29177ba Implement InstCombine/and.ll:test(15|16) 
llvm-svn: 8607
 2003-09-19 19:05:02 +00:00
Chris Lattner ba1cb38c06 pull a large nested conditional out into its own function 
llvm-svn: 8605
 2003-09-19 17:17:26 +00:00
Chris Lattner dbba189f15 Implement InstCombine/add.ll:test(15|16) 
llvm-svn: 8604
 2003-09-19 15:35:42 +00:00
Chris Lattner 099ec07a95 Make sure to cannonicalize loops before running indvar simplify 
llvm-svn: 8502
 2003-09-12 16:45:01 +00:00
Chris Lattner 7fdde92b1f 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 9a95f2a944 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 cce81be1e1 Simplify code 
Implement InstCombine/mul.ll:test9

llvm-svn: 8488
 2003-09-11 22:24:54 +00:00
Misha Brukman 217ca0bcb9 Apostrophes are only used for possession and quoting. 
llvm-svn: 8473
 2003-09-11 16:58:31 +00:00
Chris Lattner 5d8a12e094 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 bb9d03b9c0 Renamed DominatorTree::Node::getNode() -> getBlock() 
llvm-svn: 8469
 2003-09-11 16:26:13 +00:00
Misha Brukman 9b8d339f6e Spell `definite' correctly. 
llvm-svn: 8467
 2003-09-11 15:32:37 +00:00
Chris Lattner 2158052ac4 Unwind instructions are intrinsically alive, just like returns 
llvm-svn: 8462
 2003-09-10 20:38:14 +00:00
Chris Lattner 216c7b8aed Fix spell-o's 
llvm-svn: 8431
 2003-09-10 05:29:43 +00:00
Chris Lattner 4e621cd861 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 36257f049e Fix up file header 
llvm-svn: 8428
 2003-09-10 05:10:34 +00:00
Misha Brukman 4ace48e0ca Spell `occurrence' correctly. 
llvm-svn: 8425
 2003-09-09 21:54:45 +00:00
Chris Lattner 9c58cf6d03 Add support for the unwind instruction 
llvm-svn: 8408
 2003-09-08 18:54:55 +00:00
Chris Lattner 01a8391236 Do not hoist volatile loads 
llvm-svn: 8399
 2003-09-08 18:17:14 +00:00
Chris Lattner 1c884e18e1 Fix bug: TailDuplicate/2003-08-31-UnreachableBlocks.ll 
llvm-svn: 8276
 2003-08-31 21:17:44 +00:00
Chris Lattner c817458b66 ScalarRepl does not modify the CFG. Say so! 
llvm-svn: 8243
 2003-08-31 00:45:13 +00:00
Chris Lattner 2887328770 Use new interface, simplifies code 
llvm-svn: 8242
 2003-08-31 00:22:27 +00:00
Chris Lattner df741d62de Fix bug: SCCP/2003-08-26-InvokeHandling.ll 
llvm-svn: 8152
 2003-08-27 01:08:35 +00:00
Chris Lattner f1b1c5ec2f Fix bug: LowerSwitch/2003-08-23-EmptySwitch.ll 
llvm-svn: 8087
 2003-08-23 22:54:34 +00:00
Chris Lattner bb4dd7ed34 Fix bug: TailDup/2003-08-23-InvalidatedPointers.ll 
llvm-svn: 8078
 2003-08-23 20:08:30 +00:00
Misha Brukman be372b91e1 The word `dependent' has no `a'. 
llvm-svn: 8030
 2003-08-21 22:14:26 +00:00
Chris Lattner a34c477b05 Fix grammar, add comment 
llvm-svn: 7967
 2003-08-18 22:54:06 +00:00
Misha Brukman 7eb05a170a Spell `necessary' correctly. 
llvm-svn: 7944
 2003-08-18 14:43:39 +00:00
Brian Gaeke 8c14ba96ca Factory methods for function passes now return type FunctionPass *. 
llvm-svn: 7839
 2003-08-14 06:09:32 +00:00
Chris Lattner 3ac7c26a1c 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 b8b97505ba 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 89207943a1 Factory methods for FunctionPasses now return type FunctionPass *. 
llvm-svn: 7823
 2003-08-13 18:18:15 +00:00
Chris Lattner 8ac196dd3b Assign arguments different ranks so they get grouped together 
llvm-svn: 7813
 2003-08-13 16:16:26 +00:00
Chris Lattner d07283a2ad Implement InstCombine/2003-08-12-AllocaNonNull.ll 
llvm-svn: 7807
 2003-08-13 05:38:46 +00:00
Chris Lattner c992add9fe Do not cannonicalize (X != 0) into (cast X to bool) 
llvm-svn: 7806
 2003-08-13 05:33:12 +00:00
Chris Lattner ede3fe05c5 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 deaa0dd71a 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 98b3ecddec Fix bug: Reassociate/2003-08-12-InfiniteLoop.ll 
llvm-svn: 7792
 2003-08-12 21:45:24 +00:00
Chris Lattner 58c7eb60ec 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 01d5639515 Simplify code 
llvm-svn: 7783
 2003-08-12 19:17:27 +00:00
Chris Lattner 812aab7727 Implement testcases InstCombine/or.ll:test16/test17 
llvm-svn: 7782
 2003-08-12 19:11:07 +00:00
Tanya Lattner dc3c9a8545 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 57c03df032 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 8abcd56c74 DEBUG got moved to Support/Debug.h 
llvm-svn: 7492
 2003-08-01 22:15:03 +00:00
Chris Lattner ab780dfab5 Instcombine: (A >> c1) << c2 for signed integers 
llvm-svn: 7295
 2003-07-24 18:38:56 +00:00
Chris Lattner 3204d4ed4e 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 dfae8be3c9 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 bfb1d03159 Add comments 
llvm-svn: 7283
 2003-07-23 21:41:57 +00:00
Chris Lattner 9763859e8d 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 33217db4d9 InstCombine: (X ^ C1) & C2 --> (X & C2) iff (C1&C2) == 0 
llvm-svn: 7272
 2003-07-23 19:36:21 +00:00
Chris Lattner 16464b36ff - 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 8f0d15601a 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 49b47ae565 IC: (X ^ C1) & C2 --> (X & C2) ^ (C1&C2) 
Minor code cleanup

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

llvm-svn: 7257
 2003-07-23 17:02:11 +00:00
Chris Lattner 6077c3195f 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 d78ebd0c6b Fix bug: TailDup/2003-07-22-InfiniteLoop.ll 
llvm-svn: 7243
 2003-07-23 03:32:41 +00:00
Chris Lattner bdb0ce0605 - 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 d6dcbc6ce8 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 0643ceafcf 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 0f1d8a3947 Add support for elimination of load instruction from global constants 
llvm-svn: 6912
 2003-06-26 05:06:25 +00:00
Chris Lattner 35236d8477 Instcombine: X * -1 -> -X 
llvm-svn: 6904
 2003-06-25 17:09:20 +00:00
Chris Lattner b396afde26 Fix bug: Mem2Reg/2003-06-26-IterativePromote.ll 
llvm-svn: 6901
 2003-06-25 14:58:56 +00:00
Chris Lattner ee967711e9 Fix bug: ADCE/2003-06-24-BadSuccessor.ll 
llvm-svn: 6891
 2003-06-24 23:02:45 +00:00
Chris Lattner 834105502d 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 7e270580c8 Fix bug: SCCP/2003-06-24-OverdefinedPHIValue.ll 
llvm-svn: 6883
 2003-06-24 20:29:52 +00:00
Chris Lattner f7544873de Fix bug: TailDup/2003-06-24-Simpleloop.ll 
llvm-svn: 6881
 2003-06-24 19:48:06 +00:00
Chris Lattner 55d4bda861 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 92963de6fa Add paranoia checking 
llvm-svn: 6856
 2003-06-22 20:46:00 +00:00
Chris Lattner 268c1392da Test change 
llvm-svn: 6852
 2003-06-22 20:25:27 +00:00
Chris Lattner a5434caa5c Initial checkin of Tail duplication pass. 
llvm-svn: 6846
 2003-06-22 20:10:28 +00:00
Chris Lattner d0d51605b2 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 970c33abb1 Implement the functionality of InstCombine/call.ll 
llvm-svn: 6783
 2003-06-19 17:00:31 +00:00
Chris Lattner 2a8c301c9f 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 dc62f1e021 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 45789aca97 Fix bug: InstCombine/2003-06-05-BranchInvertInfLoop.ll 
llvm-svn: 6630
 2003-06-05 20:12:51 +00:00
Chris Lattner e967b348bf 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 9eef8a78b4 Implement combination of boolean not with branch 
llvm-svn: 6599
 2003-06-04 04:46:00 +00:00
Chris Lattner 791ac1a4c8 Implement xform: (X != 0) -> (bool)X 
llvm-svn: 6506
 2003-06-01 03:35:25 +00:00
Chris Lattner 0078d9c5bb 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 d847be0539 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 38d88c07f4 Fix bug: ScalarRepl/2003-05-30-MultiLevel.ll 
llvm-svn: 6428
 2003-05-30 05:26:30 +00:00
Chris Lattner 6e5398d69d Fix bug: ScalarRepl/2003-05-29-ArrayFail.ll 
llvm-svn: 6425
 2003-05-30 04:15:41 +00:00
Chris Lattner 6c81ebc97d Add comment 
llvm-svn: 6415
 2003-05-29 20:26:30 +00:00
Chris Lattner 3442844742 Fix bug: Instcombine/2003-05-27-ConstExprCrash.ll 
llvm-svn: 6352
 2003-05-27 16:40:51 +00:00
Chris Lattner c16b210349 * Actually USE the statistic that we made 
* Implement SRoA for arrays

llvm-svn: 6349
 2003-05-27 16:09:27 +00:00
Chris Lattner fb41a50d15 Implementation of the simple "scalar replacement of aggregates" transformation 
llvm-svn: 6346
 2003-05-27 15:45:27 +00:00
Chris Lattner 196897c424 Fix bug: InstCombine/2003-05-26-CastMiscompile.ll 
llvm-svn: 6338
 2003-05-26 23:41:32 +00:00
Chris Lattner 8d0a71aff8 Remove using declarations 
llvm-svn: 6306
 2003-05-22 22:00:07 +00:00
Chris Lattner 471bd76281 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 373086db75 Hopefully, the final fix for `[Pp]ropogate'. 
llvm-svn: 6251
 2003-05-20 21:01:22 +00:00
Misha Brukman e5838c4d72 s/convertable/convertible/g 
llvm-svn: 6248
 2003-05-20 18:45:36 +00:00
Chris Lattner 652e7bf8a8 Fix long standing bug 
llvm-svn: 6232
 2003-05-15 18:25:13 +00:00
Chris Lattner 0895025b30 Fix bug: LoopPreheaders/2003-05-12-PreheaderExitOfChild.ll 
llvm-svn: 6153
 2003-05-12 22:04:34 +00:00
Chris Lattner b02697210e Handle va_arg instruction correctly 
llvm-svn: 6030
 2003-05-08 02:50:13 +00:00
Chris Lattner 3666378690 Fix spelling 
llvm-svn: 5983
 2003-05-02 19:26:34 +00:00
Chris Lattner df7cc91159 Fix Bug: LowerSwitch/2003-05-01-PHIProblem.ll 
llvm-svn: 5979
 2003-05-01 22:21:21 +00:00
Chris Lattner dd65d863a9 Fix another case where constexprs could cause a crash 
llvm-svn: 5972
 2003-04-30 22:34:06 +00:00
Chris Lattner 9244df60d3 Fix constant folding of constexprs 
llvm-svn: 5971
 2003-04-30 22:19:10 +00:00
Chris Lattner b68a34eb3f Fix bug: ADCE/2003-04-25-PHIPostDominateProblem.ll 
llvm-svn: 5952
 2003-04-25 22:53:27 +00:00
Chris Lattner 3c98276168 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 cccc5c76c8 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 889f620841 Remove unnecesary &*'s 
llvm-svn: 5872
 2003-04-23 16:37:45 +00:00
Chris Lattner 1b094a0f2e New pass to lower switch instructions to branch instructions 
llvm-svn: 5865
 2003-04-23 16:23:59 +00:00
Chris Lattner 1f45f4e4d8 Minor cleanups 
llvm-svn: 5863
 2003-04-23 16:18:14 +00:00
Chris Lattner 46b3d30bf6 Change the interface to constant expressions to allow automatic folding 
llvm-svn: 5793
 2003-04-16 22:40:51 +00:00
Chris Lattner 9023155621 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 c42046f9f1 Move BreakCriticalEdges pass to lib/Transforms/Utils 
llvm-svn: 5754
 2003-03-21 21:43:19 +00:00
Chris Lattner 7fb29e19f0 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 934a64cfa4 Implement: -A*-B == A*B 
llvm-svn: 5740
 2003-03-10 23:23:04 +00:00
Chris Lattner 3e327a4334 Add new transformation: // (~A | ~B) == (~(A & B)) 
llvm-svn: 5738
 2003-03-10 23:13:59 +00:00
Chris Lattner bb74e2284a 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 dcf240a649 Generalize (A+c1)+c2 optimization to work with all associative operators 
llvm-svn: 5733
 2003-03-10 21:43:22 +00:00
Chris Lattner 3695257724 Minor change, no functionality diff 
llvm-svn: 5731
 2003-03-10 19:20:30 +00:00
Chris Lattner e8d6c604bb 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 1bbb7b6f19 Implement: (A|B)^B == A & (~B) 
llvm-svn: 5728
 2003-03-10 18:24:17 +00:00
Chris Lattner 235af5673b Implement %test7 in InstCombine/getelementptr.ll 
llvm-svn: 5704
 2003-03-05 22:33:14 +00:00
Chris Lattner 0592bb7654 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 e27406eb59 Change the mem2reg interface to accept a TargetData argument 
llvm-svn: 5685
 2003-03-03 17:25:18 +00:00
Chris Lattner e19a9f8ef7 Fix bug: LICM/2003-02-28-PromoteDifferentType.ll 
llvm-svn: 5675
 2003-02-28 19:21:40 +00:00
Chris Lattner 49eb0e3026 Fix bug I introduced yesterday :( 
llvm-svn: 5669
 2003-02-28 16:54:17 +00:00
Chris Lattner 32a39c26e0 Fix bug: LICM/2003-02-27-PreheaderExitNodeUpdate.ll 
llvm-svn: 5667
 2003-02-28 03:07:54 +00:00
Chris Lattner f2d9f94a33 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 10b2b055e8 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 1ad80e2511 Fix bug: 2003-02-27-StoreSinkPHIs.ll 
llvm-svn: 5658
 2003-02-27 21:59:36 +00:00
Chris Lattner 4e2fbfb4c3 * 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 650096a061 * 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 71b82bb494 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 4869f3700e Rename Instruction::hasSideEffects() -> mayWriteToMemory() 
llvm-svn: 5620
 2003-02-24 20:48:32 +00:00
Chris Lattner 45d67d6ea7 Initial implementation of Loop invariant memory->scalar promotion 
llvm-svn: 5613
 2003-02-24 03:52:32 +00:00
Chris Lattner 26f159046c 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 57c8d99bbd 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 3082c5a070 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 f683599915 Fix typo 
llvm-svn: 5458
 2003-02-01 04:50:59 +00:00
Chris Lattner 6fa1629c47 Fix bug: ADCE/2003-01-22-PredecessorProblem.ll 
llvm-svn: 5405
 2003-01-23 02:12:18 +00:00
Chris Lattner 3aa7767352 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 f96c8befe0 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 688ac5b723 Remove dead code 
llvm-svn: 4952
 2002-12-07 18:42:13 +00:00
Chris Lattner c6509f487b 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 98cf1f5d64 - 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 a2620ac156 Fix warning 
llvm-svn: 4649
 2002-11-09 00:49:43 +00:00
Chris Lattner 0da31d6648 Fix spelling error 
llvm-svn: 4645
 2002-11-08 23:18:37 +00:00
Chris Lattner 5d606a09ff 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 1085bdf49f 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 669c6cf459 Make sure to _delete_ memory allocated by worklists 
llvm-svn: 4523
 2002-11-04 02:54:22 +00:00
Chris Lattner 8fdf75cde5 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 12764c85e8 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 632df28deb Fix spelling of `propagate'. 
llvm-svn: 4423
 2002-10-29 23:06:16 +00:00
Chris Lattner 820d971233 - 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 b7368500dc - Fix bug: cee/2002-10-07-NoImmediateDominator.ll 
llvm-svn: 4081
 2002-10-08 21:53:51 +00:00
Chris Lattner 736709feda - 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 5ac72defc9 Expose isCriticalEdge & SplitCriticalEdge methods from crit-edges pass 
llvm-svn: 4075
 2002-10-08 21:06:27 +00:00
Chris Lattner 394617f38b 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 2e0fb39d87 Fold ashr -1, X into -1 
llvm-svn: 4070
 2002-10-08 16:16:40 +00:00
Chris Lattner bf3a099a62 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 05e86302f4 Fix bug in LICM that caused the previous big win. :( 
llvm-svn: 3980
 2002-09-29 22:26:07 +00:00
Chris Lattner 6443769b34 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 03a9e15a9f Fix major bugs in dominator set & tree information updating 
llvm-svn: 3975
 2002-09-29 21:41:38 +00:00
Chris Lattner d57f3f5073 - 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 f64f2d3fb3 Improve comments, doxygenize more 
llvm-svn: 3950
 2002-09-26 16:52:07 +00:00
Chris Lattner 718b221ff8 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 ca056914c6 Change pass name to something sane 
llvm-svn: 3946
 2002-09-26 16:37:37 +00:00
Chris Lattner d771fdfd75 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 bedbd6bc16 - 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 61992f66d8 Checkin new loop-preheader insertion pass. 
llvm-svn: 3942
 2002-09-26 16:17:31 +00:00
Chris Lattner 3cab9f0396 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 4357e54760 Eliminate extraneous #include 
llvm-svn: 3916
 2002-09-24 21:18:40 +00:00
Chris Lattner 75f80bd0b6 - 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 b4e7e22be3 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 4bec665b09 - 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 b03832d5d0 Add new BreakCriticalEdges pass 
llvm-svn: 3903
 2002-09-24 00:08:39 +00:00
Chris Lattner 555518c70f 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 7ccb217f21 * 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 a8339e3613 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 dba59921d7 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 2e8086f046 Function.h is unnecessary when Module.h is included. 
llvm-svn: 3716
 2002-09-14 03:04:02 +00:00
Chris Lattner 136dab7d86 - 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 cbc532603a Fix the last of the silly bugs I just introduced. :( 
llvm-svn: 3674
 2002-09-10 23:46:10 +00:00
Chris Lattner 55f3d94b40 Add cannonicalization of shl X, 1 -> add X, X 
llvm-svn: 3671
 2002-09-10 23:04:09 +00:00
Chris Lattner a239e6879d Clean up code due to auto-insert constructors 
llvm-svn: 3665
 2002-09-10 22:38:47 +00:00
Chris Lattner 28a8d2468a 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 4184bcc701 * 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 e103d178c5 Hack unneccesary now that shifts of pointers are no longer legal! 
llvm-svn: 3640
 2002-09-10 03:50:54 +00:00
Chris Lattner b8bba6f765 Fix Bug: test/Regression/Transforms/InstCombine/2002-09-08-PointerShiftBug.ll 
llvm-svn: 3626
 2002-09-08 21:39:07 +00:00
Chris Lattner bdb147c373 Minor simplification 
llvm-svn: 3619
 2002-09-08 18:55:04 +00:00
Chris Lattner 1871472e14 Initial checkin of Correlated Expression Elimination Pass 
llvm-svn: 3599
 2002-09-06 18:41:55 +00:00