nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2025-04-28 19:17:43 +00:00
Code Issues Packages Projects Releases Wiki Activity
20d051ec87
rust/tests/coverage/loops_branches.cov-map

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

93 lines
4.9 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: <loops_branches::DebugTest as core::fmt::Debug>::fmt
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
Raw bytes (116): 0x[01, 01, 06, 05, 00, 1d, 00, 0f, 13, 01, 19, 11, 15, 15, 19, 14, 01, 09, 05, 01, 10, 05, 02, 10, 00, 15, 00, 01, 17, 00, 1b, 00, 00, 1c, 00, 1e, 02, 01, 0d, 00, 0e, 05, 01, 0d, 00, 1e, 11, 00, 1e, 00, 1f, 00, 01, 10, 01, 0a, 19, 03, 0d, 00, 0e, 15, 00, 12, 00, 17, 19, 01, 10, 00, 14, 1d, 01, 14, 00, 19, 00, 01, 1b, 00, 1f, 00, 00, 20, 00, 22, 06, 01, 11, 00, 12, 1d, 01, 11, 00, 22, 0a, 00, 22, 00, 23, 00, 01, 14, 01, 0e, 16, 03, 09, 00, 0f, 01, 01, 05, 00, 06]
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
- file 0 => global file 1
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
Number of expressions: 6
coverage: Consistently remove unused counter IDs from expressions/mappings
2023-10-24 11:48:59 +00:00
- expression 0 operands: lhs = Counter(1), rhs = Zero
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
- expression 1 operands: lhs = Counter(7), rhs = Zero
- expression 2 operands: lhs = Expression(3, Add), rhs = Expression(4, Add)
- expression 3 operands: lhs = Counter(0), rhs = Counter(6)
- expression 4 operands: lhs = Counter(4), rhs = Counter(5)
- expression 5 operands: lhs = Counter(5), rhs = Counter(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
Number of file 0 mappings: 20
- Code(Counter(0)) at (prev + 9, 5) to (start + 1, 16)
- Code(Counter(1)) at (prev + 2, 16) to (start + 0, 21)
- Code(Zero) at (prev + 1, 23) to (start + 0, 27)
- Code(Zero) at (prev + 0, 28) to (start + 0, 30)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 10:59:10 +00:00
- Code(Expression(0, Sub)) at (prev + 1, 13) to (start + 0, 14)
coverage: Consistently remove unused counter IDs from expressions/mappings
2023-10-24 11:48:59 +00:00
= (c1 - Zero)
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(1)) at (prev + 1, 13) to (start + 0, 30)
coverage: Add an extra "transcribe" step after counter creation
2024-11-29 01:58:35 +00:00
- Code(Counter(4)) at (prev + 0, 30) to (start + 0, 31)
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(Zero) at (prev + 1, 16) to (start + 1, 10)
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
- Code(Counter(6)) at (prev + 3, 13) to (start + 0, 14)
- Code(Counter(5)) at (prev + 0, 18) to (start + 0, 23)
- Code(Counter(6)) at (prev + 1, 16) to (start + 0, 20)
- Code(Counter(7)) at (prev + 1, 20) to (start + 0, 25)
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(Zero) at (prev + 1, 27) to (start + 0, 31)
- Code(Zero) at (prev + 0, 32) to (start + 0, 34)
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
- Code(Expression(1, Sub)) at (prev + 1, 17) to (start + 0, 18)
= (c7 - Zero)
- Code(Counter(7)) at (prev + 1, 17) to (start + 0, 34)
- Code(Expression(2, Sub)) at (prev + 0, 34) to (start + 0, 35)
= ((c0 + c6) - (c4 + c5))
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(Zero) at (prev + 1, 20) to (start + 1, 14)
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
- Code(Expression(5, Sub)) at (prev + 3, 9) to (start + 0, 15)
= (c5 - c6)
- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 6)
Highest counter ID seen: c7
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: <loops_branches::DisplayTest as core::fmt::Display>::fmt
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
Raw bytes (122): 0x[01, 01, 09, 01, 00, 01, 00, 0d, 00, 0d, 00, 0d, 00, 1b, 1f, 01, 0d, 09, 1d, 09, 0d, 14, 01, 22, 05, 01, 11, 00, 01, 12, 01, 0a, 02, 02, 10, 00, 15, 00, 01, 17, 00, 1b, 00, 00, 1c, 00, 1e, 06, 01, 0d, 00, 0e, 02, 01, 0d, 00, 1e, 1d, 00, 1e, 00, 1f, 0d, 02, 0d, 00, 0e, 09, 00, 12, 00, 17, 0d, 01, 10, 00, 15, 00, 00, 16, 01, 0e, 12, 02, 14, 00, 19, 00, 01, 1b, 00, 1f, 00, 00, 20, 00, 22, 0e, 01, 11, 00, 12, 12, 01, 11, 00, 22, 16, 00, 22, 00, 23, 22, 03, 09, 00, 0f, 01, 01, 05, 00, 06]
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
- file 0 => global file 1
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
Number of expressions: 9
coverage: Consistently remove unused counter IDs from expressions/mappings
2023-10-24 11:48:59 +00:00
- expression 0 operands: lhs = Counter(0), rhs = Zero
coverage: Add an extra "transcribe" step after counter creation
2024-11-29 01:58:35 +00:00
- expression 1 operands: lhs = Counter(0), rhs = Zero
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
- expression 2 operands: lhs = Counter(3), rhs = Zero
- expression 3 operands: lhs = Counter(3), rhs = Zero
- expression 4 operands: lhs = Counter(3), rhs = Zero
- expression 5 operands: lhs = Expression(6, Add), rhs = Expression(7, Add)
- expression 6 operands: lhs = Counter(0), rhs = Counter(3)
- expression 7 operands: lhs = Counter(2), rhs = Counter(7)
- expression 8 operands: lhs = Counter(2), rhs = Counter(3)
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 file 0 mappings: 20
- Code(Counter(0)) at (prev + 34, 5) to (start + 1, 17)
- Code(Zero) at (prev + 1, 18) to (start + 1, 10)
- Code(Expression(0, Sub)) at (prev + 2, 16) to (start + 0, 21)
coverage: Consistently remove unused counter IDs from expressions/mappings
2023-10-24 11:48:59 +00:00
= (c0 - Zero)
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(Zero) at (prev + 1, 23) to (start + 0, 27)
- Code(Zero) at (prev + 0, 28) to (start + 0, 30)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 10:59:10 +00:00
- Code(Expression(1, Sub)) at (prev + 1, 13) to (start + 0, 14)
coverage: Add an extra "transcribe" step after counter creation
2024-11-29 01:58:35 +00:00
= (c0 - Zero)
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(Expression(0, Sub)) at (prev + 1, 13) to (start + 0, 30)
= (c0 - Zero)
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
- Code(Counter(7)) at (prev + 0, 30) to (start + 0, 31)
- Code(Counter(3)) at (prev + 2, 13) to (start + 0, 14)
- Code(Counter(2)) at (prev + 0, 18) to (start + 0, 23)
- Code(Counter(3)) at (prev + 1, 16) to (start + 0, 21)
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(Zero) at (prev + 0, 22) to (start + 1, 14)
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
- Code(Expression(4, Sub)) at (prev + 2, 20) to (start + 0, 25)
= (c3 - Zero)
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(Zero) at (prev + 1, 27) to (start + 0, 31)
- Code(Zero) at (prev + 0, 32) to (start + 0, 34)
coverage: Completely overhaul counter assignment, using node-flow graphs
2025-01-12 10:36:07 +00:00
- Code(Expression(3, Sub)) at (prev + 1, 17) to (start + 0, 18)
= (c3 - Zero)
- Code(Expression(4, Sub)) at (prev + 1, 17) to (start + 0, 34)
= (c3 - Zero)
- Code(Expression(5, Sub)) at (prev + 0, 34) to (start + 0, 35)
= ((c0 + c3) - (c2 + c7))
- Code(Expression(8, Sub)) at (prev + 3, 9) to (start + 0, 15)
= (c2 - c3)
- Code(Counter(0)) at (prev + 1, 5) to (start + 0, 6)
Highest counter ID seen: c7
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: loops_branches::main
Raw bytes (9): 0x[01, 01, 00, 01, 01, 37, 01, 05, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 0
Number of file 0 mappings: 1
- Code(Counter(0)) at (prev + 55, 1) to (start + 5, 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-08 02:13:05 +00:00
Highest counter ID seen: c0
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