- Aug 02, 2003
-
-
Chris Lattner authored
llvm-svn: 7492
-
- Jul 16, 2003
-
-
Vikram S. Adve authored
after all callees are inlined into the current graph. NOTE: There's also a major bug fix for the BU pass in DataStructure.cpp, which ensures that resolvable indirect calls are not moved out to the globals graph, so that they are eventually inlined (if possible). llvm-svn: 7189
-
- Jul 03, 2003
-
-
Chris Lattner authored
llvm-svn: 7082
-
- Jul 02, 2003
-
-
Chris Lattner authored
llvm-svn: 7076
-
Chris Lattner authored
Minor cleanups llvm-svn: 7059
-
- Jul 01, 2003
-
-
Chris Lattner authored
llvm-svn: 7027
-
- Jun 30, 2003
-
-
Chris Lattner authored
llvm-svn: 7006
-
Chris Lattner authored
Look at all of the code that gets deleted! llvm-svn: 7001
-
Chris Lattner authored
DSGraph at one time llvm-svn: 6994
-
- Jun 29, 2003
-
-
Chris Lattner authored
fixes bug: DSGraph/buglobals.ll llvm-svn: 6947
-
- Jun 19, 2003
-
-
Chris Lattner authored
* Add new MultiObject flag to DSNode which keeps track of whether or not multiple objects have been merged into the node, allowing must-alias info to be tracked. llvm-svn: 6794
-
- Feb 05, 2003
-
-
Chris Lattner authored
reduces the number of function nodes created and speeds up analysis by about 10% overall. llvm-svn: 5495
-
- Feb 03, 2003
-
-
Chris Lattner authored
llvm-svn: 5476
-
- Feb 01, 2003
-
-
Chris Lattner authored
This change provides a small (3%) but consistent speedup llvm-svn: 5460
-
Chris Lattner authored
llvm-svn: 5456
-
Chris Lattner authored
llvm-svn: 5450
-
- Jan 23, 2003
-
-
Chris Lattner authored
* T-D pass now eliminates unreachable globals llvm-svn: 5419
-
- Nov 27, 2002
-
-
Vikram S. Adve authored
before inlining their graphs into a function. To support this, added flags to CloneFlags to strip/keep Mod/Ref bits. llvm-svn: 4836
-
- Nov 17, 2002
-
-
Chris Lattner authored
llvm-svn: 4722
-
- Nov 12, 2002
-
-
Chris Lattner authored
llvm-svn: 4701
-
- Nov 11, 2002
-
-
Chris Lattner authored
the algorithm instead of hand coded depth first iteration llvm-svn: 4694
-
Chris Lattner authored
death when handling moderately sized SCC's, but what can you do llvm-svn: 4689
-
- Nov 10, 2002
-
-
Chris Lattner authored
* Significantly improve DEBUG output * Aggressively fold calls together if we inlined a graph that provides call nodes. * Add a bailout if the current graph has over 200 call nodes in it, this is a really whacky case that should never happen. llvm-svn: 4675
-
- Nov 09, 2002
-
-
Chris Lattner authored
This slows stuff down a bit, but it should get much better before it gets any worse. llvm-svn: 4666
-
Chris Lattner authored
llvm-svn: 4663
-
Chris Lattner authored
llvm-svn: 4660
-
Chris Lattner authored
llvm-svn: 4659
-
- Nov 08, 2002
-
-
Chris Lattner authored
llvm-svn: 4640
-
Chris Lattner authored
llvm-svn: 4632
-
- Nov 07, 2002
-
-
Chris Lattner authored
explanitory enum instead. llvm-svn: 4600
-
Chris Lattner authored
the BU class. This will be used by the IPModRef class to do stuff, eventually perhaps the TD pass will use it also. Speaking of the TD pass, this also eliminates the self recursive case, which was broken, and couldn't occur anyway. llvm-svn: 4599
-
Chris Lattner authored
llvm-svn: 4596
-
- Nov 06, 2002
-
-
Chris Lattner authored
llvm-svn: 4560
-
- Nov 04, 2002
-
-
Chris Lattner authored
llvm-svn: 4521
-
- Nov 03, 2002
-
-
Chris Lattner authored
llvm-svn: 4516
-
- Nov 02, 2002
-
-
Chris Lattner authored
llvm-svn: 4489
-
Chris Lattner authored
nodes in the graph are memory objects, which is very nice. This also greatly reduces the size and memory footprint for DSGraphs. For example, the local DSGraph for llu went from 65 to 13 nodes with this change. As a side bonus, dot seems to lay out the graphs slightly better too. :) llvm-svn: 4488
-
- Nov 01, 2002
-
-
Chris Lattner authored
llvm-svn: 4479
-
- Oct 22, 2002
-
-
Chris Lattner authored
llvm-svn: 4259
-
- Oct 21, 2002
-
-
Chris Lattner authored
llvm-svn: 4253
-