caio/clang-p2996
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
31,724 Commits 1 Branch 0 Tags
da17029218cf0c19cf0341dda1ba557471e33871
Commit Graph

748 Commits

Author SHA1 Message Date
Chris Lattner
dd1a86d858 Minor efficiency tweak, suggested by Patrick Meredith 
llvm-svn: 13341
 2004-05-04 15:19:33 +00:00
Chris Lattner
63d75af920 Make sure to reprocess instructions used by deleted instructions to avoid 
missing opportunities for combination.

llvm-svn: 13309
 2004-05-01 23:27:23 +00:00
Chris Lattner
b643a9e675 Make sure the instruction combiner doesn't lose track of instructions 
when replacing them, missing the opportunity to do simplifications

llvm-svn: 13308
 2004-05-01 23:19:52 +00:00
Chris Lattner
652064e3b8 Fix a major pessimization in the instcombiner. If an allocation instruction 
is only used by a cast, and the casted type is the same size as the original
allocation, it would eliminate the cast by folding it into the allocation.

Unfortunately, it was placing the new allocation instruction right before
the cast, which could pull (for example) alloca instructions into the body
of a function.  This turns statically allocatable allocas into expensive
dynamically allocated allocas, which is bad bad bad.

This fixes the problem by placing the new allocation instruction at the same
place the old one was, duh. :)

llvm-svn: 13289
 2004-04-30 04:37:52 +00:00
Chris Lattner
2d3a7a6ff0 Changes to fix up the inst_iterator to pass to boost iterator checks. This 
patch was graciously contributed by Vladimir Prus.

llvm-svn: 13185
 2004-04-27 15:13:33 +00:00
Chris Lattner
e20c334e65 Instcombine X/-1 --> 0-X 
llvm-svn: 13172
 2004-04-26 14:01:59 +00:00
Chris Lattner
1e9ac1a45e Fix a HUGE pessimization on X86. The indvars pass was taking this 
(familiar) function:

int _strlen(const char *str) {
    int len = 0;
    while (*str++) len++;
    return len;
}

And transforming it to use a ulong induction variable, because the type of
the pointer index was left as a constant long.  This is obviously very bad.

The fix is to shrink long constants in getelementptr instructions to intptr_t,
making the indvars pass insert a uint induction variable, which is much more
efficient.

Here's the before code for this function:

int %_strlen(sbyte* %str) {
entry:
        %tmp.13 = load sbyte* %str              ; <sbyte> [#uses=1]
        %tmp.24 = seteq sbyte %tmp.13, 0                ; <bool> [#uses=1]
        br bool %tmp.24, label %loopexit, label %no_exit

no_exit:                ; preds = %entry, %no_exit
***     %indvar = phi uint [ %indvar.next, %no_exit ], [ 0, %entry ]            ; <uint> [#uses=2]
***     %indvar = phi ulong [ %indvar.next, %no_exit ], [ 0, %entry ]           ; <ulong> [#uses=2]
        %indvar1 = cast ulong %indvar to uint           ; <uint> [#uses=1]
        %inc.02.sum = add uint %indvar1, 1              ; <uint> [#uses=1]
        %inc.0.0 = getelementptr sbyte* %str, uint %inc.02.sum          ; <sbyte*> [#uses=1]
        %tmp.1 = load sbyte* %inc.0.0           ; <sbyte> [#uses=1]
        %tmp.2 = seteq sbyte %tmp.1, 0          ; <bool> [#uses=1]
        %indvar.next = add ulong %indvar, 1             ; <ulong> [#uses=1]
        %indvar.next = add uint %indvar, 1              ; <uint> [#uses=1]
        br bool %tmp.2, label %loopexit.loopexit, label %no_exit

loopexit.loopexit:              ; preds = %no_exit
        %indvar = cast uint %indvar to int              ; <int> [#uses=1]
        %inc.1 = add int %indvar, 1             ; <int> [#uses=1]
        ret int %inc.1

loopexit:               ; preds = %entry
        ret int 0
}


Here's the after code:

int %_strlen(sbyte* %str) {
entry:
        %inc.02 = getelementptr sbyte* %str, uint 1             ; <sbyte*> [#uses=1]
        %tmp.13 = load sbyte* %str              ; <sbyte> [#uses=1]
        %tmp.24 = seteq sbyte %tmp.13, 0                ; <bool> [#uses=1]
        br bool %tmp.24, label %loopexit, label %no_exit

no_exit:                ; preds = %entry, %no_exit
***     %indvar = phi uint [ %indvar.next, %no_exit ], [ 0, %entry ]            ; <uint> [#uses=3]
        %indvar = cast uint %indvar to int              ; <int> [#uses=1]
        %inc.0.0 = getelementptr sbyte* %inc.02, uint %indvar           ; <sbyte*> [#uses=1]
        %inc.1 = add int %indvar, 1             ; <int> [#uses=1]
        %tmp.1 = load sbyte* %inc.0.0           ; <sbyte> [#uses=1]
        %tmp.2 = seteq sbyte %tmp.1, 0          ; <bool> [#uses=1]
        %indvar.next = add uint %indvar, 1              ; <uint> [#uses=1]
        br bool %tmp.2, label %loopexit, label %no_exit

loopexit:               ; preds = %entry, %no_exit
        %len.0.1 = phi int [ 0, %entry ], [ %inc.1, %no_exit ]          ; <int> [#uses=1]
        ret int %len.0.1
}

llvm-svn: 13016
 2004-04-17 18:16:10 +00:00
Chris Lattner
284d3b0311 Fix some really nasty dominance bugs that were exposed by my patch to 
make the verifier more strict.  This fixes building zlib

llvm-svn: 13002
 2004-04-16 18:08:07 +00:00
Chris Lattner
6679e46b59 ADd a trivial instcombine: load null -> null 
llvm-svn: 12940
 2004-04-14 03:28:36 +00:00
Chris Lattner
24cf0200c7 Fix a bug in my select transformation 
llvm-svn: 12826
 2004-04-11 01:39:19 +00:00
Chris Lattner
623fba1107 Implement InstCombine/select.ll:test13* 
llvm-svn: 12821
 2004-04-10 22:21:27 +00:00
Chris Lattner
cf4a996cba Implement InstCombine/add.ll:test20 
Canonicalize add of sign bit constant into a xor

llvm-svn: 12819
 2004-04-10 22:01:55 +00:00
Chris Lattner
f9d9665138 Fix spurious warning in release mode 
llvm-svn: 12816
 2004-04-10 19:15:56 +00:00
Chris Lattner
56e4d3d8ad Implement select.ll:test12* 
This transforms code like this:

   %C = or %A, %B
   %D = select %cond, %C, %A
into:
   %C = select %cond, %B, 0
   %D = or %A, %C

Since B is often a constant, the select can often be eliminated.  In any case,
this reduces the usage count of A, allowing subsequent optimizations to happen.

This xform applies when the operator is any of:
  add, sub, mul, or, xor, and, shl, shr

llvm-svn: 12800
 2004-04-09 23:46:01 +00:00
Chris Lattner
183b336a54 Fold binary operators with a constant operand into select instructions 
that have a constant operand.  This implements
add.ll:test19, shift.ll:test15*, and others that are not tested

llvm-svn: 12794
 2004-04-09 19:05:30 +00:00
Chris Lattner
cf7baf3519 Implement select.ll:test11 
llvm-svn: 12793
 2004-04-09 18:19:44 +00:00
Chris Lattner
e228ee5870 Implement InstCombine/cast-propagate.ll 
llvm-svn: 12784
 2004-04-08 20:39:49 +00:00
Chris Lattner
1c631e813d Implement InstCombine/select.ll:test[7-10] 
llvm-svn: 12769
 2004-04-08 04:43:23 +00:00
Chris Lattner
2b2412d0c8 Implement test/Regression/Transforms/InstCombine/getelementptr_index.ll 
llvm-svn: 12762
 2004-04-07 18:38:20 +00:00
Chris Lattner
4d1fcf1dcd Fix a bug in yesterdays checkins which broke siod. siod is a great testcase! :) 
llvm-svn: 12659
 2004-04-05 16:02:41 +00:00
Chris Lattner
8953b90aaa Fix InstCombine/2004-04-04-InstCombineReplaceAllUsesWith.ll 
llvm-svn: 12658
 2004-04-05 02:10:19 +00:00
Chris Lattner
69193f93b6 Support getelementptr instructions which use uint's to index into structure 
types and can have arbitrary 32- and 64-bit integer types indexing into
sequential types.

llvm-svn: 12653
 2004-04-05 01:30:19 +00:00
Chris Lattner
533bc49775 Implement select.ll:test[3-6] 
llvm-svn: 12544
 2004-03-30 19:37:13 +00:00
Chris Lattner
56b5051428 X % -1 == X % 1 == 0 
llvm-svn: 12520
 2004-03-26 16:11:24 +00:00
Chris Lattner
57c67b06e9 Two changes: 
#1 is to unconditionally strip constantpointerrefs out of
instruction operands where they are absolutely pointless and inhibit
optimization.  GRRR!

#2 is to implement InstCombine/getelementptr_const.ll

llvm-svn: 12519
 2004-03-25 22:59:29 +00:00
Chris Lattner
abb77c9959 Teach the optimizer to delete zero sized alloca's (but not mallocs!) 
llvm-svn: 12507
 2004-03-19 06:08:10 +00:00
Chris Lattner
7d2a539735 Add some debugging output 
Fix InstCombine/2004-03-13-InstCombineInfLoop.ll which caused an infinite
loop compiling (I think) povray.

llvm-svn: 12365
 2004-03-13 23:54:27 +00:00
Chris Lattner
022167f13b Implement sub.ll:test14 
llvm-svn: 12355
 2004-03-13 00:11:49 +00:00
Chris Lattner
92295c5031 Implement InstCombine/sub.ll:test12 & test13 
llvm-svn: 12353
 2004-03-12 23:53:13 +00:00
Chris Lattner
b909e8b0d4 Add trivial optimizations for select instructions 
llvm-svn: 12317
 2004-03-12 05:52:32 +00:00
Chris Lattner
51ea127bf3 Rename AddUsesToWorkList -> AddUsersToWorkList, as that is what it does. 
Create a new AddUsesToWorkList method
optimize memmove/set/cpy of zero bytes to a noop.

llvm-svn: 11941
 2004-02-28 05:22:00 +00:00
Chris Lattner
f3a366062c Turn 'free null' into nothing 
llvm-svn: 11940
 2004-02-28 04:57:37 +00:00
Chris Lattner
4f7accab96 Implement test/Regression/Transforms/InstCombine/canonicalize_branch.ll 
This is a really minor thing, but might help out the 'switch statement induction'
code in simplifycfg.

llvm-svn: 11900
 2004-02-27 06:27:46 +00:00
Chris Lattner
8ee0593f0d Fix a faulty optimization on FP values 
llvm-svn: 11801
 2004-02-24 18:10:14 +00:00
Chris Lattner
ae739aefd7 Generate much more efficient code in programs like pifft 
llvm-svn: 11775
 2004-02-23 21:46:58 +00:00
Chris Lattner
c40b9d7d51 Fix a small typeo in my checkin last night that broke vortex and other programs :( 
llvm-svn: 11774
 2004-02-23 21:46:42 +00:00
Chris Lattner
f5ce254692 Fix InstCombine/2004-02-23-ShiftShiftOverflow.ll 
Also, turn 'shr int %X, 1234' into 'shr int %X, 31'

llvm-svn: 11768
 2004-02-23 20:30:06 +00:00
Chris Lattner
2b55ea38bc Implement cast.ll::test14/15 
llvm-svn: 11742
 2004-02-23 07:16:20 +00:00
Chris Lattner
e79e854c5c Refactor some code. In the mul - setcc folding case, we really care about 
whether this is the sign bit or not, so check unsigned comparisons as well.

llvm-svn: 11740
 2004-02-23 06:38:22 +00:00
Chris Lattner
c8a10c4b6a Implement mul.ll:test11 
llvm-svn: 11737
 2004-02-23 06:00:11 +00:00
Chris Lattner
59611149ee Implement "strength reduction" of X <= C and X >= C 
llvm-svn: 11735
 2004-02-23 05:47:48 +00:00
Chris Lattner
2635b52d4e Implement InstCombine/mul.ll:test10, which is a case that occurs when dealing 
with "predication"

llvm-svn: 11734
 2004-02-23 05:39:21 +00:00
Chris Lattner
8d0bacbb9e Implement Transforms/InstCombine/cast.ll:test13, a case which occurs in a 
hot 164.gzip loop.

llvm-svn: 11702
 2004-02-22 05:25:17 +00:00
Chris Lattner
4db2d22bea Fold PHI nodes of constants which are only used by a single cast. This implements 
phi.ll:test4

llvm-svn: 11494
 2004-02-16 05:07:08 +00:00
Chris Lattner
b36d908f7b Teach LLVM to unravel the "swap idiom". This implements: 
Regression/Transforms/InstCombine/xor.ll:test20

llvm-svn: 11492
 2004-02-16 03:54:20 +00:00
Chris Lattner
c207635fd5 Implement Transforms/InstCombine/xor.ll:test19 
llvm-svn: 11490
 2004-02-16 01:20:27 +00:00
Chris Lattner
76b2ff4ded Adjustments to support the new ConstantAggregateZero class 
llvm-svn: 11474
 2004-02-15 05:55:15 +00:00
Chris Lattner
fae8ab3088 rename the "exceptional" destination of an invoke instruction to the 'unwind' dest 
llvm-svn: 11202
 2004-02-08 21:44:31 +00:00
Chris Lattner
c2f0aa58df Disable (x - (y - z)) => (x + (z - y)) optimization for floating point. 
llvm-svn: 11083
 2004-02-02 20:09:56 +00:00
Chris Lattner
1f7942fe7d Fix InstCombine/2004-01-13-InstCombineInvokePHI.ll, which also fixes lots 
of C++ programs in Shootout-C++, including lists1 and moments, etc

llvm-svn: 10845
 2004-01-14 06:06:08 +00:00