Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Implement optimization for direct function call case. This dramatically | Chris Lattner | 2003-02-05 | 1 | -5/+14 |
| | | | | | | | reduces the number of function nodes created and speeds up analysis by about 10% overall. llvm-svn: 5495 | ||||
* | Fix printing of nonfunction graphs | Chris Lattner | 2003-02-04 | 1 | -2/+4 |
| | | | | llvm-svn: 5487 | ||||
* | Be a bit more specific in caption | Chris Lattner | 2003-02-02 | 1 | -1/+1 |
| | | | | llvm-svn: 5469 | ||||
* | Change DSGraph stuff to use hash_(set|map) instead of std::(set|map) | Chris Lattner | 2003-02-01 | 1 | -2/+2 |
| | | | | | | This change provides a small (3%) but consistent speedup llvm-svn: 5460 | ||||
* | Remove using declarations | Chris Lattner | 2003-02-01 | 1 | -5/+5 |
| | | | | llvm-svn: 5456 | ||||
* | Add stats | Chris Lattner | 2002-11-18 | 1 | -4/+15 |
| | | | | llvm-svn: 4747 | ||||
* | Print the right call set size | Chris Lattner | 2002-11-11 | 1 | -1/+3 |
| | | | | llvm-svn: 4688 | ||||
* | Honor the shouldPrintAuxCalls flag | Chris Lattner | 2002-11-10 | 1 | -4/+9 |
| | | | | llvm-svn: 4678 | ||||
* | Remove obsolete code | Chris Lattner | 2002-11-09 | 1 | -14/+0 |
| | | | | llvm-svn: 4665 | ||||
* | Fix logic | Chris Lattner | 2002-11-09 | 1 | -1/+1 |
| | | | | llvm-svn: 4664 | ||||
* | Add globals graphs to all three passes | Chris Lattner | 2002-11-09 | 1 | -0/+10 |
| | | | | llvm-svn: 4663 | ||||
* | Add flush | Chris Lattner | 2002-11-08 | 1 | -1/+1 |
| | | | | llvm-svn: 4619 | ||||
* | Compute total number of nodes and # call nodes | Chris Lattner | 2002-11-07 | 1 | -0/+6 |
| | | | | llvm-svn: 4592 | ||||
* | When the -only-print-main-ds option is specified, still print out graph size | Chris Lattner | 2002-11-07 | 1 | -2/+9 |
| | | | | | | statistics for skipped functions llvm-svn: 4587 | ||||
* | Dramatically simplify internal DSNode representation, get implementation | Chris Lattner | 2002-11-06 | 1 | -23/+20 |
| | | | | | | | *FULLY OPERATIONAL* and safe. We are now capable of completely analyzing at LEAST the Olden benchmarks + 181.mcf llvm-svn: 4562 | ||||
* | Rename ValueMap to ScalarMap | Chris Lattner | 2002-11-03 | 1 | -1/+1 |
| | | | | llvm-svn: 4516 | ||||
* | Rename NewNode flag to HeapNode | Chris Lattner | 2002-11-03 | 1 | -1/+1 |
| | | | | llvm-svn: 4515 | ||||
* | Change the letters used to represent stack and heap allocations to "S" and "H" | Chris Lattner | 2002-11-03 | 1 | -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 code | Chris Lattner | 2002-11-02 | 1 | -6/+7 |
| | | | | llvm-svn: 4490 | ||||
* | Stop representing scalars as explicit nodes in the graph. Now the only | Chris Lattner | 2002-11-02 | 1 | -10/+17 |
| | | | | | | | | | 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 a confusing bug that caused return value and callee pointers to not | Chris Lattner | 2002-10-21 | 1 | -0/+10 |
| | | | | | | be printed! llvm-svn: 4248 | ||||
* | - Make DSCallSite not inherit from std::vector. Renamed methods slightly. | Chris Lattner | 2002-10-21 | 1 | -5/+5 |
| | | | | | | | | Make copy ctor have two versions to avoid dealing with conditional template argument. DSCallSite ctor now takes all arguments instead of taking one and being populated later. llvm-svn: 4240 | ||||
* | Fix previous checkin :( | Chris Lattner | 2002-10-20 | 1 | -1/+1 |
| | | | | llvm-svn: 4233 | ||||
* | Print the array flag | Chris Lattner | 2002-10-20 | 1 | -0/+2 |
| | | | | llvm-svn: 4231 | ||||
* | Added a first-class representation for each call site that can be | Vikram S. Adve | 2002-10-20 | 1 | -2/+2 |
| | | | | | | | | | used in the DS graphs. Essentially, what was vector<DSNodeHandle> before is now a DSCallSite with the same vector, plus pointers to the CallInst and the caller Function. The special-purpose class BUDataStructure::CallSite is no longer needed. llvm-svn: 4228 | ||||
* | Convert typerec to be a structure instead of a pair | Chris Lattner | 2002-10-18 | 1 | -3/+3 |
| | | | | llvm-svn: 4226 | ||||
* | Print Mod/ref info | Chris Lattner | 2002-10-17 | 1 | -0/+2 |
| | | | | llvm-svn: 4224 | ||||
* | Reenable printing of TD analysis | Chris Lattner | 2002-10-17 | 1 | -3/+2 |
| | | | | llvm-svn: 4214 | ||||
* | 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 | ||||
* | 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 | ||||
* | Reimplement/port the Bottom Up Closure pass | Chris Lattner | 2002-10-03 | 1 | -4/+9 |
| | | | | llvm-svn: 4031 | ||||
* | DataStructure.h doesn't include DSGraph.h | Chris Lattner | 2002-10-02 | 1 | -0/+1 |
| | | | | llvm-svn: 4029 | ||||
* | 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 | ||||
* | Checkin some major reworks of data structure analysis. This is not done, | Chris Lattner | 2002-10-01 | 1 | -44/+46 |
| | | | | | | | nor does it work very well, but I need to get it checked in before I break the tree unintentionally. llvm-svn: 3996 | ||||
* | 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 | ||||
* | Print globals graph after either the BU or the TD pass. | Vikram S. Adve | 2002-07-30 | 1 | -17/+41 |
| | | | | llvm-svn: 3172 | ||||
* | * Standardize how analysis results/passes as printed with the print() virtual | Chris Lattner | 2002-07-27 | 1 | -6/+11 |
| | | | | | | | | | | 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 | ||||
* | Lots of bug fixes, add BottomUpClosure, which has bugs, but is a start. | Chris Lattner | 2002-07-18 | 1 | -12/+23 |
| | | | | 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 | ||||
* | New implementation of data structure analysis. Only local analysis has been | Chris Lattner | 2002-07-10 | 1 | -0/+156 |
implemented so far. llvm-svn: 2871 |