| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Add hack to get timing of analysis | Chris Lattner | 2002-04-04 | 1 | -0/+23 |
| | | | | | llvm-svn: 2101 | ||||
| * | Many changes | Chris Lattner | 2002-03-28 | 1 | -0/+22 |
| | | | | | | | | | | | | | | * Simplify a lot of the inlining stuff. There are still problems, but not many * Break up the Function representation to have a vector for every different node type so it is fast to find nodes of a particular flavor. * Do more intelligent merging of call values * Allow elimination of unreachable shadow and allocation nodes * Generalize indistinguishability testing to allow merging of identical calls. * Increase shadow node merging power llvm-svn: 2010 | ||||
| * | Initial checkin of Datastructure analysis. | Chris Lattner | 2002-03-26 | 1 | -0/+117 |
| Has bugs, but shouldn't crash in theory. llvm-svn: 1994 | |||||
 |
index : bcm5719-llvm | |
| Project Ortega BCM5719 LLVM | Raptor Computing Systems |
| summaryrefslogtreecommitdiffstats |
|