| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Use Function::getEntryBlock instead of Function::begin, for clarity. | Dan Gohman | 2008-05-27 | 1 | -1/+1 |
| | | | | | llvm-svn: 51613 | ||||
| * | Print debug output when any edge becomes executable, including | Dan Gohman | 2008-05-27 | 1 | -3/+3 |
| | | | | | | | the first visited edge. llvm-svn: 51612 | ||||
| * | Add a bool to isEdgeFeasible that tells it whether to treat unknown | Chris Lattner | 2008-05-20 | 1 | -7/+19 |
| | | | | | | | value as undef or untracked. llvm-svn: 51295 | ||||
| * | prune #includes. | Chris Lattner | 2008-05-12 | 1 | -3/+0 |
| | | | | | llvm-svn: 50962 | ||||
| * | Add a new SparsePropagation analysis utility, which allows you to do | Chris Lattner | 2008-05-12 | 1 | -0/+320 |
| SCCP like sparse lattice analysis with relative ease. Just pick your lattice function and implement the transfer function and you're good. Just make sure you don't break monotonicity ;-) llvm-svn: 50961 | |||||
 |
index : bcm5719-llvm | |
| Project Ortega BCM5719 LLVM | Raptor Computing Systems |
| summaryrefslogtreecommitdiffstats |
|