RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 11:42:57 +01:00
Code Issues Projects Releases Wiki Activity
10,550 Commits 4 Branches 5 Tags 704 MiB
458704f675
Commit Graph

775 Commits

Author SHA1 Message Date
Chris Lattner
458704f675 Use handy method 
llvm-svn: 11692
 2004-02-21 22:27:31 +00:00
Chris Lattner
dacc6a7448 Instead of cloning the globals for main into the globals graph at the end of 
BU propagation, clone the globals into the GG of EACH FUNCTION that finishes
processing!  The GlobalsGraph *must* include all globals and effects from
all functions in the program.  Fixing this makes pool allocation work better
on 175.vpr, but it still ultimately crashes.

llvm-svn: 11686
 2004-02-21 00:30:28 +00:00
Chris Lattner
0f9200e5a5 There is no need to merge the globals graph into the function graphs at the 
end of the BU and CBU passes.  The globals will be marked incomplete, so it
doesn't matter if they are missing some info, and merging isn't guaranteed
to bring everything in anyway!

llvm-svn: 11684
 2004-02-20 23:52:15 +00:00
Chris Lattner
31f8fa66cb Add two missing returns, which caused us to be very pessimistic about the 
printf and scanf families!

llvm-svn: 11683
 2004-02-20 23:27:09 +00:00
Chris Lattner
4653c4cb50 Add support for some string functions, the scanf family, and sprintf 
llvm-svn: 11673
 2004-02-20 20:27:11 +00:00
Chris Lattner
d9e1a49650 When we complete the bottom-up pass, make sure to merge the globals in 'main' into 
the globals graph.

llvm-svn: 11562
 2004-02-17 19:06:47 +00:00
Chris Lattner
2c0736be99 Only spit out warning for functions that take pointers, not for sin and the like 
Add more special case handling for stdio functions.  I feel dirty, how about you?

llvm-svn: 11506
 2004-02-16 22:57:19 +00:00
Chris Lattner
513e4c7bd9 memset and bcopy and now unified by the llvm.memset intrinsic 
llvm-svn: 11503
 2004-02-16 18:37:40 +00:00
Chris Lattner
cd6a595db5 No need to scan zero initializers. This should make DSA a bit faster. 
llvm-svn: 11471
 2004-02-15 05:53:42 +00:00
Chris Lattner
33ed4f9de9 Add support for a bunch more functions 
llvm-svn: 11395
 2004-02-13 21:21:48 +00:00
Chris Lattner
fbacee0077 Add support for fopen/fclose. Specifically with fopen, we were marking all of the 
operands as incomplete, though fopen is known to only read them.  This just adds
fclose for symmetry, though it doesn't gain anything.  This makes the dsgraphs for
181.mcf much more precise.

llvm-svn: 11390
 2004-02-13 20:05:32 +00:00
Chris Lattner
dd8e3f4208 Restructure code to handle memcpy/memmove 
llvm-svn: 11374
 2004-02-13 16:09:54 +00:00
Chris Lattner
ffd9c8a00b Cosmetic improvements to this option. 
llvm-svn: 11331
 2004-02-11 19:14:04 +00:00
Chris Lattner
66e7209785 Actually load profiling information now! Block layout can use real, live, 
actual profile info, and works!  :)

llvm-svn: 11324
 2004-02-11 18:21:05 +00:00
Chris Lattner
16ad30203c Fix a typeo 
llvm-svn: 11323
 2004-02-11 18:20:41 +00:00
Chris Lattner
36f91c80f4 Fix copy-and-pastos 
llvm-svn: 11319
 2004-02-11 06:10:18 +00:00
Chris Lattner
c456d0cbc7 Add skeleton profileinfoloader pass. This will be enhanced to actually LOAD 
a profile tommorow.  :)

llvm-svn: 11318
 2004-02-11 06:10:05 +00:00
Chris Lattner
427c8ee657 Factor this code out of llvm-prof 
llvm-svn: 11314
 2004-02-11 05:54:25 +00:00
Chris Lattner
c9900e2eb3 Make sure to register the 'no profile' implementation as the default for ProfileInfo 
llvm-svn: 11309
 2004-02-11 04:47:54 +00:00
Chris Lattner
f8077b7801 Simplify implementation, and probably speed things up too. 
llvm-svn: 11308
 2004-02-11 03:57:16 +00:00
Chris Lattner
a81258a786 An initial implementation of an LLVM ProfileInfo class which is designed to 
eventually allow Passes to use profiling information to direct them.

llvm-svn: 11294
 2004-02-10 22:11:42 +00:00
Chris Lattner
16690fad3d Adjust to the changed StructType interface. In particular, getElementTypes() is gone. 
llvm-svn: 11228
 2004-02-09 04:37:31 +00:00
Chris Lattner
838c2dd5af Add one that I missed 
llvm-svn: 11179
 2004-02-08 01:53:10 +00:00
Chris Lattner
cc1376078c Instead of callign removeTriviallyDeadNodes on the global graph every time 
removeDeadNodes is called, only call it at the end of the pass being run.
This saves 1.3 seconds running DSA on 177.mesa (5.3->4.0s), which is
pretty big.  This is only possible because of the automatic garbage
collection done on forwarding nodes.

llvm-svn: 11178
 2004-02-08 01:51:48 +00:00
Chris Lattner
e2ee216e1f Remove another unneeded call. 
llvm-svn: 11177
 2004-02-08 01:40:40 +00:00
Chris Lattner
85ba7bbf78 This call is no longer needed now that merging does not produce garbage 
llvm-svn: 11176
 2004-02-08 01:38:34 +00:00
Chris Lattner
32a3eb0b88 Substantially improve the DSA code by removing 'forwarding' nodes from 
DSGraphs while they are forwarding.  When the last reference to the forwarding
node is dropped, the forwarding node is autodeleted.  This should simplify
removeTriviallyDead nodes, and is only (efficiently) possible because we are
using an ilist of dsnodes now.

llvm-svn: 11175
 2004-02-08 01:27:18 +00:00
Chris Lattner
84ff796305 Bugfix for ilist conversion. The ilist wants to make an 'end' node which has 
G == 0

llvm-svn: 11174
 2004-02-08 01:05:37 +00:00
Chris Lattner
29067016a4 Switch the Nodes list from being an std::vector<DSNode*> to an ilist<DSNode> 
llvm-svn: 11173
 2004-02-08 00:53:26 +00:00
Chris Lattner
2c836fc933 Change to use node_iterators instead of direct access to Nodes 
llvm-svn: 11171
 2004-02-08 00:23:16 +00:00
Chris Lattner
6af67c7eb4 getNodes() is gone, use node_begin/end instead 
Rename stats from dsnode -> dsa
Add a new stat

llvm-svn: 11167
 2004-02-07 23:58:05 +00:00
Chris Lattner
ed36ca5f13 getNodes() is gone 
llvm-svn: 11166
 2004-02-07 23:57:26 +00:00
Chris Lattner
ce838bfae6 There is no need to clone over nodes that are going to be dead anyway 
llvm-svn: 11157
 2004-02-07 22:00:03 +00:00
Chris Lattner
ffc5eee17a In a "seeing the forest through the trees" kinda situation, I realized that a 
complete rewrite of load-vn will make it a bit faster.  This changes speeds up
the gcse pass (which uses load-vn) from 25.45s to 0.42s on the testcase in
PR209.

I've also verified that this gives the exact same results as the old one.

llvm-svn: 11132
 2004-02-05 17:20:00 +00:00
Chris Lattner
1a04f2a635 This is a big diff with no functionality change. We just reorder some code, 
which causes big reindentation.  While I'm at it, I fix the fixme by removing
some dead code.

llvm-svn: 11131
 2004-02-05 05:56:23 +00:00
Chris Lattner
7d5e3febb7 finegrainify namespacification 
llvm-svn: 11130
 2004-02-05 05:51:40 +00:00
Tanya Lattner
d7b137d9fb Fixed Chris' typo. 
llvm-svn: 11128
 2004-02-05 04:45:21 +00:00
Chris Lattner
b721589bc0 Implement optimizations for handling large basic blocks. 
llvm-svn: 11126
 2004-02-05 00:36:43 +00:00
Chris Lattner
89f03df701 Avoid referencing deleted DSgraphs when merging an SCC into a larger SCC. This 
fixes the crash in 176.gcc.

llvm-svn: 11033
 2004-01-31 21:02:18 +00:00
Chris Lattner
a497e3d6e1 Fix thinko 
llvm-svn: 11027
 2004-01-30 22:48:02 +00:00
Chris Lattner
0127841d4e Forward method request to chained aa implementation 
llvm-svn: 11024
 2004-01-30 22:20:55 +00:00
Chris Lattner
8bcdaf9b5d Implement the pointsToConstantMemory() method. 
llvm-svn: 11022
 2004-01-30 22:17:24 +00:00
Chris Lattner
71d05cef5e Improve mod/ref information based on the pointsToConstantMemory method. 
llvm-svn: 11021
 2004-01-30 22:16:42 +00:00
Misha Brukman
440d62207c Order #includes alphabetically, per style guide. 
llvm-svn: 11015
 2004-01-30 17:26:24 +00:00
Chris Lattner
dfa4f14e34 Fix a bug aflicting 265.gap 
llvm-svn: 11006
 2004-01-29 08:36:22 +00:00
Chris Lattner
caecd769c4 Minor bugfixes 
llvm-svn: 11005
 2004-01-29 03:32:15 +00:00
Chris Lattner
7ab2349541 Rename DSGraph::ScalarMapTy -> DSScalarMap 
llvm-svn: 11001
 2004-01-28 09:15:42 +00:00
Chris Lattner
9a79b1690c Fix a bug 
llvm-svn: 11000
 2004-01-28 03:31:34 +00:00
Chris Lattner
8324e48b84 Eliminate the call to removeTriviallyDeadNodes from updateFromGlobals graph, 
moving it to the start of removeDeadNodes.  This speeds up DSA by 2s on perlbmk
from 41s

llvm-svn: 10999
 2004-01-28 03:24:41 +00:00
Chris Lattner
92eb91ed70 In the TD pass, iterate over globals directly instead of through the whole scalar 
map.  This saves 5s in the TD pass, from 22->17s on perlbmk

llvm-svn: 10998
 2004-01-28 03:12:48 +00:00