summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis/DataStructure/DataStructure.cpp
Commit message (Collapse)AuthorAgeFilesLines
* Implement optimization for direct function call case. This dramaticallyChris Lattner2003-02-051-11/+25
| | | | | | | reduces the number of function nodes created and speeds up analysis by about 10% overall. llvm-svn: 5495
* Add sanity checkChris Lattner2003-02-041-0/+1
| | | | llvm-svn: 5489
* * Fix a bug introduced in the last checkin wrt Stack markersChris Lattner2003-02-031-8/+6
| | | | | | * Make cloning more efficient in the process... llvm-svn: 5479
* Implement the globals graph!Chris Lattner2003-02-031-128/+163
| | | | llvm-svn: 5477
* Fix a bug where we would delete neccesary calls in bu passChris Lattner2003-02-011-1/+2
| | | | llvm-svn: 5465
* Fix a bug where we would incorrectly delete globals which had edges to alive ↵Chris Lattner2003-02-011-3/+0
| | | | | | | | | nodes in a graph in the t-d pass. This slows down the TD pass by quite a bit (1/3), but is needed for correctness. llvm-svn: 5464
* Delete nodes more efficientlyChris Lattner2003-02-011-6/+4
| | | | llvm-svn: 5463
* Remove dead nodes more efficientlyChris Lattner2003-02-011-1/+2
| | | | llvm-svn: 5462
* Improve efficiency of aliveness traversal codeChris Lattner2003-02-011-21/+19
| | | | llvm-svn: 5461
* Change DSGraph stuff to use hash_(set|map) instead of std::(set|map)Chris Lattner2003-02-011-29/+26
| | | | | | This change provides a small (3%) but consistent speedup llvm-svn: 5460
* Remove using declarationsChris Lattner2003-02-011-14/+12
| | | | llvm-svn: 5456
* Remove globals on the bottom up pass which do not contain any informationChris Lattner2003-01-311-3/+22
| | | | llvm-svn: 5451
* Use and implement API for graph traversalsChris Lattner2003-01-291-24/+25
| | | | llvm-svn: 5431
* * Eliminate boolean arguments in favor of using enumsChris Lattner2003-01-231-6/+7
| | | | | | * T-D pass now eliminates unreachable globals llvm-svn: 5419
* Fix analysis of the Burg programChris Lattner2003-01-221-1/+1
| | | | llvm-svn: 5401
* Fix several related bugs in DSNode::mergeWith() caused by theVikram S. Adve2002-12-061-90/+102
| | | | | | | | | fact that the incoming nodes may be merged away at intermediate steps. Use an extra level of indirection via DSNodeHandles to track the nodes being merged. All this now happens in a static helper function MergeNodes(). llvm-svn: 4947
* Cute bug fix: when moving links from N to this, some links could haveVikram S. Adve2002-12-051-14/+23
| | | | | | | been missed if node *this got merged away due to recursive merging! Also, links were not moved correctly if a node is collapsed. llvm-svn: 4933
* Fix logical error in TD pass: we should clear Mod/Ref bits of each callerVikram S. Adve2002-11-271-2/+7
| | | | | | | before inlining their graphs into a function. To support this, added flags to CloneFlags to strip/keep Mod/Ref bits. llvm-svn: 4836
* Keep global nodes in each DS Graph (by forcing them to be marked live).Vikram S. Adve2002-11-251-3/+3
| | | | llvm-svn: 4831
* Add peak memory usage measurement stuffChris Lattner2002-11-181-40/+64
| | | | | | Add structure padding optimizations llvm-svn: 4749
* Fix two bugs:Chris Lattner2002-11-121-27/+27
| | | | | | | | | | * The globals vector was getting broken and unsorted, this caused vortex to get badly pessimized * Node offset handling was being handled really poorly, and in particular we were not merging types with offsets right. This causes several graphs to be non-merged. llvm-svn: 4699
* Elimiante calls to a node with nothing in it.Chris Lattner2002-11-111-36/+45
| | | | llvm-svn: 4695
* Mark stuff reachable by _AUX_ calls as incomplete in the BU graphChris Lattner2002-11-111-9/+15
| | | | llvm-svn: 4690
* Use call site mergeWith method to simplify codeChris Lattner2002-11-111-5/+1
| | | | llvm-svn: 4687
* Fix a bug that could trigger when varargs call sites had non-matching number ↵Chris Lattner2002-11-101-2/+9
| | | | | | of arguments llvm-svn: 4683
* * Dramatically rework liveness evaluation.Chris Lattner2002-11-101-172/+167
| | | | | | | | | * Implement the first step of the Globals graph: Deleting nodes from function graphs. In practice, these nodes need to be moved to the globals graph, but this will be taken care of later. Note that the graphs computed right now are not strictly correct! llvm-svn: 4681
* eliminate the ability to remove global nodes from deadNodeElminate... for now.Chris Lattner2002-11-091-28/+4
| | | | | | | This slows stuff down a bit, but it should get much better before it gets any worse. llvm-svn: 4666
* Move maskNodeTypes to header fileChris Lattner2002-11-091-11/+0
| | | | llvm-svn: 4661
* Clean up DSGraph::removeDeadNodes interfaceChris Lattner2002-11-091-19/+14
| | | | llvm-svn: 4660
* Make removeTriviallyDeadNodes a private interface of DSGraphChris Lattner2002-11-091-2/+1
| | | | llvm-svn: 4659
* Add initial support for a globals graphChris Lattner2002-11-091-24/+2
| | | | llvm-svn: 4656
* Tighten up array handlingChris Lattner2002-11-091-1/+5
| | | | llvm-svn: 4655
* Fix warning & release buildChris Lattner2002-11-091-3/+1
| | | | llvm-svn: 4648
* Fold arrays down to a single element. This causes huge wins on some benchmarksChris Lattner2002-11-081-0/+10
| | | | | | | for example: 197.parser (64M->14M), 164.gzip (14M->2.7M). The actual graphs represented should not change at all. llvm-svn: 4643
* Allow specification of whether the call sites should be copied, AND whetherChris Lattner2002-11-081-2/+11
| | | | | | the aux call sites should be copied llvm-svn: 4639
* - Add a bunch of checking to make sure that dead nodes are not used after theyChris Lattner2002-11-081-12/+40
| | | | | | | | | are marked DEAD. This helped track down some bugs - Fix a bunch of bugs where we were doing work on nodes after they became dead - Add support for aux function call sites - Add support for not cloning call sites llvm-svn: 4633
* Use DSNodeHandleMap instead to be safeChris Lattner2002-11-081-11/+17
| | | | llvm-svn: 4622
* Add flushChris Lattner2002-11-081-27/+17
| | | | llvm-svn: 4619
* Instead of using a bool that constant has to be explained, use a selfChris Lattner2002-11-071-6/+5
| | | | | | explanitory enum instead. llvm-svn: 4600
* Implement a new mergeInGraph method, which basically factors code out ofChris Lattner2002-11-071-0/+52
| | | | | | | | | | | | 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
* Rename DataStructureAnalysis namespace to DSChris Lattner2002-11-071-6/+2
| | | | llvm-svn: 4596
* Minor bugfix to enable generation of methcall.llvm.lib, objinst.llvm.lib, andChris Lattner2002-11-071-2/+2
| | | | | | | The problem was merging two unsized types like function's, ie int (int*) with int (uint *) llvm-svn: 4594
* Move printouts to be wrapped in DEBUG() macrosChris Lattner2002-11-071-7/+7
| | | | llvm-svn: 4588
* Make PointerSize & Shift be enumsChris Lattner2002-11-061-6/+1
| | | | | | Fix problem with recursive merging llvm-svn: 4570
* Dramatically simplify internal DSNode representation, get implementationChris Lattner2002-11-061-268/+236
| | | | | | | *FULLY OPERATIONAL* and safe. We are now capable of completely analyzing at LEAST the Olden benchmarks + 181.mcf llvm-svn: 4562
* Attempted fixes to the mergemap to make it work better.Chris Lattner2002-11-051-15/+28
| | | | | | Ended up disabling merge map merging completely. It shall be removed. llvm-svn: 4550
* Change the "Cannot merge two portions of the same node yet" from an assertionChris Lattner2002-11-041-6/+13
| | | | | | into a "oh crap, lets collapse" case llvm-svn: 4530
* Rename ValueMap to ScalarMapChris Lattner2002-11-031-27/+27
| | | | llvm-svn: 4516
* Rename NewNode flag to HeapNodeChris Lattner2002-11-031-2/+3
| | | | llvm-svn: 4515
* Stop representing scalars as explicit nodes in the graph. Now the onlyChris Lattner2002-11-021-34/+30
| | | | | | | | | 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
OpenPOWER on IntegriCloud