nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2025-06-05 19:58:32 +00:00
Code Issues Packages Projects Releases Wiki Activity
414482f6a0
rust/tests/coverage/match_or_pattern.cov-map

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

59 lines
3.4 KiB
Plaintext
Raw Normal View History

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: match_or_pattern::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 (190): 0x[01, 01, 08, 01, 05, 01, 09, 01, 0d, 01, 11, 01, 15, 01, 19, 01, 1d, 01, 21, 22, 01, 01, 01, 00, 0a, 01, 04, 09, 00, 10, 01, 00, 13, 00, 2e, 01, 02, 09, 00, 0e, 01, 00, 10, 00, 12, 01, 00, 15, 00, 16, 01, 01, 09, 00, 0e, 01, 00, 10, 00, 12, 01, 00, 15, 00, 16, 01, 01, 08, 00, 0f, 05, 00, 10, 03, 06, 02, 03, 05, 00, 06, 01, 01, 0b, 00, 11, 06, 03, 1b, 00, 1d, 09, 01, 0e, 00, 10, 01, 02, 08, 00, 0f, 0d, 00, 10, 03, 06, 0a, 03, 05, 00, 06, 01, 01, 0b, 00, 11, 0e, 01, 1b, 00, 1d, 11, 01, 0e, 00, 10, 01, 02, 08, 00, 0f, 15, 00, 10, 03, 06, 12, 03, 05, 00, 06, 01, 01, 0b, 00, 11, 16, 01, 1b, 00, 1d, 19, 01, 0e, 00, 10, 01, 02, 08, 00, 0f, 1d, 00, 10, 03, 06, 1a, 03, 05, 00, 06, 01, 01, 0b, 00, 11, 1e, 01, 1b, 00, 1d, 21, 01, 0e, 00, 10, 01, 02, 01, 00, 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
coverage-dump: Dump filenames instead of global file IDs (and bless)
2025-04-24 07:36:50 +00:00
- file 0 => $DIR/match_or_pattern.rs
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
Number of expressions: 8
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 0 operands: lhs = Counter(0), rhs = Counter(1)
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00: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)
- expression 4 operands: lhs = Counter(0), rhs = Counter(5)
- expression 5 operands: lhs = Counter(0), rhs = Counter(6)
- expression 6 operands: lhs = Counter(0), rhs = Counter(7)
- expression 7 operands: lhs = Counter(0), rhs = Counter(8)
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: 34
- Code(Counter(0)) at (prev + 1, 1) to (start + 0, 10)
- Code(Counter(0)) at (prev + 4, 9) to (start + 0, 16)
- Code(Counter(0)) at (prev + 0, 19) to (start + 0, 46)
- Code(Counter(0)) at (prev + 2, 9) to (start + 0, 14)
- Code(Counter(0)) at (prev + 0, 16) to (start + 0, 18)
- Code(Counter(0)) at (prev + 0, 21) to (start + 0, 22)
- Code(Counter(0)) at (prev + 1, 9) to (start + 0, 14)
- Code(Counter(0)) at (prev + 0, 16) to (start + 0, 18)
- Code(Counter(0)) at (prev + 0, 21) to (start + 0, 22)
- Code(Counter(0)) at (prev + 1, 8) to (start + 0, 15)
- Code(Counter(1)) at (prev + 0, 16) to (start + 3, 6)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 10:59:10 +00:00
- Code(Expression(0, Sub)) at (prev + 3, 5) to (start + 0, 6)
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
= (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-14 03:51:24 +00:00
- Code(Counter(0)) at (prev + 1, 11) to (start + 0, 17)
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
- Code(Expression(1, Sub)) at (prev + 3, 27) to (start + 0, 29)
= (c0 - c2)
- Code(Counter(2)) at (prev + 1, 14) to (start + 0, 16)
- Code(Counter(0)) at (prev + 2, 8) to (start + 0, 15)
- Code(Counter(3)) at (prev + 0, 16) to (start + 3, 6)
- Code(Expression(2, Sub)) at (prev + 3, 5) to (start + 0, 6)
= (c0 - c3)
- Code(Counter(0)) at (prev + 1, 11) to (start + 0, 17)
- Code(Expression(3, Sub)) at (prev + 1, 27) to (start + 0, 29)
= (c0 - c4)
- Code(Counter(4)) at (prev + 1, 14) to (start + 0, 16)
- Code(Counter(0)) at (prev + 2, 8) to (start + 0, 15)
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, 16) to (start + 3, 6)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 10:59:10 +00:00
- Code(Expression(4, Sub)) at (prev + 3, 5) to (start + 0, 6)
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
= (c0 - c5)
- Code(Counter(0)) at (prev + 1, 11) to (start + 0, 17)
- Code(Expression(5, Sub)) at (prev + 1, 27) to (start + 0, 29)
= (c0 - c6)
- Code(Counter(6)) at (prev + 1, 14) to (start + 0, 16)
- Code(Counter(0)) at (prev + 2, 8) to (start + 0, 15)
- Code(Counter(7)) at (prev + 0, 16) to (start + 3, 6)
- Code(Expression(6, Sub)) at (prev + 3, 5) to (start + 0, 6)
= (c0 - c7)
- Code(Counter(0)) at (prev + 1, 11) to (start + 0, 17)
- Code(Expression(7, Sub)) at (prev + 1, 27) to (start + 0, 29)
= (c0 - c8)
- Code(Counter(8)) at (prev + 1, 14) to (start + 0, 16)
- Code(Counter(0)) at (prev + 2, 1) to (start + 0, 2)
Highest counter ID seen: c8
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
Reference in New Issue Copy Permalink