mirror of
https://github.com/rust-lang/rust.git
synced 2024-11-26 00:34:06 +00:00
Rollup merge of #115930 - Zalathar:spans-bug, r=compiler-errors
coverage: Fix an unstable-sort inconsistency in coverage spans This code was calling `sort_unstable_by`, but failed to impose a total order on the initial spans. That resulted in unpredictable handling of closure spans, producing inconsistencies in the coverage maps and in user-visible coverage reports. This PR fixes the problem by always sorting closure spans before otherwise-identical non-closure spans, and also switches to a stable sort in case the ordering is still not total. --- In addition to the fix itself, this PR also contains a cleanup to the comparison function that I was working on when I discovered the bug.
This commit is contained in:
Matthias Krüger
GitHub
commit
3cf5a6beaa
@ -51,7 +51,7 @@ pub fn dominators<G: ControlFlowGraph>(graph: &G) -> Dominators<G::Node> {
|
||||
// Traverse the graph, collecting a number of things:
|
||||
//
|
||||
// * Preorder mapping (to it, and back to the actual ordering)
|
||||
// * Postorder mapping (used exclusively for rank_partial_cmp on the final product)
|
||||
// * Postorder mapping (used exclusively for `cmp_in_dominator_order` on the final product)
|
||||
// * Parents for each vertex in the preorder tree
|
||||
//
|
||||
// These are all done here rather than through one of the 'standard'
|
||||
@ -342,8 +342,8 @@ impl<Node: Idx> Dominators<Node> {
|
||||
/// relationship, the dominator will always precede the dominated. (The relative ordering
|
||||
/// of two unrelated nodes will also be consistent, but otherwise the order has no
|
||||
/// meaning.) This method cannot be used to determine if either Node dominates the other.
|
||||
pub fn rank_partial_cmp(&self, lhs: Node, rhs: Node) -> Option<Ordering> {
|
||||
self.post_order_rank[rhs].partial_cmp(&self.post_order_rank[lhs])
|
||||
pub fn cmp_in_dominator_order(&self, lhs: Node, rhs: Node) -> Ordering {
|
||||
self.post_order_rank[rhs].cmp(&self.post_order_rank[lhs])
|
||||
}
|
||||
|
||||
/// Returns true if `a` dominates `b`.
|
||||
|
||||
@ -199,12 +199,8 @@ impl CoverageGraph {
|
||||
}
|
||||
|
||||
#[inline(always)]
|
||||
pub fn rank_partial_cmp(
|
||||
&self,
|
||||
a: BasicCoverageBlock,
|
||||
b: BasicCoverageBlock,
|
||||
) -> Option<Ordering> {
|
||||
self.dominators.as_ref().unwrap().rank_partial_cmp(a, b)
|
||||
pub fn cmp_in_dominator_order(&self, a: BasicCoverageBlock, b: BasicCoverageBlock) -> Ordering {
|
||||
self.dominators.as_ref().unwrap().cmp_in_dominator_order(a, b)
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
@ -12,7 +12,6 @@ use rustc_span::source_map::original_sp;
|
||||
use rustc_span::{BytePos, ExpnKind, MacroKind, Span, Symbol};
|
||||
|
||||
use std::cell::OnceCell;
|
||||
use std::cmp::Ordering;
|
||||
|
||||
#[derive(Debug, Copy, Clone)]
|
||||
pub(super) enum CoverageStatement {
|
||||
@ -333,30 +332,21 @@ impl<'a, 'tcx> CoverageSpans<'a, 'tcx> {
|
||||
|
||||
initial_spans.push(CoverageSpan::for_fn_sig(self.fn_sig_span));
|
||||
|
||||
initial_spans.sort_unstable_by(|a, b| {
|
||||
if a.span.lo() == b.span.lo() {
|
||||
if a.span.hi() == b.span.hi() {
|
||||
if a.is_in_same_bcb(b) {
|
||||
Some(Ordering::Equal)
|
||||
} else {
|
||||
// Sort equal spans by dominator relationship (so dominators always come
|
||||
// before the dominated equal spans). When later comparing two spans in
|
||||
// order, the first will either dominate the second, or they will have no
|
||||
// dominator relationship.
|
||||
self.basic_coverage_blocks.rank_partial_cmp(a.bcb, b.bcb)
|
||||
}
|
||||
} else {
|
||||
// Sort hi() in reverse order so shorter spans are attempted after longer spans.
|
||||
// This guarantees that, if a `prev` span overlaps, and is not equal to, a
|
||||
// `curr` span, the prev span either extends further left of the curr span, or
|
||||
// they start at the same position and the prev span extends further right of
|
||||
// the end of the curr span.
|
||||
b.span.hi().partial_cmp(&a.span.hi())
|
||||
}
|
||||
} else {
|
||||
a.span.lo().partial_cmp(&b.span.lo())
|
||||
}
|
||||
.unwrap()
|
||||
initial_spans.sort_by(|a, b| {
|
||||
// First sort by span start.
|
||||
Ord::cmp(&a.span.lo(), &b.span.lo())
|
||||
// If span starts are the same, sort by span end in reverse order.
|
||||
// This ensures that if spans A and B are adjacent in the list,
|
||||
// and they overlap but are not equal, then either:
|
||||
// - Span A extends further left, or
|
||||
// - Both have the same start and span A extends further right
|
||||
.then_with(|| Ord::cmp(&a.span.hi(), &b.span.hi()).reverse())
|
||||
// If both spans are equal, sort the BCBs in dominator order,
|
||||
// so that dominating BCBs come before other BCBs they dominate.
|
||||
.then_with(|| self.basic_coverage_blocks.cmp_in_dominator_order(a.bcb, b.bcb))
|
||||
// If two spans are otherwise identical, put closure spans first,
|
||||
// as this seems to be what the refinement step expects.
|
||||
.then_with(|| Ord::cmp(&a.is_closure, &b.is_closure).reverse())
|
||||
});
|
||||
|
||||
initial_spans
|
||||
|
||||
@ -1,5 +1,5 @@
|
||||
Function name: closure::main
|
||||
Raw bytes (170): 0x[01, 01, 17, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 05, 05, 5a, 01, 05, 18, 01, 08, 01, 0f, 0d, 03, 16, 0e, 06, 0a, 07, 10, 05, 13, 0d, 0b, 1a, 0e, 08, 09, 0f, 10, 05, 0e, 09, 13, 16, 05, 0d, 18, 17, 19, 09, 01, 21, 1b, 04, 09, 00, 29, 1f, 01, 09, 00, 2d, 23, 01, 09, 00, 24, 27, 05, 09, 00, 24, 2b, 02, 09, 00, 21, 2f, 04, 09, 00, 21, 33, 04, 09, 00, 28, 37, 09, 09, 00, 32, 3b, 04, 09, 00, 33, 3f, 07, 09, 00, 4b, 43, 08, 09, 01, 09, 47, 0a, 09, 01, 09, 4b, 08, 09, 01, 09, 4f, 0a, 08, 00, 10, 05, 00, 11, 04, 06, 5a, 04, 06, 00, 07, 57, 01, 05, 03, 02]
|
||||
Raw bytes (170): 0x[01, 01, 17, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 00, 01, 05, 05, 5a, 01, 05, 18, 01, 08, 01, 0f, 0d, 03, 16, 0e, 06, 0a, 07, 10, 05, 13, 0d, 0b, 1a, 0e, 06, 0a, 0f, 10, 05, 0c, 16, 13, 16, 05, 0d, 18, 17, 19, 09, 01, 1e, 1b, 04, 09, 00, 29, 1f, 01, 09, 00, 2d, 23, 01, 09, 00, 24, 27, 05, 09, 00, 24, 2b, 02, 09, 00, 21, 2f, 04, 09, 00, 21, 33, 04, 09, 00, 28, 37, 09, 09, 00, 32, 3b, 04, 09, 00, 33, 3f, 07, 09, 00, 4b, 43, 08, 09, 00, 48, 47, 0a, 09, 00, 47, 4b, 08, 09, 00, 44, 4f, 0a, 08, 00, 10, 05, 00, 11, 04, 06, 5a, 04, 06, 00, 07, 57, 01, 05, 03, 02]
|
||||
Number of files: 1
|
||||
- file 0 => global file 1
|
||||
Number of expressions: 23
|
||||
@ -32,13 +32,13 @@ Number of file 0 mappings: 24
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(1, Add)) at (prev + 16, 5) to (start + 19, 13)
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(2, Add)) at (prev + 26, 14) to (start + 8, 9)
|
||||
- Code(Expression(2, Add)) at (prev + 26, 14) to (start + 6, 10)
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(3, Add)) at (prev + 16, 5) to (start + 14, 9)
|
||||
- Code(Expression(3, Add)) at (prev + 16, 5) to (start + 12, 22)
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(4, Add)) at (prev + 22, 5) to (start + 13, 24)
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(5, Add)) at (prev + 25, 9) to (start + 1, 33)
|
||||
- Code(Expression(5, Add)) at (prev + 25, 9) to (start + 1, 30)
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(6, Add)) at (prev + 4, 9) to (start + 0, 41)
|
||||
= (c0 + Zero)
|
||||
@ -60,11 +60,11 @@ Number of file 0 mappings: 24
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(15, Add)) at (prev + 7, 9) to (start + 0, 75)
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(16, Add)) at (prev + 8, 9) to (start + 1, 9)
|
||||
- Code(Expression(16, Add)) at (prev + 8, 9) to (start + 0, 72)
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(17, Add)) at (prev + 10, 9) to (start + 1, 9)
|
||||
- Code(Expression(17, Add)) at (prev + 10, 9) to (start + 0, 71)
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(18, Add)) at (prev + 8, 9) to (start + 1, 9)
|
||||
- Code(Expression(18, Add)) at (prev + 8, 9) to (start + 0, 68)
|
||||
= (c0 + Zero)
|
||||
- Code(Expression(19, Add)) at (prev + 10, 8) to (start + 0, 16)
|
||||
= (c0 + Zero)
|
||||
|
||||
148
tests/coverage-map/status-quo/closure_bug.cov-map
Normal file
148
tests/coverage-map/status-quo/closure_bug.cov-map
Normal file
@ -0,0 +1,148 @@
|
||||
Function name: closure_bug::main
|
||||
Raw bytes (241): 0x[01, 01, 34, 01, 00, 01, 05, 05, ce, 01, 01, 05, cb, 01, 00, 05, ce, 01, 01, 05, cb, 01, 09, 05, ce, 01, 01, 05, 09, c6, 01, cb, 01, 09, 05, ce, 01, 01, 05, c3, 01, 00, 09, c6, 01, cb, 01, 09, 05, ce, 01, 01, 05, c3, 01, 0d, 09, c6, 01, cb, 01, 09, 05, ce, 01, 01, 05, 0d, be, 01, c3, 01, 0d, 09, c6, 01, cb, 01, 09, 05, ce, 01, 01, 05, bb, 01, 00, 0d, be, 01, c3, 01, 0d, 09, c6, 01, cb, 01, 09, 05, ce, 01, 01, 05, bb, 01, 11, 0d, be, 01, c3, 01, 0d, 09, c6, 01, cb, 01, 09, 05, ce, 01, 01, 05, 11, b6, 01, bb, 01, 11, 0d, be, 01, c3, 01, 0d, 09, c6, 01, cb, 01, 09, 05, ce, 01, 01, 05, 11, 01, 06, 01, 03, 0a, 03, 09, 05, 01, 0e, 05, 01, 0f, 00, 17, ce, 01, 00, 17, 00, 18, cb, 01, 02, 09, 00, 0a, 13, 06, 05, 01, 0e, 09, 01, 0f, 00, 17, c6, 01, 00, 17, 00, 18, c3, 01, 02, 09, 00, 0a, 3b, 06, 05, 01, 0e, 0d, 01, 0f, 00, 17, be, 01, 00, 17, 00, 18, bb, 01, 02, 09, 00, 0a, 7b, 06, 05, 01, 0e, 11, 01, 0f, 00, 17, b6, 01, 00, 17, 00, 18, b3, 01, 01, 01, 00, 02]
|
||||
Number of files: 1
|
||||
- file 0 => global file 1
|
||||
Number of expressions: 52
|
||||
- expression 0 operands: lhs = Counter(0), rhs = Zero
|
||||
- expression 1 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 2 operands: lhs = Counter(1), rhs = Expression(51, Sub)
|
||||
- expression 3 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 4 operands: lhs = Expression(50, Add), rhs = Zero
|
||||
- expression 5 operands: lhs = Counter(1), rhs = Expression(51, Sub)
|
||||
- expression 6 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 7 operands: lhs = Expression(50, Add), rhs = Counter(2)
|
||||
- expression 8 operands: lhs = Counter(1), rhs = Expression(51, Sub)
|
||||
- expression 9 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 10 operands: lhs = Counter(2), rhs = Expression(49, Sub)
|
||||
- expression 11 operands: lhs = Expression(50, Add), rhs = Counter(2)
|
||||
- expression 12 operands: lhs = Counter(1), rhs = Expression(51, Sub)
|
||||
- expression 13 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 14 operands: lhs = Expression(48, Add), rhs = Zero
|
||||
- expression 15 operands: lhs = Counter(2), rhs = Expression(49, Sub)
|
||||
- expression 16 operands: lhs = Expression(50, Add), rhs = Counter(2)
|
||||
- expression 17 operands: lhs = Counter(1), rhs = Expression(51, Sub)
|
||||
- expression 18 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 19 operands: lhs = Expression(48, Add), rhs = Counter(3)
|
||||
- expression 20 operands: lhs = Counter(2), rhs = Expression(49, Sub)
|
||||
- expression 21 operands: lhs = Expression(50, Add), rhs = Counter(2)
|
||||
- expression 22 operands: lhs = Counter(1), rhs = Expression(51, Sub)
|
||||
- expression 23 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 24 operands: lhs = Counter(3), rhs = Expression(47, Sub)
|
||||
- expression 25 operands: lhs = Expression(48, Add), rhs = Counter(3)
|
||||
- expression 26 operands: lhs = Counter(2), rhs = Expression(49, Sub)
|
||||
- expression 27 operands: lhs = Expression(50, Add), rhs = Counter(2)
|
||||
- expression 28 operands: lhs = Counter(1), rhs = Expression(51, Sub)
|
||||
- expression 29 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 30 operands: lhs = Expression(46, Add), rhs = Zero
|
||||
- expression 31 operands: lhs = Counter(3), rhs = Expression(47, Sub)
|
||||
- expression 32 operands: lhs = Expression(48, Add), rhs = Counter(3)
|
||||
- expression 33 operands: lhs = Counter(2), rhs = Expression(49, Sub)
|
||||
- expression 34 operands: lhs = Expression(50, Add), rhs = Counter(2)
|
||||
- expression 35 operands: lhs = Counter(1), rhs = Expression(51, Sub)
|
||||
- expression 36 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 37 operands: lhs = Expression(46, Add), rhs = Counter(4)
|
||||
- expression 38 operands: lhs = Counter(3), rhs = Expression(47, Sub)
|
||||
- expression 39 operands: lhs = Expression(48, Add), rhs = Counter(3)
|
||||
- expression 40 operands: lhs = Counter(2), rhs = Expression(49, Sub)
|
||||
- expression 41 operands: lhs = Expression(50, Add), rhs = Counter(2)
|
||||
- expression 42 operands: lhs = Counter(1), rhs = Expression(51, Sub)
|
||||
- expression 43 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 44 operands: lhs = Counter(4), rhs = Expression(45, Sub)
|
||||
- expression 45 operands: lhs = Expression(46, Add), rhs = Counter(4)
|
||||
- expression 46 operands: lhs = Counter(3), rhs = Expression(47, Sub)
|
||||
- expression 47 operands: lhs = Expression(48, Add), rhs = Counter(3)
|
||||
- expression 48 operands: lhs = Counter(2), rhs = Expression(49, Sub)
|
||||
- expression 49 operands: lhs = Expression(50, Add), rhs = Counter(2)
|
||||
- expression 50 operands: lhs = Counter(1), rhs = Expression(51, Sub)
|
||||
- expression 51 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
Number of file 0 mappings: 17
|
||||
- Code(Counter(0)) at (prev + 6, 1) to (start + 3, 10)
|
||||
- Code(Expression(0, Add)) at (prev + 9, 5) to (start + 1, 14)
|
||||
= (c0 + Zero)
|
||||
- Code(Counter(1)) at (prev + 1, 15) to (start + 0, 23)
|
||||
- Code(Expression(51, Sub)) at (prev + 0, 23) to (start + 0, 24)
|
||||
= (c0 - c1)
|
||||
- Code(Expression(50, Add)) at (prev + 2, 9) to (start + 0, 10)
|
||||
= (c1 + (c0 - c1))
|
||||
- Code(Expression(4, Add)) at (prev + 6, 5) to (start + 1, 14)
|
||||
= ((c1 + (c0 - c1)) + Zero)
|
||||
- Code(Counter(2)) at (prev + 1, 15) to (start + 0, 23)
|
||||
- Code(Expression(49, Sub)) at (prev + 0, 23) to (start + 0, 24)
|
||||
= ((c1 + (c0 - c1)) - c2)
|
||||
- Code(Expression(48, Add)) at (prev + 2, 9) to (start + 0, 10)
|
||||
= (c2 + ((c1 + (c0 - c1)) - c2))
|
||||
- Code(Expression(14, Add)) at (prev + 6, 5) to (start + 1, 14)
|
||||
= ((c2 + ((c1 + (c0 - c1)) - c2)) + Zero)
|
||||
- Code(Counter(3)) at (prev + 1, 15) to (start + 0, 23)
|
||||
- Code(Expression(47, Sub)) at (prev + 0, 23) to (start + 0, 24)
|
||||
= ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)
|
||||
- Code(Expression(46, Add)) at (prev + 2, 9) to (start + 0, 10)
|
||||
= (c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3))
|
||||
- Code(Expression(30, Add)) at (prev + 6, 5) to (start + 1, 14)
|
||||
= ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) + Zero)
|
||||
- Code(Counter(4)) at (prev + 1, 15) to (start + 0, 23)
|
||||
- Code(Expression(45, Sub)) at (prev + 0, 23) to (start + 0, 24)
|
||||
= ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)
|
||||
- Code(Expression(44, Add)) at (prev + 1, 1) to (start + 0, 2)
|
||||
= (c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4))
|
||||
|
||||
Function name: closure_bug::main::{closure#0}
|
||||
Raw bytes (28): 0x[01, 01, 02, 01, 05, 05, 02, 04, 01, 0d, 09, 00, 12, 05, 00, 15, 00, 19, 02, 00, 23, 00, 28, 07, 00, 29, 00, 2a]
|
||||
Number of files: 1
|
||||
- file 0 => global file 1
|
||||
Number of expressions: 2
|
||||
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 1 operands: lhs = Counter(1), rhs = Expression(0, Sub)
|
||||
Number of file 0 mappings: 4
|
||||
- Code(Counter(0)) at (prev + 13, 9) to (start + 0, 18)
|
||||
- Code(Counter(1)) at (prev + 0, 21) to (start + 0, 25)
|
||||
- Code(Expression(0, Sub)) at (prev + 0, 35) to (start + 0, 40)
|
||||
= (c0 - c1)
|
||||
- Code(Expression(1, Add)) at (prev + 0, 41) to (start + 0, 42)
|
||||
= (c1 + (c0 - c1))
|
||||
|
||||
Function name: closure_bug::main::{closure#1}
|
||||
Raw bytes (28): 0x[01, 01, 02, 01, 05, 05, 02, 04, 01, 16, 09, 00, 12, 05, 00, 15, 00, 19, 02, 00, 23, 00, 28, 07, 00, 29, 00, 2a]
|
||||
Number of files: 1
|
||||
- file 0 => global file 1
|
||||
Number of expressions: 2
|
||||
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 1 operands: lhs = Counter(1), rhs = Expression(0, Sub)
|
||||
Number of file 0 mappings: 4
|
||||
- Code(Counter(0)) at (prev + 22, 9) to (start + 0, 18)
|
||||
- Code(Counter(1)) at (prev + 0, 21) to (start + 0, 25)
|
||||
- Code(Expression(0, Sub)) at (prev + 0, 35) to (start + 0, 40)
|
||||
= (c0 - c1)
|
||||
- Code(Expression(1, Add)) at (prev + 0, 41) to (start + 0, 42)
|
||||
= (c1 + (c0 - c1))
|
||||
|
||||
Function name: closure_bug::main::{closure#2}
|
||||
Raw bytes (28): 0x[01, 01, 02, 01, 05, 05, 02, 04, 01, 1f, 09, 00, 12, 05, 00, 15, 00, 19, 02, 00, 23, 00, 28, 07, 00, 29, 00, 2a]
|
||||
Number of files: 1
|
||||
- file 0 => global file 1
|
||||
Number of expressions: 2
|
||||
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 1 operands: lhs = Counter(1), rhs = Expression(0, Sub)
|
||||
Number of file 0 mappings: 4
|
||||
- Code(Counter(0)) at (prev + 31, 9) to (start + 0, 18)
|
||||
- Code(Counter(1)) at (prev + 0, 21) to (start + 0, 25)
|
||||
- Code(Expression(0, Sub)) at (prev + 0, 35) to (start + 0, 40)
|
||||
= (c0 - c1)
|
||||
- Code(Expression(1, Add)) at (prev + 0, 41) to (start + 0, 42)
|
||||
= (c1 + (c0 - c1))
|
||||
|
||||
Function name: closure_bug::main::{closure#3}
|
||||
Raw bytes (28): 0x[01, 01, 02, 01, 05, 05, 02, 04, 01, 28, 09, 00, 12, 05, 00, 15, 00, 19, 02, 00, 23, 00, 28, 07, 00, 29, 00, 2a]
|
||||
Number of files: 1
|
||||
- file 0 => global file 1
|
||||
Number of expressions: 2
|
||||
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
|
||||
- expression 1 operands: lhs = Counter(1), rhs = Expression(0, Sub)
|
||||
Number of file 0 mappings: 4
|
||||
- Code(Counter(0)) at (prev + 40, 9) to (start + 0, 18)
|
||||
- Code(Counter(1)) at (prev + 0, 21) to (start + 0, 25)
|
||||
- Code(Expression(0, Sub)) at (prev + 0, 35) to (start + 0, 40)
|
||||
= (c0 - c1)
|
||||
- Code(Expression(1, Add)) at (prev + 0, 41) to (start + 0, 42)
|
||||
= (c1 + (c0 - c1))
|
||||
|
||||
44
tests/coverage-map/status-quo/closure_bug.rs
Normal file
44
tests/coverage-map/status-quo/closure_bug.rs
Normal file
@ -0,0 +1,44 @@
|
||||
// Regression test for #115930.
|
||||
// All of these closures are identical, and should produce identical output in
|
||||
// the coverage report. However, an unstable sort was causing them to be treated
|
||||
// inconsistently when preparing coverage spans.
|
||||
|
||||
fn main() {
|
||||
let truthy = std::env::args().len() == 1;
|
||||
|
||||
let a
|
||||
=
|
||||
|
|
||||
|
|
||||
if truthy { true } else { false };
|
||||
|
||||
a();
|
||||
if truthy { a(); }
|
||||
|
||||
let b
|
||||
=
|
||||
|
|
||||
|
|
||||
if truthy { true } else { false };
|
||||
|
||||
b();
|
||||
if truthy { b(); }
|
||||
|
||||
let c
|
||||
=
|
||||
|
|
||||
|
|
||||
if truthy { true } else { false };
|
||||
|
||||
c();
|
||||
if truthy { c(); }
|
||||
|
||||
let d
|
||||
=
|
||||
|
|
||||
|
|
||||
if truthy { true } else { false };
|
||||
|
||||
d();
|
||||
if truthy { d(); }
|
||||
}
|
||||
@ -14,7 +14,7 @@ Number of file 0 mappings: 4
|
||||
= (c1 + (c0 - c1))
|
||||
|
||||
Function name: generator::main
|
||||
Raw bytes (71): 0x[01, 01, 0b, 01, 00, 05, 0b, 09, 0d, 11, 00, 11, 15, 2a, 19, 11, 15, 15, 19, 26, 00, 2a, 19, 11, 15, 09, 01, 0f, 01, 02, 19, 03, 07, 0b, 00, 2e, 11, 01, 2b, 00, 2d, 07, 01, 0e, 00, 35, 0f, 02, 0b, 00, 2e, 2a, 01, 22, 00, 27, 26, 00, 2c, 00, 2e, 1f, 01, 0e, 00, 35, 23, 02, 01, 00, 02]
|
||||
Raw bytes (71): 0x[01, 01, 0b, 01, 00, 05, 0b, 09, 0d, 11, 00, 11, 15, 2a, 19, 11, 15, 15, 19, 26, 00, 2a, 19, 11, 15, 09, 01, 0f, 01, 02, 16, 03, 07, 0b, 00, 2e, 11, 01, 2b, 00, 2d, 07, 01, 0e, 00, 35, 0f, 02, 0b, 00, 2e, 2a, 01, 22, 00, 27, 26, 00, 2c, 00, 2e, 1f, 01, 0e, 00, 35, 23, 02, 01, 00, 02]
|
||||
Number of files: 1
|
||||
- file 0 => global file 1
|
||||
Number of expressions: 11
|
||||
@ -30,7 +30,7 @@ Number of expressions: 11
|
||||
- expression 9 operands: lhs = Expression(10, Sub), rhs = Counter(6)
|
||||
- expression 10 operands: lhs = Counter(4), rhs = Counter(5)
|
||||
Number of file 0 mappings: 9
|
||||
- Code(Counter(0)) at (prev + 15, 1) to (start + 2, 25)
|
||||
- Code(Counter(0)) at (prev + 15, 1) to (start + 2, 22)
|
||||
- Code(Expression(0, Add)) at (prev + 7, 11) to (start + 0, 46)
|
||||
= (c0 + Zero)
|
||||
- Code(Counter(4)) at (prev + 1, 43) to (start + 0, 45)
|
||||
|
||||
@ -76,8 +76,8 @@
|
||||
LL| 1| some_string = None;
|
||||
LL| 1| let
|
||||
LL| 1| a
|
||||
LL| 1| =
|
||||
LL| 1| ||
|
||||
LL| | =
|
||||
LL| | ||
|
||||
LL| 1| {
|
||||
LL| 1| let mut countdown = 0;
|
||||
LL| 1| if is_false {
|
||||
@ -98,8 +98,8 @@
|
||||
LL| 1|
|
||||
LL| 1| let
|
||||
LL| 1| quote_closure
|
||||
LL| 1| =
|
||||
LL| 1| |val|
|
||||
LL| | =
|
||||
LL| | |val|
|
||||
LL| 5| {
|
||||
LL| 5| let mut countdown = 0;
|
||||
LL| 5| if is_false {
|
||||
@ -186,7 +186,7 @@
|
||||
LL| | ;
|
||||
LL| |
|
||||
LL| 1| let short_used_not_covered_closure_line_break_block_embedded_branch =
|
||||
LL| 1| | _unused_arg: u8 |
|
||||
LL| | | _unused_arg: u8 |
|
||||
LL| 0| {
|
||||
LL| 0| println!(
|
||||
LL| 0| "not called: {}",
|
||||
@ -196,7 +196,7 @@
|
||||
LL| | ;
|
||||
LL| |
|
||||
LL| 1| let short_used_covered_closure_line_break_no_block_embedded_branch =
|
||||
LL| 1| | _unused_arg: u8 |
|
||||
LL| | | _unused_arg: u8 |
|
||||
LL| 1| println!(
|
||||
LL| 1| "not called: {}",
|
||||
LL| 1| if is_true { "check" } else { "me" }
|
||||
@ -205,7 +205,7 @@
|
||||
LL| | ;
|
||||
LL| |
|
||||
LL| 1| let short_used_covered_closure_line_break_block_embedded_branch =
|
||||
LL| 1| | _unused_arg: u8 |
|
||||
LL| | | _unused_arg: u8 |
|
||||
LL| 1| {
|
||||
LL| 1| println!(
|
||||
LL| 1| "not called: {}",
|
||||
|
||||
53
tests/run-coverage/closure_bug.coverage
Normal file
53
tests/run-coverage/closure_bug.coverage
Normal file
@ -0,0 +1,53 @@
|
||||
LL| |// Regression test for #115930.
|
||||
LL| |// All of these closures are identical, and should produce identical output in
|
||||
LL| |// the coverage report. However, an unstable sort was causing them to be treated
|
||||
LL| |// inconsistently when preparing coverage spans.
|
||||
LL| |
|
||||
LL| 1|fn main() {
|
||||
LL| 1| let truthy = std::env::args().len() == 1;
|
||||
LL| 1|
|
||||
LL| 1| let a
|
||||
LL| | =
|
||||
LL| | |
|
||||
LL| | |
|
||||
LL| 2| if truthy { true } else { false };
|
||||
^0
|
||||
LL| |
|
||||
LL| 1| a();
|
||||
LL| 1| if truthy { a(); }
|
||||
^0
|
||||
LL| |
|
||||
LL| 1| let b
|
||||
LL| | =
|
||||
LL| | |
|
||||
LL| | |
|
||||
LL| 2| if truthy { true } else { false };
|
||||
^0
|
||||
LL| |
|
||||
LL| 1| b();
|
||||
LL| 1| if truthy { b(); }
|
||||
^0
|
||||
LL| |
|
||||
LL| 1| let c
|
||||
LL| | =
|
||||
LL| | |
|
||||
LL| | |
|
||||
LL| 2| if truthy { true } else { false };
|
||||
^0
|
||||
LL| |
|
||||
LL| 1| c();
|
||||
LL| 1| if truthy { c(); }
|
||||
^0
|
||||
LL| |
|
||||
LL| 1| let d
|
||||
LL| | =
|
||||
LL| | |
|
||||
LL| | |
|
||||
LL| 2| if truthy { true } else { false };
|
||||
^0
|
||||
LL| |
|
||||
LL| 1| d();
|
||||
LL| 1| if truthy { d(); }
|
||||
^0
|
||||
LL| 1|}
|
||||
|
||||
44
tests/run-coverage/closure_bug.rs
Normal file
44
tests/run-coverage/closure_bug.rs
Normal file
@ -0,0 +1,44 @@
|
||||
// Regression test for #115930.
|
||||
// All of these closures are identical, and should produce identical output in
|
||||
// the coverage report. However, an unstable sort was causing them to be treated
|
||||
// inconsistently when preparing coverage spans.
|
||||
|
||||
fn main() {
|
||||
let truthy = std::env::args().len() == 1;
|
||||
|
||||
let a
|
||||
=
|
||||
|
|
||||
|
|
||||
if truthy { true } else { false };
|
||||
|
||||
a();
|
||||
if truthy { a(); }
|
||||
|
||||
let b
|
||||
=
|
||||
|
|
||||
|
|
||||
if truthy { true } else { false };
|
||||
|
||||
b();
|
||||
if truthy { b(); }
|
||||
|
||||
let c
|
||||
=
|
||||
|
|
||||
|
|
||||
if truthy { true } else { false };
|
||||
|
||||
c();
|
||||
if truthy { c(); }
|
||||
|
||||
let d
|
||||
=
|
||||
|
|
||||
|
|
||||
if truthy { true } else { false };
|
||||
|
||||
d();
|
||||
if truthy { d(); }
|
||||
}
|
||||
Loading…
Reference in New Issue
Block a user