RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-10 05:41:40 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
1,905 Commits 4 Branches 5 Tags 634 MiB
9f9685197c
Commit Graph

1905 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Chris Lattner
9f9685197c New file for new pass 
llvm-svn: 2012
 2002-03-28 18:01:22 +00:00
Chris Lattner
6e01190339 Checking for Cameron 
llvm-svn: 2011
 2002-03-28 17:56:28 +00:00
Chris Lattner
55186e7abf Many changes 
* Simplify a lot of the inlining stuff.  There are still problems, but not
  many
* Break up the Function representation to have a vector for every different
  node type so it is fast to find nodes of a particular flavor.
* Do more intelligent merging of call values
* Allow elimination of unreachable shadow and allocation nodes
* Generalize indistinguishability testing to allow merging of identical calls.
* Increase shadow node merging power

llvm-svn: 2010
 2002-03-28 17:56:03 +00:00
Chris Lattner
4054edc567 * Define some operators on PointerVal and PVS's 
* Nodes can determine whether they are foldable with another node
* Rename NewDSNode to AllocDSNode
* The Function graph breaks up all of the node types into individual
  vectors to alloc fast access when you are looking for a particular type
  of node.  Simplifies much code.

llvm-svn: 2009
 2002-03-28 17:48:41 +00:00
Cameron Buschardt
788a1aaab0 Rename constructor function for mem2reg pass. 
llvm-svn: 2008
 2002-03-27 23:29:23 +00:00
Cameron Buschardt
49c09d5b24 * Move classes around 
* rename constructor function
* Move stuff into anonymous namespaces

llvm-svn: 2007
 2002-03-27 23:28:40 +00:00
Cameron Buschardt
6ca2f4e859 Rename constructor function 
llvm-svn: 2006
 2002-03-27 23:27:45 +00:00
Cameron Buschardt
bcff69b0f4 Implemented promote mem->reg pass. 
llvm-svn: 2005
 2002-03-27 23:17:37 +00:00
Chris Lattner
d771725ed1 * Add #define to enabled debug messages 
* Move removeEdgesTo to be a member of DSNode
* Implement (but #ifdef out) the new, spiffier, method of determining
  shadow node equivalence.  This cannot be enabled until more is
  implemented.

llvm-svn: 2004
 2002-03-27 19:48:03 +00:00
Chris Lattner
4c6e9cda3f * Implement DSNode::removeAllIncomingEdges 
* Implement Critical Shadow node handling
* Implement routines to determine whether an allocation node is a malloc
  or alloca

llvm-svn: 2003
 2002-03-27 19:46:05 +00:00
Chris Lattner
a16c85b43d * Add critical node support 
* Optimize graph after building it.  This should be unneccesary in the future

llvm-svn: 2002
 2002-03-27 19:45:12 +00:00
Chris Lattner
9aff5a8047 * Destroy alloca nodes when a graph gets inlined 
* Add links to all subtrees when a shadow node gets resolved
* Add critical node handling

llvm-svn: 2001
 2002-03-27 19:44:33 +00:00
Chris Lattner
4defbc34ff * Add a nice utility method to DSNode 
* Export interface to tell whether an alloc node represent a malloc or alloca
* Add the concept of a "critical" shadow node

llvm-svn: 2000
 2002-03-27 19:41:45 +00:00
Chris Lattner
2a3d6c83ff * Optimizers return true on change 
* Implement indistinguishable shadow node elimination

llvm-svn: 1999
 2002-03-27 00:55:13 +00:00
Chris Lattner
ae0192e2f6 Fix long line 
llvm-svn: 1998
 2002-03-27 00:54:31 +00:00
Chris Lattner
8a44f81684 * Because of optimization, the shadow nodes between arguments might get 
removed.  Check to see if they are there.
* Repeat optimizations while changing

llvm-svn: 1997
 2002-03-27 00:53:57 +00:00
Chris Lattner
e01e339e93 Allow isa<DSNode>(..) 
Simplification routines return true on change

llvm-svn: 1996
 2002-03-27 00:52:57 +00:00
Chris Lattner
d425cc5987 * Add support for DataStructure analysis 
* Parameterize pass outputting with the printPass template, so analysis
  output can optionally take more arguments than just a stream.  The
  default output mode is just to use operator<< on the analysis.
* Remove CurrentModule hack, in favor of using printPass
* Remove special operator<<'s defined for FindUsedTypes and
  FindUnsafePointerTypes, in favor of printPass specializations
* Use std::cout instead of cout

llvm-svn: 1995
 2002-03-26 22:43:12 +00:00
Chris Lattner
d5b115e687 Initial checkin of Datastructure analysis. 
Has bugs, but shouldn't crash in theory.

llvm-svn: 1994
 2002-03-26 22:39:06 +00:00
Chris Lattner
1026adab40 New header file for datastructure analysis 
llvm-svn: 1993
 2002-03-26 22:38:45 +00:00
Chris Lattner
18073550b8 Change from Method to Function 
llvm-svn: 1992
 2002-03-26 18:02:30 +00:00
Chris Lattner
849c762b02 Change references from Method to Function 
change references from MethodARgument to FunctionArgument

llvm-svn: 1991
 2002-03-26 18:01:55 +00:00
Chris Lattner
8972179a78 Convert to use new style casts instead of direct checking 
llvm-svn: 1990
 2002-03-26 17:58:12 +00:00
Chris Lattner
57efd6ffd1 change refs to Method to Function 
Change references to MEthodArgument to FunctionArgument

llvm-svn: 1989
 2002-03-26 17:55:33 +00:00
Chris Lattner
fecabeab3c Change uses of Method to Function 
Change uses of methodArgument to FunctionArgument

llvm-svn: 1988
 2002-03-26 17:49:55 +00:00
Chris Lattner
5295e0fdcc Remove unneccesary forward declarations for classes 
llvm-svn: 1987
 2002-03-26 17:49:00 +00:00
Chris Lattner
a874026838 Transform uses of Method into uses of Function. 
Rename MethodArgument to FunctionArgument
Fix some _really_ out of date comments

llvm-svn: 1986
 2002-03-26 17:48:08 +00:00
Chris Lattner
9e84a283e3 Allow clients to use FunctionType as well as MethodType for now 
llvm-svn: 1985
 2002-03-26 17:46:41 +00:00
Vikram S. Adve
167ba9b1b2 Make test more rigorous. It was never reading the non-scalar variables 
from memory!  Also, separate the writing and reading routines.

llvm-svn: 1983
 2002-03-24 13:22:04 +00:00
Chris Lattner
22ca8cdc0d initialize sum variable 
llvm-svn: 1982
 2002-03-24 07:03:10 +00:00
Vikram S. Adve
9722a4b6e9 Refix bug: Add back method MachineCodeForInstruction::dropAllReferences. 
llvm-svn: 1980
 2002-03-24 03:58:02 +00:00
Vikram S. Adve
0a68a60e95 Fix padding when allocating local variables on stack. 
llvm-svn: 1979
 2002-03-24 03:57:38 +00:00
Vikram S. Adve
aaad217cc1 Add methods to support type inquiry. Rename TmpInstruction values. 
llvm-svn: 1978
 2002-03-24 03:56:55 +00:00
Vikram S. Adve
bd1e4e8bd8 Moved to directory Scalar/ and renamed. 
llvm-svn: 1977
 2002-03-24 03:55:06 +00:00
Vikram S. Adve
3dfd5b888b Destroy MethodLiveVarInfo after register allocation. 
llvm-svn: 1976
 2002-03-24 03:54:03 +00:00
Vikram S. Adve
fa2ed7e6b1 Use deterministic iterator for SchedGraphs. This is actually not 
useful right now when we only do local scheduling.

llvm-svn: 1975
 2002-03-24 03:53:03 +00:00
Vikram S. Adve
058ec11ea3 Bug fix: nextToTry was not being initialized in one case. 
llvm-svn: 1974
 2002-03-24 03:46:15 +00:00
Vikram S. Adve
37d44e7de9 Add option to disable scheduling. 
llvm-svn: 1973
 2002-03-24 03:45:35 +00:00
Vikram S. Adve
0cdcf40121 Add option to disable scheduling. 
Destroy live-variable information after scheduling so it is
recomputed before later phases (e.g., reg. allocation).
Use deterministic iterator to enumerate sched graphs.

llvm-svn: 1972
 2002-03-24 03:44:55 +00:00
Vikram S. Adve
d18a1cc9fb Minor changes. 
llvm-svn: 1971
 2002-03-24 03:40:59 +00:00
Vikram S. Adve
e06cac463f Re-fix bug: Put back MachineCodeForInstruction::dropAllReferences. 
llvm-svn: 1970
 2002-03-24 03:40:11 +00:00
Vikram S. Adve
b347d2796c Fix padding for variables allocated on stack. 
llvm-svn: 1969
 2002-03-24 03:39:26 +00:00
Vikram S. Adve
34306e0e1c Major overhaul to FoldGetElemPtr to handle mixed array and struct refs. 
llvm-svn: 1968
 2002-03-24 03:37:53 +00:00
Vikram S. Adve
8493ae74b2 Use deterministic iterator for treeRoots. 
llvm-svn: 1967
 2002-03-24 03:36:52 +00:00
Vikram S. Adve
8ada4c031e Bug re-fix: put back MachineCodeForInstruction::get(*I).dropAllReferences(). 
Also re-enable instr. scheduling pass.

llvm-svn: 1966
 2002-03-24 03:35:16 +00:00
Vikram S. Adve
7b84ec22d8 Change latencies for Load, Store and Branch instructions. 
llvm-svn: 1965
 2002-03-24 03:33:53 +00:00
Vikram S. Adve
57d735db7a Major enhancements to how array and structure indices are handled. 
Improve checking for constants in Multiply.
Simpler method to keep track of when a node is folded into its parent.
Several other bug fixes.

llvm-svn: 1964
 2002-03-24 03:33:02 +00:00
Vikram S. Adve
463af87e8c Change treeRoots data structure to make enumeration deterministic. 
Also, add a flag to marked nodes that do not need code because they
have been folded into the user (parent in the BURG tree).

llvm-svn: 1963
 2002-03-24 03:25:17 +00:00
Vikram S. Adve
a141a7190b Change treeRoots data structure to make enumeration deterministic. 
llvm-svn: 1962
 2002-03-24 03:24:00 +00:00
Vikram S. Adve
1f5e8f93cc Major overhaul to support arbitrary mixed array and structure indices. 
Also moved to the Scalar/ directory and renamed to "MultiDim".

llvm-svn: 1961
 2002-03-24 03:21:18 +00:00