summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis
Commit message (Collapse)AuthorAgeFilesLines
* ONLY merge in the aux call sites, this causes a HUGE speedupChris Lattner2002-11-081-1/+2
| | | | llvm-svn: 4640
* 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
* Reenable 'quick exit' caseChris Lattner2002-11-081-2/+1
| | | | llvm-svn: 4638
* Reduce amount of work needed to compute ip/modrefChris Lattner2002-11-081-1/+2
| | | | llvm-svn: 4637
* Reimplement TD pass completely it now worksChris Lattner2002-11-081-113/+119
| | | | llvm-svn: 4635
* Cannot modify original call sites vectorChris Lattner2002-11-081-1/+6
| | | | llvm-svn: 4634
* - 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
* Remove gunk used by broken TD passChris Lattner2002-11-081-12/+4
| | | | llvm-svn: 4632
* Fix IPModRef to use new DS interfaceChris Lattner2002-11-081-8/+1
| | | | llvm-svn: 4628
* Use DSNodeHandleMap instead to be safeChris Lattner2002-11-083-16/+22
| | | | llvm-svn: 4622
* * actually handle constants (especially constantexprs) correctly.Chris Lattner2002-11-081-11/+28
| | | | | | | - This seems to dramatically improve many benchmarks, only slowing down gzip significantly. llvm-svn: 4621
* Add flushChris Lattner2002-11-083-29/+20
| | | | llvm-svn: 4619
* Implement ResolveCallSiteModRefInfo for IPModRef. computeModRef is not yet ↵Chris Lattner2002-11-071-4/+56
| | | | | | done though! llvm-svn: 4602
* Instead of using a bool that constant has to be explained, use a selfChris Lattner2002-11-073-9/+8
| | | | | | explanitory enum instead. llvm-svn: 4600
* Implement a new mergeInGraph method, which basically factors code out ofChris Lattner2002-11-073-74/+86
| | | | | | | | | | | | 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-074-18/+6
| | | | llvm-svn: 4596
* Fix problem with dangling referrersChris Lattner2002-11-071-1/+4
| | | | llvm-svn: 4595
* 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
* Compute total number of nodes and # call nodesChris Lattner2002-11-071-0/+6
| | | | llvm-svn: 4592
* Move printouts to be wrapped in DEBUG() macrosChris Lattner2002-11-071-7/+7
| | | | llvm-svn: 4588
* When the -only-print-main-ds option is specified, still print out graph sizeChris Lattner2002-11-071-2/+9
| | | | | | statistics for skipped functions llvm-svn: 4587
* Allow the ResolveCallSiteModRefInfo method to return a mapping of nodes,Chris Lattner2002-11-061-6/+18
| | | | | | implement the mod/ref bit masking llvm-svn: 4578
* Add a stub to implement the context sensitive mod/ref info for call sitesChris Lattner2002-11-061-12/+23
| | | | llvm-svn: 4577
* Give a back pointer to the IPModRef object to the FunctionModRefInfo objectChris Lattner2002-11-061-4/+6
| | | | llvm-svn: 4576
* Remove a couple of #includes, move some code from .h fileChris Lattner2002-11-061-8/+32
| | | | llvm-svn: 4575
* Change Steens class to build with Vikram's changesChris Lattner2002-11-061-4/+4
| | | | llvm-svn: 4572
* Make PointerSize & Shift be enumsChris Lattner2002-11-061-6/+1
| | | | | | Fix problem with recursive merging llvm-svn: 4570
* Make query operations non-const to allow demand-driven analyses.Vikram S. Adve2002-11-061-5/+5
| | | | llvm-svn: 4569
* An interprocedural analysis pass that computes flow-insensitiveVikram S. Adve2002-11-061-0/+218
| | | | | | IP Mod and Ref information for every function and every call site. llvm-svn: 4567
* Dramatically simplify internal DSNode representation, get implementationChris Lattner2002-11-063-304/+270
| | | | | | | *FULLY OPERATIONAL* and safe. We are now capable of completely analyzing at LEAST the Olden benchmarks + 181.mcf llvm-svn: 4562
* Delete "StripScalars" argument to cloneInto methodChris Lattner2002-11-062-2/+0
| | | | llvm-svn: 4560
* 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
* Simple passes that print out SCCs in the CFGs or in the CallGraph of a module.Vikram S. Adve2002-11-041-0/+93
| | | | llvm-svn: 4532
* 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
* Give a better error message in an unhandled caseChris Lattner2002-11-041-1/+8
| | | | llvm-svn: 4521
* Allow the call graph to be called from analyze naturally with print implementedChris Lattner2002-11-041-6/+5
| | | | llvm-svn: 4517
* Rename ValueMap to ScalarMapChris Lattner2002-11-035-44/+45
| | | | llvm-svn: 4516
* Rename NewNode flag to HeapNodeChris Lattner2002-11-033-4/+5
| | | | llvm-svn: 4515
* Change the letters used to represent stack and heap allocations to "S" and "H"Chris Lattner2002-11-031-2/+2
| | | | | | respectively. This is to make presentation easier in the paper. llvm-svn: 4514
* Implement the "unknown flag" which mainly consists of aligning printing codeChris Lattner2002-11-022-11/+17
| | | | llvm-svn: 4490
* Oops, this was not meant to be checked inChris Lattner2002-11-021-2/+1
| | | | llvm-svn: 4489
* Stop representing scalars as explicit nodes in the graph. Now the onlyChris Lattner2002-11-024-170/+133
| | | | | | | | | 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
* Fix comments, steens is context sensitive, we just haven't implementedChris Lattner2002-11-011-3/+3
| | | | | | mod/ref apis yet llvm-svn: 4485
* Add a fixmeChris Lattner2002-10-311-0/+2
| | | | llvm-svn: 4479
* * Minor optimization: when merging nodes, merge the smaller one into theChris Lattner2002-10-311-3/+13
| | | | | | | larger one. * Handle the case where we are merging two nodes of different size better. llvm-svn: 4476
* Remove dead codeChris Lattner2002-10-311-31/+12
| | | | llvm-svn: 4467
* This fixes all kinds of problems with array handling. There are still bugs toChris Lattner2002-10-312-83/+244
| | | | | | | | | | | | | | | | be fixed, but we are getting much closer now. * Make DSNode::TypeRec a full fledged DSTypeRec type. * Add methods used to update and access the typerecords elements * Add methods to query if and to cause a node to be completely folded * DSGraph construction doesn't use the allocation type for anything at all, now nodes get their type information based on how they are used. * Fixed a bug with global value handling introduced in the last checkin * GEP support is now much better, arrays are handled correctly. The array flag is now updated in type records. There are still cases that are not handled yet (we do not detect pessimizations), but getting much closer. llvm-svn: 4465
* Use new isCommutative interface, which gives us SetEQ and SetNE for free.Chris Lattner2002-10-311-7/+3
| | | | | | Thanks fly out to Casey Carter for this fix. llvm-svn: 4460
* Fix spelling of `propagate'.Misha Brukman2002-10-293-5/+5
| | | | llvm-svn: 4423
* Eliminate uses of MachineBasicBlock::getChris Lattner2002-10-283-33/+43
| | | | llvm-svn: 4340
OpenPOWER on IntegriCloud