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
2,815 Commits 4 Branches 5 Tags 704 MiB
556ab513cc
Commit Graph

55 Commits

Author SHA1 Message Date
Chris Lattner
556ab513cc Rename removeDeadNodes to removeTriviallyDeadNodes 
llvm-svn: 2969
 2002-07-18 18:19:09 +00:00
Vikram S. Adve
9841c396cf Add support for a top-down propagation pass: 
-- Save a copy of the original call nodes in DSGraph before inlining bottom-up.
-- Also, save a list of the callers of each function in DSGraph.

llvm-svn: 2966
 2002-07-18 16:13:52 +00:00
Vikram S. Adve
a6647796e3 Add support for a top-down propagation pass. 
Each DSGraph now keeps a list of pending callers that have not
been inlined into the function represented by that graph.
It also keeps a copy of the original call nodes before the BU pass
eliminates some of them.

llvm-svn: 2965
 2002-07-18 16:12:08 +00:00
Chris Lattner
da58a2a5ed Implement cast nodes correctly. 
llvm-svn: 2964
 2002-07-18 15:54:42 +00:00
Chris Lattner
1cdccbde31 The graph is more accurate when I don't completely ignore the return value. 
llvm-svn: 2952
 2002-07-18 01:58:24 +00:00
Chris Lattner
9c49e62315 Lots of bug fixes, add BottomUpClosure, which has bugs, but is a start. 
llvm-svn: 2945
 2002-07-18 00:12:30 +00:00
Anand Shukla
1c8b99ff5a added std:: to string 
llvm-svn: 2915
 2002-07-16 00:03:10 +00:00
Chris Lattner
f528333ecf * Pass the DSGraph around instead of the Function to printing fns 
* Print the globals list in the node
* Print the scalars in the scalar node
* Eliminate Scalar "label" edges in the graph
* Print fake edges lighter instead of dotted

llvm-svn: 2880
 2002-07-11 20:33:32 +00:00
Chris Lattner
61d394e66f * Nodes now keep track of any global variables in them 
llvm-svn: 2879
 2002-07-11 20:32:22 +00:00
Chris Lattner
809bd75ead * Nodes now keep track of any global variables in them 
* Only dead-node-eliminate nodes with no flags
* Don't merge scalars, only merge what they point to.

llvm-svn: 2878
 2002-07-11 20:32:02 +00:00
Chris Lattner
5d62e136c5 New implementation of data structure analysis. Only local analysis has been 
implemented so far.

llvm-svn: 2871
 2002-07-10 22:38:08 +00:00
Chris Lattner
d00a93318e Reimplement data structure analysis 
llvm-svn: 2868
 2002-07-10 22:36:26 +00:00
Chris Lattner
c645efd64c Fix anand's last checkin 
llvm-svn: 2804
 2002-06-30 16:01:15 +00:00
Anand Shukla
3ab9ffd5b1 changes to make it compatible with 64bit gcc 
llvm-svn: 2795
 2002-06-25 21:18:19 +00:00
Anand Shukla
af8556bf5b changes to make it compatible with 64bit gcc 
llvm-svn: 2789
 2002-06-25 20:35:19 +00:00
Chris Lattner
cee706572b *** empty log message *** 
llvm-svn: 2777
 2002-06-25 16:12:52 +00:00
Chris Lattner
321a8cf4ba Split ConstantVals.h into Constant.h and Constants.h 
llvm-svn: 2378
 2002-04-28 19:55:58 +00:00
Chris Lattner
e6d056f520 Fix signed/unsigned comparison warning 
llvm-svn: 2350
 2002-04-28 04:49:43 +00:00
Chris Lattner
3f7a62a960 Add support for tracking array allocations 
llvm-svn: 2328
 2002-04-27 02:28:41 +00:00
Chris Lattner
4e52f71340 Allow the inline limit to be modified on the commandline for debugging 
llvm-svn: 2327
 2002-04-27 02:27:48 +00:00
Chris Lattner
bde9202648 Print argument scalars as ellipses instead of boxes 
llvm-svn: 2293
 2002-04-18 18:14:19 +00:00
Chris Lattner
a4add093c6 Inline indirect function calls that are only capable of calling one function 
llvm-svn: 2275
 2002-04-17 03:42:51 +00:00
Chris Lattner
59927296e4 Make data structure acurately get ALL edges, even loads of null fields of 
nodes that are not shadow nodes

This fixes em3d to be _correct_ if not optimial

llvm-svn: 2274
 2002-04-17 03:24:59 +00:00
Chris Lattner
0cda7182ba * Remove the concept of a critical shadow node 
* Make the function pointer argument explicit for a call nodes
* Eliminate unreachable global values
* Merge call nodes that are identical

llvm-svn: 2266
 2002-04-16 20:39:59 +00:00
Chris Lattner
11f9ff83ec * Eliminate ArgDSNode's completely, now rely on scalar map 
* Fold call nodes that are indistinguishable for each other.  This is a big
  win for external functions like sqrt, which would multiply dramatically
  before.
* Global nodes with no edges to or from them are now eliminated from the graph.

llvm-svn: 2257
 2002-04-16 03:44:03 +00:00
Chris Lattner
5e12c7caf5 Move FunctionArgument out of iOther.h into Argument.h and rename class to 
be 'Argument' instead of FunctionArgument.

llvm-svn: 2216
 2002-04-09 19:48:49 +00:00
Chris Lattner
b2038512b2 Add explicit #includes of Function.h to make up for the removed #include 
in iOther.h

llvm-svn: 2209
 2002-04-09 19:08:28 +00:00
Chris Lattner
7ae20d642d Add #includes to make up for #includes pruned out of header files. 
llvm-svn: 2207
 2002-04-09 18:37:46 +00:00
Chris Lattner
0962b63d7c Play around with #includes 
llvm-svn: 2174
 2002-04-08 21:58:53 +00:00
Chris Lattner
5cbfde5744 Call nodes are never equivalent 
Shadow nodes are never critical.

llvm-svn: 2102
 2002-04-04 19:21:51 +00:00
Chris Lattner
d4c7ce8d78 Add hack to get timing of analysis 
llvm-svn: 2101
 2002-04-04 19:21:27 +00:00
Chris Lattner
3b604e846a * Eliminate commented out code 
* Do not demand a shadow node when resolving
* Raise arbitrary inline limit

llvm-svn: 2100
 2002-04-04 19:21:06 +00:00
Chris Lattner
19689af3bb Support resolving function arguments/return values to pointers that index 
into other objects.

llvm-svn: 2094
 2002-04-01 22:20:48 +00:00
Chris Lattner
62756e4208 Avoid incorrectly adding null values to the scalar map! 
llvm-svn: 2085
 2002-04-01 00:45:09 +00:00
Chris Lattner
e66e651b68 Critical shadow nodes no do not know their parent explictly. 
llvm-svn: 2084
 2002-04-01 00:15:30 +00:00
Chris Lattner
61f6065cef Minor cleanups (use dyn_cast instead of testing manually) 
Shadow nodes now don't explicitly know their parent.

llvm-svn: 2083
 2002-04-01 00:14:41 +00:00
Chris Lattner
a68c92a3d4 Allow merging of identical call nodes. Make the shadow node pointed to 
by the call node noncritical before the call is destroyed.

llvm-svn: 2082
 2002-04-01 00:13:56 +00:00
Chris Lattner
f9097b54be Increase limit for perimeter 
llvm-svn: 2081
 2002-04-01 00:12:58 +00:00
Chris Lattner
42145d8a25 Unify the destruction code used for node pairs vs normal nodes. This was 
causing a problem before because global values with incoming edges didn't
copy the incoming edges to the node they were being merged from, causing
the poolalloc pass to die.

llvm-svn: 2079
 2002-03-31 19:57:44 +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
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
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
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