RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-26 22:42:46 +02:00
Code Issues Projects Releases Wiki Activity
40,483 Commits 4 Branches 5 Tags 704 MiB
ceacf7d17b
Commit Graph

2683 Commits

Author SHA1 Message Date
Chris Lattner
ae09ade343 Implement support for simplifying vector comparisons by 0.0 and 1.0 like we 
do for scalars.  Patch contributed by Nicolas Capens

This also generalizes the previous xforms to work on long double, now that 
isExactlyValue works for long double.

llvm-svn: 54653
 2008-08-11 22:06:05 +00:00
Eric Christopher
dcd4752642 Have IRBuilder take a template argument on whether or not to preserve 
names. This can save a lot of allocations if you aren't going to be
looking at the output.

llvm-svn: 54546
 2008-08-08 19:39:37 +00:00
Dan Gohman
4ad77e1ca2 Fix a shufflevector instcombine that was emitting invalid masks indices 
when it meant to be emitting undef indices.

llvm-svn: 54417
 2008-08-06 18:17:32 +00:00
Evan Cheng
c5cc2cb4aa Fix PR2355: bug in ChangeCompareStride. When the loop termination compare is the only use of its iv stride, the stride can be eliminated by moving it to another stride. If the scale is negative, swap the predicate instead of using a inverse predicate. 
llvm-svn: 54415
 2008-08-06 18:04:43 +00:00
Chris Lattner
55b99a6739 optimize a common idiom generated by clang for bitfield access, PR2638. 
llvm-svn: 54408
 2008-08-06 07:35:52 +00:00
Chris Lattner
cae04940bd Zap sitofp/fptoui pairs. In all cases when the sign difference 
matters, the result is undefined anyway.

llvm-svn: 54396
 2008-08-06 05:13:06 +00:00
Nick Lewycky
0bf3c812d2 Reinstate this optimization, but without the miscompile. Thanks to Bill for 
tracking down that this was breaking llvm-gcc bootstrap on Linux.

llvm-svn: 54394
 2008-08-06 04:54:03 +00:00
Dan Gohman
8377e7019f Pass the computed iteration count value to RewriteLoopExitValues 
instead of having it call getIterationCount again.

llvm-svn: 54380
 2008-08-05 22:34:21 +00:00
Bill Wendling
3882f060ef Revert r53282. This was causing a miscompile on Linux. Also, the transformation 
looks bogus. Please see PR2629 for details on why this is breaking things.

llvm-svn: 54372
 2008-08-05 21:23:45 +00:00
Duncan Sands
573c01d5da Fix comment typos. 
llvm-svn: 54266
 2008-08-01 12:23:49 +00:00
Nate Begeman
9a71580e21 Add vector shifts to the IR, patch by Eli Friedman. 
CodeGen & Clang work coming next.

llvm-svn: 54161
 2008-07-29 15:49:41 +00:00
Matthijs Kooijman
7199907f50 Add -unroll-allow-partial command line option that enabled the loop unroller to 
partially unroll a loop when fully unrolling would not fit under the threshold.

Patch by Mikael Lepistö.

llvm-svn: 54160
 2008-07-29 13:21:23 +00:00
Owen Anderson
d2cc2655af Don't remove volatile loads. Thanks to Duncan for noticing this one. 
llvm-svn: 54144
 2008-07-28 20:52:42 +00:00
Owen Anderson
4d84a90fa9 Add support for eliminating stores that store the same value that was just loaded. 
This fixes PR2599.

llvm-svn: 54133
 2008-07-28 16:14:26 +00:00
Dan Gohman
9742f7772d Rename SDOperand to SDValue. 
llvm-svn: 54128
 2008-07-27 21:46:04 +00:00
Dan Gohman
1ecbcecdf3 Put the LICM of constant GlobalVariables, introduced in r53945, under a 
command-line option, and disable it by default. It introduced performance
regressions because CodeGen is currently not able to remat such loads.

llvm-svn: 53997
 2008-07-24 23:57:25 +00:00
Chris Lattner
8eb899ecbc "Allow LICM to sink or lift loads from constant memory. Also add a test 
case for this.

This allows instructions like loads from global variables declared to
be constant to be moved out of loops."

Patch by Stefanus Du Toit!

llvm-svn: 53945
 2008-07-23 05:06:28 +00:00
Dan Gohman
6564581be0 Enable first-class aggregates support. 
Remove the GetResultInst instruction. It is still accepted in LLVM assembly
and bitcode, where it is now auto-upgraded to ExtractValueInst. Also, remove
support for return instructions with multiple values. These are auto-upgraded
to use InsertValueInst instructions.

The IRBuilder still accepts multiple-value returns, and auto-upgrades them
to InsertValueInst instructions.

llvm-svn: 53941
 2008-07-23 00:34:11 +00:00
Dan Gohman
8f7b6c8113 Fix a bug in LSR's dead-PHI cleanup. If a PHI has a def-use chain that 
leads into a cycle involving a different PHI, LSR got stuck running
around that cycle looking for the original PHI. To avoid this, keep
track of visited PHIs and stop searching if we see one more than once.
This fixes PR2570.

llvm-svn: 53879
 2008-07-21 21:45:02 +00:00
Duncan Sands
b4646d7dbe Supress a gcc-4.3 warning. 
llvm-svn: 53771
 2008-07-18 21:06:02 +00:00
Owen Anderson
8500aba55a Make PRE actually handle critical edges (by splitting them). Confirmed that bootstrap passes with this change. 
llvm-svn: 53762
 2008-07-18 18:03:38 +00:00
Owen Anderson
5524271234 Enable PRE. My last batch of changes fixed the miscompile. 
llvm-svn: 53730
 2008-07-17 19:41:00 +00:00
Chris Lattner
eccd57d118 Fix PR2553 
llvm-svn: 53715
 2008-07-17 06:07:20 +00:00
Owen Anderson
7fb36c8bba Factor MergeBlockIntoPredecessor out into BasicBlockUtils. 
llvm-svn: 53705
 2008-07-17 00:01:40 +00:00
Owen Anderson
f91aa3b22f There's no need to iterate block merging and PRE. In fact, iterating the latter 
could cause problems for memdep when it breaks critical edges.

llvm-svn: 53691
 2008-07-16 17:52:31 +00:00
Matthijs Kooijman
ceee0ddd1b Redo InstCombiner::visitExtractValueInst. Instead of using the (complicate) 
FindInsertedValue, it now performs a number of simple transformations that
should result in the same effect when applied iteratively.

llvm-svn: 53673
 2008-07-16 12:55:45 +00:00
Evan Cheng
7218339189 Fix PR2296. Do not transform x86_sse2_storel_dq into a full-width store. 
llvm-svn: 53666
 2008-07-16 07:28:14 +00:00
Owen Anderson
e12f7904ff Revert this, as it seems to still be broken. 
llvm-svn: 53627
 2008-07-15 17:59:02 +00:00
Owen Anderson
73bdb28e89 Enable local PRE by default. 
llvm-svn: 53616
 2008-07-15 16:28:23 +00:00
Owen Anderson
f1b3898e7f Have GVN do a pre-pass over the CFG that folds away unconditional branches where possible. This allows local PRE to be more aggressive. 
llvm-svn: 53615
 2008-07-15 16:28:06 +00:00
Dan Gohman
8280b2e66e Fix uninitialized use of the Changed variable. 
llvm-svn: 53564
 2008-07-14 17:55:01 +00:00
Chris Lattner
14faada3a3 Fix PR2506 by being a bit more careful about reverse fact propagation when 
disproving a condition.  This actually compiles the existing testcase
(udiv_select_to_select_shift) to:

define i64 @test(i64 %X, i1 %Cond) {
entry:
	%divisor1.t = lshr i64 %X, 3		; <i64> [#uses=1]
	%quotient2 = lshr i64 %X, 3		; <i64> [#uses=1]
	%sum = add i64 %divisor1.t, %quotient2		; <i64> [#uses=1]
	ret i64 %sum
}

instead of:

define i64 @test(i64 %X, i1 %Cond) {
entry:
	%quotient1.v = select i1 %Cond, i64 3, i64 4		; <i64> [#uses=1]
	%quotient1 = lshr i64 %X, %quotient1.v		; <i64> [#uses=1]
	%quotient2 = lshr i64 %X, 3		; <i64> [#uses=1]
	%sum = add i64 %quotient1, %quotient2		; <i64> [#uses=1]
	ret i64 %sum
}

llvm-svn: 53534
 2008-07-14 00:15:52 +00:00
Nick Lewycky
3fb5816774 Enhance analysis of srem. 
Remove dead code analyzing urem. 'urem' of power-of-2 is canonicalized to an
'and' instruction.

llvm-svn: 53506
 2008-07-12 05:04:38 +00:00
Owen Anderson
cc861329ee Don't call lookupNumber more than we have to. 
llvm-svn: 53470
 2008-07-11 20:05:13 +00:00
Nick Lewycky
cafc3d583d Document 'mask' in this calculation. 
llvm-svn: 53454
 2008-07-11 08:16:26 +00:00
Nick Lewycky
12c88a28f5 Remove misleading constant from comment. 
llvm-svn: 53452
 2008-07-11 07:36:19 +00:00
Nick Lewycky
8cd0f2058e Add another optimization from PR2330. Also catch some missing cases that are 
similar.

llvm-svn: 53451
 2008-07-11 07:20:53 +00:00
Chris Lattner
07bfade2d4 a missed optimization that Eli spotted 
llvm-svn: 53449
 2008-07-11 06:40:29 +00:00
Chris Lattner
34b0895d4d another bug in the same line. 
llvm-svn: 53448
 2008-07-11 06:38:16 +00:00
Chris Lattner
3cdb6789b9 fix a bug spotted by Eli's eagle eyes 
llvm-svn: 53447
 2008-07-11 06:36:01 +00:00
Chris Lattner
3d40848bfd simplify and merge a bunch of code. Instead of comparing against 
the min/max values for an integer type, compare against the min/max
values we can prove contain the input.  This might be a tighter bound,
so this is general goodness.

llvm-svn: 53446
 2008-07-11 05:40:05 +00:00
Chris Lattner
d1198896ae fold away (x <= cst) earlier, allowing us to not have to 
handle them in some code.

llvm-svn: 53445
 2008-07-11 05:08:55 +00:00
Chris Lattner
16b8ae98c1 Fix folding of icmp's of i1 where the comparison is signed. The code 
was using the algorithm for folding unsigned comparisons which is
completely wrong.  This has been broken since the signless types change.

llvm-svn: 53444
 2008-07-11 04:20:58 +00:00
Chris Lattner
f3f6b6d7af Fix a bogus optimization: folding (slt (zext i1 A to i32), 1) -> (slt i1 A, true) 
This cause a regression in InstCombine/JavaCompare, which was doing the right
thing on accident.  To handle the missed case, generalize the comparisons based
on masked bits a little bit to handle comparisons against the max value. For 
example, we can now xform (slt i32 (and X, 4), 4) -> (setne i32 (and X, 4), 4)

llvm-svn: 53443
 2008-07-11 04:09:09 +00:00
Nick Lewycky
26ccb8e9a8 Fix overzealous optimization. Thanks to Duncan Sands for pointing out my error! 
llvm-svn: 53393
 2008-07-10 05:51:40 +00:00
Nick Lewycky
a7d102aca3 Simplify, suggested by Chris Lattner. 
llvm-svn: 53283
 2008-07-09 07:35:26 +00:00
Nick Lewycky
6341c5a7ec Fold (a < 8) && (b < 8) into (a|b) < 8 for unsigned less or greater than. 
llvm-svn: 53282
 2008-07-09 07:29:11 +00:00
Nick Lewycky
38fa84fa12 Fold ((1 << a) & 1) to (a == 0). 
llvm-svn: 53276
 2008-07-09 05:20:13 +00:00
Nick Lewycky
2a6469c9a5 Reduce x - y to -y when we know the 'x' part will get masked off anyways. 
llvm-svn: 53271
 2008-07-09 04:32:37 +00:00
Devang Patel
2b56d5281d If loop induction variable's start value is less then its exit value then do not split the loop. 
llvm-svn: 53265
 2008-07-09 00:12:01 +00:00