nicolas/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
24,241 Commits 41 Branches 151 Tags
34c901b50e3163ac6c63f609b439bfcab3bb4b5b
Commit Graph

646 Commits

Author SHA1 Message Date
Chris Lattner
30525a04c1 fix a bogus assertion 
llvm-svn: 20675
 2005-03-18 23:18:30 +00:00
Chris Lattner
5bd948b4d7 another fastpath 
llvm-svn: 20674
 2005-03-18 23:18:20 +00:00
Chris Lattner
a8e1a5250a 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
3f181d7880 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
b8d85c1a74 implement a new method. 
llvm-svn: 20668
 2005-03-17 23:45:54 +00:00
Chris Lattner
488a80a292 add some possibly bogus assertions. 
llvm-svn: 20665
 2005-03-17 20:33:27 +00:00
Chris Lattner
b5525529bd simplify this function a bit, allow DS-AA to build on/improve the mod/ref 
results returned by AA, not just use one or the other.

llvm-svn: 20662
 2005-03-17 20:16:58 +00:00
Chris Lattner
8dd1491e71 Clean up some code, handle null pointer specially to avoid an assertion 
llvm-svn: 20660
 2005-03-17 19:56:56 +00:00
Chris Lattner
ea7e6548dc Two changes: 
1. Chain to the parent implementation of M/R analysis if we can't find
     any information.  It has some heuristics that often do well.
  2. Do not clear all flags, this can make invalid nodes by turning nodes
     that used to be collapsed into non-collapsed nodes (fixing crashes)

llvm-svn: 20659
 2005-03-17 19:56:18 +00:00
Chris Lattner
7b9020a059 Fix the missing symbols problem Bill was hitting. Patch contributed by 
Bill Wendling!!

llvm-svn: 20649
 2005-03-17 15:38:16 +00:00
Chris Lattner
5251047abd Do not create ridiculously huge DSNodes, as described in the comments. 
This speeds up the BU pass on 172.mgrid from 62.3 -> 0.1242s.

llvm-svn: 20648
 2005-03-17 05:25:34 +00:00
Chris Lattner
62462c2314 remove use of compat_iterator. 
llvm-svn: 20643
 2005-03-16 22:42:19 +00:00
Chris Lattner
f901355379 make sure to mark nodes in the globals graph incomplete after computing it 
so that external globals (and whatever they point to) are marked incomplete.

llvm-svn: 20628
 2005-03-15 22:47:18 +00:00
Chris Lattner
21a79edb27 fix crashes when we only have a prototype for main. 
llvm-svn: 20627
 2005-03-15 22:10:04 +00:00
Chris Lattner
dadf4b369e Fix a crash that happens when mapping something like this: 
{ short, short }

to
  short

where the second short maps onto the second field of the first struct.  In
this case, the struct index is not aligned, so we should avoid calling
getLink(2), which asserts out.

llvm-svn: 20626
 2005-03-15 21:36:50 +00:00
Chris Lattner
dd3fb83f32 Make computeGGToGMapping compute an invnodemap 
llvm-svn: 20622
 2005-03-15 17:52:18 +00:00
Chris Lattner
d31a3d0e82 Finally fix (the right way) the problem where functions like this: 
void foo() {
  G = 1;
}

would have an empty DSGraph even though G (a global) is directly used
in the function.

llvm-svn: 20619
 2005-03-15 17:14:09 +00:00
Chris Lattner
92d0c1c1ba Start using retnodes_* for iteration. 
llvm-svn: 20618
 2005-03-15 16:55:04 +00:00
Chris Lattner
451fa32685 avoid varialbe name collisions 
llvm-svn: 20606
 2005-03-15 06:29:12 +00:00
Chris Lattner
531f9e92d4 This mega patch converts us from using Function::a{iterator|begin|end} to 
using Function::arg_{iterator|begin|end}.  Likewise Module::g* -> Module::global_*.

This patch is contributed by Gabor Greif, thanks!

llvm-svn: 20597
 2005-03-15 04:54:21 +00:00
Chris Lattner
28f1caa639 Don't crash if computing a mapping to a node with zero size 
llvm-svn: 20595
 2005-03-15 04:40:24 +00:00
Chris Lattner
26415d7432 rename method, add counterpart 
llvm-svn: 20593
 2005-03-15 00:58:16 +00:00
Chris Lattner
1bdb8b7e7e add a method to compute a commonly used mapping. 
llvm-svn: 20588
 2005-03-14 19:22:47 +00:00
Chris Lattner
9071175625 regardless of whether or not the client things we should mark globals incomplete, 
ALWAYS mark them incomplete if they are external!

llvm-svn: 20586
 2005-03-13 20:36:01 +00:00
Chris Lattner
b9e2a4dec0 Make sure to remove incomplete markers before we add to them! :) 
llvm-svn: 20585
 2005-03-13 20:32:26 +00:00
Chris Lattner
5a6609771a The incoming arguments to main (the argv list) are not complete! 
llvm-svn: 20584
 2005-03-13 20:22:10 +00:00
Chris Lattner
2eff970892 After finishing BU analysis, move all global variables from the globals 
graph into main and mark them complete.

llvm-svn: 20583
 2005-03-13 20:15:06 +00:00
Chris Lattner
68c3caccb1 ADd support for printing eqgraphs. 
llvm-svn: 20582
 2005-03-13 19:51:24 +00:00
Chris Lattner
9cc2c3e9d6 Replace linear search with logrithmic one. 
llvm-svn: 20580
 2005-03-13 19:05:05 +00:00
Chris Lattner
97ac0a8780 make sure to mark nodes returned from functions as incomplete 
llvm-svn: 20576
 2005-03-12 14:58:28 +00:00
Chris Lattner
dd6bcbe820 remove this from the PA namespace, leaving it in the llvm ns 
llvm-svn: 20574
 2005-03-12 12:08:52 +00:00
Chris Lattner
2dd9a09837 Move this from the pool allocator project to here, where it logically belongs. 
llvm-svn: 20570
 2005-03-12 11:51:30 +00:00
Chris Lattner
7c832fb0b2 Make sure the two arguments of a setcc instruction point to the same node. 
llvm-svn: 20462
 2005-03-05 19:04:31 +00:00
Chris Lattner
c01e2f76c3 Trivial cleanup patch 
llvm-svn: 20436
 2005-03-04 20:27:46 +00:00
Chris Lattner
dc166eb8f7 Fix spelling, patch contributed by Gabor Greif 
llvm-svn: 20342
 2005-02-27 06:15:51 +00:00
Chris Lattner
e99ee2b35d Handle null a bit more carefully. 
Actually teach dsa about select instructions.  This doesn't affect the
graph in any way other than not setting a spurious U marker on pointer
nodes that are selected.

llvm-svn: 20324
 2005-02-25 01:27:48 +00:00
Chris Lattner
468fd33abb This instruction: 
X = gep null, ...

Used to not create a scalar map entry for X, which caused clients to barf.
This is bad.

llvm-svn: 20316
 2005-02-24 19:55:31 +00:00
Chris Lattner
d13cc49e19 Fix a bug introduced by revision 1.187 of this file. 
llvm-svn: 20308
 2005-02-24 18:48:07 +00:00
Chris Lattner
3e708301d2 Add a sanity check. 
llvm-svn: 20195
 2005-02-15 18:48:48 +00:00
Chris Lattner
219002ed8f Add a new method to make it easy to update graphs. 
llvm-svn: 20194
 2005-02-15 18:40:55 +00:00
Chris Lattner
5ce5a094aa Use new edge iterators to simplify some code. 
llvm-svn: 20086
 2005-02-09 03:20:43 +00:00
Chris Lattner
863d9c9068 IndCallGraphMap is now a pointer to a new'd map. 
llvm-svn: 20065
 2005-02-07 16:09:15 +00:00
Chris Lattner
4585abd549 If we have an indirect call site that calls N functions, inline the N functions 
into a temporary graph, remember it for later, then inline the tmp graph into
the call site.

In the case where there are other call sites to the same set of functions, this
permits us to just inline the temporary graph instead of all of the callees.

This turns N*M inlining situations into an N+M inlining situation.

llvm-svn: 20036
 2005-02-04 19:59:49 +00:00
Chris Lattner
d1000686cd Split mergeInGraph into two methods. 
llvm-svn: 20035
 2005-02-04 19:58:28 +00:00
Chris Lattner
ba954f3284 Fix the Regression/Transforms/DSAnalysis/recursion.ll regression. 
llvm-svn: 20031
 2005-02-04 18:58:04 +00:00
Chris Lattner
3dd3df2b55 Refactor getFunctionArgumentsForCall out of mergeInGraph. 
llvm-svn: 20018
 2005-02-03 18:40:25 +00:00
Chris Lattner
16a53243c6 Eliminate some duplicated debug code 
llvm-svn: 19980
 2005-02-01 21:55:40 +00:00
Chris Lattner
5ce51e83af Eliminate self-recursion as a special case. 
llvm-svn: 19979
 2005-02-01 21:49:43 +00:00
Chris Lattner
50cebc6b9b Eliminate use of DSCallSiteIterator in key loop. This is a half step to 
a tasty speedup.

llvm-svn: 19978
 2005-02-01 21:37:27 +00:00
Chris Lattner
63a46cee87 Signficantly speed up printing by not emitting the same file twice with 
different names.  Large SCC's tend to be big, so this saves a lot of time.

llvm-svn: 19970
 2005-02-01 19:10:48 +00:00