RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 19:52:54 +01:00
Code Issues Projects Releases Wiki Activity
54,594 Commits 4 Branches 5 Tags 704 MiB
859360e596
Commit Graph

54594 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Eric Christopher
859360e596 First pass at llvm.objectsize documentation. 
llvm-svn: 90116
 2009-11-30 08:03:53 +00:00
Nick Lewycky
81fea1665b Revert r90107, fixing test/Transforms/GVN/2009-11-29-ReverseMap.ll and the 
llvm-gcc build.

llvm-svn: 90113
 2009-11-30 07:05:51 +00:00
Nick Lewycky
51b973c964 Add a testcase for the current llvm-gcc build failure. 
llvm-svn: 90112
 2009-11-30 07:02:18 +00:00
Nick Lewycky
ff21b7c592 Remove the 'simple jit' tutorial as it wasn't really being maintained and its 
material is covered by the Kaleidoscope tutorial.

llvm-svn: 90111
 2009-11-30 04:23:17 +00:00
Mon P Wang
22b4e4e223 Add test case for r90108 
llvm-svn: 90109
 2009-11-30 02:42:27 +00:00
Mon P Wang
27bce4e285 Added support to allow clients to custom widen. For X86, custom widen vectors for 
divide/remainder since these operations can trap by unroll them and adding undefs
for the resulting vector.

llvm-svn: 90108
 2009-11-30 02:42:02 +00:00
Chris Lattner
dd895d559f reapply r90093 with an addition of keeping the forward 
and reverse nonlocal memdep maps in synch, this should
fix 255.vortex.

llvm-svn: 90107
 2009-11-30 02:26:29 +00:00
Nick Lewycky
bc81d0985e Fix this test on 64-bit systems which seem to use i64 for gep indices sometimes 
while 32-bit gcc uses i32.

llvm-svn: 90106
 2009-11-30 02:23:57 +00:00
Nick Lewycky
5f9ca6b5c9 Commit r90099 made LLVM simplify one of these constant expressions a little 
more. Update the syntax we're checking for and filecheckize it too.

This will fix the selfhost buildbots but will 'break' the others (sigh) because
they're still linked against older LLVM which is emitting less optimized IR.

llvm-svn: 90104
 2009-11-30 00:38:56 +00:00
Nick Lewycky
116b145b02 Teach ConstantFolding to do a better job when folding gep(bitcast). 
This permits the devirtualization of llvm.org/PR3100#c9 when compiled by clang.

llvm-svn: 90099
 2009-11-29 21:40:55 +00:00
Benjamin Kramer
d9780ec7c5 Revert r90089 for now, it's breaking selfhost. 
llvm-svn: 90097
 2009-11-29 21:17:48 +00:00
Chris Lattner
de1d55c200 revert this patch for now, it causes failures of: 
LLVM::Transforms/GVN/2009-02-17-LoadPRECrash.ll
    LLVM::Transforms/GVN/2009-06-17-InvalidPRE.ll

llvm-svn: 90096
 2009-11-29 21:14:59 +00:00
Chris Lattner
6155ce3427 Fix a really nasty caching bug I introduced in memdep. An entry 
was being added to the Result vector, but not being put in the
cache.  This means that if the cache was reused wholesale for a
later query that it would be missing this entry and we'd do an
incorrect load elimination.

Unfortunately, it's not really possible to write a useful 
testcase for this, but this unbreaks 255.vortex.

llvm-svn: 90093
 2009-11-29 21:09:36 +00:00
Benjamin Kramer
a1d24b5a8d Fix two FIXMEs. 
llvm-svn: 90089
 2009-11-29 20:29:30 +00:00
Nick Lewycky
2c7105b098 Detabify. 
llvm-svn: 90085
 2009-11-29 18:10:39 +00:00
Benjamin Kramer
34f2bcd0ae Remove dead returns. 
llvm-svn: 90083
 2009-11-29 17:42:58 +00:00
Kovarththanan Rajaratnam
435a9894a7 This patch ensures that Path::GetMainExecutable is able to handle the 
case where realpath() fails. When this occurs we segfault trying to
create a std::string from a NULL pointer.

Fixes PR5635.

llvm-svn: 90082
 2009-11-29 17:19:48 +00:00
Daniel Dunbar
f7eaf3980c Fix FileCheck crash when fuzzy scanning starting at the end of the file. 
llvm-svn: 90065
 2009-11-29 08:30:24 +00:00
Chris Lattner
cd6fed25d5 add testcases for the foo_with_overflow op xforms added recently and 
fix bugs exposed by the tests.  Testcases from Alastair Lynn!

llvm-svn: 90056
 2009-11-29 02:57:29 +00:00
Chris Lattner
de599f9ae4 mark all the 'foo with overflow' intrinsics as readnone. 
llvm-svn: 90055
 2009-11-29 02:44:33 +00:00
Chris Lattner
40d74cea6b update and consolidate the load pre notes. 
llvm-svn: 90050
 2009-11-29 02:19:52 +00:00
Chris Lattner
5b1941cafb add PR# 
llvm-svn: 90049
 2009-11-29 01:28:58 +00:00
Chris Lattner
8ba0b842a2 Add a testcase for: 
void test(int N, double* G) {
  long j;
  for (j = 1; j < N - 1; j++)
      G[j] = G[j] + G[j+1] + G[j-1];
}

which we now compile to one load in the loop:

LBB1_2:                                                     ## %bb
	movsd	16(%rsi,%rax,8), %xmm2
	incq	%rdx
	addsd	%xmm2, %xmm1
	addsd	%xmm1, %xmm0
	movapd	%xmm2, %xmm1
	movsd	%xmm0, 8(%rsi,%rax,8)
	incq	%rax
	cmpq	%rcx, %rax
	jne	LBB1_2

instead of:

LBB1_2:                                                     ## %bb
	movsd	8(%rsi,%rax,8), %xmm0
	addsd	16(%rsi,%rax,8), %xmm0
	addsd	(%rsi,%rax,8), %xmm0
	movsd	%xmm0, 8(%rsi,%rax,8)
	incq	%rax
	cmpq	%rcx, %rax
	jne	LBB1_2

llvm-svn: 90048
 2009-11-29 01:15:43 +00:00
Chris Lattner
e7dbdc6a7e add a testcase for 
void test9(int N, double* G) {
  long j;
  for (j = 1; j < N - 1; j++)
      G[j+1] = G[j] + G[j+1];
}

llvm-svn: 90047
 2009-11-29 01:04:40 +00:00
Chris Lattner
d48ff7ea6a Implement PR5634. 
llvm-svn: 90046
 2009-11-29 00:51:17 +00:00
Nick Lewycky
ff44d9d88a Teach memdep to look for memory use intrinsics during dependency queries. Fixes 
PR5574.

llvm-svn: 90045
 2009-11-28 21:27:49 +00:00
Chris Lattner
83284453a1 reenable load address insertion in load pre. This allows us to 
handle cases like this:
void test(int N, double* G) {
  long j;
  for (j = 1; j < N - 1; j++)
      G[j+1] = G[j] + G[j+1];
}

where G[1] isn't live into the loop.

llvm-svn: 90041
 2009-11-28 16:08:18 +00:00
Chris Lattner
f8d8142a06 Enhance InsertPHITranslatedPointer to be able to return a list of newly 
inserted instructions.  No functionality change until someone starts using it.

llvm-svn: 90039
 2009-11-28 15:39:14 +00:00
Chris Lattner
f825d5d176 implement a FIXME: limit the depth that DecomposeGEPExpression goes the same 
way that getUnderlyingObject does it. 

This fixes the 'DecomposeGEPExpression and getUnderlyingObject disagree!' 
assertion on sqlite3.

llvm-svn: 90038
 2009-11-28 15:12:41 +00:00
Chris Lattner
2e5340d0dc enable code to handle un-phi-translatable cases more aggressively: 
if we don't have an address expression available in a predecessor,
then model this as the value being clobbered at the end of the pred
block instead of being modeled as a complete phi translation failure.
This is important for PRE of loads because we want to see that the
load is available in all but this predecessor, and complete phi
translation failure results in not getting any information about
predecessors.

This doesn't do anything until I renable code insertion since PRE
now sees that it is available in all but one predecessors, but can't
insert the addressing in the predecessor that is missing it to 
eliminate the redundancy.

llvm-svn: 90037
 2009-11-28 14:54:10 +00:00
Chris Lattner
f3e5cbfc99 disable value insertion for now, I need to figure out how 
to inform GVN about the newly inserted values.  This fixes 
PR5631.

llvm-svn: 90022
 2009-11-27 22:50:07 +00:00
Chris Lattner
73b425ba51 Rework InsertPHITranslatedPointer to handle the recursive case, this 
fixes PR5630 and sets the stage for the next phase of goodness (testcase
pending).

llvm-svn: 90019
 2009-11-27 22:05:15 +00:00
Chris Lattner
473e8af336 recursively phi translate bitcast operands too, for consistency. 
llvm-svn: 90016
 2009-11-27 20:25:30 +00:00
Nick Lewycky
44573bb42b Oops! Fix bug introduced in my recent cleanup change. Thanks to Tobias Grosser 
for pointing this out.

llvm-svn: 90015
 2009-11-27 19:57:53 +00:00
Chris Lattner
1fc57583fa I accidentally implemented this :) 
llvm-svn: 90014
 2009-11-27 19:56:00 +00:00
Chris Lattner
b1fceb6006 add support for recursive phi translation and phi 
translation of add with immediate.  This allows us
to optimize this function:

void test(int N, double* G) {
  long j;
  G[1] = 1;
    for (j = 1; j < N - 1; j++)
        G[j+1] = G[j] + G[j+1];
}

to only do one load every iteration of the loop.

llvm-svn: 90013
 2009-11-27 19:11:31 +00:00
Chris Lattner
6f124b48c3 add two simple test cases we now optimize (to one load in the loop each) and one we don't (corresponding to the fixme I added yesterday). 
llvm-svn: 90012
 2009-11-27 18:08:30 +00:00
Chris Lattner
bdaed088ea factor some logic out of instcombine into a new SimplifyAddInst method. 
llvm-svn: 90011
 2009-11-27 17:42:22 +00:00
Chris Lattner
0df78ea645 add a deadargelim note. 
llvm-svn: 90009
 2009-11-27 17:12:30 +00:00
Chris Lattner
c0b92ff385 This testcase is actually only partially redundant, and requires 
the FIXME I added yesterday to be implemented.

llvm-svn: 90008
 2009-11-27 16:53:57 +00:00
Chris Lattner
cdfa9dadf1 fix PR5436 by making the 'simple' case of SRoA not promote out of range 
array indexes.  The "complex" case of SRoA still handles them, and correctly.

This fixes a weirdness where we'd correctly avoid transforming A[0][42] if
the 42 was too large, but we'd only do it if it was one gep, not two separate
ones.

llvm-svn: 90007
 2009-11-27 16:37:41 +00:00
Chris Lattner
02211273c7 filecheckize 
llvm-svn: 90006
 2009-11-27 16:31:59 +00:00
Duncan Sands
638c57757d While this test is testing a problem in the generic part of codegen, 
the problem only shows for msp430 and pic16 which is why it specifies
them using -march.  But it is wrong to put such tests in CodeGen/Generic,
since not everyone builds these targets.  Put a copy of the test in each
of the target test directories.

llvm-svn: 90005
 2009-11-27 16:04:14 +00:00
Duncan Sands
d68bde384e Vector types are no longer required to have a power-of-two length. 
llvm-svn: 90004
 2009-11-27 13:38:03 +00:00
Duncan Sands
a255c38866 These code generator limitations have been removed. 
llvm-svn: 90003
 2009-11-27 12:33:22 +00:00
Chris Lattner
c81be8ddba add comment. 
llvm-svn: 90002
 2009-11-27 08:40:14 +00:00
Chris Lattner
af321b5729 reduce nesting, no functionality change. 
llvm-svn: 90001
 2009-11-27 08:37:22 +00:00
Chris Lattner
e7056c8cde limit the recursion depth of GetLinearExpression. This 
fixes a crash analyzing consumer-lame, which had an "%X = add %X, 1"
in unreachable code.

llvm-svn: 90000
 2009-11-27 08:32:52 +00:00
Chris Lattner
a466dbe80a teach GVN's load PRE to insert computations of the address in predecessors 
where it is not available.  It's unclear how to get this inserted 
computation into GVN's scalar availability sets, Owen, help? :)

llvm-svn: 89997
 2009-11-27 08:25:10 +00:00
Chris Lattner
9c8da17055 add some tests for memdep phi translation + PRE. 
llvm-svn: 89996
 2009-11-27 06:42:42 +00:00