forked from OSchip/llvm-project
23e2278e27
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 llvm-svn: 253594 |
||
|---|---|---|
| .. | ||
| basic.ll | ||
| call.ll | ||
| dbg-declare-discriminator.ll | ||
| diamond.ll | ||
| first-only.ll | ||
| multiple.ll | ||
| no-discriminators.ll | ||
| oneline.ll | ||