RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-22 04:22:57 +02:00
Code Issues Projects Releases Wiki Activity
20,253 Commits 4 Branches 5 Tags 704 MiB
412582bcec
Commit Graph

2117 Commits

Author SHA1 Message Date
Jeff Cohen
412582bcec Fix VC++ warnings. 
llvm-svn: 23579
 2005-10-01 03:57:14 +00:00
Chris Lattner
633db4c298 Insert stores after phi nodes in the normal dest. This fixes 
LowerInvoke/2005-08-03-InvokeWithPHI.ll

llvm-svn: 23525
 2005-09-29 17:44:20 +00:00
Chris Lattner
c800214144 Fold isascii into a simple comparison. This speeds up 197.parser by 7.4%, 
bringing the LLC time down to the CBE time.

llvm-svn: 23521
 2005-09-29 06:17:27 +00:00
Chris Lattner
3aa9edd482 remove a bunch of unneeded stuff, or self evident comments 
llvm-svn: 23519
 2005-09-29 06:16:11 +00:00
Chris Lattner
0cf56701ef Implement a couple of memcmp folds from the todo list 
llvm-svn: 23517
 2005-09-29 04:54:20 +00:00
Chris Lattner
6ce1d7dabb Constant fold llvm.sqrt 
llvm-svn: 23487
 2005-09-28 01:34:32 +00:00
Chris Lattner
cd79ed877a add a note about a way to improve this code further, that I won't be getting 
to right now.

llvm-svn: 23485
 2005-09-27 22:44:59 +00:00
Chris Lattner
80e4480cfa Fix a regression in my previous patch, fixing GlobalOpt/2005-09-27-Crash.ll 
and PR632.

llvm-svn: 23484
 2005-09-27 22:28:11 +00:00
Chris Lattner
8ff6df40ba Avoid spilling stack slots... to stack slots. 
llvm-svn: 23478
 2005-09-27 21:33:12 +00:00
Chris Lattner
b2fa69f4b2 Completely rewrite 'correct' eh support. This changes how setjmp insertion 
is performed so it is only at most once per function that contains an invoke
instead of once per invoke in the function.  This patch has the following perks:

1. It fixes PR631, which complains about slowness.
2. If fixes PR240, which complains about non-volatile vars being live across
   setjmp/longjmps.
3. It improves (but does not fix) the jmpbuf alignment issue on itanium by not
   forcing the jmpbufs to always be 8-bytes off the alignment of the structure.
4. It speeds up 253.perlbmk from 338s to 13.70s (a 25x improvement!), making us
   now about 4% faster than GCC.

Further improvements are also possible.

llvm-svn: 23477
 2005-09-27 21:18:17 +00:00
Chris Lattner
29f2ba1384 Make the pass name simpler 
llvm-svn: 23476
 2005-09-27 21:10:32 +00:00
Chris Lattner
92b0563eb3 allow demotion to volatile values, add support for invoke 
llvm-svn: 23473
 2005-09-27 19:39:00 +00:00
Chris Lattner
e242673da3 Add support for external calls that we know how to constant fold. This implements 
ctor-list-opt.ll:CTOR8

llvm-svn: 23465
 2005-09-27 05:02:43 +00:00
Chris Lattner
b3b15ed0a3 Fix a bug where we would evaluate stores into linkonce objects which could be 
potentially replaced at link-time.

llvm-svn: 23463
 2005-09-27 04:50:03 +00:00
Chris Lattner
dc94923d86 Implement support for static constructors with calls in them. This is useful 
because gccas runs globalopt before inlining.

This implements ctor-list-opt.ll:CTOR7

llvm-svn: 23462
 2005-09-27 04:45:34 +00:00
Chris Lattner
5bc02b52dd Refactor this code a bit, no functionality changes. 
llvm-svn: 23460
 2005-09-27 04:27:01 +00:00
Chris Lattner
fc4e38bf0a Remove some dead code. ctor evaluation subsumes empty ctor elim 
llvm-svn: 23453
 2005-09-26 20:38:20 +00:00
Chris Lattner
ade39df257 Add support for alloca, implementing ctor-list-opt.ll:CTOR6 
llvm-svn: 23452
 2005-09-26 17:07:09 +00:00
Chris Lattner
c1fe36502e Add a debug printout, fix a crash on kc++ 
llvm-svn: 23450
 2005-09-26 07:34:35 +00:00
Chris Lattner
7283d69b9f Implement loads/stores through GEP's of globals. This implements 
ctor-list-opt.ll:CTOR5.

llvm-svn: 23449
 2005-09-26 06:52:44 +00:00
Chris Lattner
6488c9bbc1 Replace TraverseGEPInitializer with ConstantFoldLoadThroughGEPConstantExpr 
llvm-svn: 23447
 2005-09-26 05:34:07 +00:00
Chris Lattner
7c43a40871 Eliminate GetGEPGlobalInitializer in favor of the more powerful 
ConstantFoldLoadThroughGEPConstantExpr function in the utils lib.

llvm-svn: 23446
 2005-09-26 05:28:52 +00:00
Chris Lattner
6df0a740e8 Factor the GetGEPGlobalInitializer out of this pass and into Transforms/Utils 
as ConstantFoldLoadThroughGEPConstantExpr.

llvm-svn: 23445
 2005-09-26 05:28:06 +00:00
Chris Lattner
d8b3c644e1 Move the ConstantFoldLoadThroughGEPConstantExpr function out of the InstCombine 
pass.

llvm-svn: 23444
 2005-09-26 05:27:10 +00:00
Chris Lattner
e149840f04 add a comment 
llvm-svn: 23442
 2005-09-26 05:16:34 +00:00
Chris Lattner
2addd0dcab Add support for getelementptr, load, and correctly reject volatile stores. 
llvm-svn: 23441
 2005-09-26 05:15:37 +00:00
Chris Lattner
8364e6b0db Add support for br/brcond/switch and phi 
llvm-svn: 23439
 2005-09-26 04:57:38 +00:00
Chris Lattner
1d43adff6d Add a simple interpreter to this code, allowing us to statically evaluate 
global ctors that are simple enough.  This implements ctor-list-opt.ll:CTOR2.

llvm-svn: 23437
 2005-09-26 04:44:35 +00:00
Chris Lattner
9b71d2a0f6 factor some code into a InstallGlobalCtors method, add comments. No functionality change. 
llvm-svn: 23435
 2005-09-26 02:31:18 +00:00
Chris Lattner
fb737b72b1 Make the global opt optimizer work on modules with a null terminator, by 
accepting the null even with a non-65535 init prio

llvm-svn: 23434
 2005-09-26 02:19:27 +00:00
Chris Lattner
ca854922fb Factor this code out into a few methods. 
Implement the start of global ctor optimization.  It is currently smart
enough to remove the global ctor for cases like this:

struct foo {
  foo() {}
} x;

... saving a bit of startup time for the program.

llvm-svn: 23433
 2005-09-26 01:43:45 +00:00
Chris Lattner
d8febfc4aa Fix some logic I broke that caused a regression on 
SimplifyLibCalls/2005-05-20-sprintf-crash.ll

llvm-svn: 23430
 2005-09-25 07:06:48 +00:00
Chris Lattner
e6bfd80169 Move MaskedValueIsZero up. 
Match a bunch of idioms for sign extensions, implementing InstCombine/signext.ll

llvm-svn: 23428
 2005-09-24 23:43:33 +00:00
Chris Lattner
7af8b0777a Simplify this code a bit by relying on recursive simplification. Support 
sprintf("%s", P)'s that have uses.

s/hasNUses(0)/use_empty()/

llvm-svn: 23425
 2005-09-24 22:17:06 +00:00
Chris Lattner
5ce68bab6c remove some debugging code 
llvm-svn: 23411
 2005-09-23 18:49:09 +00:00
Chris Lattner
88c234b5e4 Fold two consequtive branches that share a common destination between them. 
This implements SimplifyCFG/branch-fold.ll, and is useful on ?:/min/max heavy
code

llvm-svn: 23410
 2005-09-23 18:47:20 +00:00
Chris Lattner
67437dce2c simplify some logic further 
llvm-svn: 23408
 2005-09-23 07:23:18 +00:00
Chris Lattner
48df043325 pull a bunch of logic out of SimplifyCFG into a helper fn 
llvm-svn: 23407
 2005-09-23 06:39:30 +00:00
Chris Lattner
07cf4f249d Start threading across blocks with code in them, so long as the code does 
not define a value that is used outside of it's block.  This catches many
more simplifications, e.g. 854 in 176.gcc, 137 in vpr, etc.

This implements branch-phi-thread.ll:test3.ll

llvm-svn: 23397
 2005-09-20 01:48:40 +00:00
Chris Lattner
44a9487815 Implement merging of blocks with the same condition if the block has multiple 
predecessors.  This implements branch-phi-thread.ll::test1

llvm-svn: 23395
 2005-09-20 00:43:16 +00:00
Chris Lattner
4013184d6b Reject a case we don't handle yet 
llvm-svn: 23393
 2005-09-19 23:57:04 +00:00
Chris Lattner
642f0d6aea remove debugging code :-/ 
llvm-svn: 23392
 2005-09-19 23:50:15 +00:00
Chris Lattner
34785e2d43 Implement SimplifyCFG/branch-phi-thread.ll, the most trivial case of threading 
control across branches with determined outcomes.  More generality to follow.
This triggers a couple thousand times in specint.

llvm-svn: 23391
 2005-09-19 23:49:37 +00:00
Chris Lattner
e40e2d4ec3 Refactor this code a bit and make it more general. This now compiles: 
struct S { unsigned int i : 6, j : 11, k : 15; } b;
void plus2 (unsigned int x) { b.j += x; }

To:

_plus2:
        lis r2, ha16(L_b$non_lazy_ptr)
        lwz r2, lo16(L_b$non_lazy_ptr)(r2)
        lwz r4, 0(r2)
        slwi r3, r3, 6
        add r3, r4, r3
        rlwimi r3, r4, 0, 26, 14
        stw r3, 0(r2)
        blr


instead of:

_plus2:
        lis r2, ha16(L_b$non_lazy_ptr)
        lwz r2, lo16(L_b$non_lazy_ptr)(r2)
        lwz r4, 0(r2)
        rlwinm r5, r4, 26, 21, 31
        add r3, r5, r3
        rlwimi r4, r3, 6, 15, 25
        stw r4, 0(r2)
        blr

by eliminating an 'and'.

I'm pretty sure this is as small as we can go :)

llvm-svn: 23386
 2005-09-18 07:22:02 +00:00
Chris Lattner
024a1c1a46 Compile 
struct S { unsigned int i : 6, j : 11, k : 15; } b;
void plus2 (unsigned int x) {
  b.j += x;
}

to:

plus2:
        mov %EAX, DWORD PTR [b]
        mov %ECX, %EAX
        and %ECX, 131008
        mov %EDX, DWORD PTR [%ESP + 4]
        shl %EDX, 6
        add %EDX, %ECX
        and %EDX, 131008
        and %EAX, -131009
        or %EDX, %EAX
        mov DWORD PTR [b], %EDX
        ret

instead of:

plus2:
        mov %EAX, DWORD PTR [b]
        mov %ECX, %EAX
        shr %ECX, 6
        and %ECX, 2047
        add %ECX, DWORD PTR [%ESP + 4]
        shl %ECX, 6
        and %ECX, 131008
        and %EAX, -131009
        or %ECX, %EAX
        mov DWORD PTR [b], %ECX
        ret

llvm-svn: 23385
 2005-09-18 06:30:59 +00:00
Chris Lattner
3cd5e466ee Generalize this transform, using MaskedValueIsZero, allowing us to compile: 
struct S { unsigned int i : 6, j : 11, k : 15; } b;
void plus3 (unsigned int x) { b.k += x; }

To:

plus3:
        mov %EAX, DWORD PTR [%ESP + 4]
        shl %EAX, 17
        add DWORD PTR [b], %EAX
        ret

instead of:

plus3:
        mov %EAX, DWORD PTR [%ESP + 4]
        shl %EAX, 17
        mov %ECX, DWORD PTR [b]
        add %EAX, %ECX
        and %EAX, -131072
        and %ECX, 131071
        or %ECX, %EAX
        mov DWORD PTR [b], %ECX
        ret

llvm-svn: 23384
 2005-09-18 06:02:59 +00:00
Chris Lattner
b70b011734 fix typeo 
llvm-svn: 23383
 2005-09-18 05:25:20 +00:00
Chris Lattner
7fda14c978 Remove unintentionally committed code 
llvm-svn: 23382
 2005-09-18 05:12:51 +00:00
Chris Lattner
ae35713f00 implement shift.ll:test25. This compiles: 
struct S { unsigned int i : 6, j : 11, k : 15; } b;
void plus3 (unsigned int x) {
  b.k += x;
}

to:

_plus3:
        lis r2, ha16(L_b$non_lazy_ptr)
        lwz r2, lo16(L_b$non_lazy_ptr)(r2)
        lwz r3, 0(r2)
        rlwinm r4, r3, 0, 0, 14
        add r4, r4, r3
        rlwimi r4, r3, 0, 15, 31
        stw r4, 0(r2)
        blr

instead of:

_plus3:
        lis r2, ha16(L_b$non_lazy_ptr)
        lwz r2, lo16(L_b$non_lazy_ptr)(r2)
        lwz r4, 0(r2)
        srwi r5, r4, 17
        add r3, r5, r3
        slwi r3, r3, 17
        rlwimi r3, r4, 0, 15, 31
        stw r3, 0(r2)
        blr

llvm-svn: 23381
 2005-09-18 05:12:10 +00:00
Chris Lattner
fa22870351 Implement add.ll:test29. Codegening: 
struct S { unsigned int i : 6, j : 11, k : 15; } b;
void plus1 (unsigned int x) {
  b.i += x;
}

as:
_plus1:
        lis r2, ha16(L_b$non_lazy_ptr)
        lwz r2, lo16(L_b$non_lazy_ptr)(r2)
        lwz r4, 0(r2)
        add r3, r4, r3
        rlwimi r3, r4, 0, 0, 25
        stw r3, 0(r2)
        blr

instead of:

_plus1:
        lis r2, ha16(L_b$non_lazy_ptr)
        lwz r2, lo16(L_b$non_lazy_ptr)(r2)
        lwz r4, 0(r2)
        rlwinm r5, r4, 0, 26, 31
        add r3, r5, r3
        rlwimi r3, r4, 0, 0, 25
        stw r3, 0(r2)
        blr

llvm-svn: 23379
 2005-09-18 04:24:45 +00:00