RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-20 19:42:54 +02:00
Code Issues Projects Releases Wiki Activity
38,472 Commits 4 Branches 5 Tags 704 MiB
6f33fd36ab
Commit Graph

38472 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Chris Lattner
b343e5cf8b Validate that the result of a function type is valid using shared 
logic with vmcore.

llvm-svn: 50138
 2008-04-23 05:36:58 +00:00
Chris Lattner
39e4b2e5d2 Enforce that multiple return values have to have at least one result. 
llvm-svn: 50137
 2008-04-23 05:36:34 +00:00
Chris Lattner
0dd624d232 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
5a4e46d886 returning an empty multiple return list is not valid. 
llvm-svn: 50135
 2008-04-23 05:29:14 +00:00
Chris Lattner
7b8303d37b fix description of 'ret' to be more correct with multiple return 
values.  Clarify that it is impossible to 'multiply return' a 
struct with zero elements.

llvm-svn: 50131
 2008-04-23 04:59:35 +00:00
Chris Lattner
7fe5f6ffea Allow undef as an operand to getresult. 
llvm-svn: 50130
 2008-04-23 04:06:52 +00:00
Chris Lattner
bc7ea01b8a Verify that the operand of a getresult instruction is a 
call/invoke or undef.

llvm-svn: 50129
 2008-04-23 04:06:15 +00:00
Chris Lattner
be858fc296 make this test more interesting. 
llvm-svn: 50128
 2008-04-23 03:49:32 +00:00
Chris Lattner
d059ac2e32 distill down the essense of this test. 
llvm-svn: 50125
 2008-04-23 03:03:42 +00:00
Dale Johannesen
547a55caf1 new test 
llvm-svn: 50123
 2008-04-23 01:22:22 +00:00
Dale Johannesen
3007fc4e1b Do not change the type of a ByVal argument to a 
type of a different size.

llvm-svn: 50121
 2008-04-23 01:03:05 +00:00
Evan Cheng
680839e258 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
e304ae5621 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
c59cf9c8da Dig through multiple levels of AND to thread jumps if needed. 
llvm-svn: 50106
 2008-04-22 20:46:09 +00:00
Owen Anderson
7b318804cc Move MemCpyOpt after GVN. 
llvm-svn: 50097
 2008-04-22 07:12:26 +00:00
Chris Lattner
dcbc6443ae 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
Evan Cheng
bd805d9a00 Added command line option -no-lazy to disable JIT lazy compilation. 
llvm-svn: 50095
 2008-04-22 06:51:41 +00:00
Chris Lattner
003d69adef refactor some code, no functionality change. 
llvm-svn: 50094
 2008-04-22 06:36:15 +00:00
Chris Lattner
4638234905 add a basic testcase. 
llvm-svn: 50093
 2008-04-22 06:35:14 +00:00
Nick Lewycky
97179cb16f Whoops! Undo r50087, unbreak the build. 
llvm-svn: 50088
 2008-04-22 05:20:06 +00:00
Nick Lewycky
e708ae5ffd Reverse r47989. Part of removing 'unwinds to' support. 
llvm-svn: 50087
 2008-04-22 05:16:51 +00:00
Nick Lewycky
1b583954ad Start removing 'unwinds to' support from mainline in preparation for 2.3. 
llvm-svn: 50086
 2008-04-22 05:16:02 +00:00
Owen Anderson
1b5d08ac04 Add MemCpyOpt to LTO. 
llvm-svn: 50081
 2008-04-22 03:57:36 +00:00
Chris Lattner
8837037473 remove dead code. 
llvm-svn: 50080
 2008-04-22 03:21:48 +00:00
Chris Lattner
14be19cf1e 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
Chris Lattner
188b560336 more fallout from Nicholas' asmprinter patch. 
llvm-svn: 50078
 2008-04-22 02:45:44 +00:00
Dan Gohman
93b5be1824 Implement an x86-64 ABI detail of passing structs by hidden first 
argument. The x86-64 ABI requires the incoming value of %rdi to
be copied to %rax on exit from a function that is returning a
large C struct.

Also, add a README-X86-64 entry detailing the missed optimization
opportunity and proposing an alternative approach.

llvm-svn: 50075
 2008-04-21 23:59:07 +00:00
Gabor Greif
4a1122fc9e fix some residual old API that fell thru the cracks of the conversion script, closes http://llvm.org/bugs/show_bug.cgi?id=2246 
llvm-svn: 50062
 2008-04-21 21:31:55 +00:00
Dan Gohman
b4db3f46ac Fix an out-of-bounds access in -view-sunit-dags in the case of an 
empty ScheduleDAG.

llvm-svn: 50054
 2008-04-21 20:07:30 +00:00
Dan Gohman
105b523786 Fix the encoding of the MMX movd that moves from MMX to 64-bit GPR. 
llvm-svn: 50053
 2008-04-21 19:52:29 +00:00
Dan Gohman
8f3ee5a54d Fix the way AliasSet::print prints "may alias". 
llvm-svn: 50051
 2008-04-21 19:48:48 +00:00
Chris Lattner
6e88cf849b fix grammar-o, thanks to Duncan for noticing. 
llvm-svn: 50047
 2008-04-21 18:25:01 +00:00
Duncan Sands
717a1e09aa Make these structs larger to ensure that they 
are returned by struct return.

llvm-svn: 50038
 2008-04-21 08:17:05 +00:00
Duncan Sands
cfb3631483 Make the struct bigger, to ensure it is returned 
by struct return.

llvm-svn: 50037
 2008-04-21 08:12:03 +00:00
Owen Anderson
1d83396504 Use GVN in LTO instead of GCSE+LoadVN. 
llvm-svn: 50036
 2008-04-21 07:51:07 +00:00
Owen Anderson
b171c54227 Remove unneeded #include's. 
llvm-svn: 50035
 2008-04-21 07:47:38 +00:00
Owen Anderson
bc6046416f 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
Duncan Sands
79654e36ce Fix a "large integer implicitly truncated to unsigned type" 
warning.

llvm-svn: 50033
 2008-04-21 07:35:28 +00:00
Chris Lattner
7925af6adf don't print dominators every time it is computed with -debug. 
llvm-svn: 50032
 2008-04-21 06:19:02 +00:00
Chris Lattner
c077c2a4ea another bug introduced in r47802 by nicholas, for no apparent reason. 
llvm-svn: 50031
 2008-04-21 06:12:55 +00:00
Chris Lattner
3117d33f74 Add an ugly note. 
llvm-svn: 50029
 2008-04-21 04:46:30 +00:00
Chris Lattner
1554876e9d Add jump threading to liblto. 
llvm-svn: 50028
 2008-04-21 04:31:40 +00:00
Chris Lattner
8d8e939418 run the jump threading pass in llvm-ld also 
llvm-svn: 50027
 2008-04-21 04:28:40 +00:00
Chris Lattner
c9547a13e5 enable jump threading pass by default. This causes no miscompilations 
and can significantly shrinkify some code, particularly from C++ land.

llvm-svn: 50025
 2008-04-21 04:22:09 +00:00
Chris Lattner
26468c09af fix a bug introduced by Nicholas' "unwinds to" stuff: we 
lost newlines between blocks.

llvm-svn: 50024
 2008-04-21 04:20:33 +00:00
Chris Lattner
ca82082080 don't assume that the argument passed to fprintf("%s" is a string. This 
fixes a crash in opt on 433.milc.

llvm-svn: 50023
 2008-04-21 03:18:33 +00:00
Chris Lattner
9a21fbcf81 Use the new SplitBlockPredecessors to implement a todo. 
llvm-svn: 50022
 2008-04-21 02:57:57 +00:00
Chris Lattner
57e11a167d Move SplitBlockPredecessors out of loopsimplify into BasicBlockUtils.h 
as a global helper function.  At the same type, switch it from taking
a vector of predecessors to an arbitrary sequential input.  This allows
us to switch LoopSimplify to use a SmallVector for various temporary
vectors that it passed into SplitBlockPredecessors.

llvm-svn: 50020
 2008-04-21 01:28:02 +00:00
Chris Lattner
ba4567c335 Move domtree/frontier updating earlier, allowing us to use it to update phi 
nodes, removing a hack.

llvm-svn: 50019
 2008-04-21 01:05:08 +00:00
Chris Lattner
53fa4554be Factor dominator tree and frontier updating into SplitBlockPredecessors 
instead of doing it after every call.

llvm-svn: 50018
 2008-04-21 00:54:38 +00:00