| Commit message (Expand) | 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 |
* | Cleanup data structure graph printer, eliminate hard coded printing in | Chris Lattner | 2002-10-17 | 1 | -120/+18 |
* | Make sure to print out the call nodes as well | Chris Lattner | 2002-10-16 | 1 | -1/+14 |
* | * Print the "return" node in the graphs | Chris Lattner | 2002-10-16 | 1 | -1/+18 |
* | The second element of the iterator is really an offset, not a link | Chris Lattner | 2002-10-16 | 1 | -1/+1 |
* | Specify the graph name | Chris Lattner | 2002-10-16 | 1 | -1/+1 |
* | - DSGraph Printing Improvements: | Chris Lattner | 2002-10-16 | 1 | -7/+7 |
* | Halfway conversion from custom printing to GraphWriter printing | Chris Lattner | 2002-10-13 | 1 | -0/+33 |
* | Prune function nodes that are no longer referenced due to inlining | Chris Lattner | 2002-10-03 | 2 | -2/+3 |
* | sgefa uses truely huge data structures nodes. Only print part of them if they | Chris Lattner | 2002-10-03 | 1 | -2/+7 |
* | Handle bug exposed by power benchmark | Chris Lattner | 2002-10-03 | 1 | -1/+1 |
* | Reimplement/port the Bottom Up Closure pass | Chris Lattner | 2002-10-03 | 2 | -38/+61 |
* | DataStructure.h doesn't include DSGraph.h | Chris Lattner | 2002-10-02 | 3 | -0/+3 |
* | * Implement fully general merging of array subscripts on demand! This | Chris Lattner | 2002-10-02 | 1 | -3/+27 |
* | When printing DS nodes, print the mergemap index as well to allow easier | Chris Lattner | 2002-10-02 | 1 | -1/+1 |
* | * Significant rework of DSNode to support arbitrary aliasing due to merging | Chris Lattner | 2002-10-02 | 1 | -20/+146 |
* | Initial checkin of Steensgaards context insensitive flow insensitive | Chris Lattner | 2002-10-01 | 1 | -0/+224 |
* | Checkin some major reworks of data structure analysis. This is not done, | Chris Lattner | 2002-10-01 | 5 | -353/+522 |
* | Eliminated the MemAccessInst class, folding contents into GEP class. | Chris Lattner | 2002-08-22 | 1 | -9/+8 |
* | Load & StoreInst no longer derive from MemAccessInst, so we don't have | Chris Lattner | 2002-08-22 | 1 | -3/+3 |
* | - Do not expose ::ID from any of the analyses anymore. | Chris Lattner | 2002-08-21 | 3 | -3/+0 |
* | Minor changes to DEBUG()'s | Chris Lattner | 2002-08-07 | 2 | -3/+6 |
* | Reorder #includes to be right | Chris Lattner | 2002-08-07 | 1 | -1/+1 |
* | Changes to be GCC3.1 friendly | Chris Lattner | 2002-07-31 | 3 | -12/+13 |
* | Add new -only-print-main-ds option that causes mains ds graph to be | Chris Lattner | 2002-07-31 | 1 | -1/+4 |
* | Add GlobalDSGraph -- a common graph that holds externally visible nodes. | Vikram S. Adve | 2002-07-30 | 1 | -4/+8 |
* | Print globals graph after either the BU or the TD pass. | Vikram S. Adve | 2002-07-30 | 1 | -17/+41 |
* | This file implements the top-down propagation pass for data structure graphs. | Vikram S. Adve | 2002-07-30 | 1 | -0/+224 |
* | Use a separate globals graph to hold externally visible nodes. | Vikram S. Adve | 2002-07-30 | 2 | -107/+484 |
* | * Standardize how analysis results/passes as printed with the print() virtual | Chris Lattner | 2002-07-27 | 4 | -11/+16 |
* | * Add support for different "PassType's" | Chris Lattner | 2002-07-26 | 2 | -0/+4 |
* | Changes for GCC 3.1 | Chris Lattner | 2002-07-24 | 1 | -3/+3 |
* | *** empty log message *** | Chris Lattner | 2002-07-23 | 1 | -2/+1 |
* | Always create a shadow node for a store instruction, even if it's storing | Chris Lattner | 2002-07-22 | 1 | -3/+3 |
* | Ignore some common varargs functions. | Chris Lattner | 2002-07-19 | 1 | -0/+6 |
* | * Inline CopyFunctionCallsList | Chris Lattner | 2002-07-18 | 1 | -35/+88 |
* | Rename removeDeadNodes to removeTriviallyDeadNodes | Chris Lattner | 2002-07-18 | 1 | -1/+3 |
* | Add support for a top-down propagation pass: | Vikram S. Adve | 2002-07-18 | 1 | -6/+13 |
* | Add support for a top-down propagation pass. | Vikram S. Adve | 2002-07-18 | 1 | -17/+39 |
* | Implement cast nodes correctly. | Chris Lattner | 2002-07-18 | 2 | -14/+19 |
* | The graph is more accurate when I don't completely ignore the return value. | Chris Lattner | 2002-07-18 | 1 | -0/+3 |
* | Lots of bug fixes, add BottomUpClosure, which has bugs, but is a start. | Chris Lattner | 2002-07-18 | 4 | -71/+482 |
* | added std:: to string | Anand Shukla | 2002-07-16 | 1 | -4/+4 |
* | * Pass the DSGraph around instead of the Function to printing fns | Chris Lattner | 2002-07-11 | 1 | -16/+26 |
* | * Nodes now keep track of any global variables in them | Chris Lattner | 2002-07-11 | 1 | -0/+15 |
* | * Nodes now keep track of any global variables in them | Chris Lattner | 2002-07-11 | 1 | -17/+35 |
* | New implementation of data structure analysis. Only local analysis has been | Chris Lattner | 2002-07-10 | 3 | -130/+531 |
* | Reimplement data structure analysis | Chris Lattner | 2002-07-10 | 5 | -1601/+0 |
* | Fix anand's last checkin | Chris Lattner | 2002-06-30 | 6 | -47/+43 |
* | changes to make it compatible with 64bit gcc | Anand Shukla | 2002-06-25 | 1 | -15/+15 |