summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis
Commit message (Collapse)AuthorAgeFilesLines
* Avoid referencing deleted DSgraphs when merging an SCC into a larger SCC. ThisChris Lattner2004-01-311-9/+11
| | | | | | fixes the crash in 176.gcc. llvm-svn: 11033
* Fix thinkoChris Lattner2004-01-301-3/+3
| | | | llvm-svn: 11027
* Forward method request to chained aa implementationChris Lattner2004-01-302-0/+8
| | | | llvm-svn: 11024
* Implement the pointsToConstantMemory() method.Chris Lattner2004-01-301-3/+14
| | | | llvm-svn: 11022
* Improve mod/ref information based on the pointsToConstantMemory method.Chris Lattner2004-01-301-2/+9
| | | | llvm-svn: 11021
* Order #includes alphabetically, per style guide.Misha Brukman2004-01-301-2/+2
| | | | llvm-svn: 11015
* Fix a bug aflicting 265.gapChris Lattner2004-01-291-4/+18
| | | | llvm-svn: 11006
* Minor bugfixesChris Lattner2004-01-291-8/+12
| | | | llvm-svn: 11005
* Rename DSGraph::ScalarMapTy -> DSScalarMapChris Lattner2004-01-282-9/+9
| | | | llvm-svn: 11001
* Fix a bugChris Lattner2004-01-281-1/+1
| | | | llvm-svn: 11000
* Eliminate the call to removeTriviallyDeadNodes from updateFromGlobals graph,Chris Lattner2004-01-281-4/+1
| | | | | | | moving it to the start of removeDeadNodes. This speeds up DSA by 2s on perlbmk from 41s llvm-svn: 10999
* In the TD pass, iterate over globals directly instead of through the whole ↵Chris Lattner2004-01-281-9/+8
| | | | | | | | scalar map. This saves 5s in the TD pass, from 22->17s on perlbmk llvm-svn: 10998
* In the TD pass, don't iterate over the scalar map to find the globals, ↵Chris Lattner2004-01-281-3/+2
| | | | | | | | | iterate over the globals directly. This doesn't save any substantial time, however, because the globals graph only contains globals! llvm-svn: 10997
* In updateFromGlobalsGraph, instead of iterating over all of the scalars in theChris Lattner2004-01-281-8/+7
| | | | | | | | 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
* Minor tweaks, eliminate useless integer pruning optimziation, turn onChris Lattner2004-01-281-4/+6
| | | | | | timers by default llvm-svn: 10993
* Further reduce the number of nodes cloned with getClonedNH, using merge instead.Chris Lattner2004-01-281-1/+1
| | | | | | | | 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
* Add a timer, fix a minor bug.Chris Lattner2004-01-281-4/+12
| | | | | | 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
* Another bugfix, disable "spurious" output.Chris Lattner2004-01-281-1/+4
| | | | | | You gotta love spurious llvm-svn: 10990
* fix bug in previous checkinChris Lattner2004-01-271-1/+0
| | | | llvm-svn: 10989
* * Add a new commandline argument to control the "global roots hack". DefaultChris Lattner2004-01-271-454/+407
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | it to be off. If it looks like it's completely unnecessary after testing, I will remove it completely (which is the hope). * Callers of the DSNode "copy ctor" can not choose to not copy links. * Make node collapsing not create a garbage node in some cases, avoiding a memory allocation, and a subsequent DNE. * When merging types, allow two functions of different types to be merged without collapsing. * Use DSNodeHandle::isNull more often instead of DSNodeHandle::getNode() == 0, as it is much more efficient. *** Implement the new, more efficient reachability cloner class In addition to only cloning nodes that are reachable from interesting roots, this also fixes the huge inefficiency we had where we cloned lots of nodes, only to merge them away immediately after they were cloned. Now we only actually allocate a node if there isn't one to merge it into. * Eliminate the now-obsolete cloneReachable* and clonePartiallyInto methods * Rewrite updateFromGlobalsGraph to use the reachability cloner * Rewrite mergeInGraph to use the reachability cloner * Disable the scalar map scanning code in removeTriviallyDeadNodes. In large SCC's, this is extremely expensive. We need a better data structure for the scalar map, because we really want to scan the unique node handles, not ALL of the scalars. * Remove the incorrect SANER_CODE_FOR_CHECKING_IF_ALL_REFERRERS_ARE_FROM_SCALARMAP code. * Move the code for eliminating integer nodes from the trivially dead eliminator to the dead node eliminator. * removeDeadNodes no longer uses removeTriviallyDeadNodes, as it contains a superset of the node removal power. * Only futz around with the globals graph in removeDeadNodes if it is modified llvm-svn: 10987
* Rewrite to use the reachability cloner interface. Also, make this much moreChris Lattner2004-01-271-58/+39
| | | | | | | | efficient in the case where a function calls into the same graph multiple times (ie, it either contains multiple calls to the same function, or multiple calls to functions in the same SCC graph) llvm-svn: 10986
* minor cleanupsChris Lattner2004-01-272-7/+5
| | | | llvm-svn: 10985
* Get clone flags right, so we don't build InlinedGlobals only to clear themChris Lattner2004-01-272-8/+5
| | | | llvm-svn: 10984
* Initial support for implementing clonePartiallyInto in terms of ↵Chris Lattner2004-01-234-60/+128
| | | | | | cloneReachableSubgraph, though this support is currently disabled. llvm-svn: 10970
* Eliminated the CompletedNodes argument to the cloneReachable* methods. ThisChris Lattner2004-01-222-43/+21
| | | | | | | | map was only used to implement a marginal GlobalsGraph optimization, and it actually slows the analysis down (due to the overhead of keeping it), so just eliminate it entirely. llvm-svn: 10955
* Ok, I'm tired of pulling out all my timers to check stuff in, just do it.Chris Lattner2004-01-221-0/+18
| | | | llvm-svn: 10954
* Bug fix: X.mergeWith(Y) was not updating Y if Y was a null node handle!Chris Lattner2004-01-221-2/+9
| | | | llvm-svn: 10953
* Start implementing DSGraph::clonePartiallyInto and implement mergeInGraphChris Lattner2004-01-221-66/+176
| | | | | | | | | | | in terms of it. Though clonePartiallyInto is not cloning partial graphs yet, this change dramatically speeds up inlining of graphs with many scalars. For example, this change speeds up the BU pass on 253.perlbmk from 69s to 36s, because it avoids iteration over the scalar map, which can get pretty large. llvm-svn: 10951
* Allow disabling of ALL printing overhead when performing timingsChris Lattner2004-01-221-0/+5
| | | | llvm-svn: 10948
* Remove use of ConstantHandling itfChris Lattner2004-01-121-9/+11
| | | | llvm-svn: 10781
* Eliminate use of ConstantHandling itfChris Lattner2004-01-121-12/+13
| | | | llvm-svn: 10780
* Live var is now in lib/Target/SparcChris Lattner2004-01-091-1/+2
| | | | llvm-svn: 10735
* Move sparc-specific code into lib/Target/SparcChris Lattner2004-01-095-688/+0
| | | | llvm-svn: 10734
* Improve encapsulation in the Loop and LoopInfo classes by eliminating theChris Lattner2004-01-081-2/+2
| | | | | | | getSubLoops/getTopLevelLoops methods, replacing them with iterator-based accessors. llvm-svn: 10714
* Add a noteChris Lattner2003-12-281-0/+5
| | | | llvm-svn: 10617
* rename ClassifyExpression -> ClassifyExprChris Lattner2003-12-232-16/+16
| | | | llvm-svn: 10592
* Finegrainify namespacificationChris Lattner2003-12-231-42/+42
| | | | llvm-svn: 10588
* finegrainify namespacificationChris Lattner2003-12-221-8/+23
| | | | | | Implement indvar analysis of getelementptr and sub expressions llvm-svn: 10582
* Add a new AliassetTracker::remove method. Because we need to be able to removeChris Lattner2003-12-181-8/+36
| | | | | | | | a pointer from an AliasSet, maintain the pointer values on a doubly linked list instead of a singly linked list, to permit efficient removal from the middle of the list. llvm-svn: 10506
* Change interface of MachineOperand as follows:Alkis Evlogimenos2003-12-142-11/+8
| | | | | | | | | | | | | | | a) remove opIsUse(), opIsDefOnly(), opIsDefAndUse() b) add isUse(), isDef() c) rename opHiBits32() to isHiBits32(), opLoBits32() to isLoBits32(), opHiBits64() to isHiBits64(), opLoBits64() to isLoBits64(). This results to much more readable code, for example compare "op.opIsDef() || op.opIsDefAndUse()" to "op.isDef()" a pattern used very often in the code. llvm-svn: 10461
* Finegrainify namespacificationChris Lattner2003-12-141-9/+12
| | | | | | | Add capability to represent volatile AliasSet's Propagate this information from loads&stores into the aliassets llvm-svn: 10457
* Factor out some duplicated code, implement the rest of the cases inChris Lattner2003-12-111-43/+40
| | | | | | BasicAA/2003-12-11-ConstExprGEP.ll llvm-svn: 10412
* Fix PR86. This makes basicaa _SIGNIFICANLY_ more aggressive with ↵Chris Lattner2003-12-111-121/+251
| | | | | | getelementptr's llvm-svn: 10410
* Finegrainify namespacificationChris Lattner2003-12-111-5/+23
| | | | | | Add new -print-cfg-only pass llvm-svn: 10407
* Fix a glaring bugChris Lattner2003-12-111-0/+1
| | | | llvm-svn: 10400
* Realize the gep P, <zeros> must aliases P.Chris Lattner2003-12-111-1/+11
| | | | | | This is a partial fix for PR 86 llvm-svn: 10399
* With Brian's change to AA.h we can now clean out this uglynessChris Lattner2003-12-111-1/+1
| | | | llvm-svn: 10398
* IncludeFile hack to pull in BasicValueNumbering whenever ValueNumbering.hBrian Gaeke2003-12-111-0/+2
| | | | | | is included. llvm-svn: 10397
* Finegrainify namespacificationChris Lattner2003-12-101-4/+1
| | | | llvm-svn: 10367
* Finegrainify namespacificationChris Lattner2003-12-101-10/+8
| | | | | | Provide a context module to WriteAsOperand llvm-svn: 10366
OpenPOWER on IntegriCloud