RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-29 23:12:55 +01:00
Code Issues Projects Releases Wiki Activity
20,114 Commits 4 Branches 5 Tags 704 MiB
8364e6b0db
Commit Graph

20114 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Chris Lattner
8364e6b0db Add support for br/brcond/switch and phi 
llvm-svn: 23439
 2005-09-26 04:57:38 +00:00
Chris Lattner
8084f450d9 add another testcase with simple control flow 
llvm-svn: 23438
 2005-09-26 04:57:10 +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
0952f82b26 make this harder: put some code into it 
llvm-svn: 23436
 2005-09-26 04:43:01 +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
93677ef227 new testcase for static ctor list optimizations 
llvm-svn: 23432
 2005-09-26 01:42:03 +00:00
Jeff Cohen
a5c4ff5a96 Fix VC++ build errors. 
llvm-svn: 23431
 2005-09-25 19:04:43 +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
fccd9d65c1 All of these should turn into sign extends (e.g. extsh/extsb on PPC) 
llvm-svn: 23427
 2005-09-24 23:42:18 +00:00
Chris Lattner
808a5d8750 Add long-overdue helpers for getting constants with known upper bits 
llvm-svn: 23426
 2005-09-24 22:57:28 +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
40908cf792 Enhance this to check for a crash, add a case that crashes simplifylibcalls, 
and add a case that has uses.

llvm-svn: 23424
 2005-09-24 22:16:04 +00:00
Chris Lattner
daed210edd new testcase that crashes the CFE 
llvm-svn: 23423
 2005-09-24 20:54:33 +00:00
Chris Lattner
e97c845fb8 new testcase for PR630 
llvm-svn: 23422
 2005-09-24 08:38:28 +00:00
Chris Lattner
26a6005735 Add support for a marker byte that indicates that we shouldn't add the user 
prefix to a symbol name

llvm-svn: 23421
 2005-09-24 08:24:28 +00:00
Chris Lattner
830b7b7f9a change proto slightly 
llvm-svn: 23420
 2005-09-24 08:23:53 +00:00
Chris Lattner
fc89cbf740 memoize translations 
llvm-svn: 23419
 2005-09-24 00:50:51 +00:00
Chris Lattner
5704c5bd5e Teach the dag isel generator how to construct arbitrary immediates. The 
generated isel now tries li then lis, then lis+ori.

llvm-svn: 23418
 2005-09-24 00:41:58 +00:00
Chris Lattner
9e2188cf4e Teach the DAG isel generator to emit code that creates nodes. 
Fix a few corner cases parsing things like (i32 imm:$foo)

llvm-svn: 23417
 2005-09-24 00:40:24 +00:00
Chris Lattner
7c7fbdc7e1 Emit better code (no more copies for var references), and support DAG patterns 
(e.g. things like rotates).

llvm-svn: 23416
 2005-09-23 23:16:51 +00:00
Chris Lattner
8c19aa13c8 Fix a fixme by passing around SDOperand's instead of SDNode*'s 
llvm-svn: 23415
 2005-09-23 21:53:45 +00:00
Chris Lattner
6c5dfefcb3 Emit code that matches the incoming DAG pattern and checks predicates. 
This does not check that types match yet, but PPC only has one integer type
;-).

This also doesn't have the code to build the resultant dag.

llvm-svn: 23414
 2005-09-23 21:33:23 +00:00
Chris Lattner
9949ef9748 emit information about the order patterns are to be matched. 
llvm-svn: 23413
 2005-09-23 20:52:47 +00:00
Chris Lattner
d9b4002bac start filling in the switch stmt 
llvm-svn: 23412
 2005-09-23 19:36:15 +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
be57630463 new testcase 
llvm-svn: 23409
 2005-09-23 18:43:57 +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
574dbee63c speed up Archive::isBytecodeArchive in the case when the archive doesn't have 
an llvm-ranlib symtab.  This speeds up gccld -native on an almost empty .o file
from 1.63s to 0.18s.

llvm-svn: 23406
 2005-09-23 06:22:58 +00:00
Chris Lattner
9619965bcc Speed up isBytecodeLPath from 20s to .01s in common cases. This makes -native 
not completely painful to use.  Once we decide a directory has a bytecode
library, we know it this function returns true, no need to scan entire directories.

llvm-svn: 23405
 2005-09-23 06:11:24 +00:00
Chris Lattner
e20b536b12 1. Do not use .c_str() to keep a persistent handle on a temporary string. 
2. Concatenate -lfoo and -L/bar options into a single option instead of
   passing "-L /bar" (for example) which doesn't work on Darwin.
3. Send -v output to stderr instead of stdout

llvm-svn: 23404
 2005-09-23 06:05:46 +00:00
Chris Lattner
be817baed9 Turn (X^C1) == C2 into X == C1^C2 iff X&~C1 = 0 (and move a function) 
This happens all the time on PPC for bool values, e.g. eliminating a xori
in inverted-bool-compares.ll.

This should be added to the dag combiner as well.

llvm-svn: 23403
 2005-09-23 00:55:52 +00:00
Chris Lattner
43fa639856 new testcase 
llvm-svn: 23402
 2005-09-23 00:53:06 +00:00
Chris Lattner
f1fadf4ab6 Testcase for PR629 
llvm-svn: 23401
 2005-09-21 06:53:56 +00:00
Chris Lattner
288e5b0a7d Expose the LiveInterval interfaces as public headers. 
llvm-svn: 23400
 2005-09-21 04:19:09 +00:00
Chris Lattner
8465e88d0f Recommend what I actually test 
llvm-svn: 23398
 2005-09-21 03:56:26 +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
e944688f8b make this test harder: add a case where instructions are in the bb to be 
threaded over

llvm-svn: 23396
 2005-09-20 01:43:41 +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
5ab7f9420a new testcase 
llvm-svn: 23394
 2005-09-20 00:41:55 +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
2e29152408 new testcase. 
llvm-svn: 23390
 2005-09-19 23:48:04 +00:00
Nate Begeman
236df45f1b Stub out the rest of the DAG Combiner. Just need to fill in the 
select_cc bits and then wrap it in a convenience function for  use with
regular select.

llvm-svn: 23389
 2005-09-19 22:34:01 +00:00
Chris Lattner
59dd979162 Teach the local spiller to turn stack slot loads into register-register copies 
when possible, avoiding the load (and avoiding the copy if the value is already
in the right register).

This patch came about when I noticed code like the following being generated:

  store R17 -> [SS1]
  ...blah...
  R4 = load [SS1]

This was causing an LSU reject on the G5.  This problem was due to the register
allocator folding spill code into a reg-reg copy (producing the load), which
prevented the spiller from being able to rewrite the load into a copy, despite
the fact that the value was already available in a register.  In the case
above, we now rip out the R4 load and replace it with a R4 = R17 copy.

This speeds up several programs on X86 (which spills a lot :) ), e.g.
smg2k from 22.39->20.60s, povray from 12.93->12.66s, 168.wupwise from
68.54->53.83s (!), 197.parser from 7.33->6.62s (!), etc.  This may have a larger
impact in some cases on the G5 (by avoiding LSU rejects), though it probably
won't trigger as often (less spilling in general).

Targets that implement folding of loads/stores into copies should implement
the isLoadFromStackSlot hook to get this.

llvm-svn: 23388
 2005-09-19 06:56:21 +00:00