summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Transforms/Scalar
Commit message (Collapse)AuthorAgeFilesLines
* Adjust to changes in instruction interfaces.Chris Lattner2005-01-293-10/+11
| | | | llvm-svn: 19900
* * add some DEBUG statementsChris Lattner2005-01-281-3/+10
| | | | | | | | | | | | | | | | * Properly compile this: struct a {}; int test() { struct a b[2]; if (&b[0] != &b[1]) abort (); return 0; } to 'return 0', not abort(). llvm-svn: 19875
* Get rid of a several dozen more and instructions in specint.Chris Lattner2005-01-231-5/+36
| | | | llvm-svn: 19786
* Handle comparisons of gep instructions that have different typed indicesChris Lattner2005-01-211-5/+9
| | | | | | as long as they are the same size. llvm-svn: 19734
* Add two optimizations. The first folds (X+Y)-X -> YChris Lattner2005-01-191-2/+89
| | | | | | | | | | | | | | | | | The second folds operations into selects, e.g. (select C, (X+Y), (Y+Z)) -> (Y+(select C, X, Z) This occurs a few times across spec, e.g. select add/sub mesa: 83 0 povray: 5 2 gcc 4 2 parser 0 22 perlbmk 13 30 twolf 0 3 llvm-svn: 19706
* Delete PHI nodes that are not dead but are locked in a cycle of singleChris Lattner2005-01-171-0/+26
| | | | | | useness. llvm-svn: 19629
* Move code out of indentation one level to make it easier to read.Chris Lattner2005-01-171-60/+64
| | | | | | | | | | | | | Disable the xform for < > cases. It turns out that the following is being miscompiled: bool %test(sbyte %S) { %T = cast sbyte %S to uint %V = setgt uint %T, 255 ret bool %V } llvm-svn: 19628
* Fix some bugs in an xform added yesterday. This fixes Prolangs-C/allroots.Chris Lattner2005-01-141-2/+2
| | | | llvm-svn: 19553
* Fix a compile crash on spiffChris Lattner2005-01-141-7/+4
| | | | llvm-svn: 19552
* if two gep comparisons only differ by one index, compare that index directly.Chris Lattner2005-01-141-0/+28
| | | | | | This allows us to better optimize begin() -> end() comparisons in common cases. llvm-svn: 19542
* Do not overrun iterators. This fixes a 176.gcc crashChris Lattner2005-01-131-2/+1
| | | | llvm-svn: 19541
* Turn select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y))). This occurs inChris Lattner2005-01-131-0/+53
| | | | | | | | | | | | | | | | | | | | | | | | | | | the 'sim' program and probably elsewhere. In sim, it comes up for cases like this: #define round(x) ((x)>0.0 ? (x)+0.5 : (x)-0.5) double G; void T(double X) { G = round(X); } (it uses the round macro a lot). This changes the LLVM code from: %tmp.1 = setgt double %X, 0.000000e+00 ; <bool> [#uses=1] %tmp.4 = add double %X, 5.000000e-01 ; <double> [#uses=1] %tmp.6 = sub double %X, 5.000000e-01 ; <double> [#uses=1] %mem_tmp.0 = select bool %tmp.1, double %tmp.4, double %tmp.6 store double %mem_tmp.0, double* %G to: %tmp.1 = setgt double %X, 0.000000e+00 ; <bool> [#uses=1] %mem_tmp.0.p = select bool %tmp.1, double 5.000000e-01, double -5.000000e-01 %mem_tmp.0 = add double %mem_tmp.0.p, %X store double %mem_tmp.0, double* %G ret void llvm-svn: 19537
* Implement an optimization for == and != comparisons like this:Chris Lattner2005-01-131-1/+63
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | _Bool test2(int X, int Y) { return &arr[X][Y] == arr; } instead of generating this: bool %test2(int %X, int %Y) { %tmp.3.idx = mul int %X, 160 ; <int> [#uses=1] %tmp.3.idx1 = shl int %Y, ubyte 2 ; <int> [#uses=1] %tmp.3.offs2 = sub int 0, %tmp.3.idx ; <int> [#uses=1] %tmp.7 = seteq int %tmp.3.idx1, %tmp.3.offs2 ; <bool> [#uses=1] ret bool %tmp.7 } generate this: bool %test2(int %X, int %Y) { seteq int %X, 0 ; <bool>:0 [#uses=1] seteq int %Y, 0 ; <bool>:1 [#uses=1] %tmp.7 = and bool %0, %1 ; <bool> [#uses=1] ret bool %tmp.7 } This idiom occurs in C++ programs when iterating from begin() to end(), in a vector or array. For example, we now compile this: void test(int X, int Y) { for (int *i = arr; i != arr+100; ++i) foo(*i); } to this: no_exit: ; preds = %entry, %no_exit ... %exitcond = seteq uint %indvar.next, 100 ; <bool> [#uses=1] br bool %exitcond, label %return, label %no_exit instead of this: no_exit: ; preds = %entry, %no_exit ... %inc5 = getelementptr [100 x [40 x int]]* %arr, int 0, int 0, int %inc.rec ; <int*> [#uses=1] %tmp.8 = seteq int* %inc5, getelementptr ([100 x [40 x int]]* %arr, int 0, int 100, int 0) ; <bool> [#uses=1] %indvar.next = add uint %indvar, 1 ; <uint> [#uses=1] br bool %tmp.8, label %return, label %no_exit llvm-svn: 19536
* Fix some bugs in code I didn't mean to check in.Chris Lattner2005-01-131-5/+12
| | | | llvm-svn: 19534
* Fix a crash compiling 129.compressChris Lattner2005-01-131-6/+109
| | | | llvm-svn: 19533
* Fix uint64_t -> unsigned VS warnings.Chris Lattner2005-01-082-12/+13
| | | | llvm-svn: 19381
* Silence VS warnings.Chris Lattner2005-01-081-5/+7
| | | | llvm-svn: 19380
* Silence warningsChris Lattner2005-01-082-3/+4
| | | | llvm-svn: 19379
* Add more missing createXxxPass functions.Jeff Cohen2005-01-082-0/+4
| | | | llvm-svn: 19370
* Put createLoopUnswitchPass() into proper namespaceJeff Cohen2005-01-061-1/+1
| | | | llvm-svn: 19306
* This is a bulk commit that implements the following primary improvements:Chris Lattner2005-01-011-78/+268
| | | | | | | | | | | | | | | | | | | | | | * We can now fold cast instructions into select instructions that have at least one constant operand. * We now optimize expressions more aggressively based on bits that are known to be zero. These optimizations occur a lot in code that uses bitfields even in simple ways. * We now turn more cast-cast sequences into AND instructions. Before we would only do this if it if all types were unsigned. Now only the middle type needs to be unsigned (guaranteeing a zero extend). * We transform sign extensions into zero extensions in several cases. This corresponds to these test/Regression/Transforms/InstCombine testcases: 2004-11-22-Missed-and-fold.ll and.ll: test28-29 cast.ll: test21-24 and-or-and.ll cast-cast-to-and.ll zeroext-and-reduce.ll llvm-svn: 19220
* Fix PR491 and testcase ↵Chris Lattner2004-12-291-1/+2
| | | | | | Transforms/DeadStoreElimination/2004-12-28-PartialStore.ll llvm-svn: 19180
* Adjust to new interfacesChris Lattner2004-12-151-2/+3
| | | | llvm-svn: 18958
* Constant exprs are not efficiently negatable in practice. This disablesChris Lattner2004-12-141-4/+3
| | | | | | turning X - (constantexpr) into X + (-constantexpr) among other things. llvm-svn: 18935
* Get rid of getSizeOf, using ConstantExpr::getSizeOf instead.Chris Lattner2004-12-131-20/+33
| | | | | | | | | | | do not insert a prototype for malloc of: void* malloc(uint): on 64-bit u targets this is not correct. Instead of prototype it as void *malloc(...), and pass the correct intptr_t through the "...". Finally, fix Regression/CodeGen/SparcV9/2004-12-13-MallocCrash.ll, by not forming constantexpr casts from pointer to uint. llvm-svn: 18908
* Change indentation of a whole bunch of code, no real changes here.Chris Lattner2004-12-121-105/+105
| | | | llvm-svn: 18843
* More substantial simplifications and speedups. This makes ADCE about 20% fasterChris Lattner2004-12-121-97/+43
| | | | | | in some cases. llvm-svn: 18842
* More minor microoptimizationsChris Lattner2004-12-121-6/+4
| | | | llvm-svn: 18841
* Remove some more set operationsChris Lattner2004-12-121-6/+2
| | | | llvm-svn: 18840
* Reduce number of set operations.Chris Lattner2004-12-121-2/+1
| | | | llvm-svn: 18839
* Optimize div/rem + select combinations more.Chris Lattner2004-12-121-24/+89
| | | | | | In particular, implement div.ll:test10 and rem.ll:test4. llvm-svn: 18838
* Simplify code and do not invalidate iterators.Chris Lattner2004-12-121-46/+9
| | | | | | | This fixes a crash compiling TimberWolfMC that was exposed due to recent optimizer changes. llvm-svn: 18831
* If one side of and/or is known to be 0/-1, it doesn't matterChris Lattner2004-12-111-0/+37
| | | | | | | | if the other side is overdefined. This allows us to fold conditions like: if (X < Y || Y > Z) in some cases. llvm-svn: 18807
* Two bug fixes:Chris Lattner2004-12-111-17/+27
| | | | | | | | | | | | | | | | | 1. Actually increment the Statistic for the GV elim optzn 2. When resolving undef branches, only resolve branches in executable blocks, avoiding marking a bunch of completely dead blocks live. This has a big impact on the quality of the generated code. With this patch, we positively rip up vortex, compiling Ut_MoveBytes to a single memcpy call. In vortex we get this: 12 ipsccp - Number of globals found to be constant 986 ipsccp - Number of arguments constant propagated 1378 ipsccp - Number of basic blocks unreachable 8919 ipsccp - Number of instructions removed llvm-svn: 18796
* Do not delete the entry block to a function.Chris Lattner2004-12-111-1/+5
| | | | llvm-svn: 18795
* Implement Transforms/SCCP/ipsccp-gvar.ll, by tracking values stored toChris Lattner2004-12-111-12/+85
| | | | | | non-address-taken global variables. llvm-svn: 18790
* Fix a bug where we could delete dead invoke instructions with uses.Chris Lattner2004-12-111-0/+26
| | | | | | | In functions where we fully constant prop the return value, replace all ret instructions with 'ret undef'. llvm-svn: 18786
* Implement SCCP/ipsccp-conditional.ll, by totally deleting dead blocks.Chris Lattner2004-12-101-2/+29
| | | | llvm-svn: 18781
* Fix SCCP/2004-12-10-UndefBranchBug.llChris Lattner2004-12-101-3/+51
| | | | llvm-svn: 18776
* This is the initial implementation of IPSCCP, as requested by Brian.Chris Lattner2004-12-101-63/+273
| | | | | | | | | This implements SCCP/ipsccp-basic.ll, rips apart Olden/mst (as described in PR415), and does other nice things. There is still more to come with this, but it's a start. llvm-svn: 18752
* note to self: Do not check in debugging code!Chris Lattner2004-12-091-1/+0
| | | | llvm-svn: 18693
* Implement trivial sinking for load instructions. This causes us to sink 567 ↵Chris Lattner2004-12-091-1/+11
| | | | | | loads in spec llvm-svn: 18692
* Do extremely simple sinking of instructions when they are only used in aChris Lattner2004-12-081-1/+52
| | | | | | | | | | | | | | | | | | | | | | | | successor block. This turns cases like this: x = a op b if (c) { use x } into: if (c) { x = a op b use x } This triggers 3965 times in spec, and is tested by Regression/Transforms/InstCombine/sink_instruction.ll This appears to expose a bug in the X86 backend for 177.mesa, which I'm looking in to. llvm-svn: 18677
* Fix this regression and remove the XFAIL from this test.Alkis Evlogimenos2004-12-081-3/+5
| | | | llvm-svn: 18674
* Fix Transforms/InstCombine/2004-12-08-RemInfiniteLoop.llChris Lattner2004-12-081-1/+2
| | | | llvm-svn: 18670
* For PR387:\Reid Spencer2004-12-071-0/+3
| | | | | | Add doInitialization method to avoid overloaded virtuals llvm-svn: 18602
* This pass is moving to lib IPOChris Lattner2004-12-021-56/+0
| | | | llvm-svn: 18439
* This pass is completely broken.Chris Lattner2004-11-301-11/+4
| | | | llvm-svn: 18387
* Allow hoisting loads of globals and alloca's in conditionals.Chris Lattner2004-11-291-0/+6
| | | | llvm-svn: 18363
* Fix for PR454:Reid Spencer2004-11-281-41/+80
| | | | | | | * Make sure we handle signed to unsigned conversion correctly * Move this visitSetCondInst case to its own method. llvm-svn: 18312
OpenPOWER on IntegriCloud