Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | verify-uselistorder: Force -preserve-bc-use-list-order | Duncan P. N. Exon Smith | 2014-08-19 | 1 | -1/+1 |
| | | | | llvm-svn: 216022 | ||||
* | verify-uselistorder: Change the default -num-shuffles=5 | Duncan P. N. Exon Smith | 2014-07-31 | 1 | -1/+1 |
| | | | | | | | Change the default for `-num-shuffles` to 5 and better document the algorithm in the header docs of `verify-uselistorder`. llvm-svn: 214419 | ||||
* | Rename llvm-uselistorder => verify-uselistorder | Duncan P. N. Exon Smith | 2014-07-30 | 1 | -1/+1 |
| | | | | llvm-svn: 214318 | ||||
* | Bitcode: Correctly compare a Use against itself | Duncan P. N. Exon Smith | 2014-07-29 | 1 | -0/+1 |
| | | | | | | | | | | | | | | | Fix the sort of expected order in the reader to correctly return `false` when comparing a `Use` against itself. This was caught by test/Bitcode/binaryIntInstructions.3.2.ll, so I'm adding a `RUN` line using `llvm-uselistorder` for every test in `test/Bitcode` that passes. A few tests still fail, so I'll investigate those next. This is part of PR5680. llvm-svn: 214157 | ||||
* | Add 'musttail' marker to call instructions | Reid Kleckner | 2014-04-24 | 1 | -0/+17 |
This is similar to the 'tail' marker, except that it guarantees that tail call optimization will occur. It also comes with convervative IR verification rules that ensure that tail call optimization is possible. Reviewers: nicholas Differential Revision: http://llvm-reviews.chandlerc.com/D3240 llvm-svn: 207143 |