RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-09 05:13:01 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
11,686 Commits 4 Branches 5 Tags 634 MiB
b2e1576e72
Commit Graph

870 Commits

Author SHA1 Message Date
Misha Brukman
ee27e80a0b Implement getModRefInfo() for DSA to calculate whether a function modifies or 
references a pointer.

llvm-svn: 12330
 2004-03-12 06:14:22 +00:00
Misha Brukman
da119ce857 Make code more readable. 
llvm-svn: 12305
 2004-03-12 00:58:41 +00:00
Chris Lattner
405790ecae Fix PR284: [indvars] Induction variable analysis violates LLVM invariants 
llvm-svn: 12275
 2004-03-10 21:42:19 +00:00
Chris Lattner
9ce3638433 implement new method 
llvm-svn: 12264
 2004-03-09 19:37:06 +00:00
Chris Lattner
9414c55663 Switch to using edge profiling information as the basic source of profile info 
from using basic block counts.

llvm-svn: 12242
 2004-03-08 22:04:08 +00:00
Chris Lattner
83c62c84d6 Refactor implementations 
llvm-svn: 12240
 2004-03-08 21:30:35 +00:00
Chris Lattner
91ea0d3176 Import the trace class from the reoptimizer 
llvm-svn: 12236
 2004-03-08 20:57:27 +00:00
Chris Lattner
de661f7219 If we have edge counts, we can produce block counts. I've verified that 
using an edge profile to produce block counts gives the exact same numbers
as using a block count directly.

llvm-svn: 12232
 2004-03-08 20:03:52 +00:00
Chris Lattner
f3a838662e Add initial support for reading edge counts. This will be improved to enable 
translation of edge counts into block/function counts when possible.

llvm-svn: 12229
 2004-03-08 18:20:18 +00:00
Chris Lattner
1ae4150e31 Fix a bug handling globals that are constants, but are still external 
llvm-svn: 12208
 2004-03-08 03:52:24 +00:00
Chris Lattner
5a9cae47a4 Fix a minor bug 
llvm-svn: 12169
 2004-03-05 22:04:07 +00:00
Misha Brukman
75729872be Unbreak the build on Sparc. 
llvm-svn: 12161
 2004-03-05 20:04:40 +00:00
Chris Lattner
f21e7a75d6 Fix a bug in a previous checkin that broke 175.vpr 
llvm-svn: 12128
 2004-03-04 21:36:57 +00:00
Chris Lattner
c885697daa Add support for strto* and v*printf 
llvm-svn: 12127
 2004-03-04 21:03:54 +00:00
Chris Lattner
48b0fd7101 Add non-crappy support for varargs 
llvm-svn: 12126
 2004-03-04 20:33:47 +00:00
Chris Lattner
ac1eaa43fa Implement a FIXME, improving the efficiency of DSA on povray. 
This reduces CBU time from 145s -> 122s (debug build), reduces # allocated nodes
from 129420 to 116477.

llvm-svn: 12125
 2004-03-04 19:47:04 +00:00
Chris Lattner
e3fc09a37e Speed up the cbu pass from taking somewhere near the age of the universe to about 90s on povray 
llvm-svn: 12123
 2004-03-04 19:16:35 +00:00
Chris Lattner
bc7fc82865 Fix BU datastructures with povray! 
The problem was that we were merging a field of a node with a value that was
deleted.  Thanks to bugpoint for reducing povray to a nice small 3 function
example.  :)

llvm-svn: 12116
 2004-03-04 17:06:53 +00:00
Chris Lattner
e0c90cf983 Minor changes, remove some debugging code that got checked in somehow. 
Make sure to scope the NodeMap passed into cloneInto so that it doesn't point
to nodes that are deleted.  Add some FIXME's for future performance enhancements.

llvm-svn: 12115
 2004-03-04 17:05:28 +00:00
Chris Lattner
790bd9d970 Only clone nodes that are needed in the caller, don't clone ALL aux calls. This improves 
povray from having ~600K nodes and 300K call nodes to 65K nodes and 25K call nodes.

llvm-svn: 12109
 2004-03-04 03:57:53 +00:00
Chris Lattner
a141de0f09 Fix a minor bug handling incomplete programs 
llvm-svn: 12105
 2004-03-03 23:00:19 +00:00
Chris Lattner
0e1cd00f2c Fix a DSA bug that caused DSA to generate incredibly huge graphs and take forever to 
do it on povray.  The problem is that we were not copying globals from callees to
callers unless the existed in both graphs.  We should have copied them in the case
where the global pointed to a node that was copied as well.

llvm-svn: 12104
 2004-03-03 22:01:09 +00:00
Chris Lattner
a6540122dc Deinline methods, add fast exit 
llvm-svn: 12102
 2004-03-03 20:55:27 +00:00
Chris Lattner
309a57f0c0 Fix a node mapping problem that was causing the pool allocator to locally allocate 
nodes that were globally live, thus breaking programs.

llvm-svn: 12094
 2004-03-03 05:34:31 +00:00
Chris Lattner
ea4242a575 FINALLY be able to get symbolic type names in the globals graph! 
llvm-svn: 12082
 2004-03-02 21:39:43 +00:00
Chris Lattner
833646d6b8 Really, only if reopen 
llvm-svn: 12080
 2004-03-02 20:46:18 +00:00
Chris Lattner
e7c638e989 Correctly add an array marker on a node when appropriate! 
llvm-svn: 12055
 2004-03-01 19:02:54 +00:00
Chris Lattner
9bf85f216b Expand on my note-to-self 
llvm-svn: 12029
 2004-03-01 02:44:44 +00:00
Chris Lattner
9e71c09ff5 Only clone global nodes between graphs if both graphs have the global. 
llvm-svn: 11928
 2004-02-27 20:05:15 +00:00
Chris Lattner
138a7dfb62 ADD MORE FUNCTIONS! 
llvm-svn: 11927
 2004-02-27 20:04:48 +00:00
Chris Lattner
d359fbf991 Be a good little compiler and handle direct calls efficiently, even if there 
are beastly ConstantPointerRefs in the way...

llvm-svn: 11883
 2004-02-26 22:07:22 +00:00
Chris Lattner
9e55e31b2d Fix typo 
llvm-svn: 11864
 2004-02-26 03:45:03 +00:00
Chris Lattner
7990e4dcd0 The node doesn't have to be _no_ node flags, it just has to be complete and 
not have any globals.

llvm-svn: 11863
 2004-02-26 03:43:43 +00:00
Chris Lattner
948fffa8a2 Add _more_ functions 
llvm-svn: 11862
 2004-02-26 03:43:08 +00:00
Chris Lattner
9fd0c48f80 Two changes: 
1. Functions do not make things incomplete, only variables
 2. Constant global variables no longer need to be marked incomplete, because
    we are guaranteed that the initializer for the global will be in the
    graph we are hacking on now.  This makes resolution of indirect calls happen
    a lot more in the bu pass, supports things like vtables and the C counterparts
    (giant constant arrays of function pointers), etc...

Testcase here: test/Regression/Analysis/DSGraph/constant_globals.ll

llvm-svn: 11852
 2004-02-25 23:36:08 +00:00
Chris Lattner
7d273bc532 When building local graphs, clone the initializer for constant globals into each 
local graph that uses the global.

llvm-svn: 11850
 2004-02-25 23:31:02 +00:00
Chris Lattner
9fe3bf296d Simplify the dead node elimination stuff 
Make the incompleteness marker faster by looping directly over the globals
instead of over the scalars to find the globals

Fix a bug where we didn't mark a global incomplete if it didn't have any
outgoing edges.  This wouldn't break any current clients but is still wrong.

llvm-svn: 11848
 2004-02-25 23:08:00 +00:00
Chris Lattner
a9f67b5ab8 Add a bunch more functions 
llvm-svn: 11847
 2004-02-25 23:06:40 +00:00
Chris Lattner
d99d965f8c Try harder to get symbol info 
llvm-svn: 11846
 2004-02-25 23:06:30 +00:00
Chris Lattner
4f09004dff Add a bunch more functions used by perlbmk 
llvm-svn: 11824
 2004-02-25 17:43:20 +00:00
Chris Lattner
9036c86b14 Add support for 'rename' 
llvm-svn: 11813
 2004-02-24 22:17:00 +00:00
Chris Lattner
d9652be664 Add support for remove, fwrite, and fread 
Also fix problem where we didn't check to see if a node pointer was null.
Though fclose(null) doesn't make a lot of sense, 300.twolf does it.

llvm-svn: 11810
 2004-02-24 22:02:48 +00:00
Chris Lattner
63b79422f3 Fix a soon-to-be-missing #include 
llvm-svn: 11707
 2004-02-22 06:26:17 +00:00
Chris Lattner
573441bfbd Use isNull instead of getNode() to test for existence of a node, this is cheaper. 
FIX MAJOR BUG, whereby we didn't merge null edges correctly. Correcting this
fixes poolallocation on 175.vpr, and possibly others.

llvm-svn: 11695
 2004-02-22 00:53:54 +00:00
Chris Lattner
7bff00313e Fix an iterator invalidation problem which was causing some nodes to not be 
correctly merged over!

llvm-svn: 11693
 2004-02-21 22:28:26 +00:00
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
Chris Lattner
c25a7dad97 In the TD pass, don't iterate over the scalar map to find the globals, iterate over 
the globals directly.  This doesn't save any substantial time, however, because the
globals graph only contains globals!

llvm-svn: 10997
 2004-01-28 03:07:30 +00:00
Chris Lattner
394c9343b4 In updateFromGlobalsGraph, instead of iterating over all of the scalars in the 
function to find the globals, iterate over all of the globals directly.  This
speeds the function up from 14s to 6.3s on perlbmk, reducing DSA time from
53->46s.

llvm-svn: 10996
 2004-01-28 03:03:06 +00:00
Chris Lattner
528f5842dd Minor tweaks, eliminate useless integer pruning optimziation, turn on 
timers by default

llvm-svn: 10993
 2004-01-28 02:41:32 +00:00
Chris Lattner
18e0615a69 Further reduce the number of nodes cloned with getClonedNH, using merge instead. 
This reduces the number of nodes allocated, then immediately merged and DNE'd
from 2193852 to 1298049.  unfortunately this only speeds DSA up by ~1.5s (of
53s), because it's spending most of its time waddling through the scalar map :(

llvm-svn: 10992
 2004-01-28 02:11:49 +00:00
Chris Lattner
6d38674f7b Add a timer, fix a minor bug. 
Also, use RC::merge when possible, reducing the number of nodes allocated, then immediately merged away from 2985444 to 2193852 on perlbmk.

llvm-svn: 10991
 2004-01-28 02:05:05 +00:00