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
37,490 Commits 4 Branches 5 Tags 704 MiB
6713367062
Commit Graph

4940 Commits

Author SHA1 Message Date
Devang Patel
446581de1d Update bitcode reader and writer to handle multiple return values. 
Take 2.

llvm-svn: 47583
 2008-02-26 01:29:32 +00:00
Owen Anderson
6eafd532ab Fix an issue where GVN was performing the return slot optimization when it was 
not safe.  This is fixed by more aggressively checking that the return slot is
not used elsewhere in the function.

llvm-svn: 47544
 2008-02-25 04:08:09 +00:00
Evan Cheng
e283043860 Temporarily reverting 46959. 
llvm-svn: 47542
 2008-02-25 03:57:32 +00:00
Owen Anderson
432abc0479 Fix an issue where GVN would try to use an instruction before its definition when performing return slot optimization. 
llvm-svn: 47541
 2008-02-25 00:40:41 +00:00
Evan Cheng
654983ba21 Backing out r47521 for now. This has broken a number of tests. 
llvm-svn: 47533
 2008-02-23 19:32:32 +00:00
Scott Michel
36bbc39272 Merge current work back to tree to minimize diffs and drift. Major highlights 
for CellSPU modifications:

- SPUInstrInfo.td refactoring: "multiclass" really is _your_ friend.
- Other improvements based on refactoring effort in SPUISelLowering.cpp,
  esp. in SPUISelLowering::PerformDAGCombine(), where zero amount shifts and
  rotates are now eliminiated, other scalar-to-vector-to-scalar silliness
  is also eliminated.
- 64-bit operations are being implemented, _muldi3.c gcc runtime now
  compiles and generates the right code. More work still needs to be done.

llvm-svn: 47532
 2008-02-23 18:41:37 +00:00
Zhou Sheng
5f4e29db89 Testcase for Revision 47478. 
llvm-svn: 47531
 2008-02-23 10:59:51 +00:00
Evan Cheng
d299f09bc5 Rematerialization logic was overly conservative when it comes to loads from fixed stack slots. 
llvm-svn: 47529
 2008-02-23 03:38:34 +00:00
Evan Cheng
6782480bd1 Update test. 
llvm-svn: 47527
 2008-02-23 02:57:25 +00:00
Evan Cheng
4e9d5f1ead Remat of pic loads are now on by default. 
llvm-svn: 47525
 2008-02-23 02:08:30 +00:00
Dan Gohman
8d536a33ff Fix a bug that caused opt and other tools to silently ignore 
invalid command-line options.

llvm-svn: 47523
 2008-02-23 01:55:25 +00:00
Devang Patel
4995a89a8d Properly read and write bitcodes for multiple return values. 
llvm-svn: 47521
 2008-02-23 01:44:55 +00:00
Evan Cheng
7c3a8d0056 Really. Why doesn't every arch support MMX? 
llvm-svn: 47513
 2008-02-23 00:56:14 +00:00
Evan Cheng
3b35d2a86c Test case for PR2082. 
llvm-svn: 47501
 2008-02-22 20:38:49 +00:00
Evan Cheng
1b417c4d84 Allow re-materialization of pic load (controlled by -remat-pic-load for now). 
llvm-svn: 47476
 2008-02-22 09:25:47 +00:00
Chris Lattner
a64d4179d4 copy mmx values from/to memory with GPRs on x86-32 
instead of with mmx registers.  This horribleness is apparently
done by gcc to avoid having to insert emms in places that really 
should have it.  This is the second half of rdar://5741668.

llvm-svn: 47474
 2008-02-22 05:18:04 +00:00
Chris Lattner
e70bc39d74 Start using GPR's to copy around mmx value instead of mmx regs. 
GCC apparently does this, and code depends on not having to do
emms when this happens.  This is x86-64 only so far, second half
should handle x86-32.

rdar://5741668

llvm-svn: 47470
 2008-02-22 02:09:43 +00:00
Chris Lattner
4f87f1c087 Treat clobber operands like early clobbers: if we have 
any, we force sdisel to do all regalloc for an asm.  This
leads to gross but correct codegen.

This fixes the rest of PR2078.

llvm-svn: 47454
 2008-02-21 19:43:13 +00:00
Tanya Lattner
8116db05a6 Remove llvm-upgrade and update tests. 
llvm-svn: 47432
 2008-02-21 07:42:26 +00:00
Chris Lattner
2f3bffc338 testcase for PR1133 
llvm-svn: 47427
 2008-02-21 05:27:08 +00:00
Chris Lattner
99b5a37d39 Fix a (harmless) but where vregs were added to the used reg lists for 
inline asms.

Fix PR2078 by marking aliases of registers used when a register is 
marked used.  This prevents EAX from being allocated when AX is listed
in the clobber set for the asm.

llvm-svn: 47426
 2008-02-21 04:55:52 +00:00
Devang Patel
e60ebc7744 Let invoke return aggregate value. 
llvm-svn: 47425
 2008-02-21 02:14:01 +00:00
Devang Patel
702c4a60a6 Let function call return aggregate. 
Now, we have very first multiple return value testcase!

llvm-svn: 47424
 2008-02-21 01:54:02 +00:00
Devang Patel
5c037ae5d5 XFAIL for now. 
llvm-svn: 47411
 2008-02-20 23:10:42 +00:00
Devang Patel
6436033c71 Now functions can return aggregate values. 
llvm-svn: 47409
 2008-02-20 22:51:28 +00:00
Nick Lewycky
0b6cdd1eff Add 'umax' similar to 'smax' SCEV. Closes PR2003. 
Parse reversed smax and umax as smin and umin and express them with negative
or binary-not SCEVs (which are really just subtract under the hood).

Parse 'xor %x, -1' as (-1 - %x).

Remove dead code (ConstantInt::get always returns a ConstantInt).

Don't use getIntegerSCEV(-1, Ty). The first value is an int, then it gets
passed into a uint64_t. Instead, create the -1 directly from
ConstantInt::getAllOnesValue().

llvm-svn: 47360
 2008-02-20 06:48:22 +00:00
Evan Cheng
33ee06fa48 XFAIL this for now. 
llvm-svn: 47355
 2008-02-20 02:38:58 +00:00
Chris Lattner
aaafe47a55 this test requires sse2 
llvm-svn: 47331
 2008-02-19 18:07:46 +00:00
Chris Lattner
3a4ac3a69e Don't fold and's into test instructions if they have multiple uses. 
This compiles test-nofold.ll into:

_test:
	movl	$15, %ecx
	andl	4(%esp), %ecx
	testl	%ecx, %ecx
	movl	$42, %eax
	cmove	%ecx, %eax
	ret

instead of:
_test:
	movl	4(%esp), %eax
	movl	%eax, %ecx
	andl	$15, %ecx
	testl	$15, %eax
	movl	$42, %eax
	cmove	%ecx, %eax
	ret

llvm-svn: 47330
 2008-02-19 17:37:35 +00:00
Chris Lattner
67f2a6c009 rename tests to avoid a test- prefix when they aren't related to the test instruction. 
llvm-svn: 47329
 2008-02-19 17:33:52 +00:00
Tanya Lattner
230c714773 Remove llvm-upgrade and update tests. 
llvm-svn: 47325
 2008-02-19 08:07:33 +00:00
Chris Lattner
8880d6ba5b dead pass 
llvm-svn: 47324
 2008-02-19 07:58:11 +00:00
Chris Lattner
5400cc3907 Fix PR2060 by rejecting invalid types for integer constants. 
llvm-svn: 47311
 2008-02-19 04:36:07 +00:00
Nick Lewycky
69457748ab Don't spew stats to stderr. 
llvm-svn: 47308
 2008-02-19 03:11:47 +00:00
Nick Lewycky
0560401b2e Fix up the run line for this new test. 
llc: for the -info-output-file option:  requires a value!

llvm-svn: 47306
 2008-02-19 02:58:36 +00:00
Evan Cheng
de4579d0b3 New test. 
llvm-svn: 47302
 2008-02-19 02:09:58 +00:00
Tanya Lattner
169eaef57b Remove llvm-upgrade and update tests. 
llvm-svn: 47297
 2008-02-19 01:44:26 +00:00
Tanya Lattner
aeb9bb8ba4 Remove llvm-upgrade and update tests. 
llvm-svn: 47296
 2008-02-19 01:41:04 +00:00
Evan Cheng
bb577266bf - When DAG combiner is folding a bit convert into a BUILD_VECTOR, it should check if it's essentially a SCALAR_TO_VECTOR. Avoid turning (v8i16) <10, u, u, u> to <10, 0, u, u, u, u, u, u>. Instead, simply convert it to a SCALAR_TO_VECTOR of the proper type. 
- X86 now normalize SCALAR_TO_VECTOR to (BIT_CONVERT (v4i32 SCALAR_TO_VECTOR)). Get rid of X86ISD::S2VEC.

llvm-svn: 47290
 2008-02-18 23:04:32 +00:00
Nick Lewycky
1f3c58df08 Correctly fold divide-by-constant, even when faced with overflow. 
llvm-svn: 47287
 2008-02-18 22:48:05 +00:00
Dan Gohman
70b9b2f77f Don't mark scalar integer multiplication as Expand on x86, since x86 
has plain one-result scalar integer multiplication instructions.
This avoids expanding such instructions into MUL_LOHI sequences that
must be special-cased at isel time, and avoids the problem with that
code that provented memory operands from being folded.

This fixes PR1874, addressesing the most common case. The uncommon
cases of optimizing multiply-high operations will require work
in DAGCombiner.

llvm-svn: 47277
 2008-02-18 17:55:26 +00:00
Chris Lattner
a6dc8aaa3f make this just a bit more strict. 
llvm-svn: 47274
 2008-02-18 17:33:10 +00:00
Owen Anderson
7b092ea631 Add support to GVN for performing sret return slot optimization. This means that, if an sret function tail calls 
another sret function, it should pass its own sret parameter to the tail callee, allowing it to fill in the correct
return value.  llvm-gcc does not emit this by default.  Instead, it allocates space in the caller for the sret of
the tail call and then uses memcpy to copy the result into the caller's sret parameter.  This optimization detects
and optimizes that case.

llvm-svn: 47265
 2008-02-18 09:24:53 +00:00
Chris Lattner
9851db050b optimize away stackrestore calls that have no intervening alloca or call. 
llvm-svn: 47258
 2008-02-18 06:12:38 +00:00
Chris Lattner
dd489bf3eb upgrade this test. 
llvm-svn: 47257
 2008-02-18 06:11:00 +00:00
Chris Lattner
2fa904b3af Fold (-x + -y) -> -(x+y) which promotes better association, fixing 
the second half of PR2047

llvm-svn: 47244
 2008-02-17 21:03:36 +00:00
Chris Lattner
4a34461d64 Split up subtracts into add+negate if they have a reassociable use or operand 
that is also a subtract.  This implements PR2047 and Transforms/Reassociate/subtest2.ll 

llvm-svn: 47241
 2008-02-17 20:51:26 +00:00
Chris Lattner
7cd16f34b3 upgrade and simplify this test. 
llvm-svn: 47240
 2008-02-17 20:48:43 +00:00
Tanya Lattner
03755061ae Remove llvm-upgrade. 
llvm-svn: 47238
 2008-02-17 20:02:20 +00:00
Chris Lattner
1ce2265908 fix this test. 
llvm-svn: 47232
 2008-02-17 00:15:25 +00:00
Tanya Lattner
bcf113b2ca Remove llvm-upgrade 
llvm-svn: 47231
 2008-02-17 00:15:09 +00:00
Tanya Lattner
71db645ff2 Remove llvm-upgrade. 
llvm-svn: 47230
 2008-02-17 00:13:09 +00:00
Chris Lattner
37c93d2a82 this test isn't useful since we added @ notation for globals. 
llvm-svn: 47229
 2008-02-17 00:12:03 +00:00
Chris Lattner
52d5239f6d this line was commented out. 
llvm-svn: 47228
 2008-02-17 00:09:08 +00:00
Tanya Lattner
c08b5f0208 Remove llvm-upgrade and update tests. 
llvm-svn: 47227
 2008-02-16 23:55:46 +00:00
Tanya Lattner
1ffe4f2e88 Removing llvm upgrade, so remove tests specific to llvm-upgrade and update the tests that used it. 
llvm-svn: 47225
 2008-02-16 23:27:24 +00:00
Duncan Sands
cd0325cce1 Remove any 'nest' parameter attributes if the function 
is not passed as an argument to a trampoline intrinsic.

llvm-svn: 47220
 2008-02-16 20:56:04 +00:00
Andrew Lenharth
c178981b85 llvm.memory.barrier, and impl for x86 and alpha 
llvm-svn: 47204
 2008-02-16 01:24:58 +00:00
Chris Lattner
f8ab0af3c0 upgrade this test, which wasn't testing the right thing since llvm-upgrade came around. 
llvm-svn: 47194
 2008-02-15 23:58:25 +00:00
Chris Lattner
afae31f812 rename llx -> ll 
llvm-svn: 47192
 2008-02-15 23:51:48 +00:00
Evan Cheng
94742fb5d4 This test is not interesting. 
llvm-svn: 47189
 2008-02-15 23:06:21 +00:00
Dale Johannesen
15e608542e Modify test to expect improved code. 
llvm-svn: 47182
 2008-02-15 22:05:15 +00:00
Duncan Sands
e0330d632a Fix this test on linux, which returns S242 
using sret.

llvm-svn: 47173
 2008-02-15 19:42:13 +00:00
Devang Patel
01f9252f73 Fix PR2028 
llvm-svn: 47150
 2008-02-15 01:24:49 +00:00
Devang Patel
8af92b942c If loop header is also loop exiting block then OrigPN is incoming value for B loop header. 
Fixes PR 2030.

llvm-svn: 47141
 2008-02-14 23:18:47 +00:00
Chris Lattner
b8bf200b77 Fix PR2029 
llvm-svn: 47129
 2008-02-14 19:18:13 +00:00
Chris Lattner
9c24f3ec37 Fix a miscompilation from Dan's recent apintification. 
llvm-svn: 47128
 2008-02-14 18:48:56 +00:00
Tanya Lattner
df7da98f55 Remove llvm-upgrade 
llvm-svn: 47119
 2008-02-14 07:57:12 +00:00
Nick Lewycky
12098ea401 Testcase for PR2032. 
llvm-svn: 47113
 2008-02-14 07:15:11 +00:00
Tanya Lattner
f37f44f9ec Remove llvm-upgrade. 
llvm-svn: 47110
 2008-02-14 06:56:27 +00:00
Chris Lattner
d696c25db5 This readme entry is done, testcase here: CodeGen/X86/zero-remat.ll 
llvm-svn: 47106
 2008-02-14 05:39:46 +00:00
Evan Cheng
cbbcb3144d Fix test. 
llvm-svn: 47102
 2008-02-14 01:32:53 +00:00
Devang Patel
38de2d11a5 A loop latch phi node may have uses inside loop, not just in loop header. 
llvm-svn: 47093
 2008-02-13 22:23:07 +00:00
Devang Patel
1e71afe2df While moving exit condition, do not drop loop latch on the floor. 
llvm-svn: 47089
 2008-02-13 22:06:36 +00:00
Devang Patel
d48bbbf07b Keep track of exit value operand number when operands are swapped. 
llvm-svn: 47082
 2008-02-13 19:48:48 +00:00
Dale Johannesen
cc4f128930 New test, see comments. 
llvm-svn: 47078
 2008-02-13 18:36:48 +00:00
Duncan Sands
2e9661573f Teach LegalizeTypes how to expand and promote CTLZ, 
CTTZ and CTPOP.  The expansion code differs from
that in LegalizeDAG in that it chooses to take the
CTLZ/CTTZ count from the Hi/Lo part depending on
whether the Hi/Lo value is zero, not on whether
CTLZ/CTTZ of Hi/Lo returned 32 (or whatever the
width of the type is) for it.  I made this change
because the optimizers may well know that Hi/Lo
is zero and exploit it.  The promotion code for
CTTZ also differs from that in LegalizeDAG: it
uses an "or" to get the right result when the
original value is zero, rather than using a compare
and select.  This also means the value doesn't
need to be zero extended.

llvm-svn: 47075
 2008-02-13 18:01:53 +00:00
Eli Friedman
cf6273d015 Add a note pointing to PR1996. 
llvm-svn: 47055
 2008-02-13 07:56:04 +00:00
Chris Lattner
a30946c576 In SDISel, for targets that support FORMAL_ARGUMENTS nodes, lower this 
node as soon as we create it in SDISel.  Previously we would lower it in
legalize.  The problem with this is that it only exposes the argument
loads implied by FORMAL_ARGUMENTs after legalize, so that only dag combine 2
can hack on them.  This causes us to miss some optimizations because 
datatype expansion also happens here.

Exposing the loads early allows us to do optimizations on them.  For example
we now compile arg-cast.ll to:

_foo:
	movl	$2147483647, %eax
	andl	8(%esp), %eax
	ret

where we previously produced:

_foo:
	subl	$12, %esp
	movsd	16(%esp), %xmm0
	movsd	%xmm0, (%esp)
	movl	$2147483647, %eax
	andl	4(%esp), %eax
	addl	$12, %esp
	ret

It might also make sense to do this for ISD::CALL nodes, which have implicit
stores on many targets.

llvm-svn: 47054
 2008-02-13 07:39:09 +00:00
Eli Friedman
75220639b6 Add test for PR1996. (This is my first time adding a test for a 
transform, so please review.)

llvm-svn: 47050
 2008-02-13 06:55:57 +00:00
Nate Begeman
cfd9883301 Add testcase for recent legalizer change 
llvm-svn: 47049
 2008-02-13 06:48:40 +00:00
Evan Cheng
68a88c1f52 New tests. 
llvm-svn: 47047
 2008-02-13 03:23:53 +00:00
Owen Anderson
274aa2846e Re-apply the patch to improve the optimizations of memcpy's, with several 
bugs fixed.  This now passes PPC bootstrap.

llvm-svn: 47026
 2008-02-12 21:15:18 +00:00
Evan Cheng
0d2efb485d Don't mask the isel bug. 
llvm-svn: 47018
 2008-02-12 19:11:29 +00:00
Evan Cheng
6c7520f922 This test assumes no SSE4.1. 
llvm-svn: 47017
 2008-02-12 19:11:08 +00:00
Wojciech Matyjewicz
6df5450bc4 Now that ScalarEvolution::print writes to the correct stream, there is 
no need to redirect stderr into stdout.

llvm-svn: 47009
 2008-02-12 15:12:40 +00:00
Wojciech Matyjewicz
ae01857e92 Change negative grep into positive one in my yesterday's testcase. 
llvm-svn: 47008
 2008-02-12 15:10:35 +00:00
Wojciech Matyjewicz
b6e6dacc60 Fix PR2002. Suppose n is the initial value for the induction 
variable (with step 1) and m is its final value. Then, the correct trip 
count is SMAX(m,n)-n. Previously, we used SMAX(0,m-n), but m-n may 
overflow and can't in general be interpreted as signed.

Patch by Nick Lewycky.

llvm-svn: 47007
 2008-02-12 15:09:36 +00:00
Tanya Lattner
cefcef7955 Test case for annotate builtin. 
llvm-svn: 46999
 2008-02-12 07:46:33 +00:00
Evan Cheng
1ab096a313 Fix some test cases. 
llvm-svn: 46998
 2008-02-12 07:22:46 +00:00
Wojciech Matyjewicz
2874a19254 If the LHS of the comparison is a loop-invariant we also want to move it 
to the RHS. This simple change allows to compute loop iteration count 
for loops with condition similar to the one in the testcase (which seems 
to be quite common).

llvm-svn: 46959
 2008-02-11 18:37:34 +00:00
Wojciech Matyjewicz
76c2b22ee4 Fix PR1798 - an error in the evaluation of SCEVAddRecExpr at an 
arbitrary iteration.

The patch:
1) changes SCEVSDivExpr into SCEVUDivExpr,
2) replaces PartialFact() function with BinomialCoefficient(); the 
computations (essentially, the division) in BinomialCoefficient() are 
performed with the apprioprate bitwidth necessary to avoid overflow; 
unsigned division is used instead of the signed one.

Computations in BinomialCoefficient() require support from the code 
generator for APInts. Currently, we use a hack rounding up the 
neccessary bitwidth to the nearest power of 2. The hack is easy to turn 
off in future.

One remaining issue: we assume the divisor of the binomial coefficient 
formula can be computed accurately using 16 bits. It means we can handle 
AddRecs of length up to 9. In future, we should use APInts to evaluate 
the divisor.

Thanks to Nicholas for cooperation!

llvm-svn: 46955
 2008-02-11 11:03:14 +00:00
Evan Cheng
19f684ed72 Determine whether a spill kills the register it's spilling before insertion rather than trying to undo the kill marker afterwards. 
llvm-svn: 46953
 2008-02-11 08:30:52 +00:00
Dan Gohman
cabaec582f Rename MRegisterInfo to TargetRegisterInfo. 
llvm-svn: 46930
 2008-02-10 18:45:23 +00:00
Dale Johannesen
304406f01c Alignment of struct containing vectors depends on 
whether SSE is present, on Darwin anyway.  Make it
explicit.

llvm-svn: 46909
 2008-02-09 19:04:25 +00:00
Devang Patel
9aba178666 Fix PR 1995. 
llvm-svn: 46898
 2008-02-08 22:49:13 +00:00
Evan Cheng
90f03a0b88 It's not always safe to fold movsd into xorpd, etc. Check the alignment of the load address first to make sure it's 16 byte aligned. 
llvm-svn: 46893
 2008-02-08 21:20:40 +00:00
Evan Cheng
b2bc19ee5b Added missing entries in X86 load / store folding tables. 
llvm-svn: 46866
 2008-02-08 00:12:56 +00:00
Evan Cheng
a377b2bbd1 Fix a x86-64 codegen deficiency. Allow gv + offset when using rip addressing mode. 
Before:
_main:
        subq    $8, %rsp
        leaq    _X(%rip), %rax
        movsd   8(%rax), %xmm1
        movss   _X(%rip), %xmm0
        call    _t
        xorl    %ecx, %ecx
        movl    %ecx, %eax
        addq    $8, %rsp
        ret
Now:
_main:
        subq    $8, %rsp
        movsd   _X+8(%rip), %xmm1
        movss   _X(%rip), %xmm0
        call    _t
        xorl    %ecx, %ecx
        movl    %ecx, %eax
        addq    $8, %rsp
        ret

Notice there is another idiotic codegen issue that needs to be fixed asap:
xorl    %ecx, %ecx
movl    %ecx, %eax

llvm-svn: 46850
 2008-02-07 08:53:49 +00:00
Evan Cheng
6b03a1aeb9 It's PR1925, not PR1609. 
llvm-svn: 46825
 2008-02-06 22:07:17 +00:00
Bill Wendling
8a28ab4b1f Temporarily reverting: 
http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20080128/057882.html

This is causing a miscompilation on PPC G5 and just now seeing it on iMac x86-64.

llvm-svn: 46822
 2008-02-06 20:03:07 +00:00
Evan Cheng
2091d9a2e8 Fix a number of local register allocator issues: PR1609. 
llvm-svn: 46821
 2008-02-06 19:16:53 +00:00
Evan Cheng
851d353eb8 Fix PR1975: dag isel emitter produces patterns that isel wrong flag result. 
llvm-svn: 46776
 2008-02-05 22:50:29 +00:00
Evan Cheng
69d5e0fc0f If a vr is already marked alive in a bb, then it has PHI uses that are visited earlier, then it is not killed in the def block (i.e. not dead). 
llvm-svn: 46763
 2008-02-05 20:04:18 +00:00
Chris Lattner
96deed5d4d Fix a bug compiling PR1978 (perhaps not the only one though) which 
was incorrectly simplifying "x == (gep x, 1, i)" into false, even 
though i could be negative.  As it turns out, all the code to 
handle this already existed, we just need to disable the incorrect
optimization case and let the general case handle it.

llvm-svn: 46739
 2008-02-05 04:45:32 +00:00
Evan Cheng
f1ad13301a This should also work on x86 now. 
llvm-svn: 46730
 2008-02-05 00:25:31 +00:00
Duncan Sands
b65b2462c8 Crashes LegalizeTypes with "Do not know how to 
expand the result of this operator!" (node: ctlz).

llvm-svn: 46713
 2008-02-04 18:07:02 +00:00
Duncan Sands
123f86e781 Crashes LegalizeTypes with "Do not know how to split 
this operator's operand" (node: extract_subvector).

llvm-svn: 46712
 2008-02-04 18:05:42 +00:00
Chris Lattner
cad0478491 remove target triple to make this test more "generic" 
llvm-svn: 46711
 2008-02-04 18:02:37 +00:00
Duncan Sands
36a938c4fb Crashed the new type legalizer. Not likely to catch 
any bugs in the future since to get the crash you also
need hacked in fake libcall support (which creates odd
but legal trees), but since adding it doesn't hurt...
Thanks to Chris for this ultimately reduced version.

llvm-svn: 46706
 2008-02-04 09:40:27 +00:00
Owen Anderson
e2150dfe24 Make this test more aggressive, to cover recent improvements. 
llvm-svn: 46695
 2008-02-04 04:55:24 +00:00
Owen Anderson
aaba6f96da Allow GVN to hack on memcpy's, making them open to further optimization. 
llvm-svn: 46693
 2008-02-04 02:59:58 +00:00
Nick Lewycky
81cc718a25 Tag this test with the PR reference. 
llvm-svn: 46688
 2008-02-03 16:35:19 +00:00
Nick Lewycky
febd3642ce There are some cases where icmp(add) can be folded into a new icmp. Handle them. 
llvm-svn: 46687
 2008-02-03 16:33:09 +00:00
Gordon Henriksen
b75d9e974d Fixing a bug creating floating point constants of type other 
than double through the C bindings. Thanks to Tomas Lindquist
Olsen for reporting it.

llvm-svn: 46656
 2008-02-02 01:07:50 +00:00
Lauro Ramos Venancio
563e0a3ea3 CBackend: Implement unaligned load/store. 
llvm-svn: 46646
 2008-02-01 21:25:59 +00:00
Duncan Sands
454a8eaee9 Don't drop function/call return attributes like 'nounwind'. 
llvm-svn: 46645
 2008-02-01 20:37:16 +00:00
Dale Johannesen
916037c01a Accept getelementptr starting at GV with all 0 indices as a 
legitimate way of representing global variable GV in debug info.

llvm-svn: 46565
 2008-01-30 19:00:21 +00:00
Tanya Lattner
bfeb583bfb Pointers change size depending upon the target. Remove them to make the test more stable. 
llvm-svn: 46548
 2008-01-30 05:15:15 +00:00
Owen Anderson
ad9a347656 Make DSE much more aggressive by performing DCE earlier. Update a testcase to reflect this increased aggressiveness. 
llvm-svn: 46542
 2008-01-30 01:24:47 +00:00
Chris Lattner
83227e350d Fix a bug where scalarrepl would discard offset if type would match. 
In practice this can only happen on code with already undefined behavior, 
but this is still a good thing to handle correctly.

llvm-svn: 46539
 2008-01-30 00:39:15 +00:00
Evan Cheng
6a35d0f26e Update this test case. 
llvm-svn: 46526
 2008-01-29 19:30:05 +00:00
Chris Lattner
e08ec140e0 Don't let globalopt hack on volatile loads or stores. 
llvm-svn: 46523
 2008-01-29 19:01:37 +00:00
Chris Lattner
83f411c586 eliminate additions of 0.0 when they are obviously dead. This has to be careful to 
avoid turning -0.0 + 0.0 -> -0.0 which is incorrect.

llvm-svn: 46499
 2008-01-29 06:52:45 +00:00
Owen Anderson
2688087c9c Add a testcase for eliminating memcpy's at the end of functions. Forgot to commit this with my last commit. 
llvm-svn: 46497
 2008-01-29 06:40:32 +00:00
Chris Lattner
35f063e37c Add target triples to these so they don't fail on linux. 
llvm-svn: 46496
 2008-01-29 06:26:07 +00:00
Duncan Sands
47bcca5cea This would be better done as an executable test. 
llvm-svn: 46493
 2008-01-29 06:04:54 +00:00
Duncan Sands
84bc852b52 After recent changes we fail to optimize this test 
sufficiently to have it pass.  I'm removing it from
the testsuite and adding it to PR452 instead.

llvm-svn: 46492
 2008-01-29 05:57:23 +00:00
Devang Patel
86ff705c22 Filter loops that subtract induction variables. 
These loops are not yet handled.

Fix PR 1912.

llvm-svn: 46484
 2008-01-29 02:20:41 +00:00
Scott Michel
dc780aeb57 Overhaul Cell SPU's addressing mode internals so that there are now 
only two addressing mode nodes, SPUaform and SPUindirect (vice the
three previous ones, SPUaform, SPUdform and SPUxform). This improves
code somewhat because we now avoid using reg+reg addressing when
it can be avoided. It also simplifies the address selection logic,
which was the main point for doing this.

Also, for various global variables that would be loaded using SPU's
A-form addressing, prefer D-form offs[reg] addressing, keeping the
base in a register if the variable is used more than once.

llvm-svn: 46483
 2008-01-29 02:16:57 +00:00
Devang Patel
51fde22367 New test. 
llvm-svn: 46479
 2008-01-29 01:10:04 +00:00
Bill Wendling
839e21bce4 Add test to make sure that #pragma mark/error doesn't error if there are 
unbalanced quotes.

llvm-svn: 46476
 2008-01-29 00:41:29 +00:00
Duncan Sands
93f785a638 Pure/const functions with ByVal parameters cannot 
be marked readonly either.

llvm-svn: 46456
 2008-01-28 19:25:47 +00:00
Chris Lattner
20854cf4e7 this test is now compiled into the right thing. 
llvm-svn: 46454
 2008-01-28 17:38:46 +00:00
Duncan Sands
ecab334ce0 Make this more likely to be passed byval. 
llvm-svn: 46451
 2008-01-28 10:35:11 +00:00
Nick Lewycky
6b070b1b93 Handle some more combinations of extend and icmp. Fixes PR1940. 
llvm-svn: 46431
 2008-01-28 03:48:02 +00:00
Chris Lattner
359756ea4b Fix PR1932 by disabling an xform invalid for fdiv. 
llvm-svn: 46429
 2008-01-28 00:58:18 +00:00
Chris Lattner
7250586ec9 Fix PR1938 by forcing the code that uses an undefined value to branch one 
way or the other.  Rewriting the code itself prevents subsequent analysis
passes from making contradictory conclusions about the code that could 
cause an infeasible path to be made feasible.

llvm-svn: 46427
 2008-01-28 00:32:30 +00:00
Chris Lattner
26a8116f49 Update this test. Due to dag combiner improvements, we now compile 
f7/f11 to:

_f7:
	eor r0, r0, #2, 2 @ -2147483648
	bx lr
_f11:
	bic r0, r0, #2, 2 @ -2147483648
	bx lr

instead of:

_f7:
	fmsr s0, r0
	fnegs s0, s0
	fmrs r0, s0
	bx lr

_f11:
	fmsr s0, r0
	fabss s0, s0
	fmrs r0, s0
	bx lr

llvm-svn: 46423
 2008-01-27 23:26:37 +00:00
Nick Lewycky
cd28ef8950 Be more careful modifying the use_list while also iterating through it. 
llvm-svn: 46417
 2008-01-27 18:35:00 +00:00
Duncan Sands
e77256b325 Revert r46393: readonly/readnone functions are no 
longer allowed to write through byval arguments.

llvm-svn: 46416
 2008-01-27 18:12:58 +00:00
Chris Lattner
2ab1fd3824 Implement some dag combines that allow doing fneg/fabs/fcopysign in integer 
registers if used by a bitconvert or using a bitconvert.  This allows us to
avoid constant pool loads and use cheaper integer instructions when the
values come from or end up in integer regs anyway.  For example, we now 
compile CodeGen/X86/fp-in-intregs.ll to:

_test1:
	movl	$2147483648, %eax
	xorl	4(%esp), %eax
	ret
_test2:
	movl	$1065353216, %eax
	orl	4(%esp), %eax
	andl	$3212836864, %eax
	ret

Instead of:
_test1:
	movss	4(%esp), %xmm0
	xorps	LCPI2_0, %xmm0
	movd	%xmm0, %eax
	ret
_test2:
	movss	4(%esp), %xmm0
	andps	LCPI3_0, %xmm0
	movss	LCPI3_1, %xmm1
	andps	LCPI3_2, %xmm1
	orps	%xmm0, %xmm1
	movd	%xmm1, %eax
	ret

bitconverts can happen due to various calling conventions that require
fp values to passed in integer regs in some cases, e.g. when returning
a complex.

llvm-svn: 46414
 2008-01-27 17:42:27 +00:00
Bill Wendling
0e2b8c2c45 The CorrelatedExpressions pass is now no more. 
llvm-svn: 46409
 2008-01-27 06:13:32 +00:00
Chris Lattner
aa553aa0c1 Fold fptrunc(add (fpextend x), (fpextend y)) -> add(x,y), as GCC does. 
llvm-svn: 46406
 2008-01-27 05:29:54 +00:00
Chris Lattner
e66aea6532 New test to verify that "merging 4 loads into a vec load" continues to work and 
continues to infer alignment info.

llvm-svn: 46403
 2008-01-26 20:06:45 +00:00
Chris Lattner
682346a7b0 Infer alignment of loads and increase their alignment when we can tell they are 
from the stack.  This allows us to compile stack-align.ll to:

_test:
	movsd	LCPI1_0, %xmm0
	movapd	%xmm0, %xmm1
***	andpd	4(%esp), %xmm1
	andpd	_G, %xmm0
	addsd	%xmm1, %xmm0
	movl	20(%esp), %eax
	movsd	%xmm0, (%eax)
	ret

instead of:

_test:
	movsd	LCPI1_0, %xmm0
**	movsd	4(%esp), %xmm1
**	andpd	%xmm0, %xmm1
	andpd	_G, %xmm0
	addsd	%xmm1, %xmm0
	movl	20(%esp), %eax
	movsd	%xmm0, (%eax)
	ret

llvm-svn: 46401
 2008-01-26 19:45:50 +00:00
Chris Lattner
f0c3240135 remove a useless xfailed test. 
llvm-svn: 46400
 2008-01-26 19:35:46 +00:00
Duncan Sands
9fae964ef7 Invert this test, because it is wrong if we allow 
readonly functions to use byval parameters as local
storage (how much do we want this?).

llvm-svn: 46399
 2008-01-26 12:33:01 +00:00
Bill Wendling
7b83688c73 If there's no instructions being emitted on X86 for a function, emit a 
nop. Emit the nop directly for PPC.

llvm-svn: 46398
 2008-01-26 09:03:52 +00:00
Bill Wendling
26fb9335f5 Need to convert to LLVM code and not C. 
llvm-svn: 46397
 2008-01-26 06:56:08 +00:00