rust/tests/coverage/assert.cov-map

Function name: assert::main
Raw bytes (61): 0x[01, 01, 06, 05, 01, 05, 17, 01, 09, 05, 13, 17, 0d, 01, 09, 09, 01, 09, 01, 01, 1b, 05, 02, 0b, 00, 18, 02, 01, 0c, 00, 1a, 09, 00, 1b, 02, 0a, 06, 02, 13, 00, 20, 0d, 00, 21, 02, 0a, 0e, 02, 09, 00, 0a, 02, 01, 09, 00, 17, 01, 02, 05, 01, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 6
- expression 0 operands: lhs = Counter(1), rhs = Counter(0)
- expression 1 operands: lhs = Counter(1), rhs = Expression(5, Add)
- expression 2 operands: lhs = Counter(0), rhs = Counter(2)
- expression 3 operands: lhs = Counter(1), rhs = Expression(4, Add)
- expression 4 operands: lhs = Expression(5, Add), rhs = Counter(3)
- expression 5 operands: lhs = Counter(0), rhs = Counter(2)
Number of file 0 mappings: 9
- Code(Counter(0)) at (prev + 9, 1) to (start + 1, 27)
- Code(Counter(1)) at (prev + 2, 11) to (start + 0, 24)
- Code(Expression(0, Sub)) at (prev + 1, 12) to (start + 0, 26)
    = (c1 - c0)
- Code(Counter(2)) at (prev + 0, 27) to (start + 2, 10)
- Code(Expression(1, Sub)) at (prev + 2, 19) to (start + 0, 32)
    = (c1 - (c0 + c2))
- Code(Counter(3)) at (prev + 0, 33) to (start + 2, 10)
- Code(Expression(3, Sub)) at (prev + 2, 9) to (start + 0, 10)
    = (c1 - ((c0 + c2) + c3))
- Code(Expression(0, Sub)) at (prev + 1, 9) to (start + 0, 23)
    = (c1 - c0)
- Code(Counter(0)) at (prev + 2, 5) to (start + 1, 2)
Highest counter ID seen: c3

Function name: assert::might_fail_assert
Raw bytes (21): 0x[01, 01, 01, 01, 05, 03, 01, 04, 01, 02, 0f, 02, 02, 25, 00, 3d, 05, 01, 01, 00, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 1
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
Number of file 0 mappings: 3
- Code(Counter(0)) at (prev + 4, 1) to (start + 2, 15)
- Code(Expression(0, Sub)) at (prev + 2, 37) to (start + 0, 61)
    = (c0 - c1)
- Code(Counter(1)) at (prev + 1, 1) to (start + 0, 2)
Highest counter ID seen: 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			`Function name: assert::main`
coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`Raw bytes (61): 0x[01, 01, 06, 05, 01, 05, 17, 01, 09, 05, 13, 17, 0d, 01, 09, 09, 01, 09, 01, 01, 1b, 05, 02, 0b, 00, 18, 02, 01, 0c, 00, 1a, 09, 00, 1b, 02, 0a, 06, 02, 13, 00, 20, 0d, 00, 21, 02, 0a, 0e, 02, 09, 00, 0a, 02, 01, 09, 00, 17, 01, 02, 05, 01, 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`
			`- file 0 => global file 1`
coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`Number of expressions: 6`
			`- expression 0 operands: lhs = Counter(1), rhs = Counter(0)`
			`- expression 1 operands: lhs = Counter(1), rhs = Expression(5, Add)`
			`- expression 2 operands: lhs = Counter(0), rhs = Counter(2)`
			`- expression 3 operands: lhs = Counter(1), rhs = Expression(4, Add)`
			`- expression 4 operands: lhs = Expression(5, Add), rhs = Counter(3)`
			`- expression 5 operands: lhs = Counter(0), rhs = Counter(2)`
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 file 0 mappings: 9`
			`- Code(Counter(0)) at (prev + 9, 1) to (start + 1, 27)`
coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`- Code(Counter(1)) at (prev + 2, 11) to (start + 0, 24)`
			`- Code(Expression(0, Sub)) at (prev + 1, 12) to (start + 0, 26)`
			`= (c1 - c0)`
			`- Code(Counter(2)) at (prev + 0, 27) to (start + 2, 10)`
			`- Code(Expression(1, Sub)) at (prev + 2, 19) to (start + 0, 32)`
			`= (c1 - (c0 + c2))`
			`- Code(Counter(3)) at (prev + 0, 33) to (start + 2, 10)`
			`- Code(Expression(3, Sub)) at (prev + 2, 9) to (start + 0, 10)`
			`= (c1 - ((c0 + c2) + c3))`
			`- Code(Expression(0, Sub)) at (prev + 1, 9) to (start + 0, 23)`
			`= (c1 - c0)`
			`- Code(Counter(0)) at (prev + 2, 5) to (start + 1, 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: assert::might_fail_assert`
			`Raw bytes (21): 0x[01, 01, 01, 01, 05, 03, 01, 04, 01, 02, 0f, 02, 02, 25, 00, 3d, 05, 01, 01, 00, 02]`
			`Number of files: 1`
			`- file 0 => global file 1`
			`Number of expressions: 1`
			`- expression 0 operands: lhs = Counter(0), rhs = Counter(1)`
			`Number of file 0 mappings: 3`
			`- Code(Counter(0)) at (prev + 4, 1) to (start + 2, 15)`
			`- Code(Expression(0, Sub)) at (prev + 2, 37) to (start + 0, 61)`
			`= (c0 - c1)`
			`- Code(Counter(1)) at (prev + 1, 1) to (start + 0, 2)`
coverage: Include the highest counter ID seen in `.cov-map` dumps When making changes that have a large impact on coverage counter creation, this makes it easier to see whether the number of physical counters has changed. (The highest counter ID seen in coverage maps is not necessarily the same as the number of physical counters actually used by the instrumented code, but it's the best approximation we can get from looking only at the coverage maps, and it should be reasonably accurate in most cases.) 2024-10-08 02:13:05 +00:00			`Highest counter ID seen: 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