mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
11c7f632a2
rust/tests/coverage/attr/nested.cov-map

21 lines
700 B
Plaintext
Raw Normal View History

Add more thorough coverage tests for `#[coverage(..)]` in nested functions These tests reflect the current implementation behaviour, which is not necessarily the desired behaviour.
2024-06-18 05:02:21 -05:00
Function name: nested::closure_expr
coverage: Extract hole spans from HIR instead of MIR This makes it possible to treat more kinds of nested item/code as holes, instead of being restricted to closures.
2024-06-30 22:29:54 -05:00
Raw bytes (14): 0x[01, 01, 00, 02, 01, 3f, 01, 01, 0f, 01, 0b, 05, 01, 02]
Add more thorough coverage tests for `#[coverage(..)]` in nested functions These tests reflect the current implementation behaviour, which is not necessarily the desired behaviour.
2024-06-18 05:02:21 -05:00
Number of files: 1
- file 0 => global file 1
Number of expressions: 0
Number of file 0 mappings: 2
coverage: Extract hole spans from HIR instead of MIR This makes it possible to treat more kinds of nested item/code as holes, instead of being restricted to closures.
2024-06-30 22:29:54 -05:00
- Code(Counter(0)) at (prev + 63, 1) to (start + 1, 15)
Add more thorough coverage tests for `#[coverage(..)]` in nested functions These tests reflect the current implementation behaviour, which is not necessarily the desired behaviour.
2024-06-18 05:02:21 -05:00
- Code(Counter(0)) at (prev + 11, 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-07 21:13:05 -05:00
Highest counter ID seen: c0
Add more thorough coverage tests for `#[coverage(..)]` in nested functions These tests reflect the current implementation behaviour, which is not necessarily the desired behaviour.
2024-06-18 05:02:21 -05:00
Function name: nested::closure_tail
coverage: Extract hole spans from HIR instead of MIR This makes it possible to treat more kinds of nested item/code as holes, instead of being restricted to closures.
2024-06-30 22:29:54 -05:00
Raw bytes (14): 0x[01, 01, 00, 02, 01, 4e, 01, 01, 0f, 01, 11, 05, 01, 02]
Add more thorough coverage tests for `#[coverage(..)]` in nested functions These tests reflect the current implementation behaviour, which is not necessarily the desired behaviour.
2024-06-18 05:02:21 -05:00
Number of files: 1
- file 0 => global file 1
Number of expressions: 0
Number of file 0 mappings: 2
coverage: Extract hole spans from HIR instead of MIR This makes it possible to treat more kinds of nested item/code as holes, instead of being restricted to closures.
2024-06-30 22:29:54 -05:00
- Code(Counter(0)) at (prev + 78, 1) to (start + 1, 15)
Add more thorough coverage tests for `#[coverage(..)]` in nested functions These tests reflect the current implementation behaviour, which is not necessarily the desired behaviour.
2024-06-18 05:02:21 -05:00
- Code(Counter(0)) at (prev + 17, 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-07 21:13:05 -05:00
Highest counter ID seen: c0
Add more thorough coverage tests for `#[coverage(..)]` in nested functions These tests reflect the current implementation behaviour, which is not necessarily the desired behaviour.
2024-06-18 05:02:21 -05:00
Reference in New Issue Copy Permalink