rust/tests/coverage/assert_not.cov-map

Function name: assert_not::main
Raw bytes (54): 0x[01, 01, 00, 0a, 01, 06, 01, 00, 0a, 01, 01, 05, 00, 0c, 01, 00, 0d, 00, 11, 01, 01, 05, 00, 0c, 01, 00, 0d, 00, 13, 01, 01, 05, 00, 0c, 01, 00, 0d, 00, 13, 01, 01, 05, 00, 0c, 01, 00, 0d, 00, 15, 01, 01, 01, 00, 02]
Number of files: 1
- file 0 => $DIR/assert_not.rs
Number of expressions: 0
Number of file 0 mappings: 10
- Code(Counter(0)) at (prev + 6, 1) to (start + 0, 10)
- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 12)
- Code(Counter(0)) at (prev + 0, 13) to (start + 0, 17)
- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 12)
- Code(Counter(0)) at (prev + 0, 13) to (start + 0, 19)
- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 12)
- Code(Counter(0)) at (prev + 0, 13) to (start + 0, 19)
- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 12)
- Code(Counter(0)) at (prev + 0, 13) to (start + 0, 21)
- Code(Counter(0)) at (prev + 1, 1) to (start + 0, 2)
Highest counter ID seen: c0
coverage: Regression test for `assert!(!false)` 2023-12-16 09:57:20 +00:00			`Function name: assert_not::main`
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 (54): 0x[01, 01, 00, 0a, 01, 06, 01, 00, 0a, 01, 01, 05, 00, 0c, 01, 00, 0d, 00, 11, 01, 01, 05, 00, 0c, 01, 00, 0d, 00, 13, 01, 01, 05, 00, 0c, 01, 00, 0d, 00, 13, 01, 01, 05, 00, 0c, 01, 00, 0d, 00, 15, 01, 01, 01, 00, 02]`
coverage: Regression test for `assert!(!false)` 2023-12-16 09:57:20 +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/assert_not.rs`
coverage: Don't create counters for code that was removed by MIR opts 2025-01-25 07:24:02 +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: 10`
			`- Code(Counter(0)) at (prev + 6, 1) to (start + 0, 10)`
			`- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 12)`
			`- Code(Counter(0)) at (prev + 0, 13) to (start + 0, 17)`
			`- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 12)`
			`- Code(Counter(0)) at (prev + 0, 13) to (start + 0, 19)`
			`- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 12)`
			`- Code(Counter(0)) at (prev + 0, 13) to (start + 0, 19)`
			`- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 12)`
			`- Code(Counter(0)) at (prev + 0, 13) to (start + 0, 21)`
coverage: Eliminate more counters by giving them to unreachable nodes When preparing a function's coverage counters and metadata during codegen, any part of the original coverage graph that was removed by MIR optimizations can be treated as having an execution count of zero. Somewhat counter-intuitively, if we give those unreachable nodes a _higher_ priority for receiving physical counters (instead of counter expressions), that ends up reducing the total number of physical counters needed. This works because if a node is unreachable, we don't actually create a physical counter for it. Instead that node gets a fixed zero counter, and any other node that would have relied on that physical counter in its counter expression can just ignore that term completely. 2025-02-11 03:09:11 +00:00			`- Code(Counter(0)) at (prev + 1, 1) to (start + 0, 2)`
			`Highest counter ID seen: c0`
coverage: Regression test for `assert!(!false)` 2023-12-16 09:57:20 +00:00