RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-22 04:22:57 +02:00
Code Issues Projects Releases Wiki Activity
19,314 Commits 4 Branches 5 Tags 704 MiB
0f4e0d19cc
Commit Graph

1998 Commits

Author SHA1 Message Date
Chris Lattner
5ad1e1ebec Instcombine this: 
%shortcirc_val = select bool %tmp.1, bool true, bool %tmp.4             ; <bool> [#uses=1]
        %tmp.6 = cast bool %shortcirc_val to int                ; <int> [#uses=1]

into this:

        %shortcirc_val = or bool %tmp.1, %tmp.4         ; <bool> [#uses=1]
        %tmp.6 = cast bool %shortcirc_val to int                ; <int> [#uses=1]

not this:

        %tmp.4.cast = cast bool %tmp.4 to int           ; <int> [#uses=1]
        %tmp.6 = select bool %tmp.1, int 1, int %tmp.4.cast             ; <int> [#uses=1]

llvm-svn: 21389
 2005-04-21 05:43:13 +00:00
Chris Lattner
6ce1b109aa Teach simplifycfg that setcc is cheap and non-trapping, so that it can 
convert this:

        %tmp.1 = seteq int %i, 0                ; <bool> [#uses=1]
        br bool %tmp.1, label %shortcirc_done, label %shortcirc_next

shortcirc_next:         ; preds = %entry
        %tmp.4 = seteq int %j, 0                ; <bool> [#uses=1]
        br label %shortcirc_done

shortcirc_done:         ; preds = %shortcirc_next, %entry
        %shortcirc_val = phi bool [ %tmp.4, %shortcirc_next ], [ true, %entry ]         ; <bool> [#uses=1]

to this:
        %tmp.1 = seteq int %i, 0                ; <bool> [#uses=1]
        %tmp.4 = seteq int %j, 0                ; <bool> [#uses=1]
        %shortcirc_val = select bool %tmp.1, bool true, bool %tmp.4             ; <bool> [#uses=1]

... which is later simplified by instcombine into an or.

llvm-svn: 21388
 2005-04-21 05:31:13 +00:00
Chris Lattner
145f1ec0a4 Wrap some long lines. 
Make IPSCCP strip off dead constant exprs that are using functions, making
them appear as though their address is taken.  This allows us to propagate
some more pool descriptors, lowering the overhead of pool alloc.

llvm-svn: 21363
 2005-04-19 19:16:19 +00:00
Chris Lattner
6b0132b48b Eliminate a broken transformation, fixing PR548 
llvm-svn: 21354
 2005-04-19 06:04:18 +00:00
Chris Lattner
4d9c1d06da silence a bogus warning 
llvm-svn: 21320
 2005-04-18 05:26:21 +00:00
Chris Lattner
a117cf4215 a new simple pass, which will be extended to be more useful in the future. 
This pass forward branches through conditions when it can show that the
conditions is either always true or false for a predecessor.  This currently
only handles the most simple cases of this, but is successful at threading
across 2489 branches and 65 switch instructions in 176.gcc, which isn't bad.

llvm-svn: 21306
 2005-04-15 19:28:32 +00:00
Chris Lattner
ee06161a63 Get rid of this for_each loop 
llvm-svn: 21253
 2005-04-12 18:51:33 +00:00
Chris Lattner
f82999fabe Fix bug: InstCombine/2005-05-07-UDivSelectCrash.ll 
llvm-svn: 21152
 2005-04-08 04:03:26 +00:00
Chris Lattner
05d79f36b1 Implement the following xforms: 
(X-Y)-X --> -Y
A + (B - A) --> B
(B - A) + A --> B

llvm-svn: 21138
 2005-04-07 17:14:51 +00:00
Chris Lattner
5b31ada26d Implement InstCombine/add.ll:test28, transforming C1-(X+C2) --> (C1-C2)-X. 
This occurs several dozen times in specint2k, particularly in crafty and gcc
apparently.

llvm-svn: 21136
 2005-04-07 16:28:01 +00:00
Chris Lattner
ea1752ddf5 Transform X-(X+Y) == -Y and X-(Y+X) == -Y 
llvm-svn: 21134
 2005-04-07 16:15:25 +00:00
Chris Lattner
9b3adb88b8 disable this transformation in the one obscure case that really pessimizes 
pointer analysis.

llvm-svn: 20916
 2005-03-29 06:37:47 +00:00
Alkis Evlogimenos
e0e628a401 Rename createPromoteMemoryToRegister() to 
createPromoteMemoryToRegisterPass() to be consistent with other pass
creation functions.

llvm-svn: 20885
 2005-03-28 02:01:12 +00:00
Chris Lattner
8e8b8bb133 Enhance loopsimplify to preserve alias analysis instead of clobbering it. 
This prevents crashes on some programs when using -ds-aa -licm.

llvm-svn: 20831
 2005-03-25 06:37:22 +00:00
Chris Lattner
4f4fa287ee Fix a bug where LICM was not updating AA information properly when sinking 
a pointer value out of a loop causing it to be duplicated.

llvm-svn: 20828
 2005-03-25 00:22:36 +00:00
Chris Lattner
1dbe1592ed enable -debug-only=licm 
llvm-svn: 20788
 2005-03-23 21:00:12 +00:00
Chris Lattner
c9a3ea81bf Fix the missing symbols problem Bill was hitting. Patch contributed by 
Bill Wendling!!

llvm-svn: 20649
 2005-03-17 15:38:16 +00:00
Chris Lattner
8cfd7fbf35 stop using method. 
llvm-svn: 20603
 2005-03-15 05:19:49 +00:00
Chris Lattner
4b688a1c70 This mega patch converts us from using Function::a{iterator|begin|end} to 
using Function::arg_{iterator|begin|end}.  Likewise Module::g* -> Module::global_*.

This patch is contributed by Gabor Greif, thanks!

llvm-svn: 20597
 2005-03-15 04:54:21 +00:00
Chris Lattner
6d6f980ca7 fix a bug where we thought arguments were constants :( 
llvm-svn: 20506
 2005-03-06 22:52:29 +00:00
Chris Lattner
2174b70c68 Fix Regression/Transforms/LoopStrengthReduce/dont_insert_redundant_ops.ll, 
hopefully not breaking too many other things.

llvm-svn: 20505
 2005-03-06 22:36:12 +00:00
Chris Lattner
a29e319d54 implement Transforms/LoopStrengthReduce/invariant_value_first_arg.ll 
llvm-svn: 20501
 2005-03-06 22:06:22 +00:00
Chris Lattner
18fdd1e9f6 minor simplifications of the code. 
llvm-svn: 20497
 2005-03-06 21:58:22 +00:00
Chris Lattner
53c34a2147 trivial simplification 
llvm-svn: 20494
 2005-03-06 21:35:38 +00:00
Chris Lattner
b4e635cfc4 Fix a bug where we could corrupt a parent loop's header info if we unrolled 
a nested loop.  This fixes Transforms/LoopUnroll/2005-03-06-BadLoopInfoUpdate.ll
and PR532

llvm-svn: 20493
 2005-03-06 20:57:32 +00:00
Chris Lattner
0ed850a944 Make this MUCH faster by avoiding a linear search in the symbol table code. 
llvm-svn: 20479
 2005-03-06 05:42:36 +00:00
Jeff Cohen
db51926d4a Reformat comments to fix 80 columns. 
llvm-svn: 20467
 2005-03-05 22:45:40 +00:00
Jeff Cohen
023f10be12 Reuse induction variables created for strength-reduced GEPs by other similar GEPs. 
llvm-svn: 20466
 2005-03-05 22:40:34 +00:00
Chris Lattner
1ccff5c8c7 second argument to Value::setName is now gone. 
llvm-svn: 20463
 2005-03-05 19:05:20 +00:00
Chris Lattner
cadc85daa5 Do not compute 1ULL << 64, which is undefined. This fixes Ptrdist/ks on the 
sparc, and testcase Regression/Transforms/InstCombine/2005-03-04-ShiftOverflow.ll

llvm-svn: 20445
 2005-03-04 23:21:33 +00:00
Jeff Cohen
29ecafb2e3 Add support for not strength reducing GEPs where the element size is a small 
power of two.  This emphatically includes the zeroeth power of two.

llvm-svn: 20429
 2005-03-04 04:04:26 +00:00
Chris Lattner
4814696e7d Add an optional argument to lower to a specific constant value instead of 
to a "sizeof" expression.

llvm-svn: 20414
 2005-03-03 01:03:43 +00:00
Jeff Cohen
6d82d5b23e Fixed the following LSR bugs: 
* Loop invariant code does not dominate the loop header, but rather
    the end of the loop preheader.

  * The base for a reduced GEP isn't a constant unless all of its
    operands (preceding the induction variable) are constant.

  * Allow induction variable elimination for the simple case after all.

Also made changes recommended by Chris for properly deleting
instructions.

llvm-svn: 20383
 2005-03-01 03:46:11 +00:00
Jeff Cohen
d5b1827c3f Fix crash in LSR due to attempt to remove original induction variable. However, 
for reasons explained in the comments, I also deactivated this code as it needs
more thought.

llvm-svn: 20367
 2005-02-28 00:08:56 +00:00
Jeff Cohen
fd9504c7d9 PHI nodes were incorrectly placed when more than one GEP is reduced in a loop. 
llvm-svn: 20360
 2005-02-27 21:08:04 +00:00
Jeff Cohen
6258d4a431 First pass at improved Loop Strength Reduction. Still not yet ready for prime time. 
llvm-svn: 20358
 2005-02-27 19:37:07 +00:00
Chris Lattner
73d4556bb6 Teach globalopt how memset/cpy/move affect memory, to allow better optimization. 
llvm-svn: 20352
 2005-02-27 18:58:52 +00:00
Chris Lattner
a024984017 Fix spelling, patch contributed by Gabor Greif! 
llvm-svn: 20343
 2005-02-27 06:18:25 +00:00
Chris Lattner
14f720d625 remove extraneous cast 
llvm-svn: 20334
 2005-02-26 18:33:28 +00:00
Chris Lattner
7a434679c3 Implement Transforms/SimplifyCFG/switch_thread.ll 
This does a simple form of "jump threading", which eliminates CFG edges that
are provably dead.  This triggers 90 times in the external tests, and
eliminating CFG edges is always always a good thing! :)

llvm-svn: 20300
 2005-02-24 06:17:52 +00:00
Chris Lattner
bfb6a94126 make this more efficient. Scan up to 16 nodes, not the whole list. 
llvm-svn: 20289
 2005-02-23 16:53:04 +00:00
Chris Lattner
b5256c157d Remove use of bind_obj 
llvm-svn: 20276
 2005-02-22 23:22:58 +00:00
Chris Lattner
29126b65c4 Do not mark obviously unreachable blocks live when processing PHI nodes, 
and handle incomplete control dependences correctly.  This fixes:

Regression/Transforms/ADCE/dead-phi-edge.ll
  -> a missed optimization

Regression/Transforms/ADCE/dead-phi-edge.ll
  -> a compiler crash distilled from QT4

llvm-svn: 20227
 2005-02-17 19:28:49 +00:00
Chris Lattner
0a61115d67 Fix the second bug attached to PR504. 
llvm-svn: 20181
 2005-02-14 20:11:45 +00:00
Chris Lattner
8f3f72f2bc Fix for testcase Transforms/IndVarsSimplify/2005-02-11-InvokeCrash.ll 
and PR504.

llvm-svn: 20129
 2005-02-12 03:26:49 +00:00
Alkis Evlogimenos
82f384712f Localize globals if they are only used in main(). This replaces the 
global with an alloca, which eventually gets promoted into a
register. This enables a lot of other optimizations later on.

llvm-svn: 20109
 2005-02-10 18:36:30 +00:00
Alkis Evlogimenos
3521fcb18f Fix crash on MallocInsts of unsized types. 
llvm-svn: 19988
 2005-02-02 04:43:37 +00:00
Chris Lattner
d04865822c API change. 
llvm-svn: 19959
 2005-02-01 01:23:49 +00:00
Chris Lattner
555ef32a44 Adjust to changes in APIs 
llvm-svn: 19958
 2005-02-01 01:23:31 +00:00
Chris Lattner
849a4118e6 Hacks to make this ugly ugly code work with the new use lists. 
llvm-svn: 19957
 2005-02-01 01:22:56 +00:00
Chris Lattner
c4884b553e Implement InstCombine/cast.ll:test25, a case that occurs many times 
in spec

llvm-svn: 19953
 2005-01-31 05:51:45 +00:00
Chris Lattner
6a431c25d1 Implement the trivial cases in InstCombine/store.ll 
llvm-svn: 19950
 2005-01-31 05:36:43 +00:00
Chris Lattner
a4ba8e9f0d Implement Transforms/InstCombine/cast-load-gep.ll, which allows us to devirtualize 
11 indirect calls in perlbmk.

llvm-svn: 19947
 2005-01-31 04:50:46 +00:00
Chris Lattner
c29f25e260 Adjust to changes in instruction interfaces. 
llvm-svn: 19900
 2005-01-29 00:39:08 +00:00
Chris Lattner
7dab604f10 Switchinst takes a hint for the number of cases it will have. 
llvm-svn: 19899
 2005-01-29 00:38:45 +00:00
Chris Lattner
ccc0c99fae switchinst ctor now takes a hint for the number of cases that it will have. 
llvm-svn: 19898
 2005-01-29 00:38:26 +00:00
Chris Lattner
d87666619f Adjust Valuehandle to hold its operand directly in it. 
llvm-svn: 19897
 2005-01-29 00:37:36 +00:00
Chris Lattner
b035ec4a9c * add some DEBUG statements 
* 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
 2005-01-28 19:32:01 +00:00
Alkis Evlogimenos
eb6bfe9cee Add a dependency to the trace library so that it gets pulled in 
automatically.

llvm-svn: 19828
 2005-01-25 16:23:57 +00:00
Chris Lattner
ab2ab313d3 Get rid of a several dozen more and instructions in specint. 
llvm-svn: 19786
 2005-01-23 20:26:55 +00:00
Chris Lattner
151c8e6390 Handle comparisons of gep instructions that have different typed indices 
as long as they are the same size.

llvm-svn: 19734
 2005-01-21 23:06:49 +00:00
Chris Lattner
5a9660aa71 Add two optimizations. The first folds (X+Y)-X -> Y 
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
 2005-01-19 21:50:18 +00:00
Chris Lattner
302ea8908d Fix 'raise' to work with packed types. Patch by Morten Ofstad. 
llvm-svn: 19693
 2005-01-19 16:16:35 +00:00
Chris Lattner
3402945d52 Delete PHI nodes that are not dead but are locked in a cycle of single 
useness.

llvm-svn: 19629
 2005-01-17 05:10:15 +00:00
Chris Lattner
de6b1ca556 Move code out of indentation one level to make it easier to read. 
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
 2005-01-17 03:20:02 +00:00
Chris Lattner
708ff662ba Fix some bugs in an xform added yesterday. This fixes Prolangs-C/allroots. 
llvm-svn: 19553
 2005-01-14 17:35:12 +00:00
Chris Lattner
13fd87be57 Fix a compile crash on spiff 
llvm-svn: 19552
 2005-01-14 17:17:59 +00:00
Chris Lattner
6b519e3314 if two gep comparisons only differ by one index, compare that index directly. 
This allows us to better optimize begin() -> end() comparisons in common cases.

llvm-svn: 19542
 2005-01-14 00:20:05 +00:00
Chris Lattner
283b7d9809 Do not overrun iterators. This fixes a 176.gcc crash 
llvm-svn: 19541
 2005-01-13 23:26:48 +00:00
Chris Lattner
b3dfd0aecd Turn select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y))). This occurs in 
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
 2005-01-13 22:52:24 +00:00
Chris Lattner
e59c6d1cbe Implement an optimization for == and != comparisons like this: 
_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
 2005-01-13 22:25:21 +00:00
Chris Lattner
ee469241c3 Fix some bugs in code I didn't mean to check in. 
llvm-svn: 19534
 2005-01-13 20:40:58 +00:00
Chris Lattner
aebad4db9a Fix a crash compiling 129.compress 
llvm-svn: 19533
 2005-01-13 20:14:25 +00:00
Reid Spencer
7e9642515c Add the LOADABLE_MODULE=1 directive to indicate that this shared library is 
intended to be a dlopenable module and not a "plain" shared library.

llvm-svn: 19456
 2005-01-11 04:33:32 +00:00
Jeff Cohen
8b03a55724 Apply feedback from Chris. 
llvm-svn: 19432
 2005-01-10 04:23:32 +00:00
Chris Lattner
c2821461e9 Fix VS warnings 
llvm-svn: 19383
 2005-01-08 19:48:40 +00:00
Chris Lattner
2e24bcf264 Fix VS warnings. 
llvm-svn: 19382
 2005-01-08 19:45:31 +00:00
Chris Lattner
131ada2668 Fix uint64_t -> unsigned VS warnings. 
llvm-svn: 19381
 2005-01-08 19:42:22 +00:00
Chris Lattner
ee218d4348 Silence VS warnings. 
llvm-svn: 19380
 2005-01-08 19:37:20 +00:00
Chris Lattner
d1e987d9ae Silence warnings 
llvm-svn: 19379
 2005-01-08 19:34:41 +00:00
Jeff Cohen
ce541ade79 Add more missing createXxxPass functions. 
llvm-svn: 19370
 2005-01-08 17:21:40 +00:00
Misha Brukman
22df7f894f Convert tabs to spaces 
llvm-svn: 19320
 2005-01-07 07:05:34 +00:00
Jeff Cohen
c07c54f5b4 Add missing createXxxPass functions 
llvm-svn: 19319
 2005-01-07 06:57:28 +00:00
Jeff Cohen
79dc6715bb Add missing include 
llvm-svn: 19315
 2005-01-07 05:42:13 +00:00
Jeff Cohen
67f737e5d1 Put createLoopUnswitchPass() into proper namespace 
llvm-svn: 19306
 2005-01-06 05:47:18 +00:00
Jeff Cohen
a8574e28a3 Add missing include 
llvm-svn: 19305
 2005-01-06 05:46:44 +00:00
Chris Lattner
14d51ed06a This is a bulk commit that implements the following primary improvements: 
* 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
 2005-01-01 16:22:27 +00:00
Chris Lattner
5fff877f74 Implement SimplifyCFG/DeadSetCC.ll 
SimplifyCFG is one of those passes that we use for final cleanup: it should
not rely on other passes to clean up its garbage.  This fixes the "why are
trivially dead setcc's in the output of gccas" problem.

llvm-svn: 19212
 2005-01-01 16:02:12 +00:00
Chris Lattner
b49dd5c526 Fix PR491 and testcase Transforms/DeadStoreElimination/2004-12-28-PartialStore.ll 
llvm-svn: 19180
 2004-12-29 04:36:02 +00:00
Chris Lattner
3a260f9757 Adjust to new interfaces 
llvm-svn: 18958
 2004-12-15 07:22:25 +00:00
Chris Lattner
763e852e7a Constant exprs are not efficiently negatable in practice. This disables 
turning X - (constantexpr) into X + (-constantexpr) among other things.

llvm-svn: 18935
 2004-12-14 20:08:06 +00:00
Brian Gaeke
ca2d45f5c1 Fix link error in PPC optimized build of 'opt'. 
llvm-svn: 18913
 2004-12-13 21:28:39 +00:00
Chris Lattner
318f80ae39 Get rid of getSizeOf, using ConstantExpr::getSizeOf instead. 
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
 2004-12-13 20:00:02 +00:00
Chris Lattner
bc889ab3c7 Change indentation of a whole bunch of code, no real changes here. 
llvm-svn: 18843
 2004-12-12 23:49:37 +00:00
Chris Lattner
85776b0e99 More substantial simplifications and speedups. This makes ADCE about 20% faster 
in some cases.

llvm-svn: 18842
 2004-12-12 23:40:17 +00:00
Chris Lattner
deda69d473 More minor microoptimizations 
llvm-svn: 18841
 2004-12-12 22:44:30 +00:00
Chris Lattner
1629a92f18 Remove some more set operations 
llvm-svn: 18840
 2004-12-12 22:22:18 +00:00
Chris Lattner
a47e7e4093 Reduce number of set operations. 
llvm-svn: 18839
 2004-12-12 22:16:13 +00:00
Chris Lattner
2be8c4a870 Optimize div/rem + select combinations more. 
In particular, implement div.ll:test10 and rem.ll:test4.

llvm-svn: 18838
 2004-12-12 21:48:58 +00:00
Chris Lattner
0a2feabdc9 Properly implement copying of a global, fixing the 255.vortex & povray 
failures from last night.

llvm-svn: 18832
 2004-12-12 19:34:41 +00:00
Chris Lattner
9e7ce53b82 Simplify code and do not invalidate iterators. 
This fixes a crash compiling TimberWolfMC that was exposed due to recent
optimizer changes.

llvm-svn: 18831
 2004-12-12 18:23:20 +00:00
Chris Lattner
97adae1fa4 Though the previous xform applies to literally dozens (hundreds?) of variables 
in SPEC, the subsequent optimziations that we are after don't play with
with FP values, so disable this xform for them.  Really we just don't want
stuff like:

double G;   (always 0 or 412312.312)
  = G;

turning into:

bool G_b;
  = G_b ? 412312.312 : 0;

We'd rather just do the load.

-Chris

llvm-svn: 18819
 2004-12-12 06:03:06 +00:00
Chris Lattner
f125dc0e49 If a variable can only hold two values, and is not already a bool, shrink it 
down to actually BE a bool.  This allows simple value range propagation
stuff work harder, deleting comparisons in bzip2 in some hot loops.

This implements GlobalOpt/integer-bool.ll, which is the essence of the
loop condition distilled into a testcase.

llvm-svn: 18817
 2004-12-12 05:53:50 +00:00
Chris Lattner
02c04bbf45 If one side of and/or is known to be 0/-1, it doesn't matter 
if the other side is overdefined.

This allows us to fold conditions like:  if (X < Y || Y > Z) in some cases.

llvm-svn: 18807
 2004-12-11 23:15:19 +00:00
Chris Lattner
59ce936426 Only cound if we actually made a change. 
llvm-svn: 18800
 2004-12-11 17:00:14 +00:00
Chris Lattner
8378361f0c The split bb is really the exit of the old function 
llvm-svn: 18799
 2004-12-11 16:59:54 +00:00
Chris Lattner
06bfa390f6 Two bug fixes: 
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
 2004-12-11 06:05:53 +00:00
Chris Lattner
5af0ef5c44 Do not delete the entry block to a function. 
llvm-svn: 18795
 2004-12-11 05:32:19 +00:00
Chris Lattner
943f94d2b3 Implement Transforms/SCCP/ipsccp-gvar.ll, by tracking values stored to 
non-address-taken global variables.

llvm-svn: 18790
 2004-12-11 05:15:59 +00:00
Chris Lattner
beeab3a124 Fix a bug where we could delete dead invoke instructions with uses. 
In functions where we fully constant prop the return value, replace all
ret instructions with 'ret undef'.

llvm-svn: 18786
 2004-12-11 02:53:57 +00:00
Chris Lattner
d1d00e017b Implement SCCP/ipsccp-conditional.ll, by totally deleting dead blocks. 
llvm-svn: 18781
 2004-12-10 22:29:08 +00:00
Chris Lattner
5be2c2e299 Fix SCCP/2004-12-10-UndefBranchBug.ll 
llvm-svn: 18776
 2004-12-10 20:41:50 +00:00
Chris Lattner
40e97884f6 Fix Regression/Transforms/SimplifyCFG/2004-12-10-SimplifyCFGCrash.ll, 
and the failure on make_dparser last night.

llvm-svn: 18766
 2004-12-10 17:42:31 +00:00
Chris Lattner
ead42a768e This is the initial implementation of IPSCCP, as requested by Brian. 
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
 2004-12-10 08:02:06 +00:00
Chris Lattner
f5962a7d6c note to self: Do not check in debugging code! 
llvm-svn: 18693
 2004-12-09 07:15:52 +00:00
Chris Lattner
1e2b3fd343 Implement trivial sinking for load instructions. This causes us to sink 567 loads in spec 
llvm-svn: 18692
 2004-12-09 07:14:34 +00:00
Chris Lattner
8529319568 Do extremely simple sinking of instructions when they are only used in a 
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
 2004-12-08 23:43:58 +00:00
Alkis Evlogimenos
fe549f46e1 Fix this regression and remove the XFAIL from this test. 
llvm-svn: 18674
 2004-12-08 23:10:30 +00:00
Chris Lattner
62e3f533f3 Fix Transforms/InstCombine/2004-12-08-RemInfiniteLoop.ll 
llvm-svn: 18670
 2004-12-08 22:20:34 +00:00
Chris Lattner
8ecbc96420 Add support for compilers without argument dependent name lookup, contributed 
by Bjørn Wennberg

llvm-svn: 18627
 2004-12-08 16:12:20 +00:00
Chris Lattner
2f52add966 Remove unneeded class qualifier, contributed by Bjørn Wennberg 
llvm-svn: 18625
 2004-12-08 16:05:02 +00:00
Reid Spencer
f929fb661d For PR387:\ 
Add doInitialization method to avoid overloaded virtuals

llvm-svn: 18602
 2004-12-07 08:11:36 +00:00
Chris Lattner
a5a08f5484 Implement stripping of debug symbols, making the --strip-debug options in 
gccas/gccld more than just a noop.

llvm-svn: 18456
 2004-12-03 16:22:08 +00:00
Chris Lattner
45529acebd Initial reimplementation of the -strip pass, with a stub for implementing 
-S

llvm-svn: 18440
 2004-12-02 21:25:03 +00:00
Chris Lattner
d742c10964 This pass is moving to lib IPO 
llvm-svn: 18439
 2004-12-02 21:24:40 +00:00
Chris Lattner
afb31cf723 Implement a FIXME by checking to make sure that a malloc is not being used 
in scary and unknown ways before we promote it.  This fixes the miscompilation
of 188.ammp that has been plauging us since a globalopt patch went in.

Thanks a ton to Tanya for helping me diagnose the problem!

llvm-svn: 18418
 2004-12-02 07:11:07 +00:00
Chris Lattner
fd541d4228 Fix a minor bug where we set a var to initialized on malloc, not on store. 
This doesn't fix anything that I'm aware of, just noticed it by inspection

llvm-svn: 18417
 2004-12-02 06:25:58 +00:00
Chris Lattner
23c9c1bb62 This pass is completely broken. 
llvm-svn: 18387
 2004-11-30 17:09:06 +00:00
Chris Lattner
c58bc8d96e Squelch warning 
llvm-svn: 18381
 2004-11-30 07:47:34 +00:00
Chris Lattner
537e5a6b50 Fix test/Regression/Transforms/LICM/2004-09-14-AliasAnalysisInvalidate.llx 
This only fails on darwin or on X86 under valgrind.

llvm-svn: 18377
 2004-11-30 07:01:15 +00:00
Chris Lattner
25b93fea2a Alkis noticed that this variable is dead. Thanks! 
llvm-svn: 18369
 2004-11-30 04:01:44 +00:00
Chris Lattner
b237a19a78 If we have something like this: 
if (x) {
    code
    ...
  } else {
    code
    ...
  }

Turn it into:

  code
  if (x) {
    ...
  } else {
    ...
  }

This reduces code size and in some common cases allows us to completely
eliminate the conditional.  This turns several if/then/else blocks in loops
into straightline code in 179.art, turning the loops into single basic blocks
(good for modsched even!).

Maybe now brg will leave me alone ;-)

llvm-svn: 18366
 2004-11-30 00:29:14 +00:00
Chris Lattner
ba782edfb7 Allow hoisting loads of globals and alloca's in conditionals. 
llvm-svn: 18363
 2004-11-29 21:26:12 +00:00
Reid Spencer
dd287f7758 Fix for PR454: 
* Make sure we handle signed to unsigned conversion correctly
* Move this visitSetCondInst case to its own method.

llvm-svn: 18312
 2004-11-28 21:31:15 +00:00
Chris Lattner
7301399232 Make DSE potentially more aggressive by being more specific about alloca sizes. 
llvm-svn: 18309
 2004-11-28 20:44:37 +00:00
Chris Lattner
2c4161fc57 Implement Regression/Transforms/InstCombine/getelementptr_cast.ll, which 
occurs many times in crafty

llvm-svn: 18273
 2004-11-27 17:55:46 +00:00
Chris Lattner
8715ef738f Provide size information when checking to see if we can LICM a load, this 
allows us to hoist more loads in some cases.

llvm-svn: 18265
 2004-11-26 21:20:09 +00:00
Chris Lattner
ee2f552b0f Do not count debugger intrinsics in size estimation. 
llvm-svn: 18110
 2004-11-22 17:23:57 +00:00
Chris Lattner
9d1117ed96 Ignore debugger intrinsics when doing inlining size computations. 
llvm-svn: 18109
 2004-11-22 17:21:44 +00:00
Chris Lattner
4b58b75683 Do not consider debug intrinsics in the size computations for loop unrolling. 
Patch contributed by Michael McCracken!

llvm-svn: 18108
 2004-11-22 17:18:36 +00:00
Misha Brukman
9dd523842a Allow constructor parameter to override aggregating args; fix spacing 
llvm-svn: 18028
 2004-11-20 02:20:27 +00:00
Chris Lattner
73b5c56fc1 Fix the exposed prototype for the lower packed pass, thanks to 
Morten Ofstad.

llvm-svn: 17996
 2004-11-19 16:49:34 +00:00
Chris Lattner
a973b1a1a4 CPR is dead. 
llvm-svn: 17992
 2004-11-19 16:24:57 +00:00
Chris Lattner
ce8249f570 Delete stoppoints that occur for the same source line. 
llvm-svn: 17970
 2004-11-18 21:41:39 +00:00
Chris Lattner
7fb7c81ebf Check in hook that I forgot 
llvm-svn: 17956
 2004-11-18 17:24:20 +00:00
Chris Lattner
92e712b00f Do not delete dead invoke instructions! 
llvm-svn: 17897
 2004-11-16 16:32:28 +00:00
Reid Spencer
e986ef23d7 Remove unused variable for compilation by VC++. 
Patch contributed by Morten Ofstad.

llvm-svn: 17830
 2004-11-15 17:29:41 +00:00
Chris Lattner
f95f7e05a5 Minor cleanups. There is no reason for SCCP to derive from instvisitor anymore. 
llvm-svn: 17825
 2004-11-15 07:15:04 +00:00
Chris Lattner
4aa7dc02bf Count more accurately 
llvm-svn: 17824
 2004-11-15 07:02:42 +00:00
Chris Lattner
20a9efa189 Quiet warnings on the persephone tester 
llvm-svn: 17821
 2004-11-15 05:54:07 +00:00
Chris Lattner
e87a1360b3 Two minor improvements: 
1. Speedup getValueState by having it not consider Arguments.  It's better
    to just add them before we start SCCP'ing.
 2. SCCP can delete the contents of dead blocks.  No really, it's ok!  This
    reduces the size of the IR for subsequent passes, even though
    simplifycfg would do the same job.  In practice, simplifycfg does not
    run until much later than sccp in gccas

llvm-svn: 17820
 2004-11-15 05:45:33 +00:00
Chris Lattner
4ad574191b rename InstValue to LatticeValue, as it holds for more than instructions. 
llvm-svn: 17818
 2004-11-15 05:03:30 +00:00
Chris Lattner
bde8da9e43 Substantially refactor the SCCP class into an SCCP pass and an SCCPSolver 
class.  The only changes are minor:

 * Do not try to SCCP instructions that return void in the rewrite loop.
   This is silly and fool hardy, wasting a map lookup and adding an entry
   to the map which is never used.
 * If we decide something has an undefined value, rewrite it to undef,
   potentially leading to further simplications.

llvm-svn: 17816
 2004-11-15 04:44:20 +00:00
Chris Lattner
e4a97f4bee If a global is just loaded and restored, realize that it is not changing 
value.  This allows us to turn more globals into constants and eliminate them.
This patch implements GlobalOpt/load-store-global.llx.

Note that this patch speeds up 255.vortex from:

Output/255.vortex.out-cbe.time:program 7.640000
Output/255.vortex.out-llc.time:program 9.810000

to:

Output/255.vortex.out-cbe.time:program 7.250000
Output/255.vortex.out-llc.time:program 9.490000

Which isn't bad at all!

llvm-svn: 17746
 2004-11-14 20:50:30 +00:00
Chris Lattner
3d61b688a9 This optimization makes MANY phi nodes that all have the same incoming value. 
If this happens, detect it early instead of relying on instcombine to notice
it later.  This can be a big speedup, because PHI nodes can have many
incoming values.

llvm-svn: 17741
 2004-11-14 19:29:34 +00:00
Chris Lattner
1e4cad9176 Implement instcombine/phi.ll:test6 - pulling operations through PHI nodes. 
This exposes subsequent optimization possiblities and reduces code size.
This triggers 1423 times in spec.

llvm-svn: 17740
 2004-11-14 19:13:23 +00:00
Chris Lattner
fdd41995d8 Transform this: 
%X = alloca ...
  %Y = alloca ...
    X == Y

into false.  This allows us to simplify some stuff in eon (and probably
many other C++ programs) where operator= was checking for self assignment.
Folding this allows us to SROA several additional structs.

llvm-svn: 17735
 2004-11-14 07:33:16 +00:00
Chris Lattner
d6d9a04344 Remove note to self 
llvm-svn: 17734
 2004-11-14 06:57:47 +00:00
Chris Lattner
363e78c357 If a function always returns a constant, replace all calls sites with that 
constant value.  This makes the return value dead and allows for
simplification in the caller.

This implements IPConstantProp/return-constant.ll

This triggers several dozen times throughout SPEC.

llvm-svn: 17730
 2004-11-14 06:10:11 +00:00
Chris Lattner
d0a0af0818 Teach SROA how to promote an array index that is variable, if the dimension 
of the array is just two.  This occurs 8 times in gcc, 6 times in crafty, and
12 times in 099.go.

This implements ScalarRepl/sroa_two.ll

llvm-svn: 17727
 2004-11-14 05:00:19 +00:00
Chris Lattner
bc35272f86 Rearrange some code, no functionality changes. 
llvm-svn: 17724
 2004-11-14 04:24:28 +00:00
Chris Lattner
9b2f0f93e3 Remove debugging code 
llvm-svn: 17719
 2004-11-13 23:32:53 +00:00
Chris Lattner
9749bf21f8 Argument promotion transforms functions to unconditionally load their 
argument pointers.  This is only valid to do if the function already
unconditionally loaded an argument or if the pointer passed in is known
to be valid.  Make sure to do the required checks.

This fixed ArgumentPromotion/control-flow.ll and the Burg program.

llvm-svn: 17718
 2004-11-13 23:31:34 +00:00
Chris Lattner
70e351fb1c Simplify handling of shifts to be the same as we do for adds. Add support 
for (X * C1) + (X * C2) (where * can be mul or shl), allowing us to fold:

   Y+Y+Y+Y+Y+Y+Y+Y

into
         %tmp.8 = shl long %Y, ubyte 3           ; <long> [#uses=1]

instead of

        %tmp.4 = shl long %Y, ubyte 2           ; <long> [#uses=1]
        %tmp.12 = shl long %Y, ubyte 2          ; <long> [#uses=1]
        %tmp.8 = add long %tmp.4, %tmp.12               ; <long> [#uses=1]

This implements add.ll:test25

Also add support for (X*C1)-(X*C2) -> X*(C1-C2), implementing sub.ll:test18

llvm-svn: 17704
 2004-11-13 19:50:12 +00:00
Chris Lattner
7a8d26a581 Fold: 
(X + (X << C2)) --> X * ((1 << C2) + 1)
   ((X << C2) + X) --> X * ((1 << C2) + 1)

This means that we now canonicalize "Y+Y+Y" into:

        %tmp.2 = mul long %Y, 3         ; <long> [#uses=1]

instead of:

        %tmp.10 = shl long %Y, ubyte 1          ; <long> [#uses=1]
        %tmp.6 = add long %Y, %tmp.10               ; <long> [#uses=1]

llvm-svn: 17701
 2004-11-13 19:31:40 +00:00
Chris Lattner
d348f5b9fb Lazily create the abort message, so only translation units that use unwind 
will actually get it.

llvm-svn: 17700
 2004-11-13 19:07:32 +00:00
Chris Lattner
ab917141d0 Fix: CodeExtractor/2004-11-12-InvokeExtract.ll 
llvm-svn: 17699
 2004-11-13 00:06:45 +00:00
Chris Lattner
c6b1d7a081 Fix a bug where the code extractor would get a bit confused handling invoke 
instructions, setting DefBlock to a block it did not have dom info for.

llvm-svn: 17697
 2004-11-12 23:50:44 +00:00
Chris Lattner
922a1b4601 Simplify handling of constant initializers 
llvm-svn: 17696
 2004-11-12 22:42:57 +00:00
Chris Lattner
1a469385bd Actually, leave the check in. This prevents us from counting dead arguments 
as IPCP opportunities.

llvm-svn: 17680
 2004-11-11 07:47:54 +00:00
Chris Lattner
dba9c2b0ef Fix bug: IPConstantProp/deadarg.ll 
llvm-svn: 17679
 2004-11-11 07:46:29 +00:00
Chris Lattner
d920b5b770 Make IP Constant prop more aggressive about handling self recursive calls. 
This implements IPConstantProp/recursion.ll

llvm-svn: 17666
 2004-11-10 19:43:59 +00:00
Chris Lattner
b214a04a16 Do not let dead constant expressions hanging off of functions prevent IPCP. 
This allows to elimination of a bunch of global pool descriptor args from
programs being pool allocated (and is also generally useful!)

llvm-svn: 17657
 2004-11-09 20:47:30 +00:00
Chris Lattner
9f035c9fdb Change this back so that I get stable numbers to reflect the change from the 
nightly testers

llvm-svn: 17646
 2004-11-09 08:05:23 +00:00
Chris Lattner
b924e8be62 Fix bug: 2004-11-08-FreeUseCrash.ll 
llvm-svn: 17642
 2004-11-09 05:10:56 +00:00
Chris Lattner
a9e56ddaa3 VERY large functions that are only called from one place are not really 
exciting to inline.  Only inline medium or small sized functions with a
single call site.

llvm-svn: 17588
 2004-11-07 21:46:47 +00:00
Chris Lattner
a060b55dea This is V9 specific, move it there. 
llvm-svn: 17545
 2004-11-07 00:39:26 +00:00
Chris Lattner
b5ff07e46e Remove dead vars 
llvm-svn: 17482
 2004-11-05 04:46:22 +00:00
Chris Lattner
064071600d Fix some warnings on VC++ 
llvm-svn: 17481
 2004-11-05 04:45:43 +00:00
Chris Lattner
33ed2c8984 * Rearrange code slightly 
* Disable broken transforms for simplifying (setcc (cast X to larger), CI)
  where CC is not != or ==

llvm-svn: 17422
 2004-11-02 03:50:32 +00:00
Chris Lattner
b81520727e Speed up the tail duplication pass on the testcase below from 68.2s to 1.23s: 
#define CL0(a) case a: f(); goto c;
 #define CL1(a) CL0(a##0) CL0(a##1) CL0(a##2) CL0(a##3) CL0(a##4) CL0(a##5) \
 CL0(a##6) CL0(a##7) CL0(a##8) CL0(a##9)
 #define CL2(a) CL1(a##0) CL1(a##1) CL1(a##2) CL1(a##3) CL1(a##4) CL1(a##5) \
 CL1(a##6) CL1(a##7) CL1(a##8) CL1(a##9)
 #define CL3(a) CL2(a##0) CL2(a##1) CL2(a##2) CL2(a##3) CL2(a##4) CL2(a##5) \
 CL2(a##6) CL2(a##7) CL2(a##8) CL2(a##9)
 #define CL4(a) CL3(a##0) CL3(a##1) CL3(a##2) CL3(a##3) CL3(a##4) CL3(a##5) \
 CL3(a##6) CL3(a##7) CL3(a##8) CL3(a##9)

 void f();

 void a() {
     int b;
  c: switch (b) {
         CL4(1)
     }
 }

This comes from GCC PR 15524

llvm-svn: 17390
 2004-11-01 07:05:07 +00:00
Chris Lattner
3083f2a424 Do not compute the predecessor list for a block unless we need it. 
This speeds up simplifycfg on this program, from 44.87s to 0.29s (with
a profiled build):

 #define CL0(a) case a: goto c;
 #define CL1(a) CL0(a##0) CL0(a##1) CL0(a##2) CL0(a##3) CL0(a##4) CL0(a##5) \
 CL0(a##6) CL0(a##7) CL0(a##8) CL0(a##9)
 #define CL2(a) CL1(a##0) CL1(a##1) CL1(a##2) CL1(a##3) CL1(a##4) CL1(a##5) \
 CL1(a##6) CL1(a##7) CL1(a##8) CL1(a##9)
 #define CL3(a) CL2(a##0) CL2(a##1) CL2(a##2) CL2(a##3) CL2(a##4) CL2(a##5) \
 CL2(a##6) CL2(a##7) CL2(a##8) CL2(a##9)
 #define CL4(a) CL3(a##0) CL3(a##1) CL3(a##2) CL3(a##3) CL3(a##4) CL3(a##5) \
 CL3(a##6) CL3(a##7) CL3(a##8) CL3(a##9)

 void f();

 void a() {
     int b;
  c: switch (b) {
         CL4(1)
     }
 }

This testcase is contrived to expose N^2 behavior, but this patch should speedup
simplifycfg on any programs that use large switch statements.  This testcase
comes from GCC PR17895.

llvm-svn: 17389
 2004-11-01 06:53:58 +00:00
Reid Spencer
d3f7233495 Change Library Names Not To Conflict With Others When Installed 
llvm-svn: 17286
 2004-10-27 23:18:45 +00:00
Chris Lattner
dd0094e4ed Convert 'struct' to 'class' in various places to adhere to the coding standards 
and work better with VC++.  Patch contributed by Morten Ofstad!

llvm-svn: 17281
 2004-10-27 16:14:51 +00:00
Chris Lattner
000424b69e Hrm, this code was severely botched. As it turns out, this patch: 
http://mail.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20041018/019708.html

exposed ANOTHER latent bug in this xform, which caused Prolangs-C/bison to fill
the zion nightly tester disk up and make the tester barf.

This is obviously not a good thing, so lets fix this bug shall we? :)

llvm-svn: 17276
 2004-10-27 05:57:15 +00:00
Chris Lattner
abfae1c72e Initialize with the correct constant type 
llvm-svn: 17270
 2004-10-27 03:55:24 +00:00
Chris Lattner
895f16ebfc Fix compatibility with MSVC, patch by Morten Ofstad 
llvm-svn: 17218
 2004-10-25 18:45:16 +00:00
Reid Spencer
9f6f128630 Eliminate compilation warning on uninitialized variable. 
llvm-svn: 17163
 2004-10-22 16:10:39 +00:00
Chris Lattner
f0e2ce2279 *** empty log message *** 
llvm-svn: 17161
 2004-10-22 06:43:28 +00:00
Chris Lattner
6321852143 Fix a bug Nate noticed, where we miscompiled a simple testcase 
llvm-svn: 17157
 2004-10-22 04:53:16 +00:00
Reid Spencer
e48ba34fd4 We won't use automake 
llvm-svn: 17155
 2004-10-22 03:35:04 +00:00
Brian Gaeke
71ff3efdd5 Explain what this pass does. 
llvm-svn: 17146
 2004-10-20 19:38:58 +00:00
Chris Lattner
e555b5c5cb Hrm, some people complain when the compiler cheerfully tells them what it's 
doing... I guess they're right.

llvm-svn: 17142
 2004-10-19 06:33:16 +00:00
Reid Spencer
ce514b1c2c Initial automake generated Makefile template 
llvm-svn: 17136
 2004-10-18 23:55:41 +00:00
Nate Begeman
49e38c2185 Initial implementation of the strength reduction for GEP instructions in 
loops.  This optimization is not turned on by default yet, but may be run
with the opt tool's -loop-reduce flag.  There are many FIXMEs listed in the
code that will make it far more applicable to a wide range of code, but you
have to start somewhere :)

This limited version currently triggers on the following tests in the
MultiSource directory:
pcompress2: 7 times
cfrac: 5 times
anagram: 2 times
ks: 6 times
yacr2: 2 times

llvm-svn: 17134
 2004-10-18 21:08:22 +00:00
Chris Lattner
9e2649a7be Get this file compiling with VC++, patch contributed by Morten Ofstad. Thanks Morten! 
llvm-svn: 17125
 2004-10-18 15:43:46 +00:00
Reid Spencer
2b5cfe8be8 Correction to allow compilation with Visual C++. 
Patch contributed by Morten Ofstad. Thanks Morten!

llvm-svn: 17123
 2004-10-18 14:38:48 +00:00
Chris Lattner
b1827a765a Simplify code by deleting instructions that preceed unreachable instructions. 
Simplify code by simplifying terminators that branch to blocks that start
with an unreachable instruction.

llvm-svn: 17116
 2004-10-18 04:07:22 +00:00
Chris Lattner
3c1be63b41 Turn store -> null/undef into the LLVM unreachable instruction! This simple 
change hacks off 10K of bytecode from perlbmk (.5%) even though the front-end
is not generating them yet and we are not optimizing the resultant code.
This isn't too bad.

llvm-svn: 17111
 2004-10-18 03:00:50 +00:00
Chris Lattner
18333c64de Turn things with obviously undefined semantics into 'store -> null' 
llvm-svn: 17110
 2004-10-18 02:59:09 +00:00