RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-25 12:12:47 +01:00
Code Issues Projects Releases Wiki Activity
27,011 Commits 4 Branches 5 Tags 704 MiB
ef1a8ce64a
Commit Graph

1342 Commits

Author SHA1 Message Date
Chris Lattner
bd00b4a18e post-dom-frontiers requires proper post-dominance 
llvm-svn: 24409
 2005-11-18 07:28:26 +00:00
Andrew Lenharth
177491a9a2 prevent cse of readcyclecounter 
llvm-svn: 24303
 2005-11-11 19:02:54 +00:00
Andrew Lenharth
dca2f13e76 continued readcyclecounter support 
llvm-svn: 24300
 2005-11-11 16:47:30 +00:00
Chris Lattner
2724ebe02e Fix a problem that Nate noticed with LSR: 
When inserting code for an addrec expression with a non-unit stride, be
more careful where we insert the multiply.  In particular, insert the multiply
in the outermost loop we can, instead of the requested insertion point.

This allows LSR to notice the mul in the right loop, reducing it when it gets
to it.  This allows it to reduce the multiply, where before it missed it.

This happens quite a bit in the test suite, for example, eliminating 2
multiplies in art, 3 in ammp, 4 in apsi, reducing from 1050 multiplies to
910 muls in galgel (!), from 877 to 859 in applu, and 36 to 30 in bzip2.

This speeds up galgel from 16.45s to 16.01s, applu from 14.21 to 13.94s and
fourinarow from 66.67s to 63.48s.

This implements Transforms/LoopStrengthReduce/nested-reduce.ll

llvm-svn: 24102
 2005-10-30 06:24:33 +00:00
Chris Lattner
8a257558a0 remove a dead file 
llvm-svn: 24085
 2005-10-29 04:43:38 +00:00
John Criswell
0893d5847f Move some constant folding functions into LLVMAnalysis since they are used 
by Analysis and Transformation passes.

llvm-svn: 24038
 2005-10-27 16:00:10 +00:00
John Criswell
d6538108e8 Move some constant folding code shared by Analysis and Transform passes 
into the LLVMAnalysis library.
This allows LLVMTranform and LLVMTransformUtils to be archives and linked
with LLVMAnalysis.a, which provides any missing definitions.

llvm-svn: 24036
 2005-10-27 15:54:34 +00:00
Chris Lattner
22c8bcd5c6 Remove this pass, it is not useful 
llvm-svn: 23949
 2005-10-24 02:35:43 +00:00
Chris Lattner
e6f7a38925 DONT_BUILD_RELINKED is gone and implied by BUILD_ARCHIVE now 
llvm-svn: 23940
 2005-10-24 02:26:13 +00:00
Chris Lattner
a4b13acd52 Only build .a file versions of these libraries, instead of .a and .o versions. 
This should speed up build times.

llvm-svn: 23933
 2005-10-24 01:59:48 +00:00
Chris Lattner
ffba9fcbff don't bother building the archive version of this library 
llvm-svn: 23927
 2005-10-24 01:08:20 +00:00
Chris Lattner
17f407da37 expose a ctor 
llvm-svn: 23924
 2005-10-24 01:00:45 +00:00
Chris Lattner
a1b11b2aa4 implement some prototypes 
llvm-svn: 23920
 2005-10-24 00:38:38 +00:00
Chris Lattner
67d9e82237 move this to the analyze tool 
llvm-svn: 23918
 2005-10-24 00:27:36 +00:00
Chris Lattner
8503ee5b01 wrap a long line 
llvm-svn: 23507
 2005-09-28 22:30:58 +00:00
Chris Lattner
ab0448905e Add a new getLoopLatch() method. 
llvm-svn: 23315
 2005-09-12 17:03:55 +00:00
Chris Lattner
f369fd383d floor/ceil don't read/write memory. This allows gcse to eliminate 6 calls 
in mesa.

llvm-svn: 23015
 2005-08-24 16:58:56 +00:00
Chris Lattner
3bfebb1e8f Fix Transforms/LoopStrengthReduce/2005-08-15-AddRecIV.ll 
llvm-svn: 22797
 2005-08-16 00:37:01 +00:00
Chris Lattner
c2cbe96e25 Teach LLVM to know how many times a loop executes when constructed with 
a < expression, e.g.: for (i = m; i < n; ++i)

llvm-svn: 22793
 2005-08-15 23:33:51 +00:00
Chris Lattner
0730ac081a Fix an obvious oops 
llvm-svn: 22742
 2005-08-10 00:59:40 +00:00
Chris Lattner
6ca08d5739 implement two helper methods 
llvm-svn: 22736
 2005-08-09 23:36:33 +00:00
Misha Brukman
e094f6c611 * Unbreak optimized build (noticed by Eric van Riet Paap) 
* Comment #endif clauses for readability

llvm-svn: 22646
 2005-08-04 14:16:48 +00:00
Chris Lattner
62b0ecdfb8 add support for Graphviz when viewing CFGs 
llvm-svn: 22620
 2005-08-03 17:55:05 +00:00
Nate Begeman
0d1a7b6737 Break SCEVExpander out of IndVarSimplify into its own .h/.cpp file so that 
other passes may use it.

llvm-svn: 22557
 2005-07-30 00:12:19 +00:00
Jeff Cohen
bd51ec7461 Eliminate all remaining tabs and trailing spaces. 
llvm-svn: 22523
 2005-07-27 06:12:32 +00:00
Andrew Lenharth
10f725f64b Remove glibc specific functions, and mark a couple as C99 
llvm-svn: 22384
 2005-07-11 20:35:20 +00:00
Andrew Lenharth
8089fbc902 because on alpha: 
#   define errno (*__errno_location ())

*shakes head

llvm-svn: 22383
 2005-07-11 17:41:12 +00:00
Andrew Lenharth
4e1c8055ea the correct fix was to fix AliasAnalysis.getModRefInfo 
llvm-svn: 22268
 2005-06-20 15:25:22 +00:00
Andrew Lenharth
262b657737 prevent GCSE from forwarding stores to loads around vaarg. This is uggly, and I am trying to fix the AliasInfo, as it should catch the problem instead. 
llvm-svn: 22266
 2005-06-20 15:02:05 +00:00
Andrew Lenharth
a9214fec08 core changes for varargs 
llvm-svn: 22254
 2005-06-18 18:34:52 +00:00
Chris Lattner
5a7f1642b7 By definition, 'tail' calls cannot access the stack frame of their caller. 
Expose this as a simple form of mod/ref information.  This implements
BasicAA/tailcall-modref.ll

llvm-svn: 21796
 2005-05-08 23:58:12 +00:00
Chris Lattner
4f7bba1106 These intrinsics do not access memory 
llvm-svn: 21718
 2005-05-06 05:21:04 +00:00
Misha Brukman
d29b27d73b Remove extra blank line 
llvm-svn: 21706
 2005-05-05 23:43:47 +00:00
Chris Lattner
234ffe2395 Add llvm.sqrt intrinsic, patch contributed by Morten Ofstad 
llvm-svn: 21627
 2005-04-30 03:44:07 +00:00
Chris Lattner
fb0d0ea349 These functions can set errno! 
llvm-svn: 21609
 2005-04-28 21:52:31 +00:00
Chris Lattner
5dc0b9e938 Make interval partition print correctly, patch contributed by 
Vladimir Prus!

llvm-svn: 21566
 2005-04-26 14:48:28 +00:00
Chris Lattner
bab9c90db4 Correctly handle global-argument aliases induced in main 
llvm-svn: 21537
 2005-04-25 19:16:31 +00:00
Chris Lattner
e39652d21c Don't mess up SCC traversal when a node has null edges out of it. 
llvm-svn: 21536
 2005-04-25 19:16:17 +00:00
Chris Lattner
0bc1588c47 Propagate eq sets through the bu graphs to the cbu and eq graphs, fixing 
a crash of the sfv on 188.ammp

llvm-svn: 21478
 2005-04-23 21:11:05 +00:00
Chris Lattner
c638ca05a0 Malloc/Free have mod/ref effects. Do not allow CSE of function calls that 
call malloc/free.  This fixes PR555.

llvm-svn: 21443
 2005-04-22 05:36:59 +00:00
Misha Brukman
a9a1982a44 Convert tabs to spaces 
llvm-svn: 21439
 2005-04-22 04:01:18 +00:00
Misha Brukman
122d682689 Remove trailing whitespace 
llvm-svn: 21416
 2005-04-21 21:13:18 +00:00
Chris Lattner
9d2c6a3981 add support for taking and resolving the address of free. 
llvm-svn: 21396
 2005-04-21 16:09:43 +00:00
Chris Lattner
f8d9224d8c Fix a crash analyzing MultiSource/Benchmarks/MallocBench/gs 
llvm-svn: 21245
 2005-04-12 03:59:27 +00:00
Chris Lattner
49d166c6b6 Don't make this require loopsimplify. It works BETTER with loop simplify 
but should not require it.

llvm-svn: 21123
 2005-04-06 21:45:00 +00:00
Chris Lattner
c5b8fbe7f9 do not crash when using -debug 
llvm-svn: 21092
 2005-04-05 01:12:03 +00:00
Chris Lattner
57ea4daa2e do not dereference an extra layer of pointers to determine if an external 
call can modify a memory location.  This fixes
test/Regression/Analysis/Andersens/modreftest.ll

llvm-svn: 21088
 2005-04-04 22:23:21 +00:00
Chris Lattner
0938200804 fix some VC compilation problems, thanks to Jeff C for pointing this out! 
llvm-svn: 21044
 2005-04-02 20:17:09 +00:00
Chris Lattner
e6d28e8aac EquivClassGraphs is now in DataStructure.h 
llvm-svn: 21042
 2005-04-02 20:08:17 +00:00
Chris Lattner
54ab60f08d use a callee_iterator typedef. 
llvm-svn: 21038
 2005-04-02 20:02:41 +00:00
Chris Lattner
23ef46ddca Change the ActualCallees callgraph from hash_multimap<Instruction,Function> 
to std::set<std::pair<Inst,Func>> to avoid duplicate entries.

This speeds up the CompleteBU pass from 1.99s to .15s on povray and the
eqgraph passes from 1.5s to .16s on the same.

llvm-svn: 21031
 2005-04-02 19:17:18 +00:00
Chris Lattner
761bb09edb import all of the rest of the stubs that dsa uses for direct comparison 
llvm-svn: 20932
 2005-03-29 20:36:05 +00:00
Chris Lattner
94ea4d104c learn about some more functions. 
llvm-svn: 20929
 2005-03-29 20:04:24 +00:00
Chris Lattner
cc1644eb2c Fix a problem where we not marking incoming arguments to functions with 
external linkage as incomplete.

llvm-svn: 20927
 2005-03-29 19:16:59 +00:00
Chris Lattner
39064a8ca0 there is no point comparing against null pointer. 
llvm-svn: 20925
 2005-03-29 17:44:52 +00:00
Chris Lattner
5ceaf630ab Fix a major problem with global variable initializers. This could cause 
us to have stuff pointing to the null pointer, which makes no sense
(the null ptr is an ssa value, not the null object)

llvm-svn: 20922
 2005-03-29 17:21:53 +00:00
Chris Lattner
4f9c2cde55 add some more functions, ignore setcc for constraints! 
llvm-svn: 20917
 2005-03-29 06:52:20 +00:00
Chris Lattner
813ef90a12 Handle "known" external calls context sensitively, add support for realloc 
and a couple of other functions that are important.

Handle aggregate undef values for gv initializers

llvm-svn: 20914
 2005-03-29 06:09:07 +00:00
Chris Lattner
47fcba56f8 Teach andersens that non-escaping memory cannot be mod/ref'd by external fn calls. 
llvm-svn: 20891
 2005-03-28 06:21:17 +00:00
Misha Brukman
b97b449309 Fix grammar 
llvm-svn: 20890
 2005-03-28 04:32:12 +00:00
Chris Lattner
abb512a593 Make anders-aa much more precise by not being completely pessimistic about 
external functions.  Teach it about a few important ones.

llvm-svn: 20889
 2005-03-28 04:03:52 +00:00
Chris Lattner
691b1987e1 wrap some long lines 
llvm-svn: 20884
 2005-03-27 22:03:46 +00:00
Chris Lattner
6b31704450 remove ... 
llvm-svn: 20883
 2005-03-27 21:57:09 +00:00
Chris Lattner
15741f8877 speed up steens by using spliceFrom, improve its precision by realizing that 
an incomplete node cannot alias a complete node.

llvm-svn: 20882
 2005-03-27 21:56:55 +00:00
Chris Lattner
7f0903e187 teach andersens about undef 
llvm-svn: 20881
 2005-03-27 18:58:23 +00:00
Chris Lattner
de6cc372e3 Don't give up completely, maybe other AA can say something about this. 
llvm-svn: 20873
 2005-03-27 00:02:33 +00:00
Chris Lattner
3a88055932 Factor out percentage printing into its own function. Make two changes to 
the function: print more precision XX.X% instead of XX%, and cast to ULL
before scaling by 100/1000 to avoid wrap around for large numbers of queries
(such as occur for 253.perlbmk and 176.gcc)

llvm-svn: 20872
 2005-03-26 23:56:33 +00:00
Chris Lattner
b84076a278 Cache mapping information for a call site after computing it for a mod/ref 
query.  If the next mod/ref query happens to be for the same call site
(which is extremely likely), use the cache instead of recomputing the
callee/caller mapping.  This makes -aa-eval ***MUCH*** faster with
ds-aa

llvm-svn: 20871
 2005-03-26 23:29:03 +00:00
Chris Lattner
21d25dd835 Remove more long dead code: dsa doesn't provide must alias info 
llvm-svn: 20870
 2005-03-26 22:54:46 +00:00
Chris Lattner
8638fbf4d6 remove some unsafe code that has long been dead 
llvm-svn: 20869
 2005-03-26 22:48:42 +00:00
Chris Lattner
ee96215ded slightly improve mod/ref for DSAA by checking the globals graph for fallback 
llvm-svn: 20868
 2005-03-26 22:47:03 +00:00
Chris Lattner
02275101be Teach steens-aa two things about mod/ref information: 
1. If memory never escapes the program, it cannot be mod/ref'd by external
     functions.
  2. If memory is global never mod/ref'd in the program, it cannot be mod/ref'd
     by any call.

llvm-svn: 20867
 2005-03-26 22:43:20 +00:00
Chris Lattner
bbec058833 Interchange this loop so that we test all pointers against one call site 
before moving on to the next call site.  This will be a more efficient way
to compute the mod/ref set for AA implementations like DSA.

llvm-svn: 20866
 2005-03-26 22:16:44 +00:00
Chris Lattner
d11e075664 no really, don't double count these nodes either! 
llvm-svn: 20837
 2005-03-25 20:54:45 +00:00
Chris Lattner
81e77226bb Don't count all of the nodes in the SCC once for each function in the SCC. 
llvm-svn: 20836
 2005-03-25 20:37:32 +00:00
Chris Lattner
14fd1844ba Grow the EQ classes for globals at the end of the BU pass. This shrinks 
memory usage in the TD pass for 254.gap from 31.3MB to 3.9MB.

llvm-svn: 20834
 2005-03-25 16:45:43 +00:00
Chris Lattner
549f99e537 Treat free operations as volatile, since they cannot be moved. This fixes 
Transforms/LICM/2005-03-24-LICM-Aggregate-Crash.ll

llvm-svn: 20830
 2005-03-25 05:49:37 +00:00
Chris Lattner
52e28abe6e remove a debugging timer. 
llvm-svn: 20827
 2005-03-25 00:06:09 +00:00
Chris Lattner
5d60f10a1d Two changes here: 
1. Instead of copying Local graphs to the BU graphs to start with, use
     spliceFrom to do the job (which is constant time in this case).  On
     176.gcc, this chops off .17s from the bu pass.
  2. When building SCC graphs, simplify the logic and use spliceFrom to
     do the heavy lifting, instead of cloneInto/delete.  This slices
     another .14s off 176.gcc.

llvm-svn: 20826
 2005-03-25 00:05:04 +00:00
Chris Lattner
02206c42f2 Make the spliceFrom case where one graph is completely empty be constant time. 
llvm-svn: 20825
 2005-03-25 00:02:41 +00:00
Chris Lattner
a90eb0ff31 add a new DSGraph::spliceFrom method, which violently takes the content of 
one graph and plops it into another, without breaking a sweat.

llvm-svn: 20824
 2005-03-24 23:46:04 +00:00
Chris Lattner
5f6b30b7c0 This replaces the correct but slow code with a more aggressive scc-finder 
based approach to find globals and call sites that need to be copied.  This
speeds up the BU pass on 176.gcc from 22s back up to 2.3s.  Not as good
as 1.5s, but at least it's correct :)

llvm-svn: 20820
 2005-03-24 23:06:02 +00:00
Chris Lattner
dec4b495c9 only look at successors of globals. This gets us down to "only" 22s in the 
bu pass for 176.gcc

llvm-svn: 20818
 2005-03-24 21:17:27 +00:00
Chris Lattner
0a5c8b7f21 Unfortunately, a previous patch was not safe. Revert it, reimplement 
something correct. Unfortunately this takes 176.gcc's BU phase back
up to 29s from 1.5.  This fixes DSGraph/2005-03-24-Global-Arg-Alias.ll

llvm-svn: 20817
 2005-03-24 21:07:47 +00:00
Chris Lattner
32dc61b75e don't bother |'ing in 0's 
llvm-svn: 20815
 2005-03-24 18:42:51 +00:00
Chris Lattner
0530cce5a5 be more aggressive about incompleteness marking 
llvm-svn: 20814
 2005-03-24 18:42:28 +00:00
Chris Lattner
120bfecc01 Fix a crash while promoting a value out of a loop from a global variable 
when using ds-aa

llvm-svn: 20802
 2005-03-24 04:22:04 +00:00
Chris Lattner
586f97a8b6 teach ds-aa about mod/ref for external function calls. 
llvm-svn: 20801
 2005-03-24 03:04:50 +00:00
Chris Lattner
1a860712dc Simplify dead code into a fixme :) 
llvm-svn: 20800
 2005-03-24 02:41:19 +00:00
Chris Lattner
1dfea3e0f7 fix a compiler crash in runtime/libprofile 
llvm-svn: 20799
 2005-03-24 01:22:52 +00:00
Chris Lattner
be7663e15e wrap a long line 
llvm-svn: 20797
 2005-03-23 23:51:12 +00:00
Chris Lattner
78ee200153 If we are calling an external function, chain to another AA to potentially 
decide, don't just immediately give up.

This implements GlobalsModRef/chaining-analysis.ll

llvm-svn: 20796
 2005-03-23 23:49:47 +00:00
Chris Lattner
e64b77f6c3 Make this more efficient by only making one virtual method call. 
llvm-svn: 20793
 2005-03-23 23:26:58 +00:00
Chris Lattner
db762dadcb Make this a bit more aggressive 
llvm-svn: 20792
 2005-03-23 22:06:41 +00:00
Chris Lattner
03631d6bc4 a hack to allow count-aa to work with ds-aa :( 
llvm-svn: 20791
 2005-03-23 21:59:34 +00:00
Chris Lattner
0fa70f79a6 Add two options to allow -count-aa to print queries either (1) all queries, 
or (2) only queries that are not successful (e.g. return may alias)

llvm-svn: 20790
 2005-03-23 21:59:07 +00:00
Chris Lattner
06fa97abf9 turn a dead conditional into an assert. 
llvm-svn: 20787
 2005-03-23 20:12:08 +00:00
Chris Lattner
543acffe45 Totally gut mergeInGraph. There is absolutely no reason to be merging 
global roots in from callees to callers.  The BU graphs do not have accurate
globals information and all of the clients know it.  Instead, just make sure
the GG is up-to-date, and they will be perfectly satiated.

This speeds up the BU pass on 176.gcc from 5.5s to 1.5s, and Loc+BU+TD
from 7s to 2.7s.

llvm-svn: 20786
 2005-03-23 20:08:59 +00:00
Chris Lattner
08302340ff wrap a long line 
llvm-svn: 20785
 2005-03-23 16:43:11 +00:00
Chris Lattner
6222df7351 Make -steens-aa more conservative (aka correct) by making sure to obey 
incompleteness flags.

Make it more aggressive by taking field sensitive information into
account.

llvm-svn: 20781
 2005-03-23 01:48:09 +00:00
Chris Lattner
995ce252d8 implement Analysis/DSGraph/field-sensitive.ll 
llvm-svn: 20779
 2005-03-23 01:47:19 +00:00
Chris Lattner
6d9578f11d Several changes here: 
1. Increase max node size from 64->256 to avoid collapsing an important
   structure in 181.mcf
2. If we have multiple calls to an indirect call node with an indirect
   callee, fold these call nodes together, to avoid DSA turning apoc into
   a flaming fireball of death when analyzing 176.gcc.
  With this change, 176.gcc now takes ~7s to analyze for loc+bu+td, with
  5.7s of that in the BU pass.

llvm-svn: 20775
 2005-03-22 23:54:52 +00:00
Chris Lattner
6736ff36a1 Mark external globals incomplete in the BU Globals graph, fixing 
Analysis/DSGraph/2005-03-22-IncompleteGlobal.ll

llvm-svn: 20773
 2005-03-22 22:10:22 +00:00
Chris Lattner
f975e2350a Directly count the number of memory instructions. 
llvm-svn: 20766
 2005-03-22 03:55:10 +00:00
Chris Lattner
361cab323a Remove an iteration pass over the entire scalarmap for each function created 
by not allowing integer constants to get into the scalar map in the first
place.

llvm-svn: 20764
 2005-03-22 02:45:13 +00:00
Chris Lattner
d1e1c51e8e When making a clone of a DSGraph from the BU pass, make sure to remember that 
this clone is supposed to be used for *ALL* of the functions in the SCC.

This fixes the memory explosion problem the TD pass was having, reducing the
memory growth from 24MB -> 3.5MB on povray and 270MB ->8.3MB on perlbmk!
This obviously also speeds up the TD pass *a lot*.

llvm-svn: 20763
 2005-03-22 01:50:42 +00:00
Chris Lattner
d36dab8b4c Don't use operator[], use the new method instead, which is faster. This speeds 
up the TD pass about 30% for povray and perlbmk.  It's still not clear why
copying a 5MB set of graphs turns into a 25MB set of graphs though :(

llvm-svn: 20762
 2005-03-22 01:42:59 +00:00
Chris Lattner
0ed923c45a Now that the dead ctor is gone, nothing uses the old node mapping exported by 
cloneInto: make it an internally used mapping.

llvm-svn: 20760
 2005-03-22 00:36:51 +00:00
Chris Lattner
4264b1d97e remove a dead ctor 
llvm-svn: 20759
 2005-03-22 00:33:35 +00:00
Chris Lattner
81a96c578c now that the second argument is always this->ReturnNodes, don't bother passing it. 
llvm-svn: 20758
 2005-03-22 00:29:44 +00:00
Chris Lattner
4c9d4fe24f instead of using a local RetValMap, just use the graph we are cloning into 
for the return node map.

llvm-svn: 20757
 2005-03-22 00:25:52 +00:00
Chris Lattner
bd9d33173c now that the valuemapping is always the local scalar map, we can eliminate 
this identity merge.

llvm-svn: 20755
 2005-03-22 00:22:45 +00:00
Chris Lattner
ffa612a1fd remove the second argument to cloneInto 
llvm-svn: 20754
 2005-03-22 00:21:05 +00:00
Chris Lattner
940600a185 add some timers, don't clone aux nodes 
llvm-svn: 20752
 2005-03-22 00:12:00 +00:00
Chris Lattner
21b3519b2e move this out of line 
llvm-svn: 20751
 2005-03-22 00:09:45 +00:00
Chris Lattner
e1c098449c don't generate temporary scalarmaps. 
llvm-svn: 20749
 2005-03-22 00:04:21 +00:00
Chris Lattner
1ce92ebd00 allow passing clone flags down to cloneInto 
llvm-svn: 20748
 2005-03-21 22:49:53 +00:00
Chris Lattner
97fc8f85d1 Enhance the TD pass to build composite graphs when we have indirect call 
sites that target multiple callees.  If we have a function table, for
example, with N callees, and M callers call through it, we used to have
to perform O(M*N) graph inlinings.  Now we perform O(M+N) inlinings.

This speeds up the td pass on perlbmk from 36.26s to 25.75s.

llvm-svn: 20743
 2005-03-21 20:31:29 +00:00
Chris Lattner
8b4af69d5b make this const correct 
llvm-svn: 20741
 2005-03-21 20:28:50 +00:00
Chris Lattner
15ab6ab0c1 Fix a major problem where we didn't add call graph edges for call sites with 
more than 1 callee.  This fixes Analysis/DSGraph/FunctionPointerTable-const.ll

llvm-svn: 20740
 2005-03-21 20:20:49 +00:00
Chris Lattner
7c6e697cc6 Ugh, for some reason, I can't call this unless the reference is const!?!?!? 
llvm-svn: 20732
 2005-03-21 10:00:45 +00:00
Chris Lattner
83ce1e319c The reachability cloner should add arguments to merged calls when the RHS of 
the merge has more operands than the LHS.

llvm-svn: 20731
 2005-03-21 09:39:51 +00:00
Chris Lattner
3dd7af56a4 'note to self' 
llvm-svn: 20727
 2005-03-21 08:43:32 +00:00
Chris Lattner
1f266b60f8 Change the way that the TD pass inlines graphs. Instead of inlining each 
graph into all of the functions it calls when we visit a graph, change it so
that the graph visitor inlines all of the callers of a graph into the current
graph when it visits it.

While we're at it, inline global information from the GG instead of from each
of the callers.  The GG contains a superset of the info that the callers do
anyway, and this way we only need to do it one time (not one for each caller).

This speeds up the TD pass substantially on several programs, and there is
still room for improvement.  For example, the TD pass used to take 147s
on perlbmk, it now takes 36s.  On povray, we went from about 5s to 1.97s.
134.perl is down from ~1s for Loc+BU+TD to .6s.

The TD pass needs a lot of improvement though, which will occur with later
patches.

llvm-svn: 20723
 2005-03-21 04:55:35 +00:00
Chris Lattner
85387b86fa Don't strip modref bits when inlining down the call graph. This fixes 
the DSGraph/2003-06-30-TopDownResolve.ll regression from last night.

llvm-svn: 20717
 2005-03-20 18:02:56 +00:00
Chris Lattner
da405e3c5d Remove the ability to keep track of inlined globals, which is always dead. 
llvm-svn: 20716
 2005-03-20 04:30:30 +00:00
Chris Lattner
0d3ba2a064 This call is always a noop, remove it. 
llvm-svn: 20714
 2005-03-20 04:29:54 +00:00
Chris Lattner
715493901e remove some pointless asserts 
llvm-svn: 20713
 2005-03-20 04:29:39 +00:00
Chris Lattner
a09de3da5d -steens doesn't use the inlined globals facility. 
llvm-svn: 20712
 2005-03-20 04:23:57 +00:00
Chris Lattner
cb59ad59dc Build EC's for globals twice. The first is after constructing the initial 
Globals Graph for the local pass, the second is after all of the locals
graphs have been constructed.  This allows for many additional global EC's
to be recognized that weren't before.  This speeds up analysis of programs
like 177.mesa, where it changes DSA from taking 0.712s to 0.4018s.

llvm-svn: 20711
 2005-03-20 03:32:35 +00:00
Chris Lattner
4928678f91 Add a new DSNode::removeGlobal method. 
llvm-svn: 20710
 2005-03-20 03:29:54 +00:00
Chris Lattner
f61874f79a Transform BU pass to not use the horrible DSCallSiteIterator class. 
llvm-svn: 20708
 2005-03-20 02:42:07 +00:00
Chris Lattner
1648378d0e Implement new methods for dealing with DSNode global lists, rename uses of 
old methods.

llvm-svn: 20707
 2005-03-20 02:41:38 +00:00
Chris Lattner
2a3687ecb0 use simpler methods. 
llvm-svn: 20706
 2005-03-20 02:41:16 +00:00
Chris Lattner
dddb514aa9 method was renamed. 
llvm-svn: 20705
 2005-03-20 02:40:27 +00:00
Chris Lattner
4c11b8e07d print out equiv class info. 
llvm-svn: 20704
 2005-03-20 02:40:11 +00:00
Chris Lattner
73ae41b317 some methods got renamed 
llvm-svn: 20703
 2005-03-20 02:40:04 +00:00
Chris Lattner
da7b948969 Make use of simpler DSNode methods. 
llvm-svn: 20702
 2005-03-20 02:39:49 +00:00
Chris Lattner
51f7c8a068 #ifdef out a function only used by #ifdef'd code. 
llvm-svn: 20700
 2005-03-20 02:14:15 +00:00
Chris Lattner
904a0ddcc5 comment cleanup 
llvm-svn: 20699
 2005-03-20 01:18:00 +00:00
Chris Lattner
f17cd879c0 Create an equivalence class of global variables that DSA will never be able 
to tell apart anyway, and only track the leader for of these equivalence
classes in our graphs.

This dramatically reduces the number of GlobalValue*'s that appear in scalar
maps, which A) reduces memory usage, by eliminating many many scalarmap entries
and B) reduces time for operations that need to execute an operation for each
global in the scalar map.

As an example, this reduces the memory used to analyze 176.gcc from 1GB to
511MB, which (while it's still way too much) is better because it doesn't hit
swap anymore.  On eon, this shrinks the local graphs from 14MB to 6.8MB,
shrinks the bu+td graphs of povray from 50M to 40M, shrinks the TD graphs of
130.li from 8.8M to 3.6M, etc.

This change also speeds up DSA on large programs where this makes a big
difference.  For example, 130.li goes from 1.17s -> 0.56s, 134.perl goes
from 2.14 -> 0.93s, povray goes from 15.63s->7.99s (!!!).

This also apparently either fixes the problem that caused DSA to crash on
perlbmk and gcc, or it hides it, because DSA now works on these.  These
both take entirely too much time in the TD pass (147s for perl, 538s for
gcc, vs 7.67/5.9s in the bu pass for either one), but this is a known
problem that I'll deal with later.

llvm-svn: 20696
 2005-03-19 22:23:45 +00:00
Chris Lattner
773569df86 Switch to use the new interface for the EquivalenceClasses class, and fix 
a bug involving SCC's who have multiple members that are part of an EC.

llvm-svn: 20678
 2005-03-19 05:15:27 +00:00
Chris Lattner
54b0239649 do not bother inlining nullary functions without return values. The only 
effect these calls can have is due to global variables, and these passes
all use the globals graph to capture their effect anyway.  This speeds up
the BU pass very slightly on perlbmk, reducing the number of dsnodes
allocated from 98913 to 96423.

llvm-svn: 20676
 2005-03-18 23:19:47 +00:00
Chris Lattner
a9f266472f fix a bogus assertion 
llvm-svn: 20675
 2005-03-18 23:18:30 +00:00
Chris Lattner
1ebf12b477 another fastpath 
llvm-svn: 20674
 2005-03-18 23:18:20 +00:00
Chris Lattner
7a4832c53a expose this pass to both opt and analyze 
llvm-svn: 20672
 2005-03-18 05:27:57 +00:00
Chris Lattner
c2d54235d7 remove a bogus optimization. This only works if there are no globals in the 
graph, and the combination of a function that does not reference globals, takes
not arguments and returns no value is pretty rare.

llvm-svn: 20670
 2005-03-18 00:23:59 +00:00
Chris Lattner
57989f2b9a Rewrite DSAA::getModRefInfo to compute the mapping between caller and callee 
to determine mod/ref behavior, instead of creating a *copy* of the caller
graph and inlining the callee graph into the copy.

This speeds up aa-eval on Ptrdist/yacr2 from 109.13s to 3.98s, and gives
identical results.  The speedup is similar on other programs.

llvm-svn: 20669
 2005-03-18 00:21:03 +00:00
Chris Lattner
a7e0e70f53 implement a new method. 
llvm-svn: 20668
 2005-03-17 23:45:54 +00:00
Chris Lattner
be0eb11431 add some possibly bogus assertions. 
llvm-svn: 20665
 2005-03-17 20:33:27 +00:00