RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-27 05:55:40 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
52,654 Commits 4 Branches 5 Tags 634 MiB
1832a32b78
Commit Graph

5707 Commits

Author SHA1 Message Date
Chris Lattner
1832a32b78 implement a transformation in jump threading that is currently 
done by condprop, but do it in a much more general form.  The
basic idea is that we can do a limited form of tail duplication
in the case when we have a branch on a phi.  Moving the branch
up in to the predecessor block makes instruction selection
much easier and encourages chained jump threadings.

llvm-svn: 83759
 2009-10-11 07:24:57 +00:00
Chris Lattner
562cc63c29 restructure some code, no functionality change. 
llvm-svn: 83756
 2009-10-11 04:40:21 +00:00
Chris Lattner
b4e9fb6967 factor some code better and move a function, no functionality change. 
llvm-svn: 83755
 2009-10-11 04:33:43 +00:00
Chris Lattner
525c0272aa make jump threading on a phi with undef inputs happen. 
llvm-svn: 83754
 2009-10-11 04:18:15 +00:00
Chris Lattner
8b521613d3 rewrite LCSSA to use SSAUpdate, to only return true if it modifies 
the IR, and to implement the FIXME'd optimization.

llvm-svn: 83748
 2009-10-11 02:53:37 +00:00
Chris Lattner
1b8c1d1d29 clean up and simplify some code. Don't use setvector when things will be 
inserted only once, just use vector.  Don't compute ExitBlocks unless we
need it, change std::sort to array_pod_sort.

llvm-svn: 83747
 2009-10-11 01:07:15 +00:00
Chris Lattner
37ff3c0ed1 switch GVN to use SSAUpdater. Besides removing a lot of complexity 
from GVN, this also speeds it up, inserts fewer PHI nodes (see the
testcase) and allows it to remove more loads (due to fewer PHI nodes
standing in the way).

llvm-svn: 83746
 2009-10-10 23:50:30 +00:00
Chris Lattner
0aa320ae4d add a simple helper method. 
llvm-svn: 83745
 2009-10-10 23:41:48 +00:00
Chris Lattner
acf73d9839 add ability for clients of SSAUpdater to find out about the 
PHI nodes inserted.

llvm-svn: 83744
 2009-10-10 23:15:24 +00:00
Chris Lattner
31d3137c01 remove dead code 
llvm-svn: 83742
 2009-10-10 23:04:12 +00:00
Chris Lattner
db4d523cca add the ability to get a rewritten value from the middle of a block, 
not just at the end.  Add a big comment explaining when this could
be useful (which never happens for jump threading).

llvm-svn: 83741
 2009-10-10 23:00:11 +00:00
Chris Lattner
9899ce267c rename GetValueInBlock -> GetValueAtEndOfBlock to better reflect 
what it does.

llvm-svn: 83740
 2009-10-10 22:41:58 +00:00
Chris Lattner
0561804097 use a typedef instead of spelling out an insane type. Yay for auto someday. 
llvm-svn: 83707
 2009-10-10 09:09:20 +00:00
Chris Lattner
75e5de9243 Change jump threading to use the new SSAUpdater class instead of 
DemoteRegToStack.  This makes it more efficient (because it isn't
creating a ton of load/stores that are eventually removed by a later
mem2reg), and more slightly more effective (because those load/stores
don't get in the way of threading).

llvm-svn: 83706
 2009-10-10 09:05:58 +00:00
Chris Lattner
9c5aa00411 Implement an efficient and fully general SSA update mechanism that 
works on unstructured CFGs.  This implements PR217, our oldest open PR.

llvm-svn: 83705
 2009-10-10 09:04:27 +00:00
Chris Lattner
317eb8ff20 random tidying 
llvm-svn: 83701
 2009-10-10 06:22:45 +00:00
Dale Johannesen
7691b73da0 Use names instead of numbers for some of the magic 
constants used in inlining heuristics (especially
those used in more than one file).  No functional change.

llvm-svn: 83675
 2009-10-09 21:42:02 +00:00
Dale Johannesen
10c870b46f When considering whether to inline Callee into Caller, 
and that will make Caller too big to inline, see if it
might be better to inline Caller into its callers instead.
This situation is described in PR 2973, although I haven't
tried the specific case in SPASS.

llvm-svn: 83602
 2009-10-09 00:11:32 +00:00
Dan Gohman
68e044e81a Add a form of addPreserved which takes a string argument, to allow passes 
to declare that they preserve other passes without needing to pull in
additional header file or library dependencies. Convert MachineFunctionPass
and CodeGenLICM to make use of this.

llvm-svn: 83555
 2009-10-08 17:00:02 +00:00
Jeffrey Yasskin
e36facef86 In instcombine's debug output, avoid printing ADD for instructions that are 
already on the worklist, and print Visited when an instruction is about to be
visited.  Net, on one input, this reduced the output size by at least 9x.

llvm-svn: 83510
 2009-10-08 00:12:24 +00:00
Eric Christopher
a42e55349d 80-column and whitespace fixes. 
llvm-svn: 83489
 2009-10-07 21:14:25 +00:00
Eric Christopher
e6bebc66a7 Add FreeInst to the "is a call" check for Insts that are calls, but 
not intrinsics.

llvm-svn: 83441
 2009-10-07 00:54:08 +00:00
Eric Christopher
8720c9ca69 While we still have a MallocInst treat it as a call like any other 
for inlining.

When MallocInst goes away this code will be subsumed as part of
calls and work just fine...

llvm-svn: 83434
 2009-10-07 00:02:18 +00:00
Ted Kremenek
4b5e7b5661 Update CMake file. 
llvm-svn: 83404
 2009-10-06 19:45:38 +00:00
Chris Lattner
e87add4b88 remove predicate simplifier, it never got the last bugs beaten 
out of it, and jump threading, condprop and gvn are now getting
most of the benefit.  This was approved by Nicholas and Nicolas.

llvm-svn: 83390
 2009-10-06 16:59:46 +00:00
Duncan Sands
2400ad7236 Introduce and use convenience methods for getting pointer types 
where the element is of a basic builtin type.  For example, to get
an i8* use getInt8PtrTy.

llvm-svn: 83379
 2009-10-06 15:40:36 +00:00
Dan Gohman
176e47a413 Remove an unnnecessary LLVMContext argument in 
ConstantFoldLoadThroughGEPConstantExpr.

llvm-svn: 83311
 2009-10-05 16:36:26 +00:00
Dan Gohman
a926123a24 Use Use::operator= instead of Use::set, for consistency. 
llvm-svn: 83310
 2009-10-05 16:31:55 +00:00
Chris Lattner
a3cf123e86 strength reduce a ton of type equality tests to check the typeid (Through 
the new predicates I added) instead of going through a context and doing a
pointer comparison.  Besides being cheaper, this allows a smart compiler
to turn the if sequence into a switch.

llvm-svn: 83297
 2009-10-05 05:54:46 +00:00
Chris Lattner
513b66b237 instcombine shouldn't delete all null checks for mallocs. 
This fixes PR5130.

llvm-svn: 83290
 2009-10-05 02:47:47 +00:00
Owen Anderson
412df08b59 Do away with the strange use of BitVectors in SSI, and just use normal sets. This makes the code much more C++/LLVM-ish. 
llvm-svn: 83286
 2009-10-04 18:49:55 +00:00
Owen Anderson
cadab85644 Fix a typo in the comment. 
llvm-svn: 83283
 2009-10-04 17:52:13 +00:00
Owen Anderson
18cecec6a0 SSI needs to require DT and DF transitively, since it uses them outside of its runOnFunction. 
Similarly, it can be marked setPreservesAll, since it does no work in its runOnFunction.

llvm-svn: 83282
 2009-10-04 17:47:39 +00:00
Evan Cheng
eae1bb9779 Allow -inline-threshold override default threshold even if compiling to optimize for size. 
llvm-svn: 83274
 2009-10-04 06:13:54 +00:00
Douglas Gregor
b4e6fce681 Remove GVNPRE.cpp from the CMake makefile 
llvm-svn: 83194
 2009-10-01 05:30:05 +00:00
Chris Lattner
857ed445a8 remove the GVNPRE pass. It has been subsumed by the GVN pass. 
Ok'd by Owen.

llvm-svn: 83193
 2009-10-01 02:18:36 +00:00
Dan Gohman
2ecc146f0c Fix this code so that it doesn't try to iterate through a std::vector 
while calling changeImmediateDominator, which removes elements from the
vector. This fixes PR5097.

llvm-svn: 83166
 2009-09-30 20:54:16 +00:00
Dan Gohman
9776ad2192 Remove a redundant #ifndef and add an assertion string. 
llvm-svn: 82991
 2009-09-28 14:38:19 +00:00
Dan Gohman
f31dae3931 Convert LoopSimplify and LoopExtractor from FunctionPass to LoopPass. 
llvm-svn: 82990
 2009-09-28 14:37:51 +00:00
Chris Lattner
d77fb17b28 The select instruction is not neccesarily in the same block as the 
phi nodes.  Make sure to phi translate from the right block. 

This fixes a llvm-building-llvm failure on GVN-PRE.cpp

llvm-svn: 82970
 2009-09-28 06:49:44 +00:00
Chris Lattner
2a85cfd972 simplify some code. 
llvm-svn: 82936
 2009-09-27 21:46:50 +00:00
Chris Lattner
75a5d76294 The bitcast case is not needed here: instcombine turns icmp(bitcast(x), null) -> icmp(x, null) already. 
llvm-svn: 82935
 2009-09-27 21:42:46 +00:00
Chris Lattner
e024fd6b47 calls are already unmovable, malloc doesn't need a special case. 
llvm-svn: 82933
 2009-09-27 21:36:19 +00:00
Chris Lattner
8a77e8b353 calls to external functions are already marked overdefined, special casing 
malloc isn't needed.

llvm-svn: 82932
 2009-09-27 21:35:11 +00:00
Chris Lattner
bb29bb4e16 calls are already handled, malloc doesn't need a special case. 
llvm-svn: 82931
 2009-09-27 21:33:46 +00:00
Chris Lattner
24af6de20a calls are rejected above, no need to special case malloc here. 
llvm-svn: 82929
 2009-09-27 21:31:39 +00:00
Chris Lattner
0cfb82cf8c remove special handling of bitcast(malloc), it will be handled 
when the loop inspects the bitcast operand.

llvm-svn: 82928
 2009-09-27 21:29:28 +00:00
Chris Lattner
3f320467b5 unlike the malloc instruction, "malloc" calls do not claim to be readonly, just nounwind. 
llvm-svn: 82927
 2009-09-27 21:23:38 +00:00
Chris Lattner
7a9e470ddc allow pushing icmps through phis with multiple uses and across critical edges. 
These are important to push up to encourage jump threading.  This shrinks 176.gcc a bit.

llvm-svn: 82923
 2009-09-27 20:46:36 +00:00
Chris Lattner
f7db1f1a3a Enhance the previous fix for PR4895 to allow more values than just 
simple constants for the true/false value of the select.  We now
do phi translation etc.  This really fixes PR4895 :)

llvm-svn: 82917
 2009-09-27 20:18:49 +00:00