RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 19:52:54 +01:00
Code Issues Projects Releases Wiki Activity
54,561 Commits 4 Branches 5 Tags 704 MiB
44573bb42b
Commit Graph

54561 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Nick Lewycky
44573bb42b Oops! Fix bug introduced in my recent cleanup change. Thanks to Tobias Grosser 
for pointing this out.

llvm-svn: 90015
 2009-11-27 19:57:53 +00:00
Chris Lattner
1fc57583fa I accidentally implemented this :) 
llvm-svn: 90014
 2009-11-27 19:56:00 +00:00
Chris Lattner
b1fceb6006 add support for recursive phi translation and phi 
translation of add with immediate.  This allows us
to optimize this function:

void test(int N, double* G) {
  long j;
  G[1] = 1;
    for (j = 1; j < N - 1; j++)
        G[j+1] = G[j] + G[j+1];
}

to only do one load every iteration of the loop.

llvm-svn: 90013
 2009-11-27 19:11:31 +00:00
Chris Lattner
6f124b48c3 add two simple test cases we now optimize (to one load in the loop each) and one we don't (corresponding to the fixme I added yesterday). 
llvm-svn: 90012
 2009-11-27 18:08:30 +00:00
Chris Lattner
bdaed088ea factor some logic out of instcombine into a new SimplifyAddInst method. 
llvm-svn: 90011
 2009-11-27 17:42:22 +00:00
Chris Lattner
0df78ea645 add a deadargelim note. 
llvm-svn: 90009
 2009-11-27 17:12:30 +00:00
Chris Lattner
c0b92ff385 This testcase is actually only partially redundant, and requires 
the FIXME I added yesterday to be implemented.

llvm-svn: 90008
 2009-11-27 16:53:57 +00:00
Chris Lattner
cdfa9dadf1 fix PR5436 by making the 'simple' case of SRoA not promote out of range 
array indexes.  The "complex" case of SRoA still handles them, and correctly.

This fixes a weirdness where we'd correctly avoid transforming A[0][42] if
the 42 was too large, but we'd only do it if it was one gep, not two separate
ones.

llvm-svn: 90007
 2009-11-27 16:37:41 +00:00
Chris Lattner
02211273c7 filecheckize 
llvm-svn: 90006
 2009-11-27 16:31:59 +00:00
Duncan Sands
638c57757d While this test is testing a problem in the generic part of codegen, 
the problem only shows for msp430 and pic16 which is why it specifies
them using -march.  But it is wrong to put such tests in CodeGen/Generic,
since not everyone builds these targets.  Put a copy of the test in each
of the target test directories.

llvm-svn: 90005
 2009-11-27 16:04:14 +00:00
Duncan Sands
d68bde384e Vector types are no longer required to have a power-of-two length. 
llvm-svn: 90004
 2009-11-27 13:38:03 +00:00
Duncan Sands
a255c38866 These code generator limitations have been removed. 
llvm-svn: 90003
 2009-11-27 12:33:22 +00:00
Chris Lattner
c81be8ddba add comment. 
llvm-svn: 90002
 2009-11-27 08:40:14 +00:00
Chris Lattner
af321b5729 reduce nesting, no functionality change. 
llvm-svn: 90001
 2009-11-27 08:37:22 +00:00
Chris Lattner
e7056c8cde limit the recursion depth of GetLinearExpression. This 
fixes a crash analyzing consumer-lame, which had an "%X = add %X, 1"
in unreachable code.

llvm-svn: 90000
 2009-11-27 08:32:52 +00:00
Chris Lattner
a466dbe80a teach GVN's load PRE to insert computations of the address in predecessors 
where it is not available.  It's unclear how to get this inserted 
computation into GVN's scalar availability sets, Owen, help? :)

llvm-svn: 89997
 2009-11-27 08:25:10 +00:00
Chris Lattner
9c8da17055 add some tests for memdep phi translation + PRE. 
llvm-svn: 89996
 2009-11-27 06:42:42 +00:00
Chris Lattner
3e12a00447 this test is failing, and is expected to. 
llvm-svn: 89995
 2009-11-27 06:36:28 +00:00
Chris Lattner
ed6850eb34 filecheckize 
llvm-svn: 89994
 2009-11-27 06:33:09 +00:00
Chris Lattner
479eda6018 rename test. 
llvm-svn: 89993
 2009-11-27 06:31:55 +00:00
Chris Lattner
0971e6da1f Fix phi translation in load PRE to agree with the phi 
translation done by memdep, and reenable gep translation 
again.

llvm-svn: 89992
 2009-11-27 06:31:14 +00:00
Chris Lattner
16ee3226ce redisable this, my bootstrap worked because it wasn't an optimized build, whoops. 
llvm-svn: 89991
 2009-11-27 05:53:01 +00:00
Chris Lattner
ea3b1f2186 try again. 
llvm-svn: 89990
 2009-11-27 05:19:56 +00:00
Chris Lattner
895214c65e this is causing buildbot failures, disable for now. 
llvm-svn: 89985
 2009-11-27 01:52:22 +00:00
Chris Lattner
225a88f4ab this (and probably several others) are now done. 
llvm-svn: 89982
 2009-11-27 00:35:04 +00:00
Chris Lattner
02ffb0a608 teach phi translation of GEPs to simplify geps like 'gep x, 0'. 
This allows us to compile the example from PR5313 into:

LBB1_2:                                                     ## %bb
	incl	%ecx
	movb	%al, (%rsi)
	movslq	%ecx, %rax
	movb	(%rdi,%rax), %al
	testb	%al, %al
	jne	LBB1_2

instead of:

LBB1_2:                                                     ## %bb
	movslq	%eax, %rcx
	incl	%eax
	movb	(%rdi,%rcx), %cl
	movb	%cl, (%rsi)
	movslq	%eax, %rcx
	cmpb	$0, (%rdi,%rcx)
	jne	LBB1_2

llvm-svn: 89981
 2009-11-27 00:34:38 +00:00
Chris Lattner
6611a6f733 factor some instcombine simplifications for getelementptr out to a new 
SimplifyGEPInst method in InstructionSimplify.h.  No functionality change.

llvm-svn: 89980
 2009-11-27 00:29:05 +00:00
Chris Lattner
4810fa619f teach memdep to do trivial PHI translation of GEPs. More to 
come.

llvm-svn: 89979
 2009-11-27 00:07:37 +00:00
Chris Lattner
4824ebfded Teach memdep to phi translate bitcasts. This allows us to compile 
the example in GCC PR16799 to:

LBB1_2:                                                     ## %bb1
	movl	%eax, %eax
	subq	%rax, %rdi
	movq	%rdi, (%rcx)
	movl	(%rdi), %eax
	testl	%eax, %eax
	je	LBB1_2

instead of:

LBB1_2:                                                     ## %bb1
	movl	(%rdi), %ecx
	subq	%rcx, %rdi
	movq	%rdi, (%rax)
	cmpl	$0, (%rdi)
	je	LBB1_2

llvm-svn: 89978
 2009-11-26 23:41:07 +00:00
Chris Lattner
4bf628a9ba convert to filecheck 
llvm-svn: 89977
 2009-11-26 23:32:59 +00:00
Nick Lewycky
c0a516186a Fix typo spotted by Gabor Greif. 
llvm-svn: 89976
 2009-11-26 23:19:05 +00:00
Chris Lattner
5020bb83d7 factor some code out into some helper functions. 
llvm-svn: 89975
 2009-11-26 23:18:49 +00:00
Nick Lewycky
07c3eb54a4 Clean up file, no functionality change. 
llvm-svn: 89974
 2009-11-26 22:54:26 +00:00
Chris Lattner
15482aa384 Add a hack for PR5601, a crash on obsolete syntax that we plan to 
remove in LLVM 3.0

llvm-svn: 89973
 2009-11-26 22:48:23 +00:00
Chris Lattner
e949f49b23 fix crash on Transforms/InstCombine/intrinsics.ll introduced by r89970 
llvm-svn: 89972
 2009-11-26 22:08:06 +00:00
Chris Lattner
cf7665b0c8 Fix PR5471 by removing an instcombine xform. Some pieces of the code 
generates store to undef and some generates store to null as the idiom
for undefined behavior.  Since simplifycfg zaps both, don't remove the
undefined behavior in instcombine.

llvm-svn: 89971
 2009-11-26 22:04:42 +00:00
Chris Lattner
08e20f453d implement a bunch of xforms for overflow intrinsics, based on a patch 
by Alastair Lynn.

llvm-svn: 89970
 2009-11-26 21:42:47 +00:00
Bob Wilson
c029183683 Rename new TailDuplicationPass to avoid name conflict with the old one. 
llvm-svn: 89968
 2009-11-26 21:38:41 +00:00
Chris Lattner
911e5047d0 @test9 is a testcase for r89958. Before 89958, we misanalyzed the 
first expression as P+4+4*i which we considered to possibly alias
P+4*j.  Now we correctly analyze the former one as P+1+4*i.

@test10 is a sanity test that verfies that we know that P+4+4*i != P+4*i.

llvm-svn: 89960
 2009-11-26 19:25:46 +00:00
Chris Lattner
ce573daf09 Implement PR1143 (at -m64) by making basicaa look through extensions. We 
previously already handled it at -m32 because there were no i32->i64 
extensions for addressing.

llvm-svn: 89959
 2009-11-26 18:53:33 +00:00
Chris Lattner
a403a7eddc fix two transposed lines duncan caught and add an explanatory comment. 
llvm-svn: 89958
 2009-11-26 18:35:46 +00:00
Chris Lattner
f7a0da351e this todo is resolved. 
llvm-svn: 89957
 2009-11-26 17:14:10 +00:00
Chris Lattner
2178a80b90 move DecomposeGEPExpression out into ValueTracking.cpp 
llvm-svn: 89956
 2009-11-26 17:12:50 +00:00
Chris Lattner
d86a693b70 teach GetLinearExpression to be a bit more aggressive. 
llvm-svn: 89955
 2009-11-26 17:00:01 +00:00
Chris Lattner
62a36a703c resolve a fixme. I haven't figured out how to write a testcase 
to exercise this though.

llvm-svn: 89954
 2009-11-26 16:52:32 +00:00
Chris Lattner
993cb8c911 update status of this. basicaa is much improved now, 
only missing the one form (in this testcase).  Dan, do you
consider this example to be important?

llvm-svn: 89953
 2009-11-26 16:42:00 +00:00
Chris Lattner
9c88c96b3f Teach basicaa that x|c == x+c when the c bits of x are clear. This 
allows us to compile the example in readme.txt into:

LBB1_1:                                                     ## %bb
	movl	4(%rdx,%rax), %ecx
	movl	%ecx, %esi
	imull	(%rdx,%rax), %esi
	imull	%esi, %ecx
	movl	%esi, 8(%rdx,%rax)
	imull	%ecx, %esi
	movl	%ecx, 12(%rdx,%rax)
	movl	%esi, 16(%rdx,%rax)
	imull	%ecx, %esi
	movl	%esi, 20(%rdx,%rax)
	addq	$16, %rax
	cmpq	$4000, %rax
	jne	LBB1_1

instead of:

LBB1_1: 
	movl	(%rdx,%rax), %ecx
	imull	4(%rdx,%rax), %ecx
	movl	%ecx, 8(%rdx,%rax)
	imull	4(%rdx,%rax), %ecx
	movl	%ecx, 12(%rdx,%rax)
	imull	8(%rdx,%rax), %ecx
	movl	%ecx, 16(%rdx,%rax)
	imull	12(%rdx,%rax), %ecx
	movl	%ecx, 20(%rdx,%rax)
	addq	$16, %rax
	cmpq	$4000, %rax
	jne	LBB1_1

GCC (4.2) doesn't seem to be able to eliminate the loads in this 
testcase either, it generates:

L2:
	movl	(%rdx), %eax
	imull	4(%rdx), %eax
	movl	%eax, 8(%rdx)
	imull	4(%rdx), %eax
	movl	%eax, 12(%rdx)
	imull	8(%rdx), %eax
	movl	%eax, 16(%rdx)
	imull	12(%rdx), %eax
	movl	%eax, 20(%rdx)
	addl	$4, %ecx
	addq	$16, %rdx
	cmpl	$1002, %ecx
	jne	L2

llvm-svn: 89952
 2009-11-26 16:26:43 +00:00
Chris Lattner
677b93d4c8 teach basicaa that A[i] != A[i+1]. 
llvm-svn: 89951
 2009-11-26 16:18:10 +00:00
Chris Lattner
82257f0385 rename test 
llvm-svn: 89950
 2009-11-26 16:08:41 +00:00
Chris Lattner
69e59e50f3 Change the other half of aliasGEP (which handles GEP differencing) to use DecomposeGEPExpression. This dramatically simplifies and shrinks the code by eliminating the horrible CheckGEPInstructions method, fixes a miscompilation (@test3) and makes the code more aggressive. In particular, we now handle the @test4 case, which is reduced from the SmallPtrSet constructor. Missing this caused us to emit a variable length memset instead of a fixed size one. 
llvm-svn: 89922
 2009-11-26 02:17:34 +00:00