caio/clang-p2996
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
43,071 Commits 1 Branch 0 Tags
86bbf338e57504cc1e006552d8a1a2d99302e961
Commit Graph

446 Commits

Author SHA1 Message Date
Chris Lattner
86bbf338e5 Split some code out of the main SimplifyCFG loop into its own function. 
Fix said code to handle merging return instructions together correctly
when handling multiple return values.

llvm-svn: 50199
 2008-04-24 00:01:19 +00:00
Chris Lattner
5a58a4dc6d Rewrite multiple return value handling in SCCP. Before, the -sccp pass 
would turn every getresult instruction into undef.  This helps with
rdar://5778210

llvm-svn: 50140
 2008-04-23 05:38:20 +00:00
Chris Lattner
14f41bfc49 remove this testcase. It isn't testing loop rotate, it is testing all 
of -std-compile-opts and is now failing because other passes are generating
IR that looks different to input of loop rotate.  Devang, please 
introduce a testcase that only runs loop rotate.

llvm-svn: 50136
 2008-04-23 05:36:04 +00:00
Chris Lattner
3376d6d824 make this test more interesting. 
llvm-svn: 50128
 2008-04-23 03:49:32 +00:00
Chris Lattner
2161d6c075 distill down the essense of this test. 
llvm-svn: 50125
 2008-04-23 03:03:42 +00:00
Dale Johannesen
c4d3c1cbe0 new test 
llvm-svn: 50123
 2008-04-23 01:22:22 +00:00
Evan Cheng
1c89ca7295 Don't do: "(X & 4) >> 1 == 2 --> (X & 4) == 4" if there are more than one uses of the shift result. 
llvm-svn: 50118
 2008-04-23 00:38:06 +00:00
Chris Lattner
37e9c187b0 Start doing the significantly useful part of jump threading: handle cases 
where a comparison has a phi input and that phi is a constant.  For example,
stuff like:

  Threading edge through bool from 'bb2149' to 'bb2231' with cost: 1, across block:
bb2237:		; preds = %bb2231, %bb2149
	%tmp2328.rle = phi i32 [ %tmp2232, %bb2231 ], [ %tmp2232439, %bb2149 ]		; <i32> [#uses=2]
	%done.0 = phi i32 [ %done.2, %bb2231 ], [ 0, %bb2149 ]		; <i32> [#uses=1]
	%tmp2239 = icmp eq i32 %done.0, 0		; <i1> [#uses=1]
	br i1 %tmp2239, label %bb2231, label %bb2327

or

bb38.i298:		; preds = %bb33.i295, %bb1693
	%tmp39.i296.rle = phi %struct.ibox* [ null, %bb1693 ], [ %tmp39.i296.rle1109, %bb33.i295 ]		; <%struct.ibox*> [#uses=2]
	%minspan.1.i291.reg2mem.1 = phi i32 [ 32000, %bb1693 ], [ %minspan.0.i288, %bb33.i295 ]		; <i32> [#uses=1]
	%tmp40.i297 = icmp eq %struct.ibox* %tmp39.i296.rle, null		; <i1> [#uses=1]
	br i1 %tmp40.i297, label %implfeeds.exit311, label %bb43.i301

This triggers thousands of times in spec.

llvm-svn: 50110
 2008-04-22 21:40:39 +00:00
Chris Lattner
d5425e8f8d Dig through multiple levels of AND to thread jumps if needed. 
llvm-svn: 50106
 2008-04-22 20:46:09 +00:00
Chris Lattner
3df4c15dc7 Teach jump threading to thread through blocks like: 
br (and X, phi(Y, Z, false)), label L1, label L2

This triggers once on 252.eon and 6 times on 176.gcc.  Blocks 
in question often look like this:

bb262:		; preds = %bb261, %bb248
	%iftmp.251.0 = phi i1 [ true, %bb261 ], [ false, %bb248 ]		; <i1> [#uses=4]
	%tmp270 = icmp eq %struct.rtx_def* %tmp.0.i, null		; <i1> [#uses=1]
	%bothcond = or i1 %iftmp.251.0, %tmp270		; <i1> [#uses=1]
	br i1 %bothcond, label %bb288, label %bb273

In this case, it is clear that it doesn't matter if tmp.0.i is null when coming from bb261.  When coming from bb248, it is all that matters.


Another random example:

check_asm_operands.exit:		; preds = %check_asm_operands.exit.thr_comm, %bb30.i, %bb12.i, %bb6.i413
	%tmp.0.i420 = phi i1 [ true, %bb6.i413 ], [ true, %bb12.i ], [ true, %bb30.i ], [ false, %check_asm_operands.exit.thr_comm ; <i1> [#uses=1]
	call void @llvm.stackrestore( i8* %savedstack ) nounwind 
	%tmp4389 = icmp eq i32 %added_sets_1.0, 0		; <i1> [#uses=1]
	%tmp4394 = icmp eq i32 %added_sets_2.0, 0		; <i1> [#uses=1]
	%bothcond80 = and i1 %tmp4389, %tmp4394		; <i1> [#uses=1]
	%bothcond81 = and i1 %bothcond80, %tmp.0.i420		; <i1> [#uses=1]
	br i1 %bothcond81, label %bb4398, label %bb4397

Here is the case from 252.eon:

bb290.i.i:		; preds = %bb23.i57.i.i, %bb8.i39.i.i, %bb100.i.i, %bb100.i.i, %bb85.i.i110
	%myEOF.1.i.i = phi i1 [ true, %bb100.i.i ], [ true, %bb100.i.i ], [ true, %bb85.i.i110 ], [ true, %bb8.i39.i.i ], [ false, %bb23.i57.i.i ]		; <i1> [#uses=2]
	%i.4.i.i = phi i32 [ %i.1.i.i, %bb85.i.i110 ], [ %i.0.i.i, %bb100.i.i ], [ %i.0.i.i, %bb100.i.i ], [ %i.3.i.i, %bb8.i39.i.i ], [ %i.3.i.i, %bb23.i57.i.i ]		; <i32> [#uses=3]
	%tmp292.i.i = load i8* %tmp16.i.i100, align 1		; <i8> [#uses=1]
	%tmp293.not.i.i = icmp ne i8 %tmp292.i.i, 0		; <i1> [#uses=1]
	%bothcond.i.i = and i1 %tmp293.not.i.i, %myEOF.1.i.i		; <i1> [#uses=1]
	br i1 %bothcond.i.i, label %bb202.i.i, label %bb301.i.i
  Factoring out 3 common predecessors.

On the path from any blocks other than bb23.i57.i.i, the load and compare 
are dead.

llvm-svn: 50096
 2008-04-22 07:05:46 +00:00
Chris Lattner
3cc28ce1ed add a basic testcase. 
llvm-svn: 50093
 2008-04-22 06:35:14 +00:00
Chris Lattner
c3a439351c optimize "p != gep p, ..." better. This allows us to compile 
getelementptr-seteq.ll into:

define i1 @test(i64 %X, %S* %P) {
	%C = icmp eq i64 %X, -1		; <i1> [#uses=1]
	ret i1 %C
}

instead of:

define i1 @test(i64 %X, %S* %P) {
	%A.idx.mask = and i64 %X, 4611686018427387903		; <i64> [#uses=1]
	%C = icmp eq i64 %A.idx.mask, 4611686018427387903		; <i1> [#uses=1]
	ret i1 %C
}

And fixes the second half of PR2235.  This speeds up the insertion sort
case by 45%, from 1.12s to 0.77s.  In practice, this will significantly
speed up for loops structured like:

for (double *P = Base + N; P != Base; --P)
  ...

Which happens frequently for C++ iterators.

llvm-svn: 50079
 2008-04-22 02:53:33 +00:00
Owen Anderson
6a7355caa2 Refactor memcpyopt based on Chris' suggestions. Consolidate several functions 
and simplify code that was fallout from the separation of memcpyopt and gvn.

llvm-svn: 50034
 2008-04-21 07:45:10 +00:00
Chris Lattner
b839c05a05 rename *.llx -> *.ll, last batch. 
llvm-svn: 49971
 2008-04-19 22:32:52 +00:00
Owen Anderson
81f7584c4e XFAIL this test for the moment. The real solution is to prevent ADCE 
from transforming loops and adding a separate loop pass for removing
loops with know trip counts.  Until that happens, ADCE is miscompiling this code.

llvm-svn: 49769
 2008-04-16 04:25:42 +00:00
Owen Anderson
90bde997b3 Add testcase for PR2213. 
llvm-svn: 49517
 2008-04-11 05:13:32 +00:00
Dan Gohman
99b7b3f03b Teach InstCombine's ComputeMaskedBits to handle pointer expressions 
in addition to integer expressions. Rewrite GetOrEnforceKnownAlignment
as a ComputeMaskedBits problem, moving all of its special alignment
knowledge to ComputeMaskedBits as low-zero-bits knowledge.

Also, teach ComputeMaskedBits a few basic things about Mul and PHI
instructions.

This improves ComputeMaskedBits-based simplifications in a few cases,
but more noticeably it significantly improves instcombine's alignment
detection for loads, stores, and memory intrinsics.

llvm-svn: 49492
 2008-04-10 18:43:06 +00:00
Chris Lattner
802134fc02 Generalize getUnaryFloatFunction to handle any FP unary function, automatically 
figuring out the suffix to use.  implement pow(2,x) -> exp2(x).

llvm-svn: 49437
 2008-04-09 17:48:11 +00:00
Chris Lattner
091afc7714 remove capital letter from test name. 
llvm-svn: 49436
 2008-04-09 17:46:36 +00:00
Owen Anderson
ef9a6fd5c2 Factor a bunch of functionality related to memcpy and memset transforms out of 
GVN and into its own pass.

llvm-svn: 49419
 2008-04-09 08:23:16 +00:00
Chris Lattner
b859fb49ed many cleanups to the pow optimizer. Allow it to handle powf, 
add support for  pow(x, 2.0) -> x*x.

llvm-svn: 49411
 2008-04-09 00:07:45 +00:00
Gabor Greif
00fcdeddd3 merge r48768 from branches/ggreif/parallelized-test 
llvm-svn: 49382
 2008-04-08 15:22:41 +00:00
Chris Lattner
28e7b57605 add a testcase for forming memset from noncontiguous stores. 
llvm-svn: 48938
 2008-03-29 04:51:35 +00:00
Evan Cheng
2b72c05992 Handle a special case xor undef, undef -> 0. Technically this should be transformed to undef. But this is such a common idiom (misuse) we are going to handle it. 
llvm-svn: 48791
 2008-03-25 20:07:13 +00:00
Tanya Lattner
8bf97c2324 Byebye llvm-upgrade! 
llvm-svn: 48762
 2008-03-25 04:26:08 +00:00
Devang Patel
a38f58aa5c Add incoming value from header only if phi node has any use inside the loop. 
llvm-svn: 48738
 2008-03-24 20:16:14 +00:00
Chris Lattner
c2c0c8303c apparently tclsh doesn't lex like bash. Weird. 
llvm-svn: 48732
 2008-03-24 17:41:57 +00:00
Chris Lattner
9ca6bb4f16 pass the option so this test tests the right thing. 
llvm-svn: 48731
 2008-03-24 17:36:38 +00:00
Evan Cheng
c3cf9f872a Transform (zext (or (icmp), (icmp))) to (or (zext (cimp), (zext icmp))) if at least one of the (zext icmp) can be transformed to eliminate an icmp. 
llvm-svn: 48715
 2008-03-24 00:21:34 +00:00
Owen Anderson
e3605ac108 Use normal naming convention for test. 
llvm-svn: 48693
 2008-03-22 21:08:33 +00:00
Chris Lattner
53ccb62712 implement an initial hack at a straight-line store -> memset optimization. 
This fires dozens of times across spec and multisource, but I don't know
if it actually speeds stuff up.  Hopefully the testers will show something
nice :)

llvm-svn: 48680
 2008-03-22 05:37:16 +00:00
Chris Lattner
c44160ce6e Teach masked value is zero about add and sub, and use MVIZ to 
simplify things like (X & 4) >> 1 == 2  --> (X & 4) == 4.

since it is obvious that the shift doesn't remove any bits.

llvm-svn: 48631
 2008-03-21 05:19:58 +00:00
Tanya Lattner
ab7872c06c Upgrade tests. 
llvm-svn: 48538
 2008-03-19 07:28:33 +00:00
Tanya Lattner
f9d25185d5 Upgrade tests. 
llvm-svn: 48536
 2008-03-19 05:39:35 +00:00
Tanya Lattner
0ea4c8d706 Upgrade tests to not use llvm-upgrade. 
llvm-svn: 48530
 2008-03-19 04:36:04 +00:00
Tanya Lattner
1d526b90aa Upgrade tests to not use llvm-upgrade. 
llvm-svn: 48529
 2008-03-19 04:14:49 +00:00
Tanya Lattner
f73582b17c Remove llvm-upgrade and update tests. 
llvm-svn: 48527
 2008-03-19 03:47:13 +00:00
Tanya Lattner
4e59897d3d Upgrade tests to not use llvm-upgrade. 
llvm-svn: 48484
 2008-03-18 04:14:37 +00:00
Tanya Lattner
baa370b37a Upgrade tests to not use llvm-upgrade. 
llvm-svn: 48483
 2008-03-18 03:45:45 +00:00
Bill Wendling
68a930b33e The inst combining of inttoptr into GEP with one index was using the bit size of 
the type instead of the byte size. This was causing troublesome mis-compilations.

True to form, this took 2 days to find and is a one-line fix. :-P

llvm-svn: 48354
 2008-03-14 05:12:19 +00:00
Owen Anderson
7a69e3aef3 Fix a bug in GVN that Duncan noticed, where we potentially need to insert a 
pointer bitcast when performing return slot optimization.

llvm-svn: 48343
 2008-03-13 22:07:10 +00:00
Owen Anderson
6ff0b822b4 Improve the return slot optimization to be both more aggressive (not limited to sret parameters), and 
safer (when the passed pointer might be invalid).  Thanks to Duncan and Chris for the idea behind this, 
and extra thanks to Duncan for helping me work out the trap-safety.

llvm-svn: 48280
 2008-03-12 07:37:44 +00:00
Devang Patel
fa8667a2dd Fix attribute handling. 
llvm-svn: 48262
 2008-03-12 00:07:03 +00:00
Devang Patel
7358165c99 Handle multiple ret values. 
llvm-svn: 48254
 2008-03-11 22:24:29 +00:00
Dan Gohman
20af5a0fe7 Check to see if a two-entry PHI block can be simplified 
before trying to merge the block into its predecessors.
This allows two-entry-phi-return.ll to be simplified
into a single basic block.

llvm-svn: 48252
 2008-03-11 21:53:06 +00:00
Dan Gohman
8e9ae96a4a Make this test more challenging to help it avoid being 
optimized away before it tests what it is intended to test.

llvm-svn: 48251
 2008-03-11 21:47:57 +00:00
Devang Patel
a7a2075ab8 Initial multiple return values support. 
llvm-svn: 48210
 2008-03-11 05:46:42 +00:00
Dan Gohman
319234d67c Upgrade this test. 
llvm-svn: 48207
 2008-03-11 02:19:59 +00:00
Devang Patel
741f491d90 Simplify 
llvm-svn: 48163
 2008-03-10 18:38:30 +00:00
Tanya Lattner
5f4b355f20 Remove llvm-upgrade and update tests. 
llvm-svn: 48137
 2008-03-10 07:21:50 +00:00