summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis
Commit message (Collapse)AuthorAgeFilesLines
* Add functions to the ban listChris Lattner2003-01-311-1/+2
| | | | llvm-svn: 5450
* Use and implement API for graph traversalsChris Lattner2003-01-291-24/+25
| | | | llvm-svn: 5431
* free instructions mark their operands as being heap nodes.Chris Lattner2003-01-281-1/+2
| | | | llvm-svn: 5425
* * Eliminate boolean arguments in favor of using enumsChris Lattner2003-01-231-2/+2
| | | | llvm-svn: 5420
* * Eliminate boolean arguments in favor of using enumsChris Lattner2003-01-235-18/+20
| | | | | | * T-D pass now eliminates unreachable globals llvm-svn: 5419
* Slight efficiency improvementChris Lattner2003-01-231-4/+1
| | | | llvm-svn: 5418
* Fix analysis of the Burg programChris Lattner2003-01-221-1/+1
| | | | llvm-svn: 5401
* Rename llvm/Analysis/LiveVar/FunctionLiveVarInfo.h -> ↵Chris Lattner2003-01-142-3/+3
| | | | | | llvm/CodeGen/FunctionLiveVarInfo.h llvm-svn: 5284
* Move llvm/Analysis/LiveVar/ValueSet.h to CodeGen/ValueSet.hChris Lattner2003-01-142-3/+3
| | | | llvm-svn: 5282
* Move annotations to support libraryChris Lattner2003-01-141-1/+1
| | | | llvm-svn: 5270
* 'graph' is spelled without a 'c'.Misha Brukman2002-12-121-3/+12
| | | | | | Also added Statistic counters for NoAlias and MayAlias. llvm-svn: 4972
* Remove #includesChris Lattner2002-12-121-2/+0
| | | | llvm-svn: 4968
* Iterator that enumerates the ProgramDependenceGraph (PDG) for a function,Vikram S. Adve2002-12-081-0/+250
| | | | | | i.e., enumerates all data and control dependences for the function. llvm-svn: 4958
* An explicit representation of dependence graphs, and a pass thatVikram S. Adve2002-12-082-0/+571
| | | | | | | computes a dependence graph for data dependences on memory locations using interprocedural Mod/Ref information. llvm-svn: 4957
* Add total instruction, bb, & function countsChris Lattner2002-12-071-2/+9
| | | | llvm-svn: 4954
* Two bug fixes:Vikram S. Adve2002-12-061-13/+22
| | | | | | | | (1) Make entries for Constant values in the ScalarMap. (2) Set MOD bit for the node pointed to by the argument of a free instruction. llvm-svn: 4948
* 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
* Simplify codeChris Lattner2002-12-031-118/+13
| | | | llvm-svn: 4886
* Fix logical error in TD pass: we should clear Mod/Ref bits of each callerVikram S. Adve2002-11-273-8/+17
| | | | | | | before inlining their graphs into a function. To support this, added flags to CloneFlags to strip/keep Mod/Ref bits. llvm-svn: 4836
* (1) Bug fix that was causing nodes with dangling references to be freed.Vikram S. Adve2002-11-271-77/+201
| | | | | | | | | | We run removeDeadNodes() on the TD graph up front before using it. (2) Major enhancement to printing of results: now we list the actual objects that are mod/ref instead of just printing the bit vectors. Also an important bug fix in TDDataStructures pass (no change here): clear Mod/Ref bits of callers before inlining into a function. llvm-svn: 4833
* 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
* Add peak memory usage supportChris Lattner2002-11-181-1/+4
| | | | llvm-svn: 4748
* Add statsChris Lattner2002-11-181-4/+15
| | | | llvm-svn: 4747
* Add hack to only consider indirect calls indirect if they do more than castChris Lattner2002-11-171-6/+14
| | | | | | their source function llvm-svn: 4723
* Add MaxSCC statisticsChris Lattner2002-11-171-6/+25
| | | | llvm-svn: 4722
* Count CallInsts correctly, remove unneccesary initializersChris Lattner2002-11-171-37/+3
| | | | | | S: ---------------------------------------------------------------------- llvm-svn: 4721
* Gives the count for various instructions.Dinakar Dhurjati2002-11-131-0/+189
| | | | llvm-svn: 4706
* Pass to compute various statisics related to DSGraphs.Vikram S. Adve2002-11-131-0/+86
| | | | | | | | For now, this just computes the #indirect call sites and the avg. #callees per indirect call site (actually it prints both totals and the average is their ratio). llvm-svn: 4705
* Inline graphs from outside the SCC into the SCC before SCC resolution startsChris Lattner2002-11-121-4/+104
| | | | llvm-svn: 4701
* 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
* Fix bugChris Lattner2002-11-111-3/+2
| | | | llvm-svn: 4697
* Handle a mismatch between # function args and call site argsChris Lattner2002-11-111-1/+2
| | | | llvm-svn: 4696
* Elimiante calls to a node with nothing in it.Chris Lattner2002-11-111-36/+45
| | | | llvm-svn: 4695
* Complete rewrite of BU code to use Tarjan's SCC finding algorithm to driveChris Lattner2002-11-111-265/+351
| | | | | | the algorithm instead of hand coded depth first iteration llvm-svn: 4694
* Mark stuff reachable by _AUX_ calls as incomplete in the BU graphChris Lattner2002-11-111-9/+15
| | | | llvm-svn: 4690
* Fix infinite loop in the BU algorithm. Unfortunately this dies a seriousChris Lattner2002-11-111-30/+177
| | | | | | death when handling moderately sized SCC's, but what can you do llvm-svn: 4689
* Print the right call set sizeChris Lattner2002-11-111-1/+3
| | | | llvm-svn: 4688
* 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
* Honor the shouldPrintAuxCalls flagChris Lattner2002-11-101-4/+9
| | | | llvm-svn: 4678
* Initialize PrintAuxCalls memberChris Lattner2002-11-101-0/+1
| | | | llvm-svn: 4677
* * Bottom-Up graphs print the Aux call vectorChris Lattner2002-11-101-16/+42
| | | | | | | | | | * 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
* eliminate the ability to remove global nodes from deadNodeElminate... for now.Chris Lattner2002-11-095-32/+8
| | | | | | | This slows stuff down a bit, but it should get much better before it gets any worse. llvm-svn: 4666
* Remove obsolete codeChris Lattner2002-11-091-14/+0
| | | | llvm-svn: 4665
* Fix logicChris Lattner2002-11-091-1/+1
| | | | llvm-svn: 4664
* Add globals graphs to all three passesChris Lattner2002-11-094-34/+54
| | | | llvm-svn: 4663
* Move maskNodeTypes to header fileChris Lattner2002-11-091-11/+0
| | | | llvm-svn: 4661
OpenPOWER on IntegriCloud