rust/tests/coverage/abort.cov-map

Function name: abort::main
Raw bytes (89): 0x[01, 01, 0a, 07, 09, 01, 05, 03, 0d, 03, 13, 0d, 11, 03, 0d, 03, 1f, 0d, 15, 03, 0d, 05, 09, 0d, 01, 0d, 01, 01, 1b, 03, 02, 0b, 00, 18, 22, 01, 0c, 00, 19, 11, 00, 1a, 02, 0a, 0e, 02, 09, 00, 0a, 22, 02, 0c, 00, 19, 15, 00, 1a, 00, 31, 1a, 00, 30, 00, 31, 22, 04, 0c, 00, 19, 05, 00, 1a, 00, 31, 09, 00, 30, 00, 31, 27, 01, 09, 00, 17, 0d, 02, 05, 01, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 10
- expression 0 operands: lhs = Expression(1, Add), rhs = Counter(2)
- expression 1 operands: lhs = Counter(0), rhs = Counter(1)
- expression 2 operands: lhs = Expression(0, Add), rhs = Counter(3)
- expression 3 operands: lhs = Expression(0, Add), rhs = Expression(4, Add)
- expression 4 operands: lhs = Counter(3), rhs = Counter(4)
- expression 5 operands: lhs = Expression(0, Add), rhs = Counter(3)
- expression 6 operands: lhs = Expression(0, Add), rhs = Expression(7, Add)
- expression 7 operands: lhs = Counter(3), rhs = Counter(5)
- expression 8 operands: lhs = Expression(0, Add), rhs = Counter(3)
- expression 9 operands: lhs = Counter(1), rhs = Counter(2)
Number of file 0 mappings: 13
- Code(Counter(0)) at (prev + 13, 1) to (start + 1, 27)
- Code(Expression(0, Add)) at (prev + 2, 11) to (start + 0, 24)
    = ((c0 + c1) + c2)
- Code(Expression(8, Sub)) at (prev + 1, 12) to (start + 0, 25)
    = (((c0 + c1) + c2) - c3)
- Code(Counter(4)) at (prev + 0, 26) to (start + 2, 10)
- Code(Expression(3, Sub)) at (prev + 2, 9) to (start + 0, 10)
    = (((c0 + c1) + c2) - (c3 + c4))
- Code(Expression(8, Sub)) at (prev + 2, 12) to (start + 0, 25)
    = (((c0 + c1) + c2) - c3)
- Code(Counter(5)) at (prev + 0, 26) to (start + 0, 49)
- Code(Expression(6, Sub)) at (prev + 0, 48) to (start + 0, 49)
    = (((c0 + c1) + c2) - (c3 + c5))
- Code(Expression(8, Sub)) at (prev + 4, 12) to (start + 0, 25)
    = (((c0 + c1) + c2) - c3)
- Code(Counter(1)) at (prev + 0, 26) to (start + 0, 49)
- Code(Counter(2)) at (prev + 0, 48) to (start + 0, 49)
- Code(Expression(9, Add)) at (prev + 1, 9) to (start + 0, 23)
    = (c1 + c2)
- Code(Counter(3)) at (prev + 2, 5) to (start + 1, 2)
Highest counter ID seen: c5

Function name: abort::might_abort
Raw bytes (21): 0x[01, 01, 01, 01, 05, 03, 01, 03, 01, 01, 14, 05, 02, 09, 01, 24, 02, 02, 0c, 03, 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 + 3, 1) to (start + 1, 20)
- Code(Counter(1)) at (prev + 2, 9) to (start + 1, 36)
- Code(Expression(0, Sub)) at (prev + 2, 12) to (start + 3, 2)
    = (c0 - c1)
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: abort::main`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`Raw bytes (89): 0x[01, 01, 0a, 07, 09, 01, 05, 03, 0d, 03, 13, 0d, 11, 03, 0d, 03, 1f, 0d, 15, 03, 0d, 05, 09, 0d, 01, 0d, 01, 01, 1b, 03, 02, 0b, 00, 18, 22, 01, 0c, 00, 19, 11, 00, 1a, 02, 0a, 0e, 02, 09, 00, 0a, 22, 02, 0c, 00, 19, 15, 00, 1a, 00, 31, 1a, 00, 30, 00, 31, 22, 04, 0c, 00, 19, 05, 00, 1a, 00, 31, 09, 00, 30, 00, 31, 27, 01, 09, 00, 17, 0d, 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: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 03:51:24 +00:00			`Number of expressions: 10`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`- expression 0 operands: lhs = Expression(1, Add), rhs = Counter(2)`
			`- expression 1 operands: lhs = Counter(0), rhs = Counter(1)`
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 2 operands: lhs = Expression(0, Add), rhs = Counter(3)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`- expression 3 operands: lhs = Expression(0, Add), rhs = Expression(4, Add)`
			`- expression 4 operands: lhs = Counter(3), rhs = Counter(4)`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 03:51:24 +00:00			`- expression 5 operands: lhs = Expression(0, Add), rhs = Counter(3)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`- expression 6 operands: lhs = Expression(0, Add), rhs = Expression(7, Add)`
			`- expression 7 operands: lhs = Counter(3), rhs = Counter(5)`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 03:51:24 +00:00			`- expression 8 operands: lhs = Expression(0, Add), rhs = Counter(3)`
			`- expression 9 operands: lhs = Counter(1), 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: 13`
Remove c_unwind from tests and fix tests 2023-08-25 12:52:51 +00:00			`- Code(Counter(0)) at (prev + 13, 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 + 2, 11) to (start + 0, 24)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`= ((c0 + c1) + c2)`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 03:51:24 +00:00			`- Code(Expression(8, Sub)) at (prev + 1, 12) to (start + 0, 25)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`= (((c0 + c1) + 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(4)) at (prev + 0, 26) to (start + 2, 10)`
coverage: Restrict empty-span expansion to only cover `{` and `}` 2024-11-05 10:59:10 +00:00			`- Code(Expression(3, Sub)) at (prev + 2, 9) to (start + 0, 10)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`= (((c0 + c1) + c2) - (c3 + c4))`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 03:51:24 +00:00			`- Code(Expression(8, Sub)) at (prev + 2, 12) to (start + 0, 25)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`= (((c0 + c1) + 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(5)) at (prev + 0, 26) to (start + 0, 49)`
coverage: Restrict empty-span expansion to only cover `{` and `}` 2024-11-05 10:59:10 +00:00			`- Code(Expression(6, Sub)) at (prev + 0, 48) to (start + 0, 49)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`= (((c0 + c1) + c2) - (c3 + c5))`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 03:51:24 +00:00			`- Code(Expression(8, Sub)) at (prev + 4, 12) to (start + 0, 25)`
coverage: Add an extra "transcribe" step after counter creation 2024-11-29 01:58:35 +00:00			`= (((c0 + c1) + 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 + 0, 26) to (start + 0, 49)`
coverage: Restrict empty-span expansion to only cover `{` and `}` 2024-11-05 10:59:10 +00:00			`- Code(Counter(2)) at (prev + 0, 48) to (start + 0, 49)`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 03:51:24 +00:00			`- Code(Expression(9, Add)) at (prev + 1, 9) to (start + 0, 23)`
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			`= (c1 + c2)`
			`- Code(Counter(3)) at (prev + 2, 5) to (start + 1, 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: c5`
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: abort::might_abort`
Remove c_unwind from tests and fix tests 2023-08-25 12:52:51 +00:00			`Raw bytes (21): 0x[01, 01, 01, 01, 05, 03, 01, 03, 01, 01, 14, 05, 02, 09, 01, 24, 02, 02, 0c, 03, 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`
			`Number of expressions: 1`
			`- expression 0 operands: lhs = Counter(0), rhs = Counter(1)`
			`Number of file 0 mappings: 3`
Remove c_unwind from tests and fix tests 2023-08-25 12:52:51 +00:00			`- Code(Counter(0)) at (prev + 3, 1) to (start + 1, 20)`
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 + 2, 9) to (start + 1, 36)`
			`- Code(Expression(0, Sub)) at (prev + 2, 12) to (start + 3, 2)`
			`= (c0 - c1)`
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