RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-01 16:40:15 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
31,287 Commits 4 Branches 5 Tags 634 MiB
4b323657b9
Commit Graph

89 Commits

Author SHA1 Message Date
Owen Anderson
4b323657b9 Remove DomSet completely. This concludes work on PR1171. 
llvm-svn: 35775
 2007-04-08 21:30:05 +00:00
Nick Lewycky
26652f5681 Don't crash when encountering a BasicBlock that hasn't been registered yet. 
llvm-svn: 35756
 2007-04-08 01:02:12 +00:00
Owen Anderson
7cf9d12f2e Add DomSet back, and revert the changes to LoopSimplify. Apparently the 
ETForest updating mechanisms don't work as I thought they did.  These changes
will be reapplied once the issue is worked out.

llvm-svn: 35741
 2007-04-07 18:23:27 +00:00
Owen Anderson
85b0e20f2a Completely purge DomSet. This is the (hopefully) final patch for PR1171. 
llvm-svn: 35731
 2007-04-07 07:17:27 +00:00
Devang Patel
7cde72cbc1 It is not possible to determine dominance between two PHI nodes 
based on their ordering. This is applicable to ETForest::dominates() also.

llvm-svn: 35423
 2007-03-28 14:57:43 +00:00
Devang Patel
67eede36f7 Use SmallPtrSet. 
llvm-svn: 35388
 2007-03-27 20:50:46 +00:00
Devang Patel
8330ee3120 Spell check. 
llvm-svn: 35374
 2007-03-27 00:16:08 +00:00
Devang Patel
58a8e74de6 It is not possible to determie dominance between two PHI nodes 
based on their ordering.

llvm-svn: 35369
 2007-03-26 23:18:28 +00:00
Devang Patel
3062ae001d Use std::vector<DFCalculateWorkObject> instead of 
std::vector<DFCalculateWorkObject *> to reduce malloc/free traffic.

llvm-svn: 35368
 2007-03-26 23:17:19 +00:00
Devang Patel
3a426e1c86 DominanceFrontier::calculate(). 
Avoid recursion, Use iterative algorithm.

llvm-svn: 35225
 2007-03-20 21:25:31 +00:00
Devang Patel
18146cf2a2 LoopSimplify::FindPHIToPartitionLoops() 
Use ETForest instead of DominatorSet.

llvm-svn: 35221
 2007-03-20 20:18:12 +00:00
Bill Wendling
1838be30c7 Removed iostream #includes. Replaced std::cerr with DOUT. 
llvm-svn: 31814
 2006-11-17 08:03:48 +00:00
Devang Patel
b34118f8bd remove extra white spaces. 
llvm-svn: 30576
 2006-09-22 01:07:57 +00:00
Devang Patel
8248ba3afc Use iterative algorith to assign DFS number. This reduces 
call stack depth.

llvm-svn: 30575
 2006-09-22 01:05:33 +00:00
Devang Patel
0d540a2f9a Undo previous check-in. 
Reintroduce recursive assignDFSNumber().

llvm-svn: 30380
 2006-09-14 21:43:24 +00:00
Devang Patel
2983c628cd Avoid recursion in assignDFSNumber(). Move def from ET-Forest.h 
to Dominators.h

llvm-svn: 30309
 2006-09-14 01:27:42 +00:00
Chris Lattner
f530302eda Eliminate RegisterAnalysis. RegisterPass now does all that is necessary. 
llvm-svn: 29921
 2006-08-27 22:30:17 +00:00
Chris Lattner
58aeae17a7 Add dominates/properlyDominates queries to IDom. 
llvm-svn: 29456
 2006-08-01 22:24:47 +00:00
Reid Spencer
560366562b For PR780: 
1. Fix the macros in IncludeFile.h to put everything in the llvm namespace
2. Replace the previous explicit mechanism in all the .h and .cpp files
   with the macros in IncludeFile.h
This gets us a consistent mechanism throughout LLVM for ensuring linkage.
Next step is to make sure its used in enough places.

llvm-svn: 28715
 2006-06-07 22:00:26 +00:00
Reid Spencer
2c6d390a60 Change from using a stub function to a stub variable for passing to the 
IncludeFile hack to ensure linkage of analysis passes. This works around
some -pedantic warnings about assigning an object to a function.

llvm-svn: 28621
 2006-06-01 07:02:51 +00:00
Chris Lattner
981c57fdbd Fix an et-forest memory leak. Patch by Daniel Berlin. 
llvm-svn: 26763
 2006-03-14 19:41:45 +00:00
Chris Lattner
551df64bd0 Change ET-Forest to automatically recalculate its DFSnum's if too many slow 
queries are made.

Patch by Daniel Berlin!

llvm-svn: 25323
 2006-01-14 20:55:09 +00:00
Chris Lattner
06a5b2acff Bugfix for etforest updating. Contributed by Daniel Berlin. 
llvm-svn: 25152
 2006-01-09 07:58:01 +00:00
Chris Lattner
84a9d11b28 Initial implementation of the ET-Forest data structure for dominators and 
post-dominators.  This code was written/adapted by Daniel Berlin!

llvm-svn: 25144
 2006-01-08 08:22:18 +00:00
Duraid Madina
07a3df77d0 more HP-UX cleanliness 
llvm-svn: 25015
 2005-12-26 08:35:06 +00:00
Chris Lattner
48ddf6d833 This requires proper dominance 
llvm-svn: 24408
 2005-11-18 07:27:53 +00:00
Chris Lattner
3aff97254e Make dominates(A,B) work with post dominators. Patch contributed by 
Naveen Neelakantam, thanks!

llvm-svn: 21543
 2005-04-25 20:50:33 +00:00
Jeff Cohen
6c42217055 Eliminate tabs and trailing spaces 
llvm-svn: 21480
 2005-04-23 21:38:35 +00:00
Misha Brukman
53e199440e Remove trailing whitespace 
llvm-svn: 21427
 2005-04-21 23:48:37 +00:00
Reid Spencer
d50c86f078 For PR387:\ 
Make only one print method to avoid overloaded virtual warnings when \
compiled with -Woverloaded-virtual

llvm-svn: 18589
 2004-12-07 04:03:45 +00:00
Chris Lattner
44e34a155c Make sure any client of Dominators.h links in Dominators.cpp 
Patch by Morten Ofstad

llvm-svn: 16987
 2004-10-14 15:47:16 +00:00
Reid Spencer
c4abcbefb1 Changes For Bug 352 
Move include/Config and include/Support into include/llvm/Config,
include/llvm/ADT and include/llvm/Support. From here on out, all LLVM
public header files must be under include/llvm/.

llvm-svn: 16137
 2004-09-01 22:55:40 +00:00
Chris Lattner
a1d29e1b15 compute dominator tree children in a deterministic order that does not depend 
on the address of BasicBlock objects in memory.  This eliminates stuff like this:

 Inorder Dominator Tree:
   [1]  %entry
     [2]  %loopentry
-      [3]  %loopexit
       [3]  %no_exit
-        [4]  %endif
         [4]  %then
+        [4]  %endif
+      [3]  %loopexit
       [3]  %return

llvm-svn: 14253
 2004-06-19 20:13:48 +00:00
Chris Lattner
ba131c993e Print out immediate dominators in program order, not in random order based on the address 
of BasicBlock objects

llvm-svn: 14252
 2004-06-19 20:04:47 +00:00
Chris Lattner
c107a4d1c5 Add missing #include 
llvm-svn: 14037
 2004-06-05 00:24:59 +00:00
Chris Lattner
d4abe8d28a The recalclulate method was a nasty hack that was once used by the -cee pass, 
which never worked itself.  The cee pass still doesn't work, but it doesn't use
this method anymore anyway, so eliminate the method.

llvm-svn: 10302
 2003-12-07 00:55:32 +00:00
Chris Lattner
9eeb35760f Completely rewrite domset, idom, and domtree implementation. Now it is based 
on the algorithm for directly computing immediate dominators presented in this
paper:

  A Fast Algorithm for Finding Dominators in a Flowgraph
  T. Lengauer & R. Tarjan, ACM TOPLAS July 1979, pgs 121-141.

This _substantially_ speeds up construction of all dominator related information.
Post-dominators to follow.

llvm-svn: 10301
 2003-12-07 00:38:08 +00:00
Chris Lattner
a1da49a55c Finegrainify namespacification 
llvm-svn: 10131
 2003-11-21 20:23:48 +00:00
Brian Gaeke
d25f86d683 Put all LLVM code into the llvm namespace, as per bug 109. 
llvm-svn: 9903
 2003-11-11 22:41:34 +00:00
John Criswell
b402729b30 Added LLVM project notice to the top of every C++ source file. 
Header files will be on the way.

llvm-svn: 9298
 2003-10-20 19:43:21 +00:00
Chris Lattner
d4de2760aa Rename Function::getEntryNode -> getEntryBlock 
llvm-svn: 8625
 2003-09-20 14:39:18 +00:00
Chris Lattner
3d39abeeb7 Renamed DominatorTree::Node::getNode() -> getBlock() 
llvm-svn: 8469
 2003-09-11 16:26:13 +00:00
Chris Lattner
ebf6d5c622 Rework dominator interfaces to handle changes in the post-dominance 
construction.  Now there may be multiple root blocks, and null is a
special node used to mark the "virtual" exit node of a CFG.

llvm-svn: 8461
 2003-09-10 20:37:51 +00:00
Chris Lattner
9f1ec93145 Do not even attempt to compute dominator information for unreachable blocks 
llvm-svn: 7963
 2003-08-18 22:11:16 +00:00
Misha Brukman
56f7db4178 Spell `necessary' correctly. 
llvm-svn: 7944
 2003-08-18 14:43:39 +00:00
Chris Lattner
1cab8ed666 Remove using declarations and extraneous #includes 
llvm-svn: 6303
 2003-05-22 21:47:17 +00:00
Chris Lattner
6a0cf6f937 Fix bug: Dominators/2003-05-12-UnreachableCode.ll 
llvm-svn: 6158
 2003-05-12 22:35:13 +00:00
Chris Lattner
b9f59f1533 Expose new "recalculate" method from dominatorset 
llvm-svn: 4074
 2002-10-08 19:12:08 +00:00
Chris Lattner
85ba0832e5 Fix a nasty problem with dominance calculation for unreachable blocks. 
If we had a CFG that look like Entry -> B, Unreachable -> B, then we would
not correctly determine that Entry dominated B, because Entry did not
apparently dominate "unreachable".  This patch fixes this by making the entry
node dominate all blocks, including unreachable ones.

llvm-svn: 4037
 2002-10-04 14:45:48 +00:00
Chris Lattner
2a7dd8373f Improve printing of dominator sets 
llvm-svn: 3976
 2002-09-29 21:42:42 +00:00