nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2024-11-22 23:04:33 +00:00
Code Issues Packages Projects Releases Wiki Activity
a68bb5e176
rust/tests/coverage/lazy_boolean.cov-map

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

220 lines
17 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: lazy_boolean::main
coverage: Add `#[rustfmt::skip]` to tests with non-standard formatting These tests deliberately use non-standard formatting, so that the line execution counts reported by `llvm-cov` reveal additional information about where code regions begin and end.
2024-01-16 02:40:01 +00:00
Raw bytes (636): 0x[01, 01, a4, 01, 01, 05, 09, 8a, 05, 8f, 05, 09, 05, 02, 05, 02, 8f, 05, 09, 05, 02, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 09, 8a, 05, 8f, 05, 09, 05, 02, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 15, f2, 04, f7, 04, 15, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 15, f2, 04, f7, 04, 15, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, ef, 04, 19, 15, f2, 04, f7, 04, 15, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 19, ea, 04, ef, 04, 19, 15, f2, 04, f7, 04, 15, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, e7, 04, 1d, 19, ea, 04, ef, 04, 19, 15, f2, 04, f7, 04, 15, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 1d, e2, 04, e7, 04, 1d, 19, ea, 04, ef, 04, 19, 15, f2, 04, f7, 04, 15, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, df, 04, 21, 1d, e2, 04, e7, 04, 1d, 19, ea, 04, ef, 04, 19, 15, f2, 04, f7, 04, 15, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 21, da, 04, df, 04, 21, 1d, e2, 04, e7, 04, 1d, 19, ea, 04, ef, 04, 19, 15, f2, 04, f7, 04, 15, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, d7, 04, 25, 21, da, 04, df, 04, 21, 1d, e2, 04, e7, 04, 1d, 19, ea, 04, ef, 04, 19, 15, f2, 04, f7, 04, 15, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 25, d2, 04, d7, 04, 25, 21, da, 04, df, 04, 21, 1d, e2, 04, e7, 04, 1d, 19, ea, 04, ef, 04, 19, 15, f2, 04, f7, 04, 15, 11, fa, 04, ff, 04, 11, 0d, 82, 05, 87, 05, 0d, 09, 8a, 05, 8f, 05, 09, 05, 02, 1c, 01, 04, 01, 07, 0f, 05, 07, 10, 04, 06, 02, 04, 06, 00, 07, 87, 05, 02, 09, 00, 11, 8f, 05, 02, 0d, 00, 12, 8a, 05, 02, 0d, 00, 12, ff, 04, 03, 09, 00, 11, 87, 05, 02, 0d, 00, 12, 82, 05, 02, 0d, 00, 12, f7, 04, 02, 09, 00, 11, ff, 04, 00, 14, 00, 19, 11, 00, 1d, 00, 22, ef, 04, 01, 09, 00, 11, f7, 04, 00, 14, 00, 19, 15, 00, 1d, 00, 22, ef, 04, 03, 09, 01, 10, ea, 04, 02, 05, 03, 06, 19, 03, 06, 00, 07, e7, 04, 03, 09, 00, 10, 1d, 01, 05, 03, 06, e2, 04, 05, 05, 03, 06, df, 04, 05, 08, 00, 10, da, 04, 00, 11, 02, 06, 21, 02, 06, 00, 07, d7, 04, 02, 08, 00, 0f, 25, 00, 10, 02, 06, d2, 04, 02, 0c, 02, 06, cf, 04, 03, 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: 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
Number of expressions: 164
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: 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
- expression 1 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 2 operands: lhs = Expression(163, 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 11:29:41 +00:00
- expression 3 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 4 operands: lhs = Counter(1), rhs = Expression(0, Sub)
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
- expression 5 operands: lhs = Expression(163, 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 11:29:41 +00:00
- expression 6 operands: lhs = Counter(1), rhs = Expression(0, Sub)
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
- expression 7 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 8 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 9 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 10 operands: lhs = Expression(163, 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 11:29:41 +00:00
- expression 11 operands: lhs = Counter(1), rhs = Expression(0, Sub)
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
- expression 12 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 13 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 14 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 15 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 16 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 17 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 18 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 19 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 20 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 21 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 22 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 23 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 24 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 25 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 26 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 27 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 28 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 29 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 30 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 31 operands: lhs = Counter(5), rhs = Expression(156, Sub)
- expression 32 operands: lhs = Expression(157, Add), rhs = Counter(5)
- expression 33 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 34 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 35 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 36 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 37 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 38 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 39 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 40 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 41 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 42 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 43 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 44 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 45 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 46 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 47 operands: lhs = Counter(5), rhs = Expression(156, Sub)
- expression 48 operands: lhs = Expression(157, Add), rhs = Counter(5)
- expression 49 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 50 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 51 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 52 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 53 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 54 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 55 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 56 operands: lhs = Expression(155, Add), rhs = Counter(6)
- expression 57 operands: lhs = Counter(5), rhs = Expression(156, Sub)
- expression 58 operands: lhs = Expression(157, Add), rhs = Counter(5)
- expression 59 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 60 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 61 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 62 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 63 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 64 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 65 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 66 operands: lhs = Counter(6), rhs = Expression(154, Sub)
- expression 67 operands: lhs = Expression(155, Add), rhs = Counter(6)
- expression 68 operands: lhs = Counter(5), rhs = Expression(156, Sub)
- expression 69 operands: lhs = Expression(157, Add), rhs = Counter(5)
- expression 70 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 71 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 72 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 73 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 74 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 75 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 76 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 77 operands: lhs = Expression(153, Add), rhs = Counter(7)
- expression 78 operands: lhs = Counter(6), rhs = Expression(154, Sub)
- expression 79 operands: lhs = Expression(155, Add), rhs = Counter(6)
- expression 80 operands: lhs = Counter(5), rhs = Expression(156, Sub)
- expression 81 operands: lhs = Expression(157, Add), rhs = Counter(5)
- expression 82 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 83 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 84 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 85 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 86 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 87 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 88 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 89 operands: lhs = Counter(7), rhs = Expression(152, Sub)
- expression 90 operands: lhs = Expression(153, Add), rhs = Counter(7)
- expression 91 operands: lhs = Counter(6), rhs = Expression(154, Sub)
- expression 92 operands: lhs = Expression(155, Add), rhs = Counter(6)
- expression 93 operands: lhs = Counter(5), rhs = Expression(156, Sub)
- expression 94 operands: lhs = Expression(157, Add), rhs = Counter(5)
- expression 95 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 96 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 97 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 98 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 99 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 100 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 101 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 102 operands: lhs = Expression(151, Add), rhs = Counter(8)
- expression 103 operands: lhs = Counter(7), rhs = Expression(152, Sub)
- expression 104 operands: lhs = Expression(153, Add), rhs = Counter(7)
- expression 105 operands: lhs = Counter(6), rhs = Expression(154, Sub)
- expression 106 operands: lhs = Expression(155, Add), rhs = Counter(6)
- expression 107 operands: lhs = Counter(5), rhs = Expression(156, Sub)
- expression 108 operands: lhs = Expression(157, Add), rhs = Counter(5)
- expression 109 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 110 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 111 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 112 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 113 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 114 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 115 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 116 operands: lhs = Counter(8), rhs = Expression(150, Sub)
- expression 117 operands: lhs = Expression(151, Add), rhs = Counter(8)
- expression 118 operands: lhs = Counter(7), rhs = Expression(152, Sub)
- expression 119 operands: lhs = Expression(153, Add), rhs = Counter(7)
- expression 120 operands: lhs = Counter(6), rhs = Expression(154, Sub)
- expression 121 operands: lhs = Expression(155, Add), rhs = Counter(6)
- expression 122 operands: lhs = Counter(5), rhs = Expression(156, Sub)
- expression 123 operands: lhs = Expression(157, Add), rhs = Counter(5)
- expression 124 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 125 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 126 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 127 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 128 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 129 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 130 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 131 operands: lhs = Expression(149, Add), rhs = Counter(9)
- expression 132 operands: lhs = Counter(8), rhs = Expression(150, Sub)
- expression 133 operands: lhs = Expression(151, Add), rhs = Counter(8)
- expression 134 operands: lhs = Counter(7), rhs = Expression(152, Sub)
- expression 135 operands: lhs = Expression(153, Add), rhs = Counter(7)
- expression 136 operands: lhs = Counter(6), rhs = Expression(154, Sub)
- expression 137 operands: lhs = Expression(155, Add), rhs = Counter(6)
- expression 138 operands: lhs = Counter(5), rhs = Expression(156, Sub)
- expression 139 operands: lhs = Expression(157, Add), rhs = Counter(5)
- expression 140 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 141 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 142 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 143 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 144 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 145 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 146 operands: lhs = Counter(1), rhs = Expression(0, Sub)
- expression 147 operands: lhs = Counter(9), rhs = Expression(148, Sub)
- expression 148 operands: lhs = Expression(149, Add), rhs = Counter(9)
- expression 149 operands: lhs = Counter(8), rhs = Expression(150, Sub)
- expression 150 operands: lhs = Expression(151, Add), rhs = Counter(8)
- expression 151 operands: lhs = Counter(7), rhs = Expression(152, Sub)
- expression 152 operands: lhs = Expression(153, Add), rhs = Counter(7)
- expression 153 operands: lhs = Counter(6), rhs = Expression(154, Sub)
- expression 154 operands: lhs = Expression(155, Add), rhs = Counter(6)
- expression 155 operands: lhs = Counter(5), rhs = Expression(156, Sub)
- expression 156 operands: lhs = Expression(157, Add), rhs = Counter(5)
- expression 157 operands: lhs = Counter(4), rhs = Expression(158, Sub)
- expression 158 operands: lhs = Expression(159, Add), rhs = Counter(4)
- expression 159 operands: lhs = Counter(3), rhs = Expression(160, Sub)
- expression 160 operands: lhs = Expression(161, Add), rhs = Counter(3)
- expression 161 operands: lhs = Counter(2), rhs = Expression(162, Sub)
- expression 162 operands: lhs = Expression(163, Add), rhs = Counter(2)
- expression 163 operands: lhs = Counter(1), rhs = Expression(0, Sub)
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: 28
coverage: Add `#[rustfmt::skip]` to tests with non-standard formatting These tests deliberately use non-standard formatting, so that the line execution counts reported by `llvm-cov` reveal additional information about where code regions begin and end.
2024-01-16 02:40:01 +00:00
- Code(Counter(0)) at (prev + 4, 1) to (start + 7, 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(1)) at (prev + 7, 16) to (start + 4, 6)
- Code(Expression(0, Sub)) at (prev + 4, 6) to (start + 0, 7)
= (c0 - c1)
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(161, Add)) at (prev + 2, 9) to (start + 0, 17)
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
= (c2 + ((c1 + (c0 - c1)) - c2))
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(163, Add)) at (prev + 2, 13) to (start + 0, 18)
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
= (c1 + (c0 - c1))
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(162, Sub)) at (prev + 2, 13) to (start + 0, 18)
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
= ((c1 + (c0 - c1)) - c2)
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(159, Add)) at (prev + 3, 9) to (start + 0, 17)
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
= (c3 + ((c2 + ((c1 + (c0 - c1)) - 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(161, Add)) at (prev + 2, 13) to (start + 0, 18)
= (c2 + ((c1 + (c0 - c1)) - c2))
- Code(Expression(160, Sub)) at (prev + 2, 13) to (start + 0, 18)
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
= ((c2 + ((c1 + (c0 - c1)) - 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(157, Add)) at (prev + 2, 9) to (start + 0, 17)
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
= (c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - 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-19 04:15:33 +00:00
- Code(Expression(159, Add)) at (prev + 0, 20) to (start + 0, 25)
= (c3 + ((c2 + ((c1 + (c0 - c1)) - 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 11:29:41 +00:00
- Code(Counter(4)) at (prev + 0, 29) to (start + 0, 34)
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(155, Add)) at (prev + 1, 9) to (start + 0, 17)
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
= (c5 + ((c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)) - 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-19 04:15:33 +00:00
- Code(Expression(157, Add)) at (prev + 0, 20) to (start + 0, 25)
= (c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4))
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, 29) to (start + 0, 34)
coverage: Use `SpanMarker` to mark the full condition of `if !` When MIR is built for an if-not expression, the `!` part of the condition doesn't correspond to any MIR statement, so coverage instrumentation normally can't see it. We can fix that by deliberately injecting a dummy statement whose sole purpose is to associate that span with its enclosing block.
2023-11-23 01:50:40 +00:00
- Code(Expression(155, Add)) at (prev + 3, 9) to (start + 1, 16)
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
= (c5 + ((c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)) - c5))
coverage: Use `SpanMarker` to mark the full condition of `if !` When MIR is built for an if-not expression, the `!` part of the condition doesn't correspond to any MIR statement, so coverage instrumentation normally can't see it. We can fix that by deliberately injecting a dummy statement whose sole purpose is to associate that span with its enclosing block.
2023-11-23 01:50:40 +00:00
- Code(Expression(154, Sub)) at (prev + 2, 5) to (start + 3, 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
= ((c5 + ((c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)) - c5)) - c6)
- Code(Counter(6)) at (prev + 3, 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-19 04:15:33 +00:00
- Code(Expression(153, Add)) at (prev + 3, 9) to (start + 0, 16)
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
= (c6 + ((c5 + ((c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)) - c5)) - c6))
- Code(Counter(7)) at (prev + 1, 5) to (start + 3, 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-19 04:15:33 +00:00
- Code(Expression(152, Sub)) at (prev + 5, 5) to (start + 3, 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
= ((c6 + ((c5 + ((c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)) - c5)) - c6)) - c7)
coverage: Use `SpanMarker` to mark the full condition of `if !` When MIR is built for an if-not expression, the `!` part of the condition doesn't correspond to any MIR statement, so coverage instrumentation normally can't see it. We can fix that by deliberately injecting a dummy statement whose sole purpose is to associate that span with its enclosing block.
2023-11-23 01:50:40 +00:00
- Code(Expression(151, Add)) at (prev + 5, 8) to (start + 0, 16)
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
= (c7 + ((c6 + ((c5 + ((c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)) - c5)) - c6)) - c7))
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(150, Sub)) at (prev + 0, 17) to (start + 2, 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
= ((c7 + ((c6 + ((c5 + ((c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)) - c5)) - c6)) - c7)) - c8)
- Code(Counter(8)) 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-19 04:15:33 +00:00
- Code(Expression(149, Add)) 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
= (c8 + ((c7 + ((c6 + ((c5 + ((c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)) - c5)) - c6)) - c7)) - c8))
- Code(Counter(9)) at (prev + 0, 16) 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-19 04:15:33 +00:00
- Code(Expression(148, Sub)) at (prev + 2, 12) to (start + 2, 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
= ((c8 + ((c7 + ((c6 + ((c5 + ((c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)) - c5)) - c6)) - c7)) - c8)) - 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-19 04:15:33 +00:00
- Code(Expression(147, Add)) at (prev + 3, 1) to (start + 0, 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 11:29:41 +00:00
= (c9 + ((c8 + ((c7 + ((c6 + ((c5 + ((c4 + ((c3 + ((c2 + ((c1 + (c0 - c1)) - c2)) - c3)) - c4)) - c5)) - c6)) - c7)) - c8)) - c9))
Reference in New Issue Copy Permalink