nicolas/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
24,241 Commits 41 Branches 151 Tags
34c901b50e3163ac6c63f609b439bfcab3bb4b5b
Commit Graph

2367 Commits

Author SHA1 Message Date
Chris Lattner
4c065091d8 Add factoring of multiplications, e.g. turning A*A+A*B into A*(A+B). 
Testcase here: Transforms/Reassociate/mulfactor.ll

llvm-svn: 26524
 2006-03-04 09:31:13 +00:00
Chris Lattner
32c01df299 Canonicalize (X+C1)*C2 -> X*C2+C1*C2 
This implements Transforms/InstCombine/add.ll:test31

llvm-svn: 26519
 2006-03-04 06:04:02 +00:00
Chris Lattner
681ef2f083 Change this to work with renamed intrinsics. 
llvm-svn: 26484
 2006-03-03 01:34:17 +00:00
Chris Lattner
ea7986aeca Make this work with renamed intrinsics. 
llvm-svn: 26482
 2006-03-03 01:30:23 +00:00
Chris Lattner
85dda9a2bd Generalize the REM folding code to handle another case Nick Lewycky 
pointed out: realize the AND can provide factors and look through Casts.

llvm-svn: 26469
 2006-03-02 06:50:58 +00:00
Chris Lattner
c5b6c9a12a Fix a regression in a patch from a couple of days ago. This fixes 
Transforms/InstCombine/2006-02-28-Crash.ll

llvm-svn: 26427
 2006-02-28 19:47:20 +00:00
Chris Lattner
b70f141893 Implement rem.ll:test[7-9] and PR712 
llvm-svn: 26415
 2006-02-28 05:49:21 +00:00
Chris Lattner
2a7c7b8bab Simplify some code now that the RHS of a rem can't be 0 
llvm-svn: 26413
 2006-02-28 05:40:55 +00:00
Chris Lattner
0de4a8d7b7 Rearrange some code, fold "rem X, 0", implementing rem.ll:test6 
llvm-svn: 26411
 2006-02-28 05:30:45 +00:00
Chris Lattner
c7bfed0f7b Merge two almost-identical pieces of code. 
Make this code more powerful by using ComputeMaskedBits instead of looking
for an AND operand.  This lets us fold this:

int %test23(int %a) {
        %tmp.1 = and int %a, 1
        %tmp.2 = seteq int %tmp.1, 0
        %tmp.3 = cast bool %tmp.2 to int  ;; xor tmp1, 1
        ret int %tmp.3
}

into: xor (and a, 1), 1
llvm-svn: 26396
 2006-02-27 02:38:23 +00:00
Chris Lattner
f5c8a0b83f Fold (A^B) == A -> B == 0 
and  (A-B) == A  ->  B == 0

llvm-svn: 26394
 2006-02-27 01:44:11 +00:00
Chris Lattner
f78df7c14d Fold (X|C1)^C2 -> X^(C1|C2) when possible. This implements 
InstCombine/or.ll:test23.

llvm-svn: 26385
 2006-02-26 19:57:54 +00:00
Chris Lattner
b580d26e7d Fix a problem that Nate noticed that boils down to an over conservative check 
in the code that does "select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y)))".
We now compile this loop:

LBB1_1: ; no_exit
        add r6, r2, r3
        subf r3, r2, r3
        cmpwi cr0, r2, 0
        addi r7, r5, 4
        lwz r2, 0(r5)
        addi r4, r4, 1
        blt cr0, LBB1_4 ; no_exit
LBB1_3: ; no_exit
        mr r3, r6
LBB1_4: ; no_exit
        cmpwi cr0, r4, 16
        mr r5, r7
        bne cr0, LBB1_1 ; no_exit

into this instead:

LBB1_1: ; no_exit
        srawi r6, r2, 31
        add r2, r2, r6
        xor r6, r2, r6
        addi r7, r5, 4
        lwz r2, 0(r5)
        addi r4, r4, 1
        add r3, r3, r6
        cmpwi cr0, r4, 16
        mr r5, r7
        bne cr0, LBB1_1 ; no_exit

llvm-svn: 26356
 2006-02-24 18:05:58 +00:00
Chris Lattner
e5521db5bc Fix Regression/Transforms/LoopUnswitch/2006-02-22-UnswitchCrash.ll, which 
caused SPASS to fail building last night.

We can't trivially unswitch a loop if the exit block has phi nodes in it,
because we don't know which predecessor to use.

llvm-svn: 26320
 2006-02-22 23:55:00 +00:00
Chris Lattner
8a5a324dac Add some comments, simplify some code, and fix a bug that caused rewriting 
to rewrite with the wrong value.

llvm-svn: 26311
 2006-02-22 06:37:14 +00:00
Chris Lattner
c2e3a7a4ce improved support for branch folding, still not enabled. 
llvm-svn: 26289
 2006-02-18 07:57:38 +00:00
Jeff Cohen
0add83e969 Fix bugs identified by VC++. 
llvm-svn: 26287
 2006-02-18 03:20:33 +00:00
Chris Lattner
19fa8ac938 Implement deletion of dead blocks, currently disabled. 
llvm-svn: 26285
 2006-02-18 02:42:34 +00:00
Chris Lattner
cb853de534 a previous patch completely disabled trivial unswitching, this fixees it. 
Thanks to nate for pointing this out :)

llvm-svn: 26280
 2006-02-18 01:32:04 +00:00
Chris Lattner
29f771ba21 initial trivial support for folding branches that have now-constant destinations. 
llvm-svn: 26279
 2006-02-18 01:27:45 +00:00
Chris Lattner
8e44ff50b0 When unswitching a loop, make sure to update loop info with exit blocks in 
the right loop.

llvm-svn: 26277
 2006-02-18 00:55:32 +00:00
Chris Lattner
d95665188b Fix Transforms/SimplifyCFG/2006-02-17-InfiniteUnroll.ll 
llvm-svn: 26275
 2006-02-18 00:33:17 +00:00
Chris Lattner
baddba41c7 Fix loops where the header has an exit, fixing a loop-unswitch crash on crafty 
llvm-svn: 26258
 2006-02-17 06:39:56 +00:00
Chris Lattner
6fd136239b start of some new simplification code, not thoroughly tested, use at your own 
risk :)

llvm-svn: 26248
 2006-02-17 00:31:07 +00:00
Nate Begeman
8a77efe4f7 Rework the SelectionDAG-based implementations of SimplifyDemandedBits 
and ComputeMaskedBits to match the new improved versions in instcombine.
Tested against all of multisource/benchmarks on ppc.

llvm-svn: 26238
 2006-02-16 21:11:51 +00:00
Chris Lattner
fa335f6083 Change SplitBlock to increment a BasicBlock::iterator, not an Instruction*. Apparently they do different things :) 
This fixes a testcase that nate reduced from spass.

Also included are a couple minor code changes that don't affect the generated
code at all.

llvm-svn: 26235
 2006-02-16 19:36:22 +00:00
Jeff Cohen
55f63f1b53 Fix VC++ warning. 
llvm-svn: 26228
 2006-02-16 04:07:37 +00:00
Chris Lattner
ff42e81028 fix a bug where we unswitched the wrong way 
llvm-svn: 26225
 2006-02-16 01:24:41 +00:00
Chris Lattner
fdff0bb43e Implement trivial unswitching for switch stmts. This allows us to trivial 
unswitch this loop on 2 before sweating to unswitch on 1/3.

void test4(int N, int i, int C, int*P, int*Q) {
  int j;
  for (j = 0; j < N; ++j) {
    switch (C) {                // general unswitching.
    default: P[i+j] = 0; break;
    case 1: Q[i+j] = 0; break;
    case 3: P[i+j] = Q[i+j]; break;
    case 2: break;              //  TRIVIAL UNSWITCH on C==2
    }
  }
}

llvm-svn: 26223
 2006-02-15 22:52:05 +00:00
Chris Lattner
e5cb76d744 make "trivial" unswitching significantly more general. It can now handle 
this for example:

  for (j = 0; j < N; ++j) {     // trivial unswitch
    if (C)
      P[i+j] = 0;
  }

turning it into the obvious code without bothering to duplicate an empty loop.

llvm-svn: 26220
 2006-02-15 22:03:36 +00:00
Andrew Lenharth
47da60130a fix a bunch of alpha regressions. see bug 709 
llvm-svn: 26218
 2006-02-15 21:13:37 +00:00
Chris Lattner
65152d80ec Checking the wrong value. This caused us to emit silly code like 
Y = seteq bool X, true
instead of just using X :)

llvm-svn: 26215
 2006-02-15 19:05:52 +00:00
Chris Lattner
01db04efb0 more refactoring, no functionality change. 
llvm-svn: 26194
 2006-02-15 01:44:42 +00:00
Chris Lattner
b0cbe7106e pull some code out into a function 
llvm-svn: 26191
 2006-02-15 00:07:43 +00:00
Chris Lattner
9c5693fb2a Canonicalize inner loops before outer loops. Inner loop canonicalization 
can provide work for the outer loop to canonicalize.

This fixes a case that breaks unswitching.

llvm-svn: 26189
 2006-02-14 23:06:02 +00:00
Chris Lattner
cffbbee8d1 When splitting exit edges to canonicalize loops, make sure to put the new 
block in the appropriate loop nest.

Third time is the charm, right?

llvm-svn: 26187
 2006-02-14 22:34:08 +00:00
Chris Lattner
0b8ec1a132 Use statistics to keep track of what flavors of loops we are unswitching 
llvm-svn: 26157
 2006-02-14 01:01:41 +00:00
Chris Lattner
8b10ab3002 Implement Instcombine/and.ll:test34 
llvm-svn: 26155
 2006-02-13 23:07:23 +00:00
Chris Lattner
7d8522884b If any of the sign extended bits are demanded, the input sign bit is demanded 
for a sign extension.

This fixes InstCombine/2006-02-13-DemandedMiscompile.ll and Ptrdist/bc.

llvm-svn: 26152
 2006-02-13 22:41:07 +00:00
Chris Lattner
68e7475777 Be careful not to request or look at bits shifted in from outside the size 
of the input.  This fixes the mediabench/gsm/toast failure last night.

llvm-svn: 26138
 2006-02-13 06:09:08 +00:00
Chris Lattner
f5b4ef7f58 remove some more dead special case code 
llvm-svn: 26135
 2006-02-12 08:07:37 +00:00
Chris Lattner
5b2edb1fca Eliminate special case hacks that are superceded by general purpose hacks 
llvm-svn: 26134
 2006-02-12 08:02:11 +00:00
Chris Lattner
ee0f280743 Three changes: 
1. Teach GetConstantInType to handle boolean constants.
2. Teach instcombine to fold (compare X, CST) when X has known 0/1 bits.
   Testcase here: set.ll:test22
3. Improve the "(X >> c1) & C2 == 0" folding code to allow a noop cast
   between the shift and and.  More aggressive bitfolding for other reasons
   was turning signed shr's into unsigned shr's, leaving the noop cast in
   the way.

llvm-svn: 26131
 2006-02-12 02:07:56 +00:00
Chris Lattner
02f53ad3a2 Revert my last patch. It too breaks stuff 
llvm-svn: 26128
 2006-02-12 01:59:10 +00:00
Chris Lattner
35248e06bc Fix for my previously reverted patch 
llvm-svn: 26126
 2006-02-11 21:24:54 +00:00
Chris Lattner
0157e7f55b Port the recent innovations in ComputeMaskedBits to SimplifyDemandedBits. 
This allows us to simplify on conditions where bits are not known, but they
are not demanded either!  This also fixes a couple of bugs in
ComputeMaskedBits that were exposed during this work.

In the future, swaths of instcombine should be removed, as this code
subsumes a bunch of ad-hockery.

llvm-svn: 26122
 2006-02-11 09:31:47 +00:00
Chris Lattner
b24ce3a2a8 revert my previous change, it exposed other problems. 
llvm-svn: 26121
 2006-02-11 08:47:47 +00:00
Chris Lattner
05bf90dddf Make this check stricter. Disallow loop exit blocks from being shared by 
loops and their subloops.

llvm-svn: 26118
 2006-02-11 02:13:17 +00:00
Chris Lattner
a6ae101afa remove dead expr 
llvm-svn: 26116
 2006-02-11 01:43:37 +00:00
Chris Lattner
fbadd7e1ee implement unswitching of loops with switch stmts and selects in them 
llvm-svn: 26114
 2006-02-11 00:43:37 +00:00