mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
c924e93ad9
rust/tests/coverage/closure_bug.cov-map

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

90 lines
4.2 KiB
Plaintext
Raw Normal View History

coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
Function name: closure_bug::main
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 04:59:10 -06:00
Raw bytes (97): 0x[01, 01, 04, 01, 05, 01, 09, 01, 0d, 01, 11, 11, 01, 07, 01, 03, 0a, 01, 09, 05, 01, 0e, 05, 01, 0f, 00, 17, 02, 00, 16, 00, 17, 01, 02, 09, 00, 0a, 01, 06, 05, 01, 0e, 09, 01, 0f, 00, 17, 06, 00, 16, 00, 17, 01, 02, 09, 00, 0a, 01, 06, 05, 01, 0e, 0d, 01, 0f, 00, 17, 0a, 00, 16, 00, 17, 01, 02, 09, 00, 0a, 01, 06, 05, 01, 0e, 11, 01, 0f, 00, 17, 0e, 00, 16, 00, 17, 01, 01, 01, 00, 02]
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05: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-13 22:51:24 -05:00
Number of expressions: 4
coverage: Store each BCB's code regions in one coverage statement If a BCB has more than one code region, those extra regions can now all be stored in the same coverage statement, instead of being stored in additional statements.
2023-09-18 23:15:33 -05:00
- expression 0 operands: lhs = Counter(0), rhs = Counter(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-13 22:51:24 -05:00
- expression 1 operands: lhs = Counter(0), rhs = Counter(2)
- expression 2 operands: lhs = Counter(0), rhs = Counter(3)
- expression 3 operands: lhs = Counter(0), rhs = Counter(4)
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
Number of file 0 mappings: 17
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-15 20:40:01 -06:00
- Code(Counter(0)) at (prev + 7, 1) to (start + 3, 10)
coverage: Store each BCB's code regions in one coverage statement If a BCB has more than one code region, those extra regions can now all be stored in the same coverage statement, instead of being stored in additional statements.
2023-09-18 23:15:33 -05:00
- Code(Counter(0)) at (prev + 9, 5) to (start + 1, 14)
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- Code(Counter(1)) at (prev + 1, 15) to (start + 0, 23)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 04:59:10 -06:00
- Code(Expression(0, Sub)) at (prev + 0, 22) to (start + 0, 23)
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
= (c0 - c1)
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-13 22:51:24 -05:00
- Code(Counter(0)) at (prev + 2, 9) to (start + 0, 10)
- Code(Counter(0)) at (prev + 6, 5) to (start + 1, 14)
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- Code(Counter(2)) at (prev + 1, 15) to (start + 0, 23)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 04:59:10 -06:00
- Code(Expression(1, Sub)) at (prev + 0, 22) to (start + 0, 23)
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-13 22:51:24 -05:00
= (c0 - c2)
- Code(Counter(0)) at (prev + 2, 9) to (start + 0, 10)
- Code(Counter(0)) at (prev + 6, 5) to (start + 1, 14)
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- Code(Counter(3)) at (prev + 1, 15) to (start + 0, 23)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 04:59:10 -06:00
- Code(Expression(2, Sub)) at (prev + 0, 22) to (start + 0, 23)
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-13 22:51:24 -05:00
= (c0 - c3)
- Code(Counter(0)) at (prev + 2, 9) to (start + 0, 10)
- Code(Counter(0)) at (prev + 6, 5) to (start + 1, 14)
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- Code(Counter(4)) at (prev + 1, 15) to (start + 0, 23)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 04:59:10 -06:00
- Code(Expression(3, Sub)) at (prev + 0, 22) to (start + 0, 23)
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-13 22:51:24 -05:00
= (c0 - c4)
- Code(Counter(0)) 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-07 21:13:05 -05:00
Highest counter ID seen: c4
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
Function name: closure_bug::main::{closure#0}
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-13 22:51:24 -05:00
Raw bytes (26): 0x[01, 01, 01, 01, 05, 04, 01, 0e, 09, 00, 12, 05, 00, 15, 00, 19, 02, 00, 23, 00, 28, 01, 00, 29, 00, 2a]
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05: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-13 22:51:24 -05:00
Number of expressions: 1
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
Number of file 0 mappings: 4
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-15 20:40:01 -06:00
- Code(Counter(0)) at (prev + 14, 9) to (start + 0, 18)
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- 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)
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-13 22:51:24 -05:00
- Code(Counter(0)) at (prev + 0, 41) to (start + 0, 42)
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-07 21:13:05 -05:00
Highest counter ID seen: c1
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
Function name: closure_bug::main::{closure#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-13 22:51:24 -05:00
Raw bytes (26): 0x[01, 01, 01, 01, 05, 04, 01, 17, 09, 00, 12, 05, 00, 15, 00, 19, 02, 00, 23, 00, 28, 01, 00, 29, 00, 2a]
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05: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-13 22:51:24 -05:00
Number of expressions: 1
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
Number of file 0 mappings: 4
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-15 20:40:01 -06:00
- Code(Counter(0)) at (prev + 23, 9) to (start + 0, 18)
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- 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)
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-13 22:51:24 -05:00
- Code(Counter(0)) at (prev + 0, 41) to (start + 0, 42)
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-07 21:13:05 -05:00
Highest counter ID seen: c1
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
Function name: closure_bug::main::{closure#2}
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-13 22:51:24 -05:00
Raw bytes (26): 0x[01, 01, 01, 01, 05, 04, 01, 20, 09, 00, 12, 05, 00, 15, 00, 19, 02, 00, 23, 00, 28, 01, 00, 29, 00, 2a]
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05: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-13 22:51:24 -05:00
Number of expressions: 1
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
Number of file 0 mappings: 4
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-15 20:40:01 -06:00
- Code(Counter(0)) at (prev + 32, 9) to (start + 0, 18)
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- 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)
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-13 22:51:24 -05:00
- Code(Counter(0)) at (prev + 0, 41) to (start + 0, 42)
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-07 21:13:05 -05:00
Highest counter ID seen: c1
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
Function name: closure_bug::main::{closure#3}
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-13 22:51:24 -05:00
Raw bytes (26): 0x[01, 01, 01, 01, 05, 04, 01, 29, 09, 00, 12, 05, 00, 15, 00, 19, 02, 00, 23, 00, 28, 01, 00, 29, 00, 2a]
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05: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-13 22:51:24 -05:00
Number of expressions: 1
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
Number of file 0 mappings: 4
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-15 20:40:01 -06:00
- Code(Counter(0)) at (prev + 41, 9) to (start + 0, 18)
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
- 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)
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-13 22:51:24 -05:00
- Code(Counter(0)) at (prev + 0, 41) to (start + 0, 42)
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-07 21:13:05 -05:00
Highest counter ID seen: c1
coverage: Regression test for inconsistent handling of closure spans
2023-09-18 07:19:16 -05:00
Reference in New Issue Copy Permalink