RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-23 13:02:52 +02:00
Code Issues Projects Releases Wiki Activity
27,945 Commits 4 Branches 5 Tags 704 MiB
035ac3b7e4
Commit Graph

2651 Commits

Author SHA1 Message Date
Jeff Cohen
f99052befb Unbreak VC++ build. 
llvm-svn: 32113
 2006-12-02 02:22:01 +00:00
Chris Lattner
1629b0d995 disable transformations that are invalid for fp vectors. This fixes 
Transforms/InstCombine/2006-12-01-BadFPVectorXform.ll

llvm-svn: 32112
 2006-12-02 00:13:08 +00:00
Reid Spencer
529fb41272 Remove 4 FIXMEs to hack around cast-to-bool problems which no longer exist. 
llvm-svn: 32051
 2006-11-30 23:13:36 +00:00
Chris Lattner
f3806f1c16 make it clear that this is always a zext 
llvm-svn: 32044
 2006-11-30 17:35:08 +00:00
Chris Lattner
affa9441cd One more bugfix, 3 cases of making casts explicit. 
llvm-svn: 32043
 2006-11-30 17:32:29 +00:00
Chris Lattner
0b4753a96c Fix a bug in globalopt due to the recent cast patch. 
llvm-svn: 32042
 2006-11-30 17:26:08 +00:00
Chris Lattner
2fd5719f50 implement cast.ll:test35. With this, we recognize: 
unsigned short swp(unsigned short a) {
       return ((a & 0xff00) >> 8 | (a & 0x00ff) << 8);
}

as an idiom for bswap.

llvm-svn: 32011
 2006-11-29 07:18:39 +00:00
Chris Lattner
03fdea2e74 Teach instcombine to turn trunc(srl x, c) -> srl (trunc(x), c) when safe. 
This implements InstCombine/cast.ll:test34.  It fires hundreds of times on
176.gcc.

llvm-svn: 32009
 2006-11-29 07:04:07 +00:00
Chris Lattner
0409f2c48d Implement Regression/Transforms/InstCombine/bswap-fold.ll, 
folding   seteq (bswap(x)), c -> seteq(x,bswap(c))

llvm-svn: 32006
 2006-11-29 05:02:16 +00:00
Reid Spencer
a866877d2f Join a split line. 
llvm-svn: 31996
 2006-11-29 01:11:01 +00:00
Reid Spencer
c48fe0fd4d Undo the last patch until 253.perlbmk passes with these changes. 
llvm-svn: 31977
 2006-11-28 20:23:51 +00:00
Reid Spencer
8587322e79 Remove 4 FIXME's from the CAST patch now that the back end is correctly 
producing code for "trunc to bool". This passes all tests on Linux.

llvm-svn: 31963
 2006-11-28 07:23:01 +00:00
Chris Lattner
b391cbb939 Fix PR1014 and InstCombine/2006-11-27-XorBug.ll. 
llvm-svn: 31941
 2006-11-27 19:55:07 +00:00
Reid Spencer
992d9788b3 For PR950: 
The long awaited CAST patch. This introduces 12 new instructions into LLVM
to replace the cast instruction. Corresponding changes throughout LLVM are
provided. This passes llvm-test, llvm/test, and SPEC CPUINT2000 with the
exception of 175.vpr which fails only on a slight floating point output
difference.

llvm-svn: 31931
 2006-11-27 01:05:10 +00:00
Bill Wendling
999f49061f Remove #include <iostream> and use llvm_* streams instead. 
llvm-svn: 31925
 2006-11-26 10:17:54 +00:00
Bill Wendling
5c13d56f78 Replace #include <iostream> with llvm_* streams. 
llvm-svn: 31924
 2006-11-26 10:02:32 +00:00
Bill Wendling
1b3a86000a Removed #include <iostream> and replaced with llvm_* streams. 
llvm-svn: 31923
 2006-11-26 09:46:52 +00:00
Bill Wendling
f2fadcee85 Removed #include <iostream> and used the llvm_cerr/DOUT streams instead. 
llvm-svn: 31922
 2006-11-26 09:17:06 +00:00
Nick Lewycky
cd25e651c2 Update to new predicate simplifier VRP design. Fixes PR966 and PR967. 
Remove predicate simplifier from default gcc3 pipeline. New design is too
slow to enable by default.
Add new testcases for problems encountered in development.

llvm-svn: 31895
 2006-11-22 23:49:16 +00:00
Chris Lattner
632c66b8ef This xform is handled by FoldOpIntoPhi in visitCastInst in a more elegant way. 
llvm-svn: 31889
 2006-11-21 17:05:13 +00:00
Chris Lattner
cdb67482da Do not convert massive blocks on phi nodes into select statements. Instead 
only do these transformations if there are a small number of phi's.
This speeds up Ptrdist/ks from 2.35s to 2.19s on my mac pro.

llvm-svn: 31853
 2006-11-18 19:19:36 +00:00
Chris Lattner
cc4df7e0ab If an indvar with a variable stride is used by the exit condition, go ahead 
and handle it like constant stride vars.  This fixes some bad codegen in
variable stride cases.  For example, it compiles this:

void foo(int k, int i) {
  for (k=i+i; k <= 8192; k+=i)
    flags2[k] = 0;
}

to:

LBB1_1: #bb.preheader
        movl %eax, %ecx
        addl %ecx, %ecx
        movl L_flags2$non_lazy_ptr, %edx
LBB1_2: #bb
        movb $0, (%edx,%ecx)
        addl %eax, %ecx
        cmpl $8192, %ecx
        jle LBB1_2      #bb
LBB1_5: #return
        ret

or (if the array is local and we are in dynamic-nonpic or static mode):

LBB3_2: #bb
        movb $0, _flags2(%ecx)
        addl %eax, %ecx
        cmpl $8192, %ecx
        jle LBB3_2      #bb

and:

        lis r2, ha16(L_flags2$non_lazy_ptr)
        lwz r2, lo16(L_flags2$non_lazy_ptr)(r2)
        slwi r3, r4, 1
LBB1_2: ;bb
        li r5, 0
        add r6, r4, r3
        stbx r5, r2, r3
        cmpwi cr0, r6, 8192
        bgt cr0, LBB1_5 ;return

instead of:

        leal (%eax,%eax,2), %ecx
        movl %eax, %edx
        addl %edx, %edx
        addl L_flags2$non_lazy_ptr, %edx
        xorl %esi, %esi
LBB1_2: #bb
        movb $0, (%edx,%esi)
        movl %eax, %edi
        addl %esi, %edi
        addl %ecx, %esi
        cmpl $8192, %esi
        jg LBB1_5       #return

and:

        lis r2, ha16(L_flags2$non_lazy_ptr)
        lwz r2, lo16(L_flags2$non_lazy_ptr)(r2)
        mulli r3, r4, 3
        slwi r5, r4, 1
        li r6, 0
        add r2, r2, r5
LBB1_2: ;bb
        li r5, 0
        add r7, r3, r6
        stbx r5, r2, r6
        add r6, r4, r6
        cmpwi cr0, r7, 8192
        ble cr0, LBB1_2 ;bb

This speeds up Benchmarks/Shootout/sieve from 8.533s to 6.464s and
implements LoopStrengthReduce/var_stride_used_by_compare.ll

llvm-svn: 31809
 2006-11-17 06:17:33 +00:00
Chris Lattner
0a2d29b345 Fix a gcc 4.2 warning. 
llvm-svn: 31751
 2006-11-15 04:53:24 +00:00
Chris Lattner
0114b0c20e implement InstCombine/shift-simplify.ll by transforming: 
(X >> Z) op (Y >> Z)  -> (X op Y) >> Z

for all shifts and all ops={and/or/xor}.

llvm-svn: 31729
 2006-11-14 07:46:50 +00:00
Chris Lattner
616335f272 implement InstCombine/and-compare.ll:test1. This compiles: 
typedef struct { unsigned prefix : 4; unsigned code : 4; unsigned unsigned_p : 4; } tree_common;
int foo(tree_common *a, tree_common *b) { return a->code == b->code; }

into:

_foo:
        movl 4(%esp), %eax
        movl 8(%esp), %ecx
        movl (%eax), %eax
        xorl (%ecx), %eax
        # TRUNCATE movb %al, %al
        shrb $4, %al
        testb %al, %al
        sete %al
        movzbl %al, %eax
        ret

instead of:

_foo:
        movl 8(%esp), %eax
        movb (%eax), %al
        shrb $4, %al
        movl 4(%esp), %ecx
        movb (%ecx), %cl
        shrb $4, %cl
        cmpb %al, %cl
        sete %al
        movzbl %al, %eax
        ret

saving one cycle by eliminating a shift.

llvm-svn: 31727
 2006-11-14 06:06:06 +00:00
Chris Lattner
65a873caa2 Fix InstCombine/2006-11-10-ashr-miscompile.ll a miscompilation introduced 
by the shr -> [al]shr patch.  This was reduced from 176.gcc.

llvm-svn: 31653
 2006-11-10 23:38:52 +00:00
Chris Lattner
4e6c828296 second patch to fix PR992/993. 
llvm-svn: 31610
 2006-11-09 23:36:08 +00:00
Chris Lattner
23d3dac40a Minimal patch to fix PR992/PR993 
llvm-svn: 31608
 2006-11-09 23:17:45 +00:00
Chris Lattner
cd3c5f59e2 Teach ShrinkDemandedConstant how to handle X+C. This implements: 
add.ll:test33, add.ll:test34, shift-sra.ll:test2

llvm-svn: 31586
 2006-11-09 05:12:27 +00:00
Chris Lattner
d1bcd014a8 reenable factoring of GEP expressions, being more precise about the 
case that it bad to do.

llvm-svn: 31563
 2006-11-08 19:42:28 +00:00
Chris Lattner
77e0e67f23 make this code more efficient by not creating a phi node we are just going to 
delete in the first place.  This also makes it simpler.

llvm-svn: 31562
 2006-11-08 19:29:23 +00:00
Jim Laskey
28fec74f1b Remove redundant <cmath>. 
llvm-svn: 31561
 2006-11-08 19:16:44 +00:00
Chris Lattner
f2cd0aeced disable this factoring optzn for GEPs for now, this severely pessimizes some 
loops.

llvm-svn: 31560
 2006-11-08 18:49:31 +00:00
Reid Spencer
da1f5b882a For PR950: 
This patch converts the old SHR instruction into two instructions,
AShr (Arithmetic) and LShr (Logical). The Shr instructions now are not
dependent on the sign of their operands.

llvm-svn: 31542
 2006-11-08 06:47:33 +00:00
Chris Lattner
924b2b109f scalarrepl should not split the two elements of the vsiidx array: 
int func(vFloat v0, vFloat v1) {
        int ii;
        vSInt32 vsiidx[2];
        vsiidx[0] = _mm_cvttps_epi32(v0);
        vsiidx[1] = _mm_cvttps_epi32(v1);
        ii = ((int *) vsiidx)[4];
        return ii;
}

This fixes Transforms/ScalarRepl/2006-11-07-InvalidArrayPromote.ll

llvm-svn: 31524
 2006-11-07 22:42:47 +00:00
Jeff Cohen
e1003da1a2 Unbreak VC++ build. 
llvm-svn: 31464
 2006-11-05 19:31:28 +00:00
Nick Lewycky
8b17d79f5e Remove commented line from earlier debugging. 
llvm-svn: 31460
 2006-11-05 14:19:40 +00:00
Andrew Lenharth
c2f822392c The wrong parameter was being tested to deturmine i32 vs i64 
llvm-svn: 31431
 2006-11-03 22:45:50 +00:00
Chris Lattner
8f8a1ed82e remove dead code 
llvm-svn: 31398
 2006-11-03 01:34:58 +00:00
Reid Spencer
4bafa71dc1 For PR786: 
Turn on -Wunused and -Wno-unused-parameter. Clean up most of the resulting
fall out by removing unused variables. Remaining warnings have to do with
unused functions (I didn't want to delete code without review) and unused
variables in generated code. Maintainers should clean up the remaining
issues when they see them. All changes pass DejaGnu tests and Olden.

llvm-svn: 31380
 2006-11-02 20:25:50 +00:00
Reid Spencer
1abf69e923 For PR950: 
Replace the REM instruction with UREM, SREM and FREM.

llvm-svn: 31369
 2006-11-02 01:53:59 +00:00
Devang Patel
ae6d81559a There can be more than one PHINode at the start of the block. 
llvm-svn: 31362
 2006-11-01 23:04:45 +00:00
Devang Patel
3f3161cee2 Handle PHINode with only one incoming value. 
This fixes http://llvm.org/bugs/show_bug.cgi?id=979

llvm-svn: 31358
 2006-11-01 22:26:43 +00:00
Chris Lattner
953b8e6f7d Fix GlobalOpt/2006-11-01-ShrinkGlobalPhiCrash.ll and McGill/chomp 
llvm-svn: 31352
 2006-11-01 18:03:33 +00:00
Chris Lattner
2cedfa5156 Factor gep instructions through phi nodes. 
llvm-svn: 31346
 2006-11-01 07:43:41 +00:00
Chris Lattner
61ea2af8fe Turn a phi of many loads into a phi of the address and a single load of the 
result.  This can significantly shrink code and exposes identities more
aggressively.

llvm-svn: 31344
 2006-11-01 07:13:54 +00:00
Chris Lattner
e43c3b1681 Fix a bug in the previous patch 
llvm-svn: 31342
 2006-11-01 04:55:47 +00:00
Chris Lattner
7211110992 Fold things like "phi [add (a,b), add(c,d)]" into two phi's and one add. 
This triggers thousands of times on multisource.

llvm-svn: 31341
 2006-11-01 04:51:18 +00:00
Chris Lattner
3b7a9fa472 generalize the fix for PR977 to also fix 
Transforms/LCSSA/2006-10-31-UnreachableBlock-2.ll

llvm-svn: 31317
 2006-10-31 18:56:48 +00:00
Chris Lattner
79daf6ae80 Fix PR977 and Transforms/LCSSA/2006-10-31-UnreachableBlock.ll 
llvm-svn: 31315
 2006-10-31 17:52:18 +00:00