nicolas/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
48,674 Commits 41 Branches 151 Tags
3ba293564a511ec67ccbbfba3fc0c87b51a290d8
Commit Graph

4522 Commits

Author SHA1 Message Date
Chris Lattner
16395e51f4 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
Chris Lattner
80b03a1b49 Fix mishandling of the infinite loop case when merging two blocks. This 
fixes PR2540.

llvm-svn: 53533
 2008-07-13 22:23:11 +00:00
Chris Lattner
834ab4ec1b more refactoring. Use early exits instead of really complex logic. 
No functionality change.

llvm-svn: 53532
 2008-07-13 22:04:41 +00:00
Chris Lattner
5eed37224a improve comments. 
llvm-svn: 53531
 2008-07-13 21:55:46 +00:00
Chris Lattner
9aada1d755 factor another large hunk of code out into its own function. 
No functionality change.

llvm-svn: 53530
 2008-07-13 21:53:26 +00:00
Chris Lattner
55eaae1e0c Final bit of simplification for FoldBranchToCommonDest. 
llvm-svn: 53528
 2008-07-13 21:20:19 +00:00
Chris Lattner
1b317ea48a simplify logic a bit 
llvm-svn: 53527
 2008-07-13 21:15:11 +00:00
Chris Lattner
2e25b8f444 Refactor some code out into its own helper function, getting rid of crazy multiline 
conditionals and commenting the code better.

No functionality change.

llvm-svn: 53526
 2008-07-13 21:12:01 +00:00
Nick Lewycky
f76aa23b54 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
Dan Gohman
3707f1daba Use find instead of lower_bound. 
llvm-svn: 53474
 2008-07-11 20:58:19 +00:00
Owen Anderson
8e462e9a82 Don't call lookupNumber more than we have to. 
llvm-svn: 53470
 2008-07-11 20:05:13 +00:00
Nick Lewycky
45e127ab20 Document 'mask' in this calculation. 
llvm-svn: 53454
 2008-07-11 08:16:26 +00:00
Nick Lewycky
da405e1155 Remove misleading constant from comment. 
llvm-svn: 53452
 2008-07-11 07:36:19 +00:00
Nick Lewycky
f95b64acaa 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
3994bed1a9 a missed optimization that Eli spotted 
llvm-svn: 53449
 2008-07-11 06:40:29 +00:00
Chris Lattner
13a6911ea2 another bug in the same line. 
llvm-svn: 53448
 2008-07-11 06:38:16 +00:00
Chris Lattner
de89b507dd fix a bug spotted by Eli's eagle eyes 
llvm-svn: 53447
 2008-07-11 06:36:01 +00:00
Chris Lattner
bd25b8507c 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
38a50c9528 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
6af608b8ce 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
4fa8bb3430 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
Matthijs Kooijman
e0f3ab82c4 Restructure dead argument elimination, try #3 :-) 
Rewrite the DeadArgumentElimination pass, to use a more explicit tracking of
dependencies between return values and/or arguments. Also make the handling of
arguments and return values the same.

The pass now looks properly inside returned structs, but only at the first
level (ie, not inside nested structs).

This version fixed a few more bugs and was cleaned up a bit. It now passes all
of LLVM's testing, and should still pass SPEC2006. There is still a minor bug
with regard to returning nested structs. Since there is currently nothing that
emits such IR, I will fix that in a seperate commit (partly because it requires
a non-trivial fix).

llvm-svn: 53400
 2008-07-10 10:24:08 +00:00
Nick Lewycky
6193a564ab 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
bb89c2a3f6 Simplify, suggested by Chris Lattner. 
llvm-svn: 53283
 2008-07-09 07:35:26 +00:00
Nick Lewycky
f9c27c343a 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
364661c43e Fold ((1 << a) & 1) to (a == 0). 
llvm-svn: 53276
 2008-07-09 05:20:13 +00:00
Nick Lewycky
0d3645e673 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
51cbf928ab 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
Chris Lattner
501d78fdc0 Fix PR2496, a really nasty bug which involved sinking volatile loads 
into phis.  This is actually the same bug as PR2262 /
2008-04-29-VolatileLoadDontMerge.ll, but I missed checking the first 
predecessor for multiple successors.  Testcase here:
InstCombine/2008-07-08-VolatileLoadMerge.ll

llvm-svn: 53240
 2008-07-08 17:18:32 +00:00
Evan Cheng
03001cb820 Fix two serious LSR bugs. 
1. LSR runOnLoop is always returning false regardless if any transformation is made.
2. AddUsersIfInteresting can create new instructions that are added to DeadInsts. But there is a later early exit which prevents them from being freed.

llvm-svn: 53193
 2008-07-07 19:51:32 +00:00
Dan Gohman
38740a98b2 Make DenseMap's insert return a pair, to more closely resemble std::map. 
llvm-svn: 53177
 2008-07-07 17:46:23 +00:00
Nick Lewycky
9f1a4dc672 Fix missed optimization opportunity when analyzing cast of mul and select. 
llvm-svn: 53151
 2008-07-05 21:19:34 +00:00
Owen Anderson
3ea90a7d55 Use information already present in the ValueTable to fast-fail when we know there won't be a value number match. This speeds up GVN on a case where there are very few redundancies by ~25%. 
llvm-svn: 53108
 2008-07-03 17:44:33 +00:00
Devang Patel
eb611ddeb2 Do not try to update dominator info while manipulating CFG. This code does not handle all cases and keeps invalid dom info around some cases, which misleads other passes down stream. 
Right now, dom info is recaluclated in the end if the loop is switched.

llvm-svn: 53106
 2008-07-03 17:37:52 +00:00
Owen Anderson
d57cdc3c60 Remove the ability for ADCE to remove unreachable blocks in loop nests, because, as Eli pointed out, SimplifyCFG already does this. 
llvm-svn: 53104
 2008-07-03 17:21:41 +00:00
Bill Wendling
a96eabaab7 Remove unused function. 
llvm-svn: 53090
 2008-07-03 07:10:03 +00:00
Devang Patel
f94b9826b5 Preserve dom info. 
llvm-svn: 53089
 2008-07-03 07:04:22 +00:00
Devang Patel
226edd1826 Remove extra FIXME 
llvm-svn: 53087
 2008-07-03 06:50:04 +00:00
Devang Patel
c4dcf82a16 Reconstruct dom info, if loop is unswitched. 
llvm-svn: 53086
 2008-07-03 06:48:21 +00:00
Devang Patel
e491bb8845 LoopUnswitch does not preserve dominator info in all cases. 
llvm-svn: 53085
 2008-07-03 05:55:03 +00:00
Devang Patel
7dcfff392a Undo previous patch. It is not that simple to fix dom info here. 
llvm-svn: 53062
 2008-07-03 00:08:13 +00:00
Devang Patel
5adfcb5783 Preserve dom info while simplifing loop after the unswitch. 
llvm-svn: 53052
 2008-07-02 22:58:54 +00:00
Owen Anderson
488b89f608 Use df_ext_iterator to capture the reachable set without allocating an extra set. 
Also, move large sets and vectors out of instance variables and onto the stack,
and give them more reasonable sizes.

llvm-svn: 53044
 2008-07-02 18:41:09 +00:00
Owen Anderson
6acc782dad Avoid a redundant call. 
llvm-svn: 53040
 2008-07-02 18:15:31 +00:00
Owen Anderson
323b5755a6 Add support to ADCE for pruning unreachable blocks. This addresses the final 
part of PR2509.

llvm-svn: 53038
 2008-07-02 18:05:19 +00:00
Owen Anderson
9edcf24da9 Use DenseSet rather than SmallPtrSet for the alive set. Using SmallPtrSet 
with a huge "size" parameter is actually quite inefficient.

llvm-svn: 53034
 2008-07-02 17:32:04 +00:00
Owen Anderson
b22a640fe4 A better fix for PR2503 that doesn't pessimize GVN in the presence of unreachable blocks. 
llvm-svn: 53032
 2008-07-02 17:20:16 +00:00
Devang Patel
ed50fb5b61 reuse vectors. 
llvm-svn: 53007
 2008-07-02 01:44:29 +00:00
Devang Patel
57d94d6304 Fix comment. 
llvm-svn: 53006
 2008-07-02 01:31:19 +00:00
Devang Patel
e149d4ed4d Preserve loop data so that it is not fetched everytime it is needed. 
Keep track of currentLoop.

llvm-svn: 53005
 2008-07-02 01:18:13 +00:00