RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-23 21:13:02 +02:00
Code Issues Projects Releases Wiki Activity
26,637 Commits 4 Branches 5 Tags 704 MiB
ed1e28e373
Commit Graph

2558 Commits

Author SHA1 Message Date
Chris Lattner
ed1e28e373 Fix a bug from r1.391 of this file, where we checked the size instead of 
the alignment when promoting allocations.  This implements
InstCombine/cast.ll:test32

llvm-svn: 30682
 2006-10-01 19:40:58 +00:00
Chris Lattner
e3f1023f80 Fix debug output 
llvm-svn: 30680
 2006-09-30 23:32:50 +00:00
Chris Lattner
fd5a6b3445 Implement SRA of heap allocations. 
llvm-svn: 30679
 2006-09-30 23:32:09 +00:00
Chris Lattner
2521ed8492 Add some ifdef'd out debug info 
llvm-svn: 30676
 2006-09-30 19:40:30 +00:00
Chris Lattner
168061f13d Eliminate ConstantBool::True and ConstantBool::False. Instead, provide 
ConstantBool::getTrue() and ConstantBool::getFalse().

llvm-svn: 30665
 2006-09-28 23:35:22 +00:00
Owen Anderson
18284b15a8 Another attempt at making ArgPromotion smarter. This patch no longer breaks Burg. 
llvm-svn: 30657
 2006-09-28 23:02:22 +00:00
Chris Lattner
d9c79b9349 simplify code 
llvm-svn: 30656
 2006-09-28 22:58:25 +00:00
Chris Lattner
358e9432a1 set DEBUG_TYPE right 
llvm-svn: 30623
 2006-09-27 04:58:23 +00:00
Nick Lewycky
800fff3067 Style changes only. Remove dead code, fix a comment. 
llvm-svn: 30588
 2006-09-23 15:13:08 +00:00
Chris Lattner
c0f674b9fd Be far more careful when splitting a loop header, either to form a preheader 
or when splitting loops with a common header into multiple loops.  In particular
the old code would always insert the preheader before the old loop header.  This
is disasterous in cases where the loop hasn't been rotated.  For example, it can
produce code like:

        .. outside the loop...
        jmp LBB1_2      #bb13.outer
LBB1_1: #bb1
        movsd 8(%esp,%esi,8), %xmm1
        mulsd (%edi), %xmm1
        addsd %xmm0, %xmm1
        addl $24, %edi
        incl %esi
        jmp LBB1_3      #bb13
LBB1_2: #bb13.outer
        leal (%edx,%eax,8), %edi
        pxor %xmm1, %xmm1
        xorl %esi, %esi
LBB1_3: #bb13
        movapd %xmm1, %xmm0
        cmpl $4, %esi
        jl LBB1_1       #bb1

Note that the loop body is actually LBB1_1 + LBB1_3, which means that the
loop now contains an uncond branch WITHIN it to jump around the inserted
loop header (LBB1_2).  Doh.

This patch changes the preheader insertion code to insert it in the right
spot, producing this code:

        ... outside the loop, fall into the header ...
LBB1_1: #bb13.outer
        leal (%edx,%eax,8), %esi
        pxor %xmm0, %xmm0
        xorl %edi, %edi
        jmp LBB1_3      #bb13
LBB1_2: #bb1
        movsd 8(%esp,%edi,8), %xmm0
        mulsd (%esi), %xmm0
        addsd %xmm1, %xmm0
        addl $24, %esi
        incl %edi
LBB1_3: #bb13
        movapd %xmm0, %xmm1
        cmpl $4, %edi
        jl LBB1_2       #bb1

Totally crazy, no branch in the loop! :)

llvm-svn: 30587
 2006-09-23 08:19:21 +00:00
Chris Lattner
56c1c10ca1 Teach UpdateDomInfoForRevectoredPreds to handle revectored preds that are not 
reachable, making it general purpose enough for use by InsertPreheaderForLoop.
Eliminate custom dominfo updating code in InsertPreheaderForLoop, using
UpdateDomInfoForRevectoredPreds instead.

llvm-svn: 30586
 2006-09-23 07:40:52 +00:00
Chris Lattner
e87cf1c708 Fix Transforms/IndVarsSimplify/2006-09-20-LFTR-Crash.ll 
llvm-svn: 30555
 2006-09-21 05:12:20 +00:00
Nick Lewycky
2aff202559 Don't rewrite ConstantExpr::get. 
llvm-svn: 30552
 2006-09-21 01:05:35 +00:00
Nick Lewycky
eb301d20a6 Once we're down to "setcc type constant1, constant2", at least come up 
with the right answer.

llvm-svn: 30550
 2006-09-20 23:02:24 +00:00
Nick Lewycky
99b3c50130 Use a total ordering to compare instructions. 
Fixes infinite loop in resolve().

llvm-svn: 30540
 2006-09-20 17:04:01 +00:00
Andrew Lenharth
cf0746ba2a simplify 
llvm-svn: 30535
 2006-09-20 15:37:57 +00:00
Chris Lattner
6ddcf6bba8 We went through all that trouble to compute whether it was safe to transform 
this comparison, but never checked it.  Whoops, no wonder we miscompiled
177.mesa!

llvm-svn: 30511
 2006-09-20 04:44:59 +00:00
Evan Cheng
a7347758f5 Back out Chris' last set of changes. This breaks 177.mesa and povray somehow. 
llvm-svn: 30505
 2006-09-20 01:39:40 +00:00
Evan Cheng
8652c13f13 80 col. 
llvm-svn: 30504
 2006-09-20 01:10:02 +00:00
Andrew Lenharth
0240d56eb6 If we have an add, do it in the pointer realm, not the int realm. This is critical in the linux kernel for pointer analysis correctness 
llvm-svn: 30496
 2006-09-19 18:24:51 +00:00
Chris Lattner
2d2d80a4c2 implement select.ll:test19-22 
llvm-svn: 30482
 2006-09-19 06:18:21 +00:00
Nick Lewycky
96939f2d94 Walk down the dominator tree instead of the control flow graph. That means 
that we can't modify the CFG any more, at least not until it's possible
to update the dominator tree (PR217).

llvm-svn: 30469
 2006-09-18 21:09:35 +00:00
Chris Lattner
1efde528d6 Fix an infinite loop building the CFE 
llvm-svn: 30465
 2006-09-18 18:27:05 +00:00
Chris Lattner
39218c2b0c Implement a trivial optzn: of vastart is never called in a function that takes 
... args, remove the '...'.

This is Transforms/DeadArgElim/dead_vaargs.ll

llvm-svn: 30459
 2006-09-18 07:02:31 +00:00
Chris Lattner
9c8bffb5e8 Implement InstCombine/cast.ll:test31. This speeds up 462.libquantum by 26%. 
llvm-svn: 30456
 2006-09-18 05:27:43 +00:00
Chris Lattner
f7e8879212 Implement Transforms/InstCombine/shift-sra.ll:test0 
llvm-svn: 30450
 2006-09-18 04:31:40 +00:00
Chris Lattner
6ee34e89bc Rewrite shift/and/compare sequences to promote better licm of the RHS. 
Use isLogicalShift/isArithmeticShift to simplify code.

llvm-svn: 30448
 2006-09-18 04:22:48 +00:00
Chris Lattner
a4689e489e Fix Transforms/InstCombine/2006-09-15-CastToBool.ll and PR913 
llvm-svn: 30405
 2006-09-16 03:14:10 +00:00
Chris Lattner
ce8928eed5 revert previous two patches. They cause miscompilation of MultiSource/Applications/Burg 
llvm-svn: 30397
 2006-09-15 17:24:45 +00:00
Owen Anderson
d55cc3f6d8 Revert my previous work on ArgumentPromotion. Further investigation has revealed these 
changes to be incorrect.  They just weren't showing up in any of our current testcases.

llvm-svn: 30385
 2006-09-15 05:22:51 +00:00
Anton Korobeynikov
6e19f80688 Adding dllimport, dllexport and external weak linkage types. 
DLL* linkages got full (I hope) codegeneration support in C & both x86
assembler backends.
External weak linkage added for future use, we don't provide any
codegeneration, etc. support for it.

llvm-svn: 30374
 2006-09-14 18:23:27 +00:00
Chris Lattner
60207ce1f7 Second half of the fix for Transforms/Inline/inline_cleanup.ll 
This folds unconditional branches that are often produced by code
specialization.

llvm-svn: 30307
 2006-09-13 21:27:00 +00:00
Nick Lewycky
d8a64a4b2a Add some more consistency checks. 
llvm-svn: 30305
 2006-09-13 19:32:53 +00:00
Nick Lewycky
29d605880a Fix unionSets so that it can merge correctly. 
llvm-svn: 30304
 2006-09-13 19:24:01 +00:00
Chris Lattner
e55d70cedc Implement the first half of Transforms/Inline/inline_cleanup.ll 
llvm-svn: 30303
 2006-09-13 19:23:57 +00:00
Nick Lewycky
315cc49646 Erase dead instructions. 
llvm-svn: 30298
 2006-09-13 18:55:37 +00:00
Devang Patel
b0ace495df Initialize DontInternalize. 
llvm-svn: 30281
 2006-09-13 01:02:26 +00:00
Chris Lattner
c35e7175c3 An sinkable instruction may exist with uses, if those uses are in dead blocks. 
Handle this.  This fixes PR908 and Transforms/LICM/2006-09-12-DeadUserOfSunkInstr.ll

llvm-svn: 30275
 2006-09-12 19:17:09 +00:00
Chris Lattner
0cffa03571 Fix PR905 and InstCombine/2006-09-11-EmptyStructCrash.ll 
llvm-svn: 30266
 2006-09-11 21:43:16 +00:00
Nick Lewycky
f9acdaf05e Skip the linear search if the answer is already known. 
llvm-svn: 30251
 2006-09-11 17:23:34 +00:00
Chris Lattner
2921612126 Allow tail duplication in more cases, relaxing the previous restriction a 
bit.  This fixes Regression/Transforms/TailDup/MergeTest.ll

llvm-svn: 30237
 2006-09-10 18:17:58 +00:00
Nick Lewycky
3bfe103166 Replace EquivalenceClasses with a custom-built data structure. Many common 
operations (like findProperties) should be faster, at the expense of
unionSets being slower in cases that are rare in practise.

Don't erase a dead Instruction. This fixes a memory corruption issue.

llvm-svn: 30235
 2006-09-10 02:27:07 +00:00
Chris Lattner
91d21d85e8 Implement Transforms/InstCombine/hoist_instr.ll 
llvm-svn: 30234
 2006-09-09 22:02:56 +00:00
Chris Lattner
2122c2e124 Make inlining costs more accurate. 
llvm-svn: 30231
 2006-09-09 20:40:44 +00:00
Chris Lattner
6847781b3e Turn div X, (Cond ? Y : 0) -> div X, Y 
This implements select.ll::test18.

llvm-svn: 30230
 2006-09-09 20:26:32 +00:00
Chris Lattner
6aebff10e8 Throttle back tail duplication to avoid creating really ugly sequences of code. 
For Transforms/TailDup/if-tail-dup.ll, f.e., it produces:

_foo:
        movl 8(%esp), %eax
        movl 4(%esp), %ecx
        testl $1, %ecx
        je LBB1_2       #cond_next
LBB1_1: #cond_true
        movl $1, (%eax)
LBB1_2: #cond_next
        testl $2, %ecx
        je LBB1_4       #cond_next10
LBB1_3: #cond_true6
        movl $1, 4(%eax)
LBB1_4: #cond_next10
        testl $4, %ecx
        je LBB1_6       #cond_next18
LBB1_5: #cond_true14
        movl $1, 8(%eax)
LBB1_6: #cond_next18
        testl $8, %ecx
        je LBB1_8       #return
LBB1_7: #cond_true22
        movl $1, 12(%eax)
        ret
LBB1_8: #return
        ret

instead of:

_foo:
        movl 4(%esp), %eax
        testl $2, %eax
        sete %cl
        movl 8(%esp), %edx
        testl $1, %eax
        je LBB1_2       #cond_next
LBB1_1: #cond_true
        movl $1, (%edx)
        testb %cl, %cl
        jne LBB1_4      #cond_next10
        jmp LBB1_3      #cond_true6
LBB1_2: #cond_next
        testb %cl, %cl
        jne LBB1_4      #cond_next10
LBB1_3: #cond_true6
        movl $1, 4(%edx)
        testl $4, %eax
        je LBB1_6       #cond_next18
        jmp LBB1_5      #cond_true14
LBB1_4: #cond_next10
        testl $4, %eax
        je LBB1_6       #cond_next18
LBB1_5: #cond_true14
        movl $1, 8(%edx)
        testl $8, %eax
        je LBB1_8       #return
        jmp LBB1_7      #cond_true22
LBB1_6: #cond_next18
        testl $8, %eax
        je LBB1_8       #return
LBB1_7: #cond_true22
        movl $1, 12(%edx)
        ret
LBB1_8: #return
        ret

llvm-svn: 30158
 2006-09-07 21:30:15 +00:00
Chris Lattner
f17002a907 Fix Duraid's changes to work when TLI is null. This fixes the failing 
lowerinvoke regtests.

llvm-svn: 30115
 2006-09-05 17:48:07 +00:00
Duraid Madina
51396ffd3e add setJumpBufSize() and setJumpBufAlignment() to target-lowering. 
Call these from your backend to enjoy setjmp/longjmp goodness, see
lib/Target/IA64/IA64ISelLowering.cpp for an example

llvm-svn: 30095
 2006-09-04 06:21:35 +00:00
Owen Anderson
0ea394ab0a Make ArgumentPromotion handle recursive functions that pass pointers in their recursive calls. 
llvm-svn: 30057
 2006-09-02 21:19:44 +00:00
Nick Lewycky
26f5df3031 Improve handling of SelectInst. 
Reorder operations to remove duplicated work.
Fix to leave floating-point types out of the optimization.
Add tests to predsimplify.ll for SwitchInst and SelectInst handling.

llvm-svn: 30055
 2006-09-02 19:40:38 +00:00