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
34,072 Commits 4 Branches 5 Tags 704 MiB
3dffac0c59
Commit Graph

704 Commits

Author SHA1 Message Date
Anton Korobeynikov
3dffac0c59 Don't promote volatile loads/stores. This is needed (for example) to handle setjmp/longjmp properly. 
This fixes PR1520.

llvm-svn: 41461
 2007-08-26 21:43:30 +00:00
Devang Patel
f06e667e9c Use SmallVector instead of std::vector. 
llvm-svn: 41207
 2007-08-21 00:31:24 +00:00
Devang Patel
fded73828f When one branch of condition is eliminated then head of the other 
branch is not necessary immediate dominators of merge blcok in all cases.

llvm-svn: 41144
 2007-08-17 21:59:16 +00:00
Devang Patel
1dd44d7501 Break infinite loop. 
llvm-svn: 41091
 2007-08-14 23:59:17 +00:00
Devang Patel
d1d0316041 If NewBB dominates DestBB then DestBB is not part of NewBB's dominance frontier. 
llvm-svn: 41051
 2007-08-13 21:59:17 +00:00
Devang Patel
d412a2a0ed Add utility to clone loops. 
llvm-svn: 40997
 2007-08-10 17:59:47 +00:00
Chris Lattner
bf64e878e6 remove some dead lines 
llvm-svn: 40859
 2007-08-06 06:21:06 +00:00
Chris Lattner
e562e9bdb0 rewrite the code used to construct pruned SSA form with the IDF method. 
In the old way, we computed and inserted phi nodes for the whole IDF of 
the definitions of the alloca, then computed which ones were dead and
removed them.

In the new method, we first compute the region where the value is live,
and use that information to only insert phi nodes that are live.  This
eliminates the need to compute liveness later, and stops the algorithm
from inserting a bunch of phis which it then later removes.

This speeds up the testcase in PR1432 from 2.00s to 0.15s (14x) in a
release build and 6.84s->0.50s (14x) in a debug build.

llvm-svn: 40825
 2007-08-04 22:50:14 +00:00
Chris Lattner
b7d4ef6ca6 Factor out a whole bunch of code into it's own method. 
llvm-svn: 40824
 2007-08-04 21:14:29 +00:00
Chris Lattner
d4a88d77d4 Use getNumPreds(BB) instead of computing them manually. This is a very small but 
measurable speedup.

llvm-svn: 40823
 2007-08-04 21:06:15 +00:00
Chris Lattner
6b9dca62dd Change the rename pass to be "tail recursive", only adding N-1 successors 
to the worklist, and handling the last one with a 'tail call'.  This speeds
up PR1432 from 2.0578s to 2.0012s (2.8%)

llvm-svn: 40822
 2007-08-04 20:40:27 +00:00
Chris Lattner
c1d2c2bdc8 cache computation of #preds for a BB. This speeds up 
mem2reg from 2.0742->2.0522s on PR1432.

llvm-svn: 40821
 2007-08-04 20:24:50 +00:00
Chris Lattner
8335a86536 reserve operand space for phi nodes when we insert them. 
llvm-svn: 40820
 2007-08-04 20:14:34 +00:00
Chris Lattner
32d9e4ba5c use continue to avoid nesting, no functionality change. 
llvm-svn: 40819
 2007-08-04 20:07:06 +00:00
Chris Lattner
a97ceae263 Promoting allocas with the 'single store' fastpath is 
faster than with the 'local to a block' fastpath.  This speeds
up PR1432 from 2.1232 to 2.0686s (2.6%)

llvm-svn: 40818
 2007-08-04 20:03:23 +00:00
Chris Lattner
479e3fa267 When PromoteLocallyUsedAllocas promoted allocas, it didn't remember 
to increment NumLocalPromoted, and didn't actually delete the
dead alloca, leading to an extra iteration of mem2reg.

llvm-svn: 40817
 2007-08-04 20:01:43 +00:00
Chris Lattner
bd506a8e12 std::map -> DenseMap 
llvm-svn: 40816
 2007-08-04 19:52:20 +00:00
Chris Lattner
9748fa5c6f fix a logic bug where we wouldn't promote single store allocas if the 
stored value was a non-instruction value.  Doh.

This increase the # single store allocas from 8982 to 9026, and
speeds up mem2reg on the testcase in PR1432 from 2.17 to 2.13s.

llvm-svn: 40813
 2007-08-04 02:45:02 +00:00
Chris Lattner
3f971fdbd5 When we do the single-store optimization, delete both the store 
and the alloca so they don't get reprocessed.

This speeds up PR1432 from 2.20s to 2.17s.

llvm-svn: 40812
 2007-08-04 02:38:38 +00:00
Chris Lattner
c38b2a2473 Three improvements: 
1. Check for revisiting a block before checking domination, which is faster.
  2. If the stored value isn't an instruction, we don't have to check for domination.
  3. If we have a value used in the same block more than once, make sure to remove the
     block from the UsingBlocks vector.  Not doing so forces us to go through the slow
     path for the alloca.

The combination of these improvements increases the number of allocas on the fastpath
from 8935 to 8982 on PR1432.  This speeds it up from 2.90s to 2.20s (31%)

llvm-svn: 40811
 2007-08-04 02:32:22 +00:00
Chris Lattner
fe6a3e2fb4 switch from using a std::set to using a SmallPtrSet. This speeds up the 
testcase in PR1432 from 6.33s to 2.90s (2.22x)

llvm-svn: 40810
 2007-08-04 02:21:22 +00:00
Chris Lattner
9b45ad1f5c In mem2reg, when handling the single-store case, make sure to remove 
a using block from the list if we handle it.  Not doing this caused us
to not be able to promote (with the fast path) allocas which have uses (whoops).

This increases the # allocas hitting this fastpath from 4042 to 8935 on the
testcase in PR1432, speeding up mem2reg by 2.6x

llvm-svn: 40809
 2007-08-04 02:15:24 +00:00
Chris Lattner
b5af2cf90d split rewriting of single-store allocas into its own 
method.

llvm-svn: 40806
 2007-08-04 01:47:41 +00:00
Chris Lattner
f8b22a3568 refactor some code to shrink PromoteMem2Reg::run a bit 
llvm-svn: 40805
 2007-08-04 01:41:18 +00:00
Chris Lattner
2d4d557c80 add a typedef, no other change. 
llvm-svn: 40804
 2007-08-04 01:19:38 +00:00
Chris Lattner
65181deba3 avoid an unneeded vector copy. This speeds up mem2reg on the testcase 
in PR1432 by 6%

llvm-svn: 40803
 2007-08-04 01:07:49 +00:00
Chris Lattner
34cf111957 make RenamePassWorkList a local var instead of an ivar. 
llvm-svn: 40802
 2007-08-04 01:04:40 +00:00
Dan Gohman
7dd04fb91c More explicit keywords. 
llvm-svn: 40673
 2007-08-01 15:32:29 +00:00
David Greene
f06a395bb9 New CallInst interface to address GLIBCXX_DEBUG errors caused by 
indexing an empty std::vector.

Updates to all clients.

llvm-svn: 40660
 2007-08-01 03:43:44 +00:00
Devang Patel
1b2732c880 LCSSA preserves dom info. 
llvm-svn: 40604
 2007-07-30 20:23:45 +00:00
Devang Patel
a03e82d7ee Use SmallPtrSet. 
llvm-svn: 40560
 2007-07-27 18:34:27 +00:00
Dan Gohman
298f3fd9b7 Move the GET_SIDE_EFFECT_INFO logic from isInstructionTriviallyDead 
to Instruction::mayWriteToMemory, fixing a FIXME, and helping
various places that call mayWriteToMemory directly.

llvm-svn: 40533
 2007-07-26 16:06:08 +00:00
Devang Patel
d7b401bafd Add BasicInliner interface. 
This interface allows clients to inline bunch of functions with module
level call graph information.:wq

llvm-svn: 40486
 2007-07-25 18:00:25 +00:00
Devang Patel
45675e56ad Verify loop info. 
llvm-svn: 40062
 2007-07-19 18:02:32 +00:00
Devang Patel
fe0ef94227 After a basic block is split into two parts, 
second part dominates all the blocks dominated
by original basic block. And first part dominates
second part.

llvm-svn: 40035
 2007-07-19 02:29:24 +00:00
Devang Patel
4020116257 Now this temp. fix is not required. 
llvm-svn: 40034
 2007-07-19 02:22:21 +00:00
Reid Spencer
9496d63260 Return Undef if the block has no dominator. This was required to allow 
llvm-gcc build to succeed. Without this change it fails in libstdc++
compilation. This causes no regressions in dejagnu tests. However, 
someone who knows this code better might want to review it.

llvm-svn: 39924
 2007-07-16 21:03:44 +00:00
Dan Gohman
0ba554c0c8 Fix comments about vectors to use the current wording. 
llvm-svn: 39921
 2007-07-16 14:29:03 +00:00
Devang Patel
9166ad7658 Make LCSSA a loop pass. 
llvm-svn: 39844
 2007-07-13 23:57:11 +00:00
Tanya Lattner
a715bbe152 Adding ability to demote phi to stack. 
llvm-svn: 39744
 2007-07-11 18:41:34 +00:00
Anton Korobeynikov
7971c2c9b7 During module cloning copy aliases too. This fixes PR1544 
llvm-svn: 38505
 2007-07-10 19:07:35 +00:00
Devang Patel
d9043c7501 Add SplitEdge and SplitBlock utility routines. 
llvm-svn: 37952
 2007-07-06 21:39:20 +00:00
David Greene
c176772093 Fix reference to iterator invalidated by an erase operation. Uncovered 
by _GLIBCXX_DEBUG.

llvm-svn: 37796
 2007-06-29 02:53:16 +00:00
Devang Patel
bfb1c7192e Move code to update dominator information after basic block is split 
from LoopSimplify.cpp to Dominator.cpp

llvm-svn: 37689
 2007-06-21 17:23:45 +00:00
Devang Patel
bc3887310b Add and use DominatorTreeBase::findNearestCommonDominator(). 
llvm-svn: 37545
 2007-06-11 23:31:22 +00:00
Devang Patel
336e38d425 Simplify. 
llvm-svn: 37542
 2007-06-11 21:45:31 +00:00
Devang Patel
8fba00d86d simplify 
llvm-svn: 37541
 2007-06-11 21:25:31 +00:00
Devang Patel
35df53ab56 Simplify. Dominator Tree is required so always available. 
llvm-svn: 37540
 2007-06-11 21:18:00 +00:00
Devang Patel
cfb3a761ae Update LoopSimplify to require and preserve DominatorTree only. 
Now LoopSimplify does not require nor preserve ETForest.

llvm-svn: 37512
 2007-06-08 01:50:32 +00:00
Devang Patel
b5554f450a Do not preserve ETForest. 
llvm-svn: 37506
 2007-06-08 00:02:08 +00:00