mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-14 23:48:56 +00:00
0a7baafe64
Summary: The new algorithm is more efficient (O(n), n is number of basic blocks). And it is guaranteed to cover all cases of multiple BB mapped to same line. Reviewers: dblaikie, davidxl, dnovillo Subscribers: llvm-commits Differential Revision: http://reviews.llvm.org/D14738 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@253594 91177308-0d34-0410-b5e6-96231b3b80d8 |
||
---|---|---|
.. | ||
basic.ll | ||
call.ll | ||
dbg-declare-discriminator.ll | ||
diamond.ll | ||
first-only.ll | ||
multiple.ll | ||
no-discriminators.ll | ||
oneline.ll |