summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Analysis
Commit message (Collapse)AuthorAgeFilesLines
...
* Do not include the Function* for direct call/invoke instructions in theChris Lattner2005-03-171-1/+6
| | | | | | alias evaluation. Clients really don't care. llvm-svn: 20664
* simplify this function a bit, allow DS-AA to build on/improve the mod/refChris Lattner2005-03-171-8/+11
| | | | | | results returned by AA, not just use one or the other. llvm-svn: 20662
* Clean up some code, handle null pointer specially to avoid an assertionChris Lattner2005-03-171-6/+10
| | | | llvm-svn: 20660
* Two changes:Chris Lattner2005-03-171-3/+3
| | | | | | | | | 1. Chain to the parent implementation of M/R analysis if we can't find any information. It has some heuristics that often do well. 2. Do not clear all flags, this can make invalid nodes by turning nodes that used to be collapsed into non-collapsed nodes (fixing crashes) llvm-svn: 20659
* Fix the missing symbols problem Bill was hitting. Patch contributed byChris Lattner2005-03-173-0/+3
| | | | | | Bill Wendling!! llvm-svn: 20649
* Do not create ridiculously huge DSNodes, as described in the comments.Chris Lattner2005-03-171-1/+21
| | | | | | This speeds up the BU pass on 172.mgrid from 62.3 -> 0.1242s. llvm-svn: 20648
* remove use of compat_iterator.Chris Lattner2005-03-163-14/+15
| | | | llvm-svn: 20643
* make sure to mark nodes in the globals graph incomplete after computing itChris Lattner2005-03-151-0/+1
| | | | | | so that external globals (and whatever they point to) are marked incomplete. llvm-svn: 20628
* fix crashes when we only have a prototype for main.Chris Lattner2005-03-153-3/+3
| | | | llvm-svn: 20627
* Fix a crash that happens when mapping something like this:Chris Lattner2005-03-151-6/+12
| | | | | | | | | | | | | { short, short } to short where the second short maps onto the second field of the first struct. In this case, the struct index is not aligned, so we should avoid calling getLink(2), which asserts out. llvm-svn: 20626
* Make computeGGToGMapping compute an invnodemapChris Lattner2005-03-151-9/+11
| | | | llvm-svn: 20622
* Finally fix (the right way) the problem where functions like this:Chris Lattner2005-03-151-0/+24
| | | | | | | | | | | void foo() { G = 1; } would have an empty DSGraph even though G (a global) is directly used in the function. llvm-svn: 20619
* Start using retnodes_* for iteration.Chris Lattner2005-03-156-39/+34
| | | | llvm-svn: 20618
* avoid varialbe name collisionsChris Lattner2005-03-151-2/+3
| | | | llvm-svn: 20606
* This mega patch converts us from using Function::a{iterator|begin|end} toChris Lattner2005-03-159-20/+20
| | | | | | | | using Function::arg_{iterator|begin|end}. Likewise Module::g* -> Module::global_*. This patch is contributed by Gabor Greif, thanks! llvm-svn: 20597
* Don't crash if computing a mapping to a node with zero sizeChris Lattner2005-03-151-0/+2
| | | | llvm-svn: 20595
* rename method, add counterpartChris Lattner2005-03-152-4/+16
| | | | llvm-svn: 20593
* add a method to compute a commonly used mapping.Chris Lattner2005-03-142-5/+16
| | | | llvm-svn: 20588
* regardless of whether or not the client things we should mark globals ↵Chris Lattner2005-03-131-7/+7
| | | | | | | | incomplete, ALWAYS mark them incomplete if they are external! llvm-svn: 20586
* Make sure to remove incomplete markers before we add to them! :)Chris Lattner2005-03-133-0/+3
| | | | llvm-svn: 20585
* The incoming arguments to main (the argv list) are not complete!Chris Lattner2005-03-131-4/+3
| | | | llvm-svn: 20584
* After finishing BU analysis, move all global variables from the globalsChris Lattner2005-03-133-6/+71
| | | | | | graph into main and mark them complete. llvm-svn: 20583
* ADd support for printing eqgraphs.Chris Lattner2005-03-132-2/+8
| | | | llvm-svn: 20582
* Replace linear search with logrithmic one.Chris Lattner2005-03-131-4/+1
| | | | llvm-svn: 20580
* make sure to mark nodes returned from functions as incompleteChris Lattner2005-03-121-0/+1
| | | | llvm-svn: 20576
* remove this from the PA namespace, leaving it in the llvm nsChris Lattner2005-03-121-8/+7
| | | | llvm-svn: 20574
* Move this from the pool allocator project to here, where it logically belongs.Chris Lattner2005-03-121-0/+442
| | | | llvm-svn: 20570
* Fix Regression/Analysis/BasicAA/2005-03-09-BrokenBasicAA.ll, a miscompilationChris Lattner2005-03-091-2/+6
| | | | | | that Alkis found with Java, thanks Alkis! llvm-svn: 20531
* Export two methods for getting -X and A-B.Chris Lattner2005-03-091-10/+11
| | | | llvm-svn: 20527
* Make sure the two arguments of a setcc instruction point to the same node.Chris Lattner2005-03-051-1/+8
| | | | llvm-svn: 20462
* Trivial cleanup patchChris Lattner2005-03-041-2/+2
| | | | llvm-svn: 20436
* Fix spelling, patch contributed by Gabor GreifChris Lattner2005-02-271-1/+1
| | | | llvm-svn: 20342
* DCE a dead functionChris Lattner2005-02-261-19/+0
| | | | llvm-svn: 20339
* 1 + 100 + 51 == 152, not 52.Chris Lattner2005-02-261-0/+2
| | | | | | | | If we fold three constants together (c1+c2+c3), make sure to keep LHSC updated, instead of reusing (in this case), the 1 instead of the partial sum. llvm-svn: 20337
* Handle null a bit more carefully.Chris Lattner2005-02-251-1/+11
| | | | | | | | Actually teach dsa about select instructions. This doesn't affect the graph in any way other than not setting a spurious U marker on pointer nodes that are selected. llvm-svn: 20324
* This instruction:Chris Lattner2005-02-241-1/+2
| | | | | | | | | X = gep null, ... Used to not create a scalar map entry for X, which caused clients to barf. This is bad. llvm-svn: 20316
* Fix a bug introduced by revision 1.187 of this file.Chris Lattner2005-02-241-1/+2
| | | | llvm-svn: 20308
* Remove use of bind_obj, deleter, and finegrainify namespacification.Chris Lattner2005-02-221-18/+15
| | | | llvm-svn: 20277
* Scary typo that fixes ↵Chris Lattner2005-02-171-1/+1
| | | | | | | | Regression/Transforms/IndVarsSimplify/2005-02-17-TruncateExprCrash.ll and PR515. llvm-svn: 20224
* Add a sanity check.Chris Lattner2005-02-151-0/+1
| | | | llvm-svn: 20195
* Add a new method to make it easy to update graphs.Chris Lattner2005-02-151-1/+23
| | | | llvm-svn: 20194
* Correct the recursive PHI node handling routines in a way that CANNOT induceChris Lattner2005-02-131-27/+83
| | | | | | | | | | | | | | | infinite loops (using the new replaceSymbolicValuesWithConcrete method). This patch reverts this patch: http://mail.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20050131/023830.html ... which was an attempted fix for this problem. Unfortunately, that patch caused test/Regression/Transforms/IndVarsSimplify/exit_value_tests.llx to fail and slightly castrated the entire analysis. This patch fixes it right. This patch is dedicated to jeffc, for making me deal with this. :) llvm-svn: 20146
* Use new edge iterators to simplify some code.Chris Lattner2005-02-091-7/+7
| | | | llvm-svn: 20086
* IndCallGraphMap is now a pointer to a new'd map.Chris Lattner2005-02-071-3/+6
| | | | llvm-svn: 20065
* If we have an indirect call site that calls N functions, inline the N functionsChris Lattner2005-02-041-57/+98
| | | | | | | | | | | | into a temporary graph, remember it for later, then inline the tmp graph into the call site. In the case where there are other call sites to the same set of functions, this permits us to just inline the temporary graph instead of all of the callees. This turns N*M inlining situations into an N+M inlining situation. llvm-svn: 20036
* Split mergeInGraph into two methods.Chris Lattner2005-02-041-29/+28
| | | | llvm-svn: 20035
* Fix the Regression/Transforms/DSAnalysis/recursion.ll regression.Chris Lattner2005-02-041-4/+3
| | | | llvm-svn: 20031
* Refactor getFunctionArgumentsForCall out of mergeInGraph.Chris Lattner2005-02-031-29/+41
| | | | llvm-svn: 20018
* Eliminate some duplicated debug codeChris Lattner2005-02-011-21/+0
| | | | llvm-svn: 19980
* Eliminate self-recursion as a special case.Chris Lattner2005-02-011-58/+39
| | | | llvm-svn: 19979
OpenPOWER on IntegriCloud