rust/tests/coverage/while_early_ret.cov-map

Function name: while_early_ret::main
Raw bytes (80): 0x[01, 01, 08, 0f, 05, 01, 09, 0f, 13, 01, 09, 05, 0d, 05, 01, 05, 01, 05, 09, 0c, 01, 05, 01, 00, 1c, 01, 01, 09, 00, 16, 01, 00, 19, 00, 1b, 05, 02, 09, 02, 0a, 09, 05, 0d, 02, 0e, 02, 06, 15, 02, 16, 0d, 04, 15, 00, 1b, 0a, 04, 15, 00, 1b, 1a, 03, 09, 00, 0a, 1a, 01, 09, 02, 0a, 1e, 05, 05, 00, 0b, 01, 01, 01, 00, 02]
Number of files: 1
- file 0 => $DIR/while_early_ret.rs
Number of expressions: 8
- expression 0 operands: lhs = Expression(3, Add), rhs = Counter(1)
- expression 1 operands: lhs = Counter(0), rhs = Counter(2)
- expression 2 operands: lhs = Expression(3, Add), rhs = Expression(4, Add)
- expression 3 operands: lhs = Counter(0), rhs = Counter(2)
- expression 4 operands: lhs = Counter(1), rhs = Counter(3)
- expression 5 operands: lhs = Counter(1), rhs = Counter(0)
- expression 6 operands: lhs = Counter(1), rhs = Counter(0)
- expression 7 operands: lhs = Counter(1), rhs = Counter(2)
Number of file 0 mappings: 12
- Code(Counter(0)) at (prev + 5, 1) to (start + 0, 28)
- Code(Counter(0)) at (prev + 1, 9) to (start + 0, 22)
- Code(Counter(0)) at (prev + 0, 25) to (start + 0, 27)
- Code(Counter(1)) at (prev + 2, 9) to (start + 2, 10)
- Code(Counter(2)) at (prev + 5, 13) to (start + 2, 14)
- Code(Expression(0, Sub)) at (prev + 6, 21) to (start + 2, 22)
    = ((c0 + c2) - c1)
- Code(Counter(3)) at (prev + 4, 21) to (start + 0, 27)
- Code(Expression(2, Sub)) at (prev + 4, 21) to (start + 0, 27)
    = ((c0 + c2) - (c1 + c3))
- Code(Expression(6, Sub)) at (prev + 3, 9) to (start + 0, 10)
    = (c1 - c0)
- Code(Expression(6, Sub)) at (prev + 1, 9) to (start + 2, 10)
    = (c1 - c0)
- Code(Expression(7, Sub)) at (prev + 5, 5) to (start + 0, 11)
    = (c1 - c2)
- Code(Counter(0)) at (prev + 1, 1) to (start + 0, 2)
Highest counter ID seen: c3
Copy most of `tests/run-coverage` into `tests/coverage-map/status-quo` The output of these tests is too complicated to comfortably verify by hand, but we can still use them to observe changes to the underlying mappings produced by codegen/LLVM. If these tests fail due to non-coverage changes (e.g. in HIR-to-MIR lowering or MIR optimizations), it should usually be OK to just `--bless` them, as long as the `run-coverage` test suite still works. 2023-08-14 11:29:41 +00:00			`Function name: while_early_ret::main`
coverage: Only merge adjacent coverage spans This also removes some manipulation of the function signature span that only made sense in the context of merging non-adjacent spans. 2025-04-12 07:52:55 +00:00			`Raw bytes (80): 0x[01, 01, 08, 0f, 05, 01, 09, 0f, 13, 01, 09, 05, 0d, 05, 01, 05, 01, 05, 09, 0c, 01, 05, 01, 00, 1c, 01, 01, 09, 00, 16, 01, 00, 19, 00, 1b, 05, 02, 09, 02, 0a, 09, 05, 0d, 02, 0e, 02, 06, 15, 02, 16, 0d, 04, 15, 00, 1b, 0a, 04, 15, 00, 1b, 1a, 03, 09, 00, 0a, 1a, 01, 09, 02, 0a, 1e, 05, 05, 00, 0b, 01, 01, 01, 00, 02]`
Copy most of `tests/run-coverage` into `tests/coverage-map/status-quo` The output of these tests is too complicated to comfortably verify by hand, but we can still use them to observe changes to the underlying mappings produced by codegen/LLVM. If these tests fail due to non-coverage changes (e.g. in HIR-to-MIR lowering or MIR optimizations), it should usually be OK to just `--bless` them, as long as the `run-coverage` test suite still works. 2023-08-14 11:29:41 +00:00			`Number of files: 1`
coverage-dump: Dump filenames instead of global file IDs (and bless) 2025-04-24 07:36:50 +00:00			`- file 0 => $DIR/while_early_ret.rs`
coverage: Only merge adjacent coverage spans This also removes some manipulation of the function signature span that only made sense in the context of merging non-adjacent spans. 2025-04-12 07:52:55 +00:00			`Number of expressions: 8`
coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`- expression 0 operands: lhs = Expression(3, Add), rhs = Counter(1)`
			`- expression 1 operands: lhs = Counter(0), rhs = Counter(2)`
			`- expression 2 operands: lhs = Expression(3, Add), rhs = Expression(4, Add)`
			`- expression 3 operands: lhs = Counter(0), rhs = Counter(2)`
			`- expression 4 operands: lhs = Counter(1), rhs = Counter(3)`
			`- expression 5 operands: lhs = Counter(1), rhs = Counter(0)`
coverage: Only merge adjacent coverage spans This also removes some manipulation of the function signature span that only made sense in the context of merging non-adjacent spans. 2025-04-12 07:52:55 +00:00			`- expression 6 operands: lhs = Counter(1), rhs = Counter(0)`
			`- expression 7 operands: lhs = Counter(1), rhs = Counter(2)`
			`Number of file 0 mappings: 12`
			`- Code(Counter(0)) at (prev + 5, 1) to (start + 0, 28)`
			`- Code(Counter(0)) at (prev + 1, 9) to (start + 0, 22)`
			`- Code(Counter(0)) at (prev + 0, 25) to (start + 0, 27)`
			`- Code(Counter(1)) at (prev + 2, 9) to (start + 2, 10)`
coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`- Code(Counter(2)) at (prev + 5, 13) to (start + 2, 14)`
			`- Code(Expression(0, Sub)) at (prev + 6, 21) to (start + 2, 22)`
			`= ((c0 + c2) - c1)`
Copy most of `tests/run-coverage` into `tests/coverage-map/status-quo` The output of these tests is too complicated to comfortably verify by hand, but we can still use them to observe changes to the underlying mappings produced by codegen/LLVM. If these tests fail due to non-coverage changes (e.g. in HIR-to-MIR lowering or MIR optimizations), it should usually be OK to just `--bless` them, as long as the `run-coverage` test suite still works. 2023-08-14 11:29:41 +00:00			`- Code(Counter(3)) at (prev + 4, 21) to (start + 0, 27)`
coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`- Code(Expression(2, Sub)) at (prev + 4, 21) to (start + 0, 27)`
			`= ((c0 + c2) - (c1 + c3))`
coverage: Only merge adjacent coverage spans This also removes some manipulation of the function signature span that only made sense in the context of merging non-adjacent spans. 2025-04-12 07:52:55 +00:00			`- Code(Expression(6, Sub)) at (prev + 3, 9) to (start + 0, 10)`
coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`= (c1 - c0)`
coverage: Only merge adjacent coverage spans This also removes some manipulation of the function signature span that only made sense in the context of merging non-adjacent spans. 2025-04-12 07:52:55 +00:00			`- Code(Expression(6, Sub)) at (prev + 1, 9) to (start + 2, 10)`
			`= (c1 - c0)`
			`- Code(Expression(7, Sub)) at (prev + 5, 5) to (start + 0, 11)`
coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`= (c1 - c2)`
coverage: Prefer to visit nodes whose predecessors have been visited 2024-12-05 07:57:17 +00:00			`- Code(Counter(0)) at (prev + 1, 1) to (start + 0, 2)`
			`Highest counter ID seen: c3`
Copy most of `tests/run-coverage` into `tests/coverage-map/status-quo` The output of these tests is too complicated to comfortably verify by hand, but we can still use them to observe changes to the underlying mappings produced by codegen/LLVM. If these tests fail due to non-coverage changes (e.g. in HIR-to-MIR lowering or MIR optimizations), it should usually be OK to just `--bless` them, as long as the `run-coverage` test suite still works. 2023-08-14 11:29:41 +00:00