rust/tests/coverage/while_early_ret.cov-map

Function name: while_early_ret::main
Raw bytes (59): 0x[01, 01, 05, 01, 05, 03, 09, 01, 09, 01, 13, 09, 0d, 09, 01, 05, 01, 01, 1b, 03, 03, 09, 02, 0a, 06, 05, 0d, 02, 0e, 0a, 06, 15, 02, 16, 0d, 04, 15, 00, 1b, 0e, 04, 15, 00, 1b, 05, 03, 0a, 03, 0a, 09, 06, 05, 00, 0b, 01, 01, 01, 00, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 5
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
- expression 1 operands: lhs = Expression(0, Add), rhs = Counter(2)
- expression 2 operands: lhs = Counter(0), rhs = Counter(2)
- expression 3 operands: lhs = Counter(0), rhs = Expression(4, Add)
- expression 4 operands: lhs = Counter(2), rhs = Counter(3)
Number of file 0 mappings: 9
- Code(Counter(0)) at (prev + 5, 1) to (start + 1, 27)
- Code(Expression(0, Add)) at (prev + 3, 9) to (start + 2, 10)
    = (c0 + c1)
- Code(Expression(1, Sub)) at (prev + 5, 13) to (start + 2, 14)
    = ((c0 + c1) - c2)
- Code(Expression(2, Sub)) at (prev + 6, 21) to (start + 2, 22)
    = (c0 - c2)
- Code(Counter(3)) at (prev + 4, 21) to (start + 0, 27)
- Code(Expression(3, Sub)) at (prev + 4, 21) to (start + 0, 27)
    = (c0 - (c2 + c3))
- Code(Counter(1)) at (prev + 3, 10) to (start + 3, 10)
- Code(Counter(2)) at (prev + 6, 5) to (start + 0, 11)
- 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: Prefer to visit nodes whose predecessors have been visited 2024-12-05 07:57:17 +00:00			`Raw bytes (59): 0x[01, 01, 05, 01, 05, 03, 09, 01, 09, 01, 13, 09, 0d, 09, 01, 05, 01, 01, 1b, 03, 03, 09, 02, 0a, 06, 05, 0d, 02, 0e, 0a, 06, 15, 02, 16, 0d, 04, 15, 00, 1b, 0e, 04, 15, 00, 1b, 05, 03, 0a, 03, 0a, 09, 06, 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`
			`- file 0 => global file 1`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`Number of expressions: 5`
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			`- expression 0 operands: lhs = Counter(0), rhs = Counter(1)`
			`- expression 1 operands: lhs = Expression(0, Add), rhs = Counter(2)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`- expression 2 operands: lhs = Counter(0), rhs = Counter(2)`
coverage: Prefer to visit nodes whose predecessors have been visited 2024-12-05 07:57:17 +00:00			`- expression 3 operands: lhs = Counter(0), rhs = Expression(4, Add)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`- expression 4 operands: lhs = Counter(2), rhs = Counter(3)`
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`
coverage: Add `#[rustfmt::skip]` to tests with non-standard formatting These tests deliberately use non-standard formatting, so that the line execution counts reported by `llvm-cov` reveal additional information about where code regions begin and end. 2024-01-16 02:40:01 +00:00			`- Code(Counter(0)) at (prev + 5, 1) to (start + 1, 27)`
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(Expression(0, Add)) at (prev + 3, 9) to (start + 2, 10)`
			`= (c0 + c1)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`- Code(Expression(1, Sub)) at (prev + 5, 13) to (start + 2, 14)`
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			`= ((c0 + c1) - c2)`
			`- Code(Expression(2, Sub)) at (prev + 6, 21) to (start + 2, 22)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`= (c0 - c2)`
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: Prefer to visit nodes whose predecessors have been visited 2024-12-05 07:57:17 +00:00			`- Code(Expression(3, Sub)) at (prev + 4, 21) to (start + 0, 27)`
			`= (c0 - (c2 + 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			`- Code(Counter(1)) at (prev + 3, 10) to (start + 3, 10)`
			`- Code(Counter(2)) at (prev + 6, 5) to (start + 0, 11)`
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