Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | * Add data structures and code to track the call sites for each function | Chris Lattner | 2002-10-17 | 1 | -2/+8 | |
| | | | | llvm-svn: 4213 | |||||
* | Cleanup data structure graph printer, eliminate hard coded printing in | Chris Lattner | 2002-10-17 | 1 | -120/+18 | |
| | | | | | | favor of generic printer. llvm-svn: 4209 | |||||
* | Make sure to print out the call nodes as well | Chris Lattner | 2002-10-16 | 1 | -1/+14 | |
| | | | | llvm-svn: 4203 | |||||
* | * Print the "return" node in the graphs | Chris Lattner | 2002-10-16 | 1 | -1/+18 | |
| | | | | llvm-svn: 4199 | |||||
* | The second element of the iterator is really an offset, not a link | Chris Lattner | 2002-10-16 | 1 | -1/+1 | |
| | | | | llvm-svn: 4196 | |||||
* | Specify the graph name | Chris Lattner | 2002-10-16 | 1 | -1/+1 | |
| | | | | llvm-svn: 4195 | |||||
* | - DSGraph Printing Improvements: | Chris Lattner | 2002-10-16 | 1 | -7/+7 | |
| | | | | | | | * Print edge source labels again * Override node shape to be Mrecord again, instead of just record. llvm-svn: 4193 | |||||
* | Halfway conversion from custom printing to GraphWriter printing | Chris Lattner | 2002-10-13 | 1 | -0/+33 | |
| | | | | llvm-svn: 4146 | |||||
* | Prune function nodes that are no longer referenced due to inlining | Chris Lattner | 2002-10-03 | 2 | -2/+3 | |
| | | | | llvm-svn: 4036 | |||||
* | sgefa uses truely huge data structures nodes. Only print part of them if they | Chris Lattner | 2002-10-03 | 1 | -2/+7 | |
| | | | | | | are so big llvm-svn: 4035 | |||||
* | Handle bug exposed by power benchmark | Chris Lattner | 2002-10-03 | 1 | -1/+1 | |
| | | | | llvm-svn: 4033 | |||||
* | Reimplement/port the Bottom Up Closure pass | Chris Lattner | 2002-10-03 | 2 | -38/+61 | |
| | | | | llvm-svn: 4031 | |||||
* | DataStructure.h doesn't include DSGraph.h | Chris Lattner | 2002-10-02 | 3 | -0/+3 | |
| | | | | llvm-svn: 4029 | |||||
* | * Implement fully general merging of array subscripts on demand! This | Chris Lattner | 2002-10-02 | 1 | -3/+27 | |
| | | | | | | does not handle the initial pointer index case yet though. llvm-svn: 4012 | |||||
* | When printing DS nodes, print the mergemap index as well to allow easier | Chris Lattner | 2002-10-02 | 1 | -1/+1 | |
| | | | | | | debugging of merging process. llvm-svn: 4010 | |||||
* | * Significant rework of DSNode to support arbitrary aliasing due to merging | Chris Lattner | 2002-10-02 | 1 | -20/+146 | |
| | | | | | | | | * Now all and any bytes of a DSNode can be merged together individually. This is neccesary to support the full generality of C and support aliasing correctly. llvm-svn: 4008 | |||||
* | Initial checkin of Steensgaards context insensitive flow insensitive | Chris Lattner | 2002-10-01 | 1 | -0/+224 | |
| | | | | | | alias analysis llvm-svn: 3997 | |||||
* | Checkin some major reworks of data structure analysis. This is not done, | Chris Lattner | 2002-10-01 | 5 | -353/+522 | |
| | | | | | | | nor does it work very well, but I need to get it checked in before I break the tree unintentionally. llvm-svn: 3996 | |||||
* | Eliminated the MemAccessInst class, folding contents into GEP class. | Chris Lattner | 2002-08-22 | 1 | -9/+8 | |
| | | | | llvm-svn: 3488 | |||||
* | Load & StoreInst no longer derive from MemAccessInst, so we don't have | Chris Lattner | 2002-08-22 | 1 | -3/+3 | |
| | | | | | | to handle indexing anymore llvm-svn: 3485 | |||||
* | - Do not expose ::ID from any of the analyses anymore. | Chris Lattner | 2002-08-21 | 3 | -3/+0 | |
| | | | | llvm-svn: 3416 | |||||
* | Minor changes to DEBUG()'s | Chris Lattner | 2002-08-07 | 2 | -3/+6 | |
| | | | | llvm-svn: 3261 | |||||
* | Reorder #includes to be right | Chris Lattner | 2002-08-07 | 1 | -1/+1 | |
| | | | | llvm-svn: 3260 | |||||
* | Changes to be GCC3.1 friendly | Chris Lattner | 2002-07-31 | 3 | -12/+13 | |
| | | | | llvm-svn: 3186 | |||||
* | Add new -only-print-main-ds option that causes mains ds graph to be | Chris Lattner | 2002-07-31 | 1 | -1/+4 | |
| | | | | | | printed, but no others. llvm-svn: 3178 | |||||
* | Add GlobalDSGraph -- a common graph that holds externally visible nodes. | Vikram S. Adve | 2002-07-30 | 1 | -4/+8 | |
| | | | | llvm-svn: 3173 | |||||
* | Print globals graph after either the BU or the TD pass. | Vikram S. Adve | 2002-07-30 | 1 | -17/+41 | |
| | | | | llvm-svn: 3172 | |||||
* | This file implements the top-down propagation pass for data structure graphs. | Vikram S. Adve | 2002-07-30 | 1 | -0/+224 | |
| | | | | | | | | | | Also, we now use a separate globals graph to hold externally visible nodes. This changes both the bottom-up and top-down propagation so that globals and other external objects do not have to appear in every function, but only in functions in which they are referenced or they can be used to access something else that is referenced. llvm-svn: 3171 | |||||
* | Use a separate globals graph to hold externally visible nodes. | Vikram S. Adve | 2002-07-30 | 2 | -107/+484 | |
| | | | | | | | | | This changes both the bottom-up and top-down propagation so that globals and other external objects do not have to appear in every function, but only in functions in which they are referenced or they can be used to access something else that is referenced. llvm-svn: 3170 | |||||
* | * Standardize how analysis results/passes as printed with the print() virtual | Chris Lattner | 2002-07-27 | 4 | -11/+16 | |
| | | | | | | | | | | methods * Eliminate AnalysisID: Now it is just a typedef for const PassInfo* * Simplify how AnalysisID's are initialized * Eliminate Analysis/Writer.cpp/.h: incorporate printing functionality into the analyses themselves. llvm-svn: 3115 | |||||
* | * Add support for different "PassType's" | Chris Lattner | 2002-07-26 | 2 | -0/+4 | |
| | | | | | | | | | | | | | | | * Add new RegisterOpt/RegisterAnalysis templates for registering passes that are to show up in opt or analyze * Register Analyses now * Change optimizations to use RegisterOpt instead of RegisterPass * Add support for different "PassType's" * Add new RegisterOpt/RegisterAnalysis templates for registering passes that are to show up in opt or analyze * Register Analyses now * Change optimizations to use RegisterOpt instead of RegisterPass * Remove getPassName implementations from various subclasses llvm-svn: 3112 | |||||
* | Changes for GCC 3.1 | Chris Lattner | 2002-07-24 | 1 | -3/+3 | |
| | | | | llvm-svn: 3068 | |||||
* | *** empty log message *** | Chris Lattner | 2002-07-23 | 1 | -2/+1 | |
| | | | | llvm-svn: 3002 | |||||
* | Always create a shadow node for a store instruction, even if it's storing | Chris Lattner | 2002-07-22 | 1 | -3/+3 | |
| | | | | | | a scalar value. Likewise for load instructions. llvm-svn: 2990 | |||||
* | Ignore some common varargs functions. | Chris Lattner | 2002-07-19 | 1 | -0/+6 | |
| | | | | llvm-svn: 2973 | |||||
* | * Inline CopyFunctionCallsList | Chris Lattner | 2002-07-18 | 1 | -35/+88 | |
| | | | | | | | | * Don't clone OrigCallList * Rename removeDeadNodes -> removeTriviallyDeadNodes * Implement new removeDeadNodes method llvm-svn: 2970 | |||||
* | Rename removeDeadNodes to removeTriviallyDeadNodes | Chris Lattner | 2002-07-18 | 1 | -1/+3 | |
| | | | | llvm-svn: 2969 | |||||
* | Add support for a top-down propagation pass: | Vikram S. Adve | 2002-07-18 | 1 | -6/+13 | |
| | | | | | | | -- Save a copy of the original call nodes in DSGraph before inlining bottom-up. -- Also, save a list of the callers of each function in DSGraph. llvm-svn: 2966 | |||||
* | Add support for a top-down propagation pass. | Vikram S. Adve | 2002-07-18 | 1 | -17/+39 | |
| | | | | | | | | | Each DSGraph now keeps a list of pending callers that have not been inlined into the function represented by that graph. It also keeps a copy of the original call nodes before the BU pass eliminates some of them. llvm-svn: 2965 | |||||
* | Implement cast nodes correctly. | Chris Lattner | 2002-07-18 | 2 | -14/+19 | |
| | | | | llvm-svn: 2964 | |||||
* | The graph is more accurate when I don't completely ignore the return value. | Chris Lattner | 2002-07-18 | 1 | -0/+3 | |
| | | | | llvm-svn: 2952 | |||||
* | Lots of bug fixes, add BottomUpClosure, which has bugs, but is a start. | Chris Lattner | 2002-07-18 | 4 | -71/+482 | |
| | | | | llvm-svn: 2945 | |||||
* | added std:: to string | Anand Shukla | 2002-07-16 | 1 | -4/+4 | |
| | | | | llvm-svn: 2915 | |||||
* | * Pass the DSGraph around instead of the Function to printing fns | Chris Lattner | 2002-07-11 | 1 | -16/+26 | |
| | | | | | | | | | * Print the globals list in the node * Print the scalars in the scalar node * Eliminate Scalar "label" edges in the graph * Print fake edges lighter instead of dotted llvm-svn: 2880 | |||||
* | * Nodes now keep track of any global variables in them | Chris Lattner | 2002-07-11 | 1 | -0/+15 | |
| | | | | llvm-svn: 2879 | |||||
* | * Nodes now keep track of any global variables in them | Chris Lattner | 2002-07-11 | 1 | -17/+35 | |
| | | | | | | | * Only dead-node-eliminate nodes with no flags * Don't merge scalars, only merge what they point to. llvm-svn: 2878 | |||||
* | New implementation of data structure analysis. Only local analysis has been | Chris Lattner | 2002-07-10 | 3 | -130/+531 | |
| | | | | | | implemented so far. llvm-svn: 2871 | |||||
* | Reimplement data structure analysis | Chris Lattner | 2002-07-10 | 5 | -1601/+0 | |
| | | | | llvm-svn: 2868 | |||||
* | Fix anand's last checkin | Chris Lattner | 2002-06-30 | 6 | -47/+43 | |
| | | | | llvm-svn: 2804 | |||||
* | changes to make it compatible with 64bit gcc | Anand Shukla | 2002-06-25 | 1 | -15/+15 | |
| | | | | llvm-svn: 2795 |