RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 03:33:20 +01:00
Code Issues Projects Releases Wiki Activity
64,653 Commits 4 Branches 5 Tags 704 MiB
e389929186
Commit Graph

1870 Commits

Author SHA1 Message Date
Chris Lattner
8729e47b8f fix PR8144, a bug where constant merge would merge globals marked 
attribute(used).

llvm-svn: 113911
 2010-09-15 00:30:11 +00:00
Owen Anderson
788b93febd Remove dead option from tests. 
llvm-svn: 113855
 2010-09-14 21:03:40 +00:00
Chris Lattner
0718ff9be2 fix PR8102, a case where we'd copyValue from a value that we already 
deleted.  Fix this by doing the copyValue's before we delete stuff!

The testcase only repros the problem on my system with valgrind.

llvm-svn: 113820
 2010-09-14 00:19:00 +00:00
Owen Anderson
e305c119b9 Add a reduced testcase for the infinite loop fixed in r113763. 
llvm-svn: 113770
 2010-09-13 18:28:40 +00:00
Owen Anderson
9c34a7831d Re-apply r113679, which was reverted in r113720, which added a paid of new instcombine transforms 
to expose greater opportunities for store narrowing in codegen.  This patch fixes a potential
infinite loop in instcombine caused by one of the introduced transforms being overly aggressive.

llvm-svn: 113763
 2010-09-13 17:59:27 +00:00
Eric Christopher
d4aaabfa74 Revert 113679, it was causing an infinite loop in a testcase that I've sent 
on to Owen.

llvm-svn: 113720
 2010-09-12 06:09:23 +00:00
Owen Anderson
d4ebde12ce Invert and-of-or into or-of-and when doing so would allow us to clear bits of the and's mask. 
This can result in increased opportunities for store narrowing in code generation.  Update a number of
tests for this change.  This fixes <rdar://problem/8285027>.

Additionally, because this inverts the order of ors and ands, some patterns for optimizing or-of-and-of-or
no longer fire in instances where they did originally.  Add a simple transform which recaptures most of these
opportunities: if we have an or-of-constant-or and have failed to fold away the inner or, commute the order 
of the two ors, to give the non-constant or a chance for simplification instead.

llvm-svn: 113679
 2010-09-11 05:48:06 +00:00
Benjamin Kramer
6110efbf8c Teach InstructionSimplify to fold (A & B) & A -> A & B and (A | B) | A -> A | B. 
Reassociate does this but it doesn't catch all cases (e.g. if the operands are i1).

llvm-svn: 113651
 2010-09-10 22:39:55 +00:00
Owen Anderson
db6a08beef Revert r113439, which relaxed the requirement that loops containing calls cannot be unrolled. After some discussion, 
there seems to be a better way to achieve the same effect.

llvm-svn: 113528
 2010-09-09 20:02:23 +00:00
Owen Anderson
956afdd1f2 Relax the "don't unroll loops containing calls" rule. Instead, when a loop contains a call, lower the 
unrolling threshold to the optimize-for-size threshold.  Basically, for loops containing calls, unrolling
can still be profitable as long as the loop is REALLY small.

llvm-svn: 113439
 2010-09-08 23:10:07 +00:00
Owen Anderson
c51d7d1a8d Generalize instcombine's support for combining multiple bit checks into a single test. Patch by Dirk Steinke! 
llvm-svn: 113423
 2010-09-08 22:16:17 +00:00
Chris Lattner
a58a97dafc Fix a serious performance regression introduced by r108687 on linux: 
turning (fptrunc (sqrt (fpext x))) -> (sqrtf x)  is great, but we have
to delete the original sqrt as well.  Not doing so causes us to do 
two sqrt's when building with -fmath-errno (the default on linux).

llvm-svn: 113260
 2010-09-07 20:01:38 +00:00
Chris Lattner
f2534b401f rename test. 
llvm-svn: 113257
 2010-09-07 19:57:06 +00:00
Chris Lattner
6e6a535055 fix PR8067, an over-aggressive assertion in LICM. 
llvm-svn: 113146
 2010-09-06 05:11:24 +00:00
Chris Lattner
4100881939 Teach loop rotate to hoist trivially invariant instructions 
in the duplicated block instead of duplicating them.  

Duplicating them into the end of the loop and the preheader 
means that we got a phi node in the header of the loop, 
which prevented LICM from hoisting them.  GVN would
usually come around later and merge the duplicated 
instructions so we'd get reasonable output... except that
anything dependent on the shoulda-been-hoisted value can't
be hoisted.  In PR5319 (which this fixes), a memory value
didn't get promoted.

llvm-svn: 113134
 2010-09-06 01:10:22 +00:00
Chris Lattner
4dccd368f3 fix PR8063, a crash in globalopt in the malloc analysis code. 
llvm-svn: 113109
 2010-09-05 17:20:46 +00:00
Dan Gohman
e1ad0ebbcc Fix LoopSimplify to notify ScalarEvolution when splitting a loop backedge 
into an inner loop, as the new loop iteration may differ substantially.
This fixes PR8078.

llvm-svn: 113057
 2010-09-04 02:42:48 +00:00
Chris Lattner
2b77a2a167 fix a bug in my licm rewrite when a load from the promoted memory 
location is being re-stored to the memory location.  We would get
a dangling pointer from the SSAUpdate data structure and miss a 
use.  This fixes PR8068

llvm-svn: 113042
 2010-09-04 00:12:30 +00:00
Owen Anderson
94d98b12c8 Propagate non-local comparisons. Fixes PR1757. 
llvm-svn: 113025
 2010-09-03 22:47:08 +00:00
Owen Anderson
9161c79ffe Add support for simplifying a load from a computed value to a load from a global when it 
is provable that they're equivalent.  This fixes PR4855.

llvm-svn: 112994
 2010-09-03 19:08:37 +00:00
Owen Anderson
f700be9fb2 Add a test for PR4413, which was apparently fixed at some point in the past. 
llvm-svn: 112987
 2010-09-03 18:33:08 +00:00
Owen Anderson
91cc1ae13c Add PR number to test. 
llvm-svn: 112971
 2010-09-03 16:58:25 +00:00
Chris Lattner
a1691fc6cb more test cleanup 
llvm-svn: 112892
 2010-09-02 22:38:56 +00:00
Chris Lattner
238f46d92e remove some noise from tests. 
llvm-svn: 112889
 2010-09-02 22:35:33 +00:00
Chris Lattner
1edeb00c72 fix more AST updating bugs, correcting miscompilation in PR8041 
llvm-svn: 112878
 2010-09-02 22:19:10 +00:00
Owen Anderson
86201cfdd9 Fix typo. I accidentally edited the wrong file before my last commit. 
llvm-svn: 112851
 2010-09-02 19:52:06 +00:00
Owen Anderson
3206920eb2 Fix a bug in LazyValueInfo that CorrelatedValuePropagation exposed: In the LVI lattice, undef and the full set ConstantRange should not 
be treated as equivalent.

llvm-svn: 112843
 2010-09-02 18:23:58 +00:00
Duncan Sands
6b382d04f4 Print the number of uses of a function in the .ll since it can be informative 
and there seems to be no reason not to.

llvm-svn: 112812
 2010-09-02 08:52:23 +00:00
Chris Lattner
b1c861e28c deepen my MMX/SRoA hack to avoid hurting non-x86 codegen. 
llvm-svn: 112763
 2010-09-01 23:09:27 +00:00
Dan Gohman
d0dc80485c Fix loop unswitching's assumption that a code path which either 
infinite loops or exits will eventually exit. This fixes PR5373.

llvm-svn: 112745
 2010-09-01 21:46:45 +00:00
Bill Wendling
988287ae88 The output of opt -stats must be sent to stderr. Patch by NAKAMURA Takumi! 
llvm-svn: 112724
 2010-09-01 18:32:56 +00:00
Chris Lattner
9759e898f0 add a gross hack to work around a problem that Argiris reported 
on llvmdev: SRoA is introducing MMX datatypes like <1 x i64>,
which then cause random problems because the X86 backend is
producing mmx stuff without inserting proper emms calls.

In the short term, force off MMX datatypes.  In the long term,
the X86 backend should not select generic vector types to MMX
registers.  This is being worked on, but won't be done in time
for 2.8.  rdar://8380055

llvm-svn: 112696
 2010-09-01 05:14:33 +00:00
Chris Lattner
c7ae149253 filecheckize 
llvm-svn: 112695
 2010-09-01 05:10:14 +00:00
Chris Lattner
5ed5e29575 licm is wasting time hoisting constant foldable operations, 
instead of hoisting them, just fold them away.  This occurs in the
testcase for PR8041, for example.

llvm-svn: 112669
 2010-08-31 23:00:16 +00:00
Owen Anderson
c9c199c531 Merge 2010-08-31-InfiniteRecursion.ll into crash.ll. 
llvm-svn: 112635
 2010-08-31 20:27:17 +00:00
Owen Anderson
3ab91d56b4 Add a test for the duplicated-conditional situation illutrated by PR5652. 
llvm-svn: 112621
 2010-08-31 18:49:12 +00:00
Chris Lattner
98902c15fa merge two tests. 
llvm-svn: 112617
 2010-08-31 18:44:03 +00:00
Owen Anderson
43ac4da8d1 Manually reduce this testcase. 
llvm-svn: 112615
 2010-08-31 18:16:29 +00:00
Chris Lattner
8535204036 merge two tests and convert to filecheck. 
llvm-svn: 112613
 2010-08-31 18:05:08 +00:00
Owen Anderson
e4af4b10f1 Add a micro-test for the transforms I added to JumpThreading. 
I have not been able to find a way to test each in isolation, for a few reasons:
1) The ability to look-through non-i1 BinaryOperator's requires the ability to look through non-constant
   ICmps in order for it to ever trigger.
2) The ability to do LVI-powered PHI value determination only matters in cases that ProcessBranchOnPHI
   can't handle.  Since it already handles all the cases without other instructions in the def-use chain
   between the PHI and the branch, it requires the ability to look through ICmps and/or BinaryOperators
   as well.

llvm-svn: 112611
 2010-08-31 17:59:07 +00:00
Owen Anderson
e930c65b2c Rename test directory to reflect new pass name. 
llvm-svn: 112592
 2010-08-31 07:50:31 +00:00
Owen Anderson
ccaee65189 Rename ValuePropagation to a more descriptive CorrelatedValuePropagation. 
llvm-svn: 112591
 2010-08-31 07:48:34 +00:00
Owen Anderson
ba28fe3dcb More Chris-inspired JumpThreading fixes: use ConstantExpr to correctly constant-fold undef, and be more careful with its return value. 
This actually exposed an infinite recursion bug in ComputeValueKnownInPredecessors which theoretically already existed (in JumpThreading's
handling of and/or of i1's), but never manifested before.  This patch adds a tracking set to prevent this case.

llvm-svn: 112589
 2010-08-31 07:36:34 +00:00
Owen Anderson
bd9edea8a3 Remove r111665, which implemented store-narrowing in InstCombine. Chris discovered a miscompilation in it, and it's not easily 
fixable at the optimizer level. I'll investigate reimplementing it in DAGCombine.

llvm-svn: 112575
 2010-08-31 04:41:06 +00:00
Owen Anderson
18110f0db4 Combine these two tests, and make sure there's a newline at the end of the file. 
llvm-svn: 112554
 2010-08-30 23:37:41 +00:00
Duncan Sands
254f8ff0a6 Correct bogus module triple specifications. 
llvm-svn: 112469
 2010-08-30 10:48:29 +00:00
Chris Lattner
51639dea34 LICM does get dead instructions input to it. Instead of sinking them 
out of loops, just delete them.

llvm-svn: 112451
 2010-08-29 18:22:25 +00:00
Chris Lattner
4b49ada02c remove the ABCD and SSI passes. They don't have any clients that 
I'm aware of, aren't maintained, and LVI will be replacing their value.
nlewycky approved this on irc.

llvm-svn: 112355
 2010-08-28 03:51:24 +00:00
Chris Lattner
b61cf1e296 handle the constant case of vector insertion. For something 
like this:

struct S { float A, B, C, D; };

struct S g;
struct S bar() { 
  struct S A = g;
  ++A.B;
  A.A = 42;
  return A;
}

we now generate:

_bar:                                   ## @bar
## BB#0:                                ## %entry
	movq	_g@GOTPCREL(%rip), %rax
	movss	12(%rax), %xmm0
	pshufd	$16, %xmm0, %xmm0
	movss	4(%rax), %xmm2
	movss	8(%rax), %xmm1
	pshufd	$16, %xmm1, %xmm1
	unpcklps	%xmm0, %xmm1
	addss	LCPI1_0(%rip), %xmm2
	pshufd	$16, %xmm2, %xmm2
	movss	LCPI1_1(%rip), %xmm0
	pshufd	$16, %xmm0, %xmm0
	unpcklps	%xmm2, %xmm0
	ret

instead of:

_bar:                                   ## @bar
## BB#0:                                ## %entry
	movq	_g@GOTPCREL(%rip), %rax
	movss	12(%rax), %xmm0
	pshufd	$16, %xmm0, %xmm0
	movss	4(%rax), %xmm2
	movss	8(%rax), %xmm1
	pshufd	$16, %xmm1, %xmm1
	unpcklps	%xmm0, %xmm1
	addss	LCPI1_0(%rip), %xmm2
	movd	%xmm2, %eax
	shlq	$32, %rax
	addq	$1109917696, %rax       ## imm = 0x42280000
	movd	%rax, %xmm0
	ret

llvm-svn: 112345
 2010-08-28 01:50:57 +00:00
Chris Lattner
c70b0c0ee7 optimize bitcasts from large integers to vector into vector 
element insertion from the pieces that feed into the vector.
This handles a pattern that occurs frequently due to code
generated for the x86-64 abi.  We now compile something like
this:

struct S { float A, B, C, D; };
struct S g;
struct S bar() { 
  struct S A = g;
  ++A.A;
  ++A.C;
  return A;
}

into all nice vector operations:

_bar:                                   ## @bar
## BB#0:                                ## %entry
	movq	_g@GOTPCREL(%rip), %rax
	movss	LCPI1_0(%rip), %xmm1
	movss	(%rax), %xmm0
	addss	%xmm1, %xmm0
	pshufd	$16, %xmm0, %xmm0
	movss	4(%rax), %xmm2
	movss	12(%rax), %xmm3
	pshufd	$16, %xmm2, %xmm2
	unpcklps	%xmm2, %xmm0
	addss	8(%rax), %xmm1
	pshufd	$16, %xmm1, %xmm1
	pshufd	$16, %xmm3, %xmm2
	unpcklps	%xmm2, %xmm1
	ret

instead of icky integer operations:

_bar:                                   ## @bar
	movq	_g@GOTPCREL(%rip), %rax
	movss	LCPI1_0(%rip), %xmm1
	movss	(%rax), %xmm0
	addss	%xmm1, %xmm0
	movd	%xmm0, %ecx
	movl	4(%rax), %edx
	movl	12(%rax), %esi
	shlq	$32, %rdx
	addq	%rcx, %rdx
	movd	%rdx, %xmm0
	addss	8(%rax), %xmm1
	movd	%xmm1, %eax
	shlq	$32, %rsi
	addq	%rax, %rsi
	movd	%rsi, %xmm1
	ret

This resolves rdar://8360454

llvm-svn: 112343
 2010-08-28 01:20:38 +00:00