| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | [LAA] LLE 3/6: Rename InterestingDependence to Dependences, NFC | Adam Nemet | 2015-11-03 | 1 | -1/+1 |
| | | | | | | | | | | | | | | | Summary: We now collect all types of dependences including lexically forward deps not just "interesting" ones. Reviewers: hfinkel Subscribers: rengolin, llvm-commits Differential Revision: http://reviews.llvm.org/D13256 llvm-svn: 251985 | ||||
| * | [LAA] Fix typo in test | Adam Nemet | 2015-08-11 | 1 | -1/+1 |
| | | | | | llvm-svn: 244690 | ||||
| * | [LAA] Revert a small part of r239295 | Adam Nemet | 2015-07-08 | 1 | -0/+42 |
| This commit ([LAA] Fix estimation of number of memchecks) regressed the logic a bit. We shouldn't quit the analysis if we encounter a pointer without known bounds *unless* we actually need to emit a memcheck for it. The original code was using NumComparisons which is now computed differently. Instead I compute NeedRTCheck from NumReadPtrChecks and NumWritePtrChecks. As side note, I find the separation of NeedRTCheck and CanDoRT confusing, so I will try to merge them in a follow-up patch. llvm-svn: 241756 | |||||
 |
index : bcm5719-llvm | |
| Project Ortega BCM5719 LLVM | Raptor Computing Systems |
| summaryrefslogtreecommitdiffstats |
|