| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Add some constantness. | Jakub Staszak | 2013-08-20 | 1 | -5/+6 |
| | | | | | llvm-svn: 188844 | ||||
| * | Fix an oversight in isPotentiallyReachable where we wouldn't do any CFG-walking | Nick Lewycky | 2013-08-13 | 1 | -53/+70 |
| | | | | | | | | | | | | | to find loops if the From and To instructions were in the same block. Refactor the code a little now that we need to fill to start the CFG-walking algorithm with more than one starting basic block sometimes. Special thanks to Andrew Trick for catching an error in my understanding of natural loops in code review. llvm-svn: 188236 | ||||
| * | Reimplement isPotentiallyReachable to make nocapture deduction much stronger. | Nick Lewycky | 2013-07-27 | 1 | -0/+227 |
| Adds unit tests for it too. Split BasicBlockUtils into an analysis-half and a transforms-half, and put the analysis bits into a new Analysis/CFG.{h,cpp}. Promote isPotentiallyReachable into llvm::isPotentiallyReachable and move it into Analysis/CFG. llvm-svn: 187283 | |||||
 |
index : bcm5719-llvm | |
| Project Ortega BCM5719 LLVM | Raptor Computing Systems |
| summaryrefslogtreecommitdiffstats |
|