nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2025-06-21 12:07:31 +00:00
Code Issues Packages Projects Releases Wiki Activity
444a62712a
rust/tests/coverage/branch/match-trivial.cov-map

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

25 lines
1.0 KiB
Plaintext
Raw Normal View History

coverage: Branch coverage tests for match arms
2024-04-17 02:32:11 +00:00
Function name: match_trivial::_uninhabited (unused)
coverage: Only merge adjacent coverage spans This also removes some manipulation of the function signature span that only made sense in the context of merging non-adjacent spans.
2025-04-12 07:52:55 +00:00
Raw bytes (14): 0x[01, 01, 00, 02, 00, 16, 01, 00, 20, 00, 01, 05, 00, 0e]
coverage: Branch coverage tests for match arms
2024-04-17 02:32:11 +00:00
Number of files: 1
coverage-dump: Dump filenames instead of global file IDs (and bless)
2025-04-24 07:36:50 +00:00
- file 0 => $DIR/match-trivial.rs
coverage: Branch coverage tests for match arms
2024-04-17 02:32:11 +00:00
Number of expressions: 0
coverage: Only merge adjacent coverage spans This also removes some manipulation of the function signature span that only made sense in the context of merging non-adjacent spans.
2025-04-12 07:52:55 +00:00
Number of file 0 mappings: 2
- Code(Zero) at (prev + 22, 1) to (start + 0, 32)
- Code(Zero) at (prev + 1, 5) to (start + 0, 14)
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: (none)
coverage: Branch coverage tests for match arms
2024-04-17 02:32:11 +00:00
Function name: match_trivial::trivial
coverage: Only merge adjacent coverage spans This also removes some manipulation of the function signature span that only made sense in the context of merging non-adjacent spans.
2025-04-12 07:52:55 +00:00
Raw bytes (34): 0x[01, 01, 00, 06, 01, 1e, 01, 00, 17, 01, 01, 05, 00, 0e, 01, 02, 0b, 00, 0c, 01, 01, 1b, 00, 22, 01, 03, 05, 00, 0c, 01, 01, 01, 00, 02]
coverage: Branch coverage tests for match arms
2024-04-17 02:32:11 +00:00
Number of files: 1
coverage-dump: Dump filenames instead of global file IDs (and bless)
2025-04-24 07:36:50 +00:00
- file 0 => $DIR/match-trivial.rs
coverage: Branch coverage tests for match arms
2024-04-17 02:32:11 +00:00
Number of expressions: 0
coverage: Only merge adjacent coverage spans This also removes some manipulation of the function signature span that only made sense in the context of merging non-adjacent spans.
2025-04-12 07:52:55 +00:00
Number of file 0 mappings: 6
- Code(Counter(0)) at (prev + 30, 1) to (start + 0, 23)
- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 14)
- Code(Counter(0)) at (prev + 2, 11) to (start + 0, 12)
- Code(Counter(0)) at (prev + 1, 27) to (start + 0, 34)
- Code(Counter(0)) at (prev + 3, 5) to (start + 0, 12)
- Code(Counter(0)) at (prev + 1, 1) to (start + 0, 2)
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
Highest counter ID seen: c0
coverage: Branch coverage tests for match arms
2024-04-17 02:32:11 +00:00
Reference in New Issue Copy Permalink