nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2025-04-29 03:27:44 +00:00
Code Issues Packages Projects Releases Wiki Activity
ef148cd7eb
rust/tests/coverage/conditions.cov-map

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

193 lines
12 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: conditions::main
coverage: Prefer to visit nodes whose predecessors have been visited
2024-12-05 07:57:17 +00:00
Raw bytes (545): 0x[01, 01, 4d, 09, 0d, 01, 09, 0d, 71, 0d, 27, 71, 75, 27, 79, 71, 75, 0d, 23, 27, 79, 71, 75, 01, 03, 03, 15, 19, 65, 19, 4f, 65, 69, 4f, 6d, 65, 69, 19, 4b, 4f, 6d, 65, 69, 03, ef, 01, 15, 19, 15, 19, 1d, 25, 29, 59, 29, 7f, 59, 5d, 7f, 61, 59, 5d, 29, 7b, 7f, 61, 59, 5d, 1d, 87, 01, 25, 29, e7, 01, 1d, eb, 01, 29, ef, 01, 25, 15, 19, 31, 35, e7, 01, 1d, eb, 01, 29, ef, 01, 25, 15, 19, e7, 01, f7, 01, eb, 01, 29, ef, 01, 25, 15, 19, 1d, 31, 35, 4d, 35, df, 01, 4d, 51, df, 01, 55, 4d, 51, 35, db, 01, df, 01, 55, 4d, 51, e7, 01, f3, 01, eb, 01, 29, ef, 01, 25, 15, 19, f7, 01, 35, 1d, 31, 39, 3d, 31, 35, af, 02, 39, 31, 35, 3d, 41, 3d, a7, 02, 41, 45, a7, 02, 49, 41, 45, 3d, a3, 02, a7, 02, 49, 41, 45, af, 02, b3, 02, 31, 35, 39, 3d, 44, 01, 03, 01, 02, 0c, 05, 02, 0d, 02, 06, 00, 02, 05, 00, 06, 03, 03, 09, 00, 0a, 01, 00, 10, 00, 1d, 09, 01, 09, 01, 0a, 06, 02, 0f, 00, 1c, 0d, 01, 0c, 00, 19, 0a, 00, 1d, 00, 2a, 0e, 00, 2e, 00, 3c, 23, 00, 3d, 02, 0a, 1e, 02, 09, 00, 0a, 0d, 01, 09, 01, 12, 2a, 03, 09, 00, 0f, 03, 03, 09, 01, 0c, 11, 01, 0d, 02, 06, 00, 02, 05, 00, 06, 03, 02, 08, 00, 15, 15, 00, 16, 02, 06, 2e, 02, 0f, 00, 1c, 19, 01, 0c, 00, 19, 32, 00, 1d, 00, 2a, 36, 00, 2e, 00, 3c, 4b, 00, 3d, 02, 0a, 46, 02, 09, 00, 0a, 19, 01, 09, 00, 17, 52, 02, 09, 00, 0f, ef, 01, 03, 08, 00, 0c, 1d, 01, 0d, 01, 10, 21, 01, 11, 02, 0a, 00, 02, 09, 00, 0a, 1d, 02, 0c, 00, 19, 25, 00, 1a, 02, 0a, 5e, 04, 11, 00, 1e, 29, 01, 10, 00, 1d, 62, 00, 21, 00, 2e, 66, 00, 32, 00, 40, 7b, 00, 41, 02, 0e, 76, 02, 0d, 00, 0e, 29, 01, 0d, 00, 1b, 82, 01, 02, 0d, 00, 13, 00, 02, 05, 00, 06, 9e, 01, 02, 09, 01, 0c, 2d, 01, 0d, 02, 06, 00, 02, 05, 00, 06, af, 02, 02, 09, 00, 0a, 9e, 01, 00, 10, 00, 1d, 31, 00, 1e, 02, 06, ae, 01, 02, 0f, 00, 1c, 35, 01, 0c, 00, 19, c2, 01, 00, 1d, 00, 2a, c6, 01, 00, 2e, 00, 3c, db, 01, 00, 3d, 02, 0a, d6, 01, 02, 09, 00, 0a, 35, 01, 09, 00, 17, e2, 01, 02, 0d, 02, 0f, b3, 02, 05, 09, 00, 0a, af, 02, 00, 10, 00, 1d, 39, 00, 1e, 02, 06, 82, 02, 02, 0f, 00, 1c, 3d, 01, 0c, 00, 19, 8a, 02, 00, 1d, 00, 2a, 8e, 02, 00, 2e, 00, 3c, a3, 02, 00, 3d, 02, 0a, 9e, 02, 02, 09, 00, 0a, 3d, 01, 09, 00, 17, aa, 02, 02, 09, 00, 0f, 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
- file 0 => global file 1
coverage: Prefer to visit nodes whose predecessors have been visited
2024-12-05 07:57:17 +00:00
Number of expressions: 77
- expression 0 operands: lhs = Counter(2), rhs = Counter(3)
- expression 1 operands: lhs = Counter(0), rhs = Counter(2)
- expression 2 operands: lhs = Counter(3), rhs = Counter(28)
- expression 3 operands: lhs = Counter(3), rhs = Expression(9, Add)
- expression 4 operands: lhs = Counter(28), rhs = Counter(29)
- expression 5 operands: lhs = Expression(9, Add), rhs = Counter(30)
- expression 6 operands: lhs = Counter(28), rhs = Counter(29)
- expression 7 operands: lhs = Counter(3), rhs = Expression(8, Add)
- expression 8 operands: lhs = Expression(9, Add), rhs = Counter(30)
- expression 9 operands: lhs = Counter(28), rhs = Counter(29)
- expression 10 operands: lhs = Counter(0), rhs = Expression(0, Add)
- expression 11 operands: lhs = Expression(0, Add), rhs = Counter(5)
- expression 12 operands: lhs = Counter(6), rhs = Counter(25)
- expression 13 operands: lhs = Counter(6), rhs = Expression(19, Add)
- expression 14 operands: lhs = Counter(25), rhs = Counter(26)
- expression 15 operands: lhs = Expression(19, Add), rhs = Counter(27)
- expression 16 operands: lhs = Counter(25), rhs = Counter(26)
- expression 17 operands: lhs = Counter(6), rhs = Expression(18, Add)
- expression 18 operands: lhs = Expression(19, Add), rhs = Counter(27)
- expression 19 operands: lhs = Counter(25), rhs = Counter(26)
- expression 20 operands: lhs = Expression(0, Add), rhs = Expression(59, Add)
- expression 21 operands: lhs = Counter(5), rhs = Counter(6)
- expression 22 operands: lhs = Counter(5), rhs = Counter(6)
- expression 23 operands: lhs = Counter(7), rhs = Counter(9)
- expression 24 operands: lhs = Counter(10), rhs = Counter(22)
- expression 25 operands: lhs = Counter(10), rhs = Expression(31, Add)
- expression 26 operands: lhs = Counter(22), rhs = Counter(23)
- expression 27 operands: lhs = Expression(31, Add), rhs = Counter(24)
- expression 28 operands: lhs = Counter(22), rhs = Counter(23)
- expression 29 operands: lhs = Counter(10), rhs = Expression(30, Add)
- expression 30 operands: lhs = Expression(31, Add), rhs = Counter(24)
- expression 31 operands: lhs = Counter(22), rhs = Counter(23)
- expression 32 operands: lhs = Counter(7), rhs = Expression(33, Add)
- expression 33 operands: lhs = Counter(9), rhs = Counter(10)
- expression 34 operands: lhs = Expression(57, Add), rhs = Counter(7)
- expression 35 operands: lhs = Expression(58, Add), rhs = Counter(10)
- expression 36 operands: lhs = Expression(59, Add), rhs = Counter(9)
- expression 37 operands: lhs = Counter(5), rhs = Counter(6)
- expression 38 operands: lhs = Counter(12), rhs = Counter(13)
- expression 39 operands: lhs = Expression(57, Add), rhs = Counter(7)
- expression 40 operands: lhs = Expression(58, Add), rhs = Counter(10)
- expression 41 operands: lhs = Expression(59, Add), rhs = Counter(9)
- expression 42 operands: lhs = Counter(5), rhs = Counter(6)
- expression 43 operands: lhs = Expression(57, Add), rhs = Expression(61, Add)
- expression 44 operands: lhs = Expression(58, Add), rhs = Counter(10)
- expression 45 operands: lhs = Expression(59, Add), rhs = Counter(9)
- expression 46 operands: lhs = Counter(5), rhs = Counter(6)
- expression 47 operands: lhs = Counter(7), rhs = Counter(12)
- expression 48 operands: lhs = Counter(13), rhs = Counter(19)
- expression 49 operands: lhs = Counter(13), rhs = Expression(55, Add)
- expression 50 operands: lhs = Counter(19), rhs = Counter(20)
- expression 51 operands: lhs = Expression(55, Add), rhs = Counter(21)
- expression 52 operands: lhs = Counter(19), rhs = Counter(20)
- expression 53 operands: lhs = Counter(13), rhs = Expression(54, Add)
- expression 54 operands: lhs = Expression(55, Add), rhs = Counter(21)
- expression 55 operands: lhs = Counter(19), rhs = Counter(20)
- expression 56 operands: lhs = Expression(57, Add), rhs = Expression(60, Add)
- expression 57 operands: lhs = Expression(58, Add), rhs = Counter(10)
- expression 58 operands: lhs = Expression(59, Add), rhs = Counter(9)
- expression 59 operands: lhs = Counter(5), rhs = Counter(6)
- expression 60 operands: lhs = Expression(61, Add), rhs = Counter(13)
- expression 61 operands: lhs = Counter(7), rhs = Counter(12)
- expression 62 operands: lhs = Counter(14), rhs = Counter(15)
- expression 63 operands: lhs = Counter(12), rhs = Counter(13)
- expression 64 operands: lhs = Expression(75, Add), rhs = Counter(14)
- expression 65 operands: lhs = Counter(12), rhs = Counter(13)
- expression 66 operands: lhs = Counter(15), rhs = Counter(16)
- expression 67 operands: lhs = Counter(15), rhs = Expression(73, Add)
- expression 68 operands: lhs = Counter(16), rhs = Counter(17)
- expression 69 operands: lhs = Expression(73, Add), rhs = Counter(18)
- expression 70 operands: lhs = Counter(16), rhs = Counter(17)
- expression 71 operands: lhs = Counter(15), rhs = Expression(72, Add)
- expression 72 operands: lhs = Expression(73, Add), rhs = Counter(18)
- expression 73 operands: lhs = Counter(16), rhs = Counter(17)
- expression 74 operands: lhs = Expression(75, Add), rhs = Expression(76, Add)
- expression 75 operands: lhs = Counter(12), rhs = Counter(13)
- expression 76 operands: lhs = Counter(14), rhs = Counter(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
Number of file 0 mappings: 68
- Code(Counter(0)) at (prev + 3, 1) to (start + 2, 12)
- Code(Counter(1)) at (prev + 2, 13) to (start + 2, 6)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 10:59:10 +00:00
- Code(Zero) at (prev + 2, 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
- Code(Expression(0, Add)) at (prev + 3, 9) to (start + 0, 10)
coverage: Prefer to visit nodes whose predecessors have been visited
2024-12-05 07:57:17 +00:00
= (c2 + c3)
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 + 0, 16) to (start + 0, 29)
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(2)) at (prev + 1, 9) to (start + 1, 10)
coverage: Prefer to visit nodes whose predecessors have been visited
2024-12-05 07:57:17 +00:00
- Code(Expression(1, Sub)) at (prev + 2, 15) to (start + 0, 28)
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
= (c0 - c2)
coverage: Prefer to visit nodes whose predecessors have been visited
2024-12-05 07:57:17 +00:00
- Code(Counter(3)) at (prev + 1, 12) to (start + 0, 25)
- Code(Expression(2, Sub)) at (prev + 0, 29) to (start + 0, 42)
= (c3 - c28)
- Code(Expression(3, Sub)) at (prev + 0, 46) to (start + 0, 60)
= (c3 - (c28 + c29))
- Code(Expression(8, Add)) at (prev + 0, 61) to (start + 2, 10)
= ((c28 + c29) + c30)
- Code(Expression(7, Sub)) at (prev + 2, 9) to (start + 0, 10)
= (c3 - ((c28 + c29) + c30))
- Code(Counter(3)) at (prev + 1, 9) to (start + 1, 18)
- Code(Expression(10, Sub)) at (prev + 3, 9) to (start + 0, 15)
= (c0 - (c2 + c3))
coverage: Store each BCB's code regions in one coverage statement If a BCB has more than one code region, those extra regions can now all be stored in the same coverage statement, instead of being stored in additional statements.
2023-09-19 04:15:33 +00:00
- Code(Expression(0, Add)) at (prev + 3, 9) to (start + 1, 12)
coverage: Prefer to visit nodes whose predecessors have been visited
2024-12-05 07:57:17 +00:00
= (c2 + c3)
- Code(Counter(4)) at (prev + 1, 13) to (start + 2, 6)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 10:59:10 +00:00
- Code(Zero) at (prev + 2, 5) to (start + 0, 6)
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, Add)) at (prev + 2, 8) to (start + 0, 21)
coverage: Prefer to visit nodes whose predecessors have been visited
2024-12-05 07:57:17 +00:00
= (c2 + c3)
- Code(Counter(5)) at (prev + 0, 22) to (start + 2, 6)
- Code(Expression(11, Sub)) at (prev + 2, 15) to (start + 0, 28)
= ((c2 + c3) - c5)
- Code(Counter(6)) at (prev + 1, 12) to (start + 0, 25)
- Code(Expression(12, Sub)) at (prev + 0, 29) to (start + 0, 42)
= (c6 - c25)
- Code(Expression(13, Sub)) at (prev + 0, 46) to (start + 0, 60)
= (c6 - (c25 + c26))
- Code(Expression(18, Add)) at (prev + 0, 61) to (start + 2, 10)
= ((c25 + c26) + c27)
- Code(Expression(17, Sub)) at (prev + 2, 9) to (start + 0, 10)
= (c6 - ((c25 + c26) + c27))
- Code(Counter(6)) at (prev + 1, 9) to (start + 0, 23)
- Code(Expression(20, Sub)) at (prev + 2, 9) to (start + 0, 15)
= ((c2 + c3) - (c5 + c6))
- Code(Expression(59, Add)) at (prev + 3, 8) to (start + 0, 12)
= (c5 + c6)
- Code(Counter(7)) at (prev + 1, 13) to (start + 1, 16)
- Code(Counter(8)) at (prev + 1, 17) to (start + 2, 10)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 10:59:10 +00:00
- Code(Zero) at (prev + 2, 9) to (start + 0, 10)
coverage: Prefer to visit nodes whose predecessors have been visited
2024-12-05 07:57:17 +00:00
- Code(Counter(7)) at (prev + 2, 12) to (start + 0, 25)
- Code(Counter(9)) at (prev + 0, 26) to (start + 2, 10)
- Code(Expression(23, Sub)) at (prev + 4, 17) to (start + 0, 30)
= (c7 - c9)
- Code(Counter(10)) at (prev + 1, 16) to (start + 0, 29)
- Code(Expression(24, Sub)) at (prev + 0, 33) to (start + 0, 46)
= (c10 - c22)
- Code(Expression(25, Sub)) at (prev + 0, 50) to (start + 0, 64)
= (c10 - (c22 + c23))
- Code(Expression(30, Add)) at (prev + 0, 65) to (start + 2, 14)
= ((c22 + c23) + c24)
- Code(Expression(29, Sub)) at (prev + 2, 13) to (start + 0, 14)
= (c10 - ((c22 + c23) + c24))
- Code(Counter(10)) at (prev + 1, 13) to (start + 0, 27)
- Code(Expression(32, Sub)) at (prev + 2, 13) to (start + 0, 19)
= (c7 - (c9 + c10))
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 10:59:10 +00:00
- Code(Zero) at (prev + 2, 5) to (start + 0, 6)
coverage: Prefer to visit nodes whose predecessors have been visited
2024-12-05 07:57:17 +00:00
- Code(Expression(39, Sub)) at (prev + 2, 9) to (start + 1, 12)
= ((((c5 + c6) + c9) + c10) - c7)
- Code(Counter(11)) at (prev + 1, 13) to (start + 2, 6)
coverage: Restrict empty-span expansion to only cover `{` and `}`
2024-11-05 10:59:10 +00:00
- Code(Zero) at (prev + 2, 5) to (start + 0, 6)
coverage: Prefer to visit nodes whose predecessors have been visited
2024-12-05 07:57:17 +00:00
- Code(Expression(75, Add)) at (prev + 2, 9) to (start + 0, 10)
= (c12 + c13)
- Code(Expression(39, Sub)) at (prev + 0, 16) to (start + 0, 29)
= ((((c5 + c6) + c9) + c10) - c7)
- Code(Counter(12)) at (prev + 0, 30) to (start + 2, 6)
- Code(Expression(43, Sub)) at (prev + 2, 15) to (start + 0, 28)
= ((((c5 + c6) + c9) + c10) - (c7 + c12))
- Code(Counter(13)) at (prev + 1, 12) to (start + 0, 25)
- Code(Expression(48, Sub)) at (prev + 0, 29) to (start + 0, 42)
= (c13 - c19)
- Code(Expression(49, Sub)) at (prev + 0, 46) to (start + 0, 60)
= (c13 - (c19 + c20))
- Code(Expression(54, Add)) at (prev + 0, 61) to (start + 2, 10)
= ((c19 + c20) + c21)
- Code(Expression(53, Sub)) at (prev + 2, 9) to (start + 0, 10)
= (c13 - ((c19 + c20) + c21))
- Code(Counter(13)) at (prev + 1, 9) to (start + 0, 23)
- Code(Expression(56, Sub)) at (prev + 2, 13) to (start + 2, 15)
= ((((c5 + c6) + c9) + c10) - ((c7 + c12) + c13))
- Code(Expression(76, Add)) at (prev + 5, 9) to (start + 0, 10)
= (c14 + c15)
- Code(Expression(75, Add)) at (prev + 0, 16) to (start + 0, 29)
= (c12 + c13)
- Code(Counter(14)) at (prev + 0, 30) to (start + 2, 6)
- Code(Expression(64, Sub)) at (prev + 2, 15) to (start + 0, 28)
= ((c12 + c13) - c14)
- Code(Counter(15)) at (prev + 1, 12) to (start + 0, 25)
- Code(Expression(66, Sub)) at (prev + 0, 29) to (start + 0, 42)
= (c15 - c16)
- Code(Expression(67, Sub)) at (prev + 0, 46) to (start + 0, 60)
= (c15 - (c16 + c17))
- Code(Expression(72, Add)) at (prev + 0, 61) to (start + 2, 10)
= ((c16 + c17) + c18)
- Code(Expression(71, Sub)) at (prev + 2, 9) to (start + 0, 10)
= (c15 - ((c16 + c17) + c18))
- Code(Counter(15)) at (prev + 1, 9) to (start + 0, 23)
- Code(Expression(74, Sub)) at (prev + 2, 9) to (start + 0, 15)
= ((c12 + c13) - (c14 + c15))
- Code(Counter(0)) at (prev + 2, 1) to (start + 0, 2)
Highest counter ID seen: c15
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