mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
d578ac9e47
rust/tests/coverage/conditions.cov-map

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

260 lines
18 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 06:29:41 -05:00
Function name: conditions::main
coverage: Tweak individual tests to be unaffected by `rustfmt` Some of these tests use non-standard formatting that we can simulate by strategically adding `//` line comments. One contains `where` clauses that would be split across multiple lines, which we can keep on one line by moving the bounds to the generic type instead.
2024-01-15 21:12:10 -06:00
Raw bytes (784): 0x[01, 01, 8e, 01, 09, 33, 37, 41, 3b, 3d, 35, 39, 05, 00, b7, 04, 09, 05, 00, 0d, 35, 26, 39, 0d, 35, 3b, 3d, 35, 39, 37, 41, 3b, 3d, 35, 39, b2, 04, 0d, b7, 04, 09, 05, 00, 45, 00, 83, 01, 49, 45, 00, 7e, 31, 83, 01, 49, 45, 00, 7a, 4d, 7e, 31, 83, 01, 49, 45, 00, 76, 51, 7a, 4d, 7e, 31, 83, 01, 49, 45, 00, a7, 01, 55, 4d, 51, a3, 01, 59, a7, 01, 55, 4d, 51, 49, 9f, 01, a3, 01, 59, a7, 01, 55, 4d, 51, 61, 00, e3, 01, 65, 61, 00, de, 01, 2d, e3, 01, 65, 61, 00, da, 01, 69, de, 01, 2d, e3, 01, 65, 61, 00, d6, 01, 6d, da, 01, 69, de, 01, 2d, e3, 01, 65, 61, 00, 8b, 02, 71, 69, 6d, 87, 02, 75, 8b, 02, 71, 69, 6d, ff, 01, 00, 65, 83, 02, 87, 02, 75, 8b, 02, 71, 69, 6d, 7d, eb, 03, ef, 03, 8d, 01, f3, 03, 89, 01, 81, 01, 85, 01, 79, 00, d7, 02, 7d, 79, 00, d2, 02, 29, d7, 02, 7d, 79, 00, ce, 02, 81, 01, d2, 02, 29, d7, 02, 7d, 79, 00, ca, 02, 85, 01, ce, 02, 81, 01, d2, 02, 29, d7, 02, 7d, 79, 00, f3, 03, 89, 01, 81, 01, 85, 01, ef, 03, 8d, 01, f3, 03, 89, 01, 81, 01, 85, 01, 11, 93, 04, 97, 04, 21, 9b, 04, 1d, 15, 19, 7d, eb, 03, ef, 03, 8d, 01, f3, 03, 89, 01, 81, 01, 85, 01, e7, 03, 11, 7d, eb, 03, ef, 03, 8d, 01, f3, 03, 89, 01, 81, 01, 85, 01, e2, 03, 25, e7, 03, 11, 7d, eb, 03, ef, 03, 8d, 01, f3, 03, 89, 01, 81, 01, 85, 01, de, 03, 15, e2, 03, 25, e7, 03, 11, 7d, eb, 03, ef, 03, 8d, 01, f3, 03, 89, 01, 81, 01, 85, 01, da, 03, 19, de, 03, 15, e2, 03, 25, e7, 03, 11, 7d, eb, 03, ef, 03, 8d, 01, f3, 03, 89, 01, 81, 01, 85, 01, 9b, 04, 1d, 15, 19, 97, 04, 21, 9b, 04, 1d, 15, 19, 8f, 04, 9f, 04, 11, 93, 04, 97, 04, 21, 9b, 04, 1d, 15, 19, a3, 04, ae, 04, a7, 04, 31, ab, 04, 2d, 25, 29, b2, 04, 0d, b7, 04, 09, 05, 00, 44, 01, 03, 01, 02, 0c, 05, 02, 0d, 02, 06, 00, 02, 06, 00, 07, 03, 03, 09, 00, 0a, b7, 04, 00, 10, 00, 1d, 09, 01, 09, 01, 0a, b2, 04, 02, 0f, 00, 1c, 0d, 01, 0c, 00, 19, 26, 00, 1d, 00, 2a, 22, 00, 2e, 00, 3c, 37, 00, 3d, 02, 0a, 41, 02, 0a, 00, 0b, 33, 01, 09, 01, 12, ae, 04, 03, 09, 00, 0f, 03, 03, 09, 01, 0c, 45, 01, 0d, 02, 06, 00, 02, 06, 00, 07, 83, 01, 02, 08, 00, 15, 49, 00, 16, 02, 06, 7e, 02, 0f, 00, 1c, 7a, 01, 0c, 00, 19, 76, 00, 1d, 00, 2a, 72, 00, 2e, 00, 3c, a3, 01, 00, 3d, 02, 0a, 59, 02, 0a, 00, 0b, 9f, 01, 01, 09, 00, 17, 31, 02, 09, 00, 0f, 9b, 01, 03, 08, 00, 0c, 5d, 01, 0d, 01, 10, 61, 01, 11, 02, 0a, 00, 02, 0a, 00, 0b, e3, 01, 02, 0c, 00, 19, 65, 00, 1a, 02, 0a, de, 01, 04, 11, 00, 1e, da, 01, 01, 10, 00, 1d, d6, 01, 00, 21, 00, 2e, d2, 01, 00, 32, 00, 40, 87, 02, 00, 41, 02, 0e, 75, 02, 0e, 00, 0f, 83, 02, 01, 0d, 00, 1b, 2d, 02, 0d, 00, 13, 00, 02, 06, 00, 07, fb, 01, 02, 09, 01, 0c, 79, 01, 0d, 02, 06, 00, 02, 06, 00, 07, e7, 03, 02, 09, 00, 0a, d7, 02, 00, 10, 00, 1d, 7d, 00, 1e, 02, 06, d2, 02, 02, 0f, 00, 1c, ce, 02, 01, 0c, 00, 19, ca, 02, 00, 1d, 00, 2a, c6, 02, 00, 2e, 00, 3c, ef, 03, 00, 3d, 02, 0a, 8d, 01, 02, 0a, 00, 0b, eb, 03, 01, 09, 00, 17, 29, 02, 0d, 02, 0f, 8f, 04, 05, 09, 00, 0a, e7, 03, 00, 10, 00, 1d, 11, 00, 1e, 02, 06, e2, 03, 02, 0f, 00, 1c, de, 03, 01, 0c, 00, 19, da, 03, 00, 1d, 00, 2a, d6, 03, 00, 2e, 00, 3c, 97, 04, 00, 3d, 02, 0a, 21, 02, 0a, 00, 0b, 93, 04, 01, 09, 00, 17, 25, 02, 09, 00, 0f, 8b, 04, 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 06:29:41 -05:00
Number of files: 1
- file 0 => global file 1
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-18 23:15:33 -05:00
Number of expressions: 142
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 06:29:41 -05:00
- expression 0 operands: lhs = Counter(2), rhs = Expression(12, Add)
- expression 1 operands: lhs = Expression(13, Add), rhs = Counter(16)
- expression 2 operands: lhs = Expression(14, Add), rhs = Counter(15)
- expression 3 operands: lhs = Counter(13), rhs = Counter(14)
- expression 4 operands: lhs = Counter(1), rhs = Zero
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-18 23:15:33 -05:00
- expression 5 operands: lhs = Expression(141, Add), rhs = Counter(2)
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 06:29:41 -05:00
- expression 6 operands: lhs = Counter(1), rhs = Zero
- expression 7 operands: lhs = Counter(3), rhs = Counter(13)
- expression 8 operands: lhs = Expression(9, Sub), rhs = Counter(14)
- expression 9 operands: lhs = Counter(3), rhs = Counter(13)
- expression 10 operands: lhs = Expression(14, Add), rhs = Counter(15)
- expression 11 operands: lhs = Counter(13), rhs = Counter(14)
- expression 12 operands: lhs = Expression(13, Add), rhs = Counter(16)
- expression 13 operands: lhs = Expression(14, Add), rhs = Counter(15)
- expression 14 operands: lhs = Counter(13), rhs = Counter(14)
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-18 23:15:33 -05:00
- expression 15 operands: lhs = Expression(140, Sub), rhs = Counter(3)
- expression 16 operands: lhs = Expression(141, Add), rhs = Counter(2)
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 06:29:41 -05:00
- expression 17 operands: lhs = Counter(1), rhs = Zero
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-18 23:15:33 -05:00
- expression 18 operands: lhs = Counter(17), rhs = Zero
- expression 19 operands: lhs = Expression(32, Add), rhs = Counter(18)
- expression 20 operands: lhs = Counter(17), rhs = Zero
- expression 21 operands: lhs = Expression(31, Sub), rhs = Counter(12)
- expression 22 operands: lhs = Expression(32, Add), rhs = Counter(18)
- expression 23 operands: lhs = Counter(17), rhs = Zero
- expression 24 operands: lhs = Expression(30, Sub), rhs = Counter(19)
- expression 25 operands: lhs = Expression(31, Sub), rhs = Counter(12)
- expression 26 operands: lhs = Expression(32, Add), rhs = Counter(18)
- expression 27 operands: lhs = Counter(17), rhs = Zero
- expression 28 operands: lhs = Expression(29, Sub), rhs = Counter(20)
- expression 29 operands: lhs = Expression(30, Sub), rhs = Counter(19)
- expression 30 operands: lhs = Expression(31, Sub), rhs = Counter(12)
- expression 31 operands: lhs = Expression(32, Add), rhs = Counter(18)
- expression 32 operands: lhs = Counter(17), rhs = Zero
- expression 33 operands: lhs = Expression(41, Add), rhs = Counter(21)
- expression 34 operands: lhs = Counter(19), rhs = Counter(20)
- expression 35 operands: lhs = Expression(40, Add), rhs = Counter(22)
- expression 36 operands: lhs = Expression(41, Add), rhs = Counter(21)
- expression 37 operands: lhs = Counter(19), rhs = Counter(20)
- expression 38 operands: lhs = Counter(18), rhs = Expression(39, Add)
- expression 39 operands: lhs = Expression(40, Add), rhs = Counter(22)
- expression 40 operands: lhs = Expression(41, Add), rhs = Counter(21)
- expression 41 operands: lhs = Counter(19), rhs = Counter(20)
- expression 42 operands: lhs = Counter(24), rhs = Zero
- expression 43 operands: lhs = Expression(56, Add), rhs = Counter(25)
- expression 44 operands: lhs = Counter(24), rhs = Zero
- expression 45 operands: lhs = Expression(55, Sub), rhs = Counter(11)
- expression 46 operands: lhs = Expression(56, Add), rhs = Counter(25)
- expression 47 operands: lhs = Counter(24), rhs = Zero
- expression 48 operands: lhs = Expression(54, Sub), rhs = Counter(26)
- expression 49 operands: lhs = Expression(55, Sub), rhs = Counter(11)
- expression 50 operands: lhs = Expression(56, Add), rhs = Counter(25)
- expression 51 operands: lhs = Counter(24), rhs = Zero
- expression 52 operands: lhs = Expression(53, Sub), rhs = Counter(27)
- expression 53 operands: lhs = Expression(54, Sub), rhs = Counter(26)
- expression 54 operands: lhs = Expression(55, Sub), rhs = Counter(11)
- expression 55 operands: lhs = Expression(56, Add), rhs = Counter(25)
- expression 56 operands: lhs = Counter(24), rhs = Zero
- expression 57 operands: lhs = Expression(66, Add), rhs = Counter(28)
- expression 58 operands: lhs = Counter(26), rhs = Counter(27)
- expression 59 operands: lhs = Expression(65, Add), rhs = Counter(29)
- expression 60 operands: lhs = Expression(66, Add), rhs = Counter(28)
- expression 61 operands: lhs = Counter(26), rhs = Counter(27)
- expression 62 operands: lhs = Expression(63, Add), rhs = Zero
- expression 63 operands: lhs = Counter(25), rhs = Expression(64, Add)
- expression 64 operands: lhs = Expression(65, Add), rhs = Counter(29)
- expression 65 operands: lhs = Expression(66, Add), rhs = Counter(28)
- expression 66 operands: lhs = Counter(26), rhs = Counter(27)
- expression 67 operands: lhs = Counter(31), rhs = Expression(122, Add)
- expression 68 operands: lhs = Expression(123, Add), rhs = Counter(35)
- expression 69 operands: lhs = Expression(124, Add), rhs = Counter(34)
- expression 70 operands: lhs = Counter(32), rhs = Counter(33)
- expression 71 operands: lhs = Counter(30), rhs = Zero
- expression 72 operands: lhs = Expression(85, Add), rhs = Counter(31)
- expression 73 operands: lhs = Counter(30), rhs = Zero
- expression 74 operands: lhs = Expression(84, Sub), rhs = Counter(10)
- expression 75 operands: lhs = Expression(85, Add), rhs = Counter(31)
- expression 76 operands: lhs = Counter(30), rhs = Zero
- expression 77 operands: lhs = Expression(83, Sub), rhs = Counter(32)
- expression 78 operands: lhs = Expression(84, Sub), rhs = Counter(10)
- expression 79 operands: lhs = Expression(85, Add), rhs = Counter(31)
- expression 80 operands: lhs = Counter(30), rhs = Zero
- expression 81 operands: lhs = Expression(82, Sub), rhs = Counter(33)
- expression 82 operands: lhs = Expression(83, Sub), rhs = Counter(32)
- expression 83 operands: lhs = Expression(84, Sub), rhs = Counter(10)
- expression 84 operands: lhs = Expression(85, Add), rhs = Counter(31)
- expression 85 operands: lhs = Counter(30), rhs = Zero
- expression 86 operands: lhs = Expression(124, Add), rhs = Counter(34)
- expression 87 operands: lhs = Counter(32), rhs = Counter(33)
- expression 88 operands: lhs = Expression(123, Add), rhs = Counter(35)
- expression 89 operands: lhs = Expression(124, Add), rhs = Counter(34)
- expression 90 operands: lhs = Counter(32), rhs = Counter(33)
- expression 91 operands: lhs = Counter(4), rhs = Expression(132, Add)
- expression 92 operands: lhs = Expression(133, Add), rhs = Counter(8)
- expression 93 operands: lhs = Expression(134, Add), rhs = Counter(7)
- expression 94 operands: lhs = Counter(5), rhs = Counter(6)
- expression 95 operands: lhs = Counter(31), rhs = Expression(122, Add)
- expression 96 operands: lhs = Expression(123, Add), rhs = Counter(35)
- expression 97 operands: lhs = Expression(124, Add), rhs = Counter(34)
- expression 98 operands: lhs = Counter(32), rhs = Counter(33)
- expression 99 operands: lhs = Expression(121, Add), rhs = Counter(4)
- expression 100 operands: lhs = Counter(31), rhs = Expression(122, Add)
- expression 101 operands: lhs = Expression(123, Add), rhs = Counter(35)
- expression 102 operands: lhs = Expression(124, Add), rhs = Counter(34)
- expression 103 operands: lhs = Counter(32), rhs = Counter(33)
- expression 104 operands: lhs = Expression(120, Sub), rhs = Counter(9)
- expression 105 operands: lhs = Expression(121, Add), rhs = Counter(4)
- expression 106 operands: lhs = Counter(31), rhs = Expression(122, Add)
- expression 107 operands: lhs = Expression(123, Add), rhs = Counter(35)
- expression 108 operands: lhs = Expression(124, Add), rhs = Counter(34)
- expression 109 operands: lhs = Counter(32), rhs = Counter(33)
- expression 110 operands: lhs = Expression(119, Sub), rhs = Counter(5)
- expression 111 operands: lhs = Expression(120, Sub), rhs = Counter(9)
- expression 112 operands: lhs = Expression(121, Add), rhs = Counter(4)
- expression 113 operands: lhs = Counter(31), rhs = Expression(122, Add)
- expression 114 operands: lhs = Expression(123, Add), rhs = Counter(35)
- expression 115 operands: lhs = Expression(124, Add), rhs = Counter(34)
- expression 116 operands: lhs = Counter(32), rhs = Counter(33)
- expression 117 operands: lhs = Expression(118, Sub), rhs = Counter(6)
- expression 118 operands: lhs = Expression(119, Sub), rhs = Counter(5)
- expression 119 operands: lhs = Expression(120, Sub), rhs = Counter(9)
- expression 120 operands: lhs = Expression(121, Add), rhs = Counter(4)
- expression 121 operands: lhs = Counter(31), rhs = Expression(122, Add)
- expression 122 operands: lhs = Expression(123, Add), rhs = Counter(35)
- expression 123 operands: lhs = Expression(124, Add), rhs = Counter(34)
- expression 124 operands: lhs = Counter(32), rhs = Counter(33)
- expression 125 operands: lhs = Expression(134, Add), rhs = Counter(7)
- expression 126 operands: lhs = Counter(5), rhs = Counter(6)
- expression 127 operands: lhs = Expression(133, Add), rhs = Counter(8)
- expression 128 operands: lhs = Expression(134, Add), rhs = Counter(7)
- expression 129 operands: lhs = Counter(5), rhs = Counter(6)
- expression 130 operands: lhs = Expression(131, Add), rhs = Expression(135, Add)
- expression 131 operands: lhs = Counter(4), rhs = Expression(132, Add)
- expression 132 operands: lhs = Expression(133, Add), rhs = Counter(8)
- expression 133 operands: lhs = Expression(134, Add), rhs = Counter(7)
- expression 134 operands: lhs = Counter(5), rhs = Counter(6)
- expression 135 operands: lhs = Expression(136, Add), rhs = Expression(139, Sub)
coverage: Simplify building coverage expressions based on sums In some cases we need to prepare a coverage expression that is the sum of an arbitrary number of other terms. This patch simplifies the code paths that build those sums. This causes some churn in the mappings, because the previous code was building its sums in a somewhat idiosyncratic order.
2023-10-31 01:44:26 -05:00
- expression 136 operands: lhs = Expression(137, Add), rhs = Counter(12)
- expression 137 operands: lhs = Expression(138, Add), rhs = Counter(11)
- expression 138 operands: lhs = Counter(9), rhs = Counter(10)
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-18 23:15:33 -05:00
- expression 139 operands: lhs = Expression(140, Sub), rhs = Counter(3)
- expression 140 operands: lhs = Expression(141, Add), rhs = Counter(2)
- expression 141 operands: lhs = Counter(1), rhs = 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 06:29:41 -05: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)
- Code(Zero) at (prev + 2, 6) to (start + 0, 7)
- Code(Expression(0, Add)) at (prev + 3, 9) to (start + 0, 10)
= (c2 + (((c13 + c14) + c15) + c16))
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-18 23:15:33 -05:00
- Code(Expression(141, Add)) 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 06:29:41 -05:00
= (c1 + Zero)
- Code(Counter(2)) at (prev + 1, 9) to (start + 1, 10)
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-18 23:15:33 -05:00
- Code(Expression(140, Sub)) at (prev + 2, 15) to (start + 0, 28)
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 06:29:41 -05:00
= ((c1 + Zero) - c2)
- Code(Counter(3)) at (prev + 1, 12) to (start + 0, 25)
- Code(Expression(9, Sub)) at (prev + 0, 29) to (start + 0, 42)
= (c3 - c13)
- Code(Expression(8, Sub)) at (prev + 0, 46) to (start + 0, 60)
= ((c3 - c13) - c14)
- Code(Expression(13, Add)) at (prev + 0, 61) to (start + 2, 10)
= ((c13 + c14) + c15)
- Code(Counter(16)) at (prev + 2, 10) to (start + 0, 11)
- Code(Expression(12, Add)) at (prev + 1, 9) to (start + 1, 18)
= (((c13 + c14) + c15) + c16)
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-18 23:15:33 -05:00
- Code(Expression(139, Sub)) at (prev + 3, 9) 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 06:29:41 -05:00
= (((c1 + Zero) - 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-18 23:15:33 -05:00
- Code(Expression(0, Add)) at (prev + 3, 9) to (start + 1, 12)
= (c2 + (((c13 + c14) + c15) + c16))
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 06:29:41 -05:00
- Code(Counter(17)) at (prev + 1, 13) to (start + 2, 6)
- Code(Zero) at (prev + 2, 6) to (start + 0, 7)
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-18 23:15:33 -05:00
- Code(Expression(32, Add)) at (prev + 2, 8) 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 06:29:41 -05:00
= (c17 + Zero)
- Code(Counter(18)) at (prev + 0, 22) to (start + 2, 6)
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-18 23:15:33 -05:00
- Code(Expression(31, Sub)) at (prev + 2, 15) to (start + 0, 28)
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 06:29:41 -05:00
= ((c17 + Zero) - c18)
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-18 23:15:33 -05:00
- Code(Expression(30, Sub)) at (prev + 1, 12) 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 06:29:41 -05:00
= (((c17 + Zero) - c18) - c12)
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-18 23:15:33 -05:00
- Code(Expression(29, Sub)) at (prev + 0, 29) to (start + 0, 42)
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 06:29:41 -05:00
= ((((c17 + Zero) - c18) - c12) - c19)
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-18 23:15:33 -05:00
- Code(Expression(28, Sub)) at (prev + 0, 46) to (start + 0, 60)
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 06:29:41 -05:00
= (((((c17 + Zero) - c18) - c12) - c19) - c20)
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-18 23:15:33 -05:00
- Code(Expression(40, Add)) at (prev + 0, 61) to (start + 2, 10)
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 06:29:41 -05:00
= ((c19 + c20) + c21)
- Code(Counter(22)) at (prev + 2, 10) to (start + 0, 11)
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-18 23:15:33 -05:00
- Code(Expression(39, Add)) at (prev + 1, 9) to (start + 0, 23)
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 06:29:41 -05:00
= (((c19 + c20) + c21) + c22)
- Code(Counter(12)) at (prev + 2, 9) to (start + 0, 15)
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-18 23:15:33 -05:00
- Code(Expression(38, Add)) at (prev + 3, 8) to (start + 0, 12)
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 06:29:41 -05:00
= (c18 + (((c19 + c20) + c21) + c22))
- Code(Counter(23)) at (prev + 1, 13) to (start + 1, 16)
- Code(Counter(24)) at (prev + 1, 17) to (start + 2, 10)
- Code(Zero) at (prev + 2, 10) to (start + 0, 11)
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-18 23:15:33 -05:00
- Code(Expression(56, Add)) at (prev + 2, 12) 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 06:29:41 -05:00
= (c24 + Zero)
- Code(Counter(25)) at (prev + 0, 26) to (start + 2, 10)
coverage: Tweak individual tests to be unaffected by `rustfmt` Some of these tests use non-standard formatting that we can simulate by strategically adding `//` line comments. One contains `where` clauses that would be split across multiple lines, which we can keep on one line by moving the bounds to the generic type instead.
2024-01-15 21:12:10 -06:00
- Code(Expression(55, Sub)) at (prev + 4, 17) to (start + 0, 30)
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 06:29:41 -05:00
= ((c24 + Zero) - c25)
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-18 23:15:33 -05:00
- Code(Expression(54, Sub)) at (prev + 1, 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 06:29:41 -05:00
= (((c24 + Zero) - c25) - c11)
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-18 23:15:33 -05:00
- Code(Expression(53, Sub)) at (prev + 0, 33) to (start + 0, 46)
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 06:29:41 -05:00
= ((((c24 + Zero) - c25) - c11) - c26)
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-18 23:15:33 -05:00
- Code(Expression(52, Sub)) at (prev + 0, 50) to (start + 0, 64)
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 06:29:41 -05:00
= (((((c24 + Zero) - c25) - c11) - c26) - c27)
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-18 23:15:33 -05:00
- Code(Expression(65, Add)) at (prev + 0, 65) to (start + 2, 14)
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 06:29:41 -05:00
= ((c26 + c27) + c28)
- Code(Counter(29)) at (prev + 2, 14) to (start + 0, 15)
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-18 23:15:33 -05:00
- Code(Expression(64, Add)) at (prev + 1, 13) to (start + 0, 27)
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 06:29:41 -05:00
= (((c26 + c27) + c28) + c29)
- Code(Counter(11)) at (prev + 2, 13) to (start + 0, 19)
- Code(Zero) at (prev + 2, 6) to (start + 0, 7)
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-18 23:15:33 -05:00
- Code(Expression(62, Add)) at (prev + 2, 9) to (start + 1, 12)
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 06:29:41 -05:00
= ((c25 + (((c26 + c27) + c28) + c29)) + Zero)
- Code(Counter(30)) at (prev + 1, 13) to (start + 2, 6)
- Code(Zero) at (prev + 2, 6) to (start + 0, 7)
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-18 23:15:33 -05:00
- Code(Expression(121, Add)) at (prev + 2, 9) to (start + 0, 10)
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 06:29:41 -05:00
= (c31 + (((c32 + c33) + c34) + c35))
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-18 23:15:33 -05:00
- Code(Expression(85, Add)) 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 06:29:41 -05:00
= (c30 + Zero)
- Code(Counter(31)) at (prev + 0, 30) to (start + 2, 6)
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-18 23:15:33 -05:00
- Code(Expression(84, Sub)) at (prev + 2, 15) to (start + 0, 28)
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 06:29:41 -05:00
= ((c30 + Zero) - c31)
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-18 23:15:33 -05:00
- Code(Expression(83, Sub)) at (prev + 1, 12) 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 06:29:41 -05:00
= (((c30 + Zero) - c31) - c10)
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-18 23:15:33 -05:00
- Code(Expression(82, Sub)) at (prev + 0, 29) to (start + 0, 42)
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 06:29:41 -05:00
= ((((c30 + Zero) - c31) - c10) - c32)
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-18 23:15:33 -05:00
- Code(Expression(81, Sub)) at (prev + 0, 46) to (start + 0, 60)
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 06:29:41 -05:00
= (((((c30 + Zero) - c31) - c10) - c32) - c33)
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-18 23:15:33 -05:00
- Code(Expression(123, Add)) at (prev + 0, 61) to (start + 2, 10)
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 06:29:41 -05:00
= ((c32 + c33) + c34)
- Code(Counter(35)) at (prev + 2, 10) to (start + 0, 11)
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-18 23:15:33 -05:00
- Code(Expression(122, Add)) at (prev + 1, 9) to (start + 0, 23)
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 06:29:41 -05:00
= (((c32 + c33) + c34) + c35)
- Code(Counter(10)) at (prev + 2, 13) to (start + 2, 15)
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-18 23:15:33 -05:00
- Code(Expression(131, Add)) at (prev + 5, 9) to (start + 0, 10)
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 06:29:41 -05:00
= (c4 + (((c5 + c6) + c7) + c8))
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-18 23:15:33 -05:00
- Code(Expression(121, Add)) at (prev + 0, 16) to (start + 0, 29)
= (c31 + (((c32 + c33) + c34) + c35))
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 06:29:41 -05:00
- Code(Counter(4)) at (prev + 0, 30) to (start + 2, 6)
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-18 23:15:33 -05:00
- Code(Expression(120, Sub)) at (prev + 2, 15) to (start + 0, 28)
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 06:29:41 -05:00
= ((c31 + (((c32 + c33) + c34) + c35)) - c4)
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-18 23:15:33 -05:00
- Code(Expression(119, Sub)) at (prev + 1, 12) 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 06:29:41 -05:00
= (((c31 + (((c32 + c33) + c34) + c35)) - c4) - c9)
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-18 23:15:33 -05:00
- Code(Expression(118, Sub)) at (prev + 0, 29) to (start + 0, 42)
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 06:29:41 -05:00
= ((((c31 + (((c32 + c33) + c34) + c35)) - c4) - c9) - c5)
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-18 23:15:33 -05:00
- Code(Expression(117, Sub)) at (prev + 0, 46) to (start + 0, 60)
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 06:29:41 -05:00
= (((((c31 + (((c32 + c33) + c34) + c35)) - c4) - c9) - c5) - c6)
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-18 23:15:33 -05:00
- Code(Expression(133, Add)) at (prev + 0, 61) to (start + 2, 10)
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 06:29:41 -05:00
= ((c5 + c6) + c7)
- Code(Counter(8)) at (prev + 2, 10) to (start + 0, 11)
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-18 23:15:33 -05:00
- Code(Expression(132, Add)) at (prev + 1, 9) to (start + 0, 23)
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 06:29:41 -05:00
= (((c5 + c6) + c7) + c8)
- Code(Counter(9)) at (prev + 2, 9) to (start + 0, 15)
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-18 23:15:33 -05:00
- Code(Expression(130, Add)) at (prev + 2, 1) to (start + 0, 2)
coverage: Simplify building coverage expressions based on sums In some cases we need to prepare a coverage expression that is the sum of an arbitrary number of other terms. This patch simplifies the code paths that build those sums. This causes some churn in the mappings, because the previous code was building its sums in a somewhat idiosyncratic order.
2023-10-31 01:44:26 -05:00
= ((c4 + (((c5 + c6) + c7) + c8)) + ((((c9 + c10) + c11) + c12) + (((c1 + Zero) - c2) - c3)))
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 06:29:41 -05:00
Reference in New Issue Copy Permalink