RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-28 14:32:51 +01:00
Code Issues Projects Releases Wiki Activity
1,961 Commits 4 Branches 5 Tags 704 MiB
1e6ab6f476
Commit Graph

1128 Commits

Author SHA1 Message Date
Vikram S. Adve
1e6ab6f476 Fix a bug in previous bug fix. 
llvm-svn: 2069
 2002-03-31 18:56:51 +00:00
Vikram S. Adve
fbdd533059 Bug fix: address used by indirect call instruction should also 
be marked as having a Call Interference, even though it may not
be live after the call.

llvm-svn: 2068
 2002-03-31 18:54:37 +00:00
Chris Lattner
c620b825b6 Add debug output 
llvm-svn: 2066
 2002-03-31 07:17:46 +00:00
Chris Lattner
164b766137 * Fix nondeleted type handle which could cause type pool corruption (and 
a memory leak)
* Fix memory leak of Argument nodes on function prototypes

llvm-svn: 2065
 2002-03-31 07:16:49 +00:00
Chris Lattner
8528806b33 * Move the isEquivalentTo implementations here. They can probably be put 
someplace nicer in the file though.
* Add new dump method for debugging

llvm-svn: 2064
 2002-03-31 07:16:08 +00:00
Chris Lattner
d2c39a02f7 Print out the instruction instead of just the address! 
llvm-svn: 2063
 2002-03-31 07:15:20 +00:00
Chris Lattner
aba1ef6fc9 * Move isEquivalentTo implementations to NodeImpl 
* Implement a new form of node folding to catch cases missed in Addtree
* Add removeIndistinguishableNodePairs to merge calls (todo) and globals

llvm-svn: 2062
 2002-03-31 07:14:52 +00:00
Chris Lattner
f1a2a9c168 * Convert CallMap to be a vector, because the keys can change, and the map 
doesn't resort!
* Be more generous with the cached matches that we allow now.
* Recursive calls should all work now!

llvm-svn: 2061
 2002-03-31 07:13:27 +00:00
Vikram S. Adve
f057ff78fb Fix CreateUIntSetInstruction() to handle sign extensions correctly. 
llvm-svn: 2059
 2002-03-31 00:13:12 +00:00
Chris Lattner
4c4a273f43 * Catch and ignore (for now) return instructions in tranformed functions 
* Add more debugging output
* Fix problems refering to wrong versions of various graphs
* Build the pool descriptor map!
* Clear the nodemapping map after building pool descriptor to avoid assert
* Transform the NEw function body, not the old one...
* Matrix.ll now works!

llvm-svn: 2058
 2002-03-30 20:53:14 +00:00
Chris Lattner
410c6394d3 * Clean up data structures [AllocDSNode -> DSNode] 
* TransformFunctionInfo now has call field form field mapping.  May be
  removed in the future.
* Moved the computation of "Scalars" into transformFunctionBody so
  transformFunction didn't have to recompute it.
* Implement the node mapping calculation in preparation to calculate
  PoolDescriptors to pass to transformFunctionBody
* Print out the node mapping [it looks right!]
* Other minor changes

llvm-svn: 2056
 2002-03-30 09:12:35 +00:00
Chris Lattner
36d50d01ab Maintain enough information so that the pools for all of the nodes of 
the graph can be passed around.

llvm-svn: 2053
 2002-03-30 04:02:31 +00:00
Chris Lattner
a4b9a9f573 Implement the first batch of transformations to the methods. So far it: 
* Converts malloc instructions to poolalloc
 * Converts free instructions to poolfree
 * Convert calls to call the new cloned hacked up versions

Note that this does not modify hacked up stuff yet, just the top level
function

llvm-svn: 2052
 2002-03-29 21:25:19 +00:00
Chris Lattner
c7df07c3f8 * s/Method/Function 
* Implement a check to make sure a function is not internal and external
  at the same time

llvm-svn: 2050
 2002-03-29 19:06:18 +00:00
Chris Lattner
9166ac0b3f Correctly clone the function with the extra argument types. Now we need 
to modify the function next.

This also properly recycles functions so that we don't get exponential
code blowup in the common case.

llvm-svn: 2049
 2002-03-29 19:05:48 +00:00
Chris Lattner
b6b7c3fe60 s/Method/Function 
llvm-svn: 2048
 2002-03-29 19:04:45 +00:00
Chris Lattner
57dd5ed245 New clone function routine 
llvm-svn: 2045
 2002-03-29 19:03:54 +00:00
Chris Lattner
6b1ce137c2 Find out which calls in the function we need to transform and how. 
Next step is to start hacking functions up.

llvm-svn: 2044
 2002-03-29 17:13:46 +00:00
Chris Lattner
5df9c977e1 s/Method/Function 
llvm-svn: 2043
 2002-03-29 17:08:29 +00:00
Chris Lattner
3a9f1dd66a Modularize code a bit 
llvm-svn: 2040
 2002-03-29 06:21:38 +00:00
Chris Lattner
7c2529076a Implement the first step of pool allocation - Creating, initialization, and 
destruction of the pools.

llvm-svn: 2039
 2002-03-29 05:50:20 +00:00
Chris Lattner
18cc6a9277 Add an insert method to VAlueHolder to allow batch insertion 
llvm-svn: 2038
 2002-03-29 05:49:37 +00:00
Chris Lattner
474495e742 Add new addTypeName method to Module class 
llvm-svn: 2037
 2002-03-29 04:48:40 +00:00
Chris Lattner
dc0566e721 s/Method/Function 
llvm-svn: 2036
 2002-03-29 03:57:15 +00:00
Chris Lattner
8c98acc07f s/Method/Function 
llvm-svn: 2035
 2002-03-29 03:51:11 +00:00
Chris Lattner
084601e6f4 s/Method/Function 
llvm-svn: 2034
 2002-03-29 03:44:36 +00:00
Chris Lattner
c32e9901b1 Implement new getFunction and getOrInsertFunction methods 
llvm-svn: 2033
 2002-03-29 03:44:18 +00:00
Chris Lattner
a2d3c99dfc Simplify code a bit by using Module::getOrInsertFunction 
llvm-svn: 2032
 2002-03-29 03:43:24 +00:00
Chris Lattner
815e2f4daa Flesh out a bunch more code, print allocations that are poolable. 
llvm-svn: 2031
 2002-03-29 03:40:59 +00:00
Chris Lattner
e46e35806a s/method/function 
llvm-svn: 2030
 2002-03-29 03:40:25 +00:00
Chris Lattner
4ca6fd00f2 s/Method/Function/g 
llvm-svn: 2029
 2002-03-29 03:39:36 +00:00
Chris Lattner
b7f4043df7 Simplify code a lot by using the Module::getFunction & getOrInsertFunction 
llvm-svn: 2028
 2002-03-29 03:38:05 +00:00
Chris Lattner
ab9cc61ceb Remove the reduceApply functions they are obsolete things from the days before 
we had a reasonable pass system

llvm-svn: 2022
 2002-03-28 22:49:49 +00:00
Chris Lattner
cab0ce8244 Implement getEscapingAllocations & getNonEscapingAllocations 
llvm-svn: 2021
 2002-03-28 19:33:00 +00:00
Chris Lattner
513ecd7256 * Rename UnlinkUndistinguishableShadowNodes & RemoveUnreachableShadowNodes 
to reflect that they can eliminate arbitrary nodes.
* Rename the ShadowNodeEliminate.cpp file to EliminateNodes.cpp for the
  same reason

llvm-svn: 2020
 2002-03-28 19:16:48 +00:00
Chris Lattner
fa67ad938c Ooops, I did such a great job pruning nodes, that I accidentally deleted 
ALL allocation nodes... hrm... bad.

llvm-svn: 2018
 2002-03-28 18:38:38 +00:00
Chris Lattner
0336a78488 Initial checkin of Noop pass that will be the pool allocator 
llvm-svn: 2014
 2002-03-28 18:08:31 +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
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
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
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
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
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