RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-19 11:02:59 +02:00
Code Issues Projects Releases Wiki Activity
54,635 Commits 4 Branches 5 Tags 704 MiB
bfde3ae3d4
Commit Graph

1408 Commits

Author SHA1 Message Date
Chris Lattner
ec294dac55 minimize this a bit more. 
llvm-svn: 90216
 2009-12-01 07:30:01 +00:00
Chris Lattner
7323159b21 merge 2009-11-29-ReverseMap.ll into crash.ll 
llvm-svn: 90212
 2009-12-01 06:22:10 +00:00
Chris Lattner
7c0c90df97 fix PR5640 by tracking whether a block is the header of a loop more 
precisely, which prevents us from infinitely peeling the loop.

llvm-svn: 90211
 2009-12-01 06:04:43 +00:00
Nick Lewycky
51b973c964 Add a testcase for the current llvm-gcc build failure. 
llvm-svn: 90112
 2009-11-30 07:02:18 +00:00
Nick Lewycky
116b145b02 Teach ConstantFolding to do a better job when folding gep(bitcast). 
This permits the devirtualization of llvm.org/PR3100#c9 when compiled by clang.

llvm-svn: 90099
 2009-11-29 21:40:55 +00:00
Chris Lattner
cd6fed25d5 add testcases for the foo_with_overflow op xforms added recently and 
fix bugs exposed by the tests.  Testcases from Alastair Lynn!

llvm-svn: 90056
 2009-11-29 02:57:29 +00:00
Chris Lattner
5b1941cafb add PR# 
llvm-svn: 90049
 2009-11-29 01:28:58 +00:00
Chris Lattner
8ba0b842a2 Add a testcase for: 
void test(int N, double* G) {
  long j;
  for (j = 1; j < N - 1; j++)
      G[j] = G[j] + G[j+1] + G[j-1];
}

which we now compile to one load in the loop:

LBB1_2:                                                     ## %bb
	movsd	16(%rsi,%rax,8), %xmm2
	incq	%rdx
	addsd	%xmm2, %xmm1
	addsd	%xmm1, %xmm0
	movapd	%xmm2, %xmm1
	movsd	%xmm0, 8(%rsi,%rax,8)
	incq	%rax
	cmpq	%rcx, %rax
	jne	LBB1_2

instead of:

LBB1_2:                                                     ## %bb
	movsd	8(%rsi,%rax,8), %xmm0
	addsd	16(%rsi,%rax,8), %xmm0
	addsd	(%rsi,%rax,8), %xmm0
	movsd	%xmm0, 8(%rsi,%rax,8)
	incq	%rax
	cmpq	%rcx, %rax
	jne	LBB1_2

llvm-svn: 90048
 2009-11-29 01:15:43 +00:00
Chris Lattner
e7dbdc6a7e add a testcase for 
void test9(int N, double* G) {
  long j;
  for (j = 1; j < N - 1; j++)
      G[j+1] = G[j] + G[j+1];
}

llvm-svn: 90047
 2009-11-29 01:04:40 +00:00
Chris Lattner
d48ff7ea6a Implement PR5634. 
llvm-svn: 90046
 2009-11-29 00:51:17 +00:00
Nick Lewycky
ff44d9d88a Teach memdep to look for memory use intrinsics during dependency queries. Fixes 
PR5574.

llvm-svn: 90045
 2009-11-28 21:27:49 +00:00
Chris Lattner
83284453a1 reenable load address insertion in load pre. This allows us to 
handle cases like this:
void test(int N, double* G) {
  long j;
  for (j = 1; j < N - 1; j++)
      G[j+1] = G[j] + G[j+1];
}

where G[1] isn't live into the loop.

llvm-svn: 90041
 2009-11-28 16:08:18 +00:00
Chris Lattner
f825d5d176 implement a FIXME: limit the depth that DecomposeGEPExpression goes the same 
way that getUnderlyingObject does it. 

This fixes the 'DecomposeGEPExpression and getUnderlyingObject disagree!' 
assertion on sqlite3.

llvm-svn: 90038
 2009-11-28 15:12:41 +00:00
Chris Lattner
f3e5cbfc99 disable value insertion for now, I need to figure out how 
to inform GVN about the newly inserted values.  This fixes 
PR5631.

llvm-svn: 90022
 2009-11-27 22:50:07 +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
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
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
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
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
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
Edward O'Callaghan
4b197b8908 Reverting patch in revision 89758, initial attempt at fixing PR5373 has proven to be bogus. 
llvm-svn: 89844
 2009-11-25 05:38:41 +00:00
Edward O'Callaghan
8c1cd4fdbc Fix for PR5373, Credit to Jakub Staszak. 
llvm-svn: 89758
 2009-11-24 11:51:52 +00:00
Dan Gohman
58bb87921b Make ConstantFoldConstantExpression recursively visit the entire 
ConstantExpr, not just the top-level operator. This allows it to
fold many more constants.

Also, make GlobalOpt call ConstantFoldConstantExpression on
GlobalVariable initializers.

llvm-svn: 89659
 2009-11-23 16:22:21 +00:00
Dan Gohman
0ef3e7cf76 Fix a use of an invalidated iterator in the case where there are multiple 
adjacent uses of a dead basic block from the same user. This fixes PR5596.

llvm-svn: 89658
 2009-11-23 16:13:39 +00:00
Nick Lewycky
9d1ee635e3 Reapply r88830 with a bugfix: this transform only applies to icmp eq/ne. This 
fixes part of PR5438.

llvm-svn: 89639
 2009-11-23 03:17:33 +00:00
Dan Gohman
d115107ef2 Make Loop::getLoopLatch() work on loops which don't have preheaders, as 
it may be used in contexts where preheader insertion may have failed due
to an indirectbr.

Make LoopSimplify's LoopSimplify::SeparateNestedLoop properly fail in
the case that it would require splitting an indirectbr edge.

These fix PR5502.

llvm-svn: 89484
 2009-11-20 20:51:18 +00:00
Dan Gohman
94cca19d9d Fix IPSCCP's code for deleting dead blocks to tolerate outstanding 
blockaddress users. This fixes PR5569.

llvm-svn: 89483
 2009-11-20 20:19:14 +00:00
Benjamin Kramer
8be7ccec51 Try to work around grep's "Binary file (standard input) matches" complaints seen 
on ppc buildbot.

llvm-svn: 89452
 2009-11-20 09:53:25 +00:00
Dan Gohman
9f19d60c14 Teach getSmallConstantTripMultiple about Shl operators. 
llvm-svn: 89426
 2009-11-20 01:09:34 +00:00
Dan Gohman
44ddc50043 Extend CaptureTracking to indicate when a value is never stored, even 
if it is not ultimately captured. Teach BasicAliasAnalysis that a 
local object address which does not escape and is never stored does
not alias with a value resulting from a load.

llvm-svn: 89398
 2009-11-19 21:57:48 +00:00
Dan Gohman
026230b0a9 Enable hoisting of loads from constant memory by default. In cases where 
they are lowered to instruction sequences more complex than a simple
load, such that CodeGen cannot rematerialize them, a reload from a
spill slot is likely to be cheaper than the complex sequence.

llvm-svn: 89374
 2009-11-19 19:00:10 +00:00
Evan Cheng
aaa58b7653 Generalize OptimizeLoopTermCond to optimize more loop terminating icmp to use postinc iv. 
llvm-svn: 89116
 2009-11-17 18:10:11 +00:00
Nick Lewycky
f05946faff Revert r88830 and r88831 which appear to have caused a selfhost buildbot some 
grief. I suspect this patch merely exposed a bug else.

llvm-svn: 88841
 2009-11-15 07:47:32 +00:00
Nick Lewycky
62f00c17eb Correct typo. 
llvm-svn: 88831
 2009-11-15 06:16:57 +00:00
Nick Lewycky
14a2122db3 Teach instcombine to look for booleans in wider integers when it encounters a 
zext(icmp). It may be able to optimize that away. This fixes one of the cases
in PR5438.

llvm-svn: 88830
 2009-11-15 05:55:17 +00:00
Nick Lewycky
fba1efd298 Teach BasicAA that a constant expression can't alias memory provably not 
allocated until runtime (such as an alloca). Patch by Hans Wennborg!

llvm-svn: 88760
 2009-11-14 06:15:14 +00:00
Gabor Greif
15afbc8fa9 typo 
llvm-svn: 86980
 2009-11-12 09:44:17 +00:00