rust/tests/coverage/nested_loops.cov-map

Function name: nested_loops::main
Raw bytes (97): 0x[01, 01, 0e, 07, 2f, 05, 11, 01, 0d, 2f, 05, 01, 0d, 27, 05, 01, 09, 33, 27, 05, 15, 01, 09, 2f, 33, 01, 0d, 05, 15, 05, 01, 0d, 01, 01, 01, 02, 1b, 05, 04, 13, 00, 20, 09, 01, 0d, 01, 18, 0d, 02, 12, 00, 17, 11, 01, 10, 00, 16, 02, 01, 11, 00, 16, 0e, 01, 0e, 03, 16, 15, 04, 11, 01, 1b, 16, 02, 15, 00, 21, 1e, 01, 18, 02, 12, 2a, 03, 0d, 00, 0e, 36, 02, 09, 00, 17, 01, 02, 01, 00, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 14
- expression 0 operands: lhs = Expression(1, Add), rhs = Expression(11, Add)
- expression 1 operands: lhs = Counter(1), rhs = Counter(4)
- expression 2 operands: lhs = Counter(0), rhs = Counter(3)
- expression 3 operands: lhs = Expression(11, Add), rhs = Counter(1)
- expression 4 operands: lhs = Counter(0), rhs = Counter(3)
- expression 5 operands: lhs = Expression(9, Add), rhs = Counter(1)
- expression 6 operands: lhs = Counter(0), rhs = Counter(2)
- expression 7 operands: lhs = Expression(12, Add), rhs = Expression(9, Add)
- expression 8 operands: lhs = Counter(1), rhs = Counter(5)
- expression 9 operands: lhs = Counter(0), rhs = Counter(2)
- expression 10 operands: lhs = Expression(11, Add), rhs = Expression(12, Add)
- expression 11 operands: lhs = Counter(0), rhs = Counter(3)
- expression 12 operands: lhs = Counter(1), rhs = Counter(5)
- expression 13 operands: lhs = Counter(1), rhs = Counter(0)
Number of file 0 mappings: 13
- Code(Counter(0)) at (prev + 1, 1) to (start + 2, 27)
- Code(Counter(1)) at (prev + 4, 19) to (start + 0, 32)
- Code(Counter(2)) at (prev + 1, 13) to (start + 1, 24)
- Code(Counter(3)) at (prev + 2, 18) to (start + 0, 23)
- Code(Counter(4)) at (prev + 1, 16) to (start + 0, 22)
- Code(Expression(0, Sub)) at (prev + 1, 17) to (start + 0, 22)
    = ((c1 + c4) - (c0 + c3))
- Code(Expression(3, Sub)) at (prev + 1, 14) to (start + 3, 22)
    = ((c0 + c3) - c1)
- Code(Counter(5)) at (prev + 4, 17) to (start + 1, 27)
- Code(Expression(5, Sub)) at (prev + 2, 21) to (start + 0, 33)
    = ((c0 + c2) - c1)
- Code(Expression(7, Sub)) at (prev + 1, 24) to (start + 2, 18)
    = ((c1 + c5) - (c0 + c2))
- Code(Expression(10, Sub)) at (prev + 3, 13) to (start + 0, 14)
    = ((c0 + c3) - (c1 + c5))
- Code(Expression(13, Sub)) at (prev + 2, 9) to (start + 0, 23)
    = (c1 - c0)
- Code(Counter(0)) at (prev + 2, 1) to (start + 0, 2)
Highest counter ID seen: c5
Copy most of `tests/run-coverage` into `tests/coverage-map/status-quo` The output of these tests is too complicated to comfortably verify by hand, but we can still use them to observe changes to the underlying mappings produced by codegen/LLVM. If these tests fail due to non-coverage changes (e.g. in HIR-to-MIR lowering or MIR optimizations), it should usually be OK to just `--bless` them, as long as the `run-coverage` test suite still works. 2023-08-14 11:29:41 +00:00			`Function name: nested_loops::main`
coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`Raw bytes (97): 0x[01, 01, 0e, 07, 2f, 05, 11, 01, 0d, 2f, 05, 01, 0d, 27, 05, 01, 09, 33, 27, 05, 15, 01, 09, 2f, 33, 01, 0d, 05, 15, 05, 01, 0d, 01, 01, 01, 02, 1b, 05, 04, 13, 00, 20, 09, 01, 0d, 01, 18, 0d, 02, 12, 00, 17, 11, 01, 10, 00, 16, 02, 01, 11, 00, 16, 0e, 01, 0e, 03, 16, 15, 04, 11, 01, 1b, 16, 02, 15, 00, 21, 1e, 01, 18, 02, 12, 2a, 03, 0d, 00, 0e, 36, 02, 09, 00, 17, 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: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`Number of expressions: 14`
			`- expression 0 operands: lhs = Expression(1, Add), rhs = Expression(11, Add)`
			`- expression 1 operands: lhs = Counter(1), rhs = Counter(4)`
			`- expression 2 operands: lhs = Counter(0), rhs = Counter(3)`
			`- expression 3 operands: lhs = Expression(11, Add), rhs = Counter(1)`
			`- expression 4 operands: lhs = Counter(0), rhs = Counter(3)`
			`- expression 5 operands: lhs = Expression(9, Add), rhs = Counter(1)`
			`- expression 6 operands: lhs = Counter(0), rhs = Counter(2)`
			`- expression 7 operands: lhs = Expression(12, Add), rhs = Expression(9, Add)`
			`- expression 8 operands: lhs = Counter(1), rhs = Counter(5)`
			`- expression 9 operands: lhs = Counter(0), rhs = Counter(2)`
			`- expression 10 operands: lhs = Expression(11, Add), rhs = Expression(12, Add)`
			`- expression 11 operands: lhs = Counter(0), rhs = Counter(3)`
			`- expression 12 operands: lhs = Counter(1), rhs = Counter(5)`
			`- expression 13 operands: lhs = Counter(1), rhs = Counter(0)`
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: 13`
			`- Code(Counter(0)) at (prev + 1, 1) to (start + 2, 27)`
coverage: Completely overhaul counter assignment, using node-flow graphs 2025-01-12 10:36:07 +00:00			`- Code(Counter(1)) at (prev + 4, 19) to (start + 0, 32)`
			`- Code(Counter(2)) at (prev + 1, 13) to (start + 1, 24)`
			`- Code(Counter(3)) at (prev + 2, 18) to (start + 0, 23)`
			`- Code(Counter(4)) at (prev + 1, 16) to (start + 0, 22)`
			`- Code(Expression(0, Sub)) at (prev + 1, 17) to (start + 0, 22)`
			`= ((c1 + c4) - (c0 + c3))`
			`- Code(Expression(3, Sub)) at (prev + 1, 14) to (start + 3, 22)`
			`= ((c0 + c3) - c1)`
			`- Code(Counter(5)) at (prev + 4, 17) to (start + 1, 27)`
			`- Code(Expression(5, Sub)) at (prev + 2, 21) to (start + 0, 33)`
			`= ((c0 + c2) - c1)`
			`- Code(Expression(7, Sub)) at (prev + 1, 24) to (start + 2, 18)`
			`= ((c1 + c5) - (c0 + c2))`
			`- Code(Expression(10, Sub)) at (prev + 3, 13) to (start + 0, 14)`
			`= ((c0 + c3) - (c1 + c5))`
			`- Code(Expression(13, Sub)) at (prev + 2, 9) to (start + 0, 23)`
			`= (c1 - c0)`
			`- Code(Counter(0)) at (prev + 2, 1) to (start + 0, 2)`
			`Highest counter ID seen: c5`
Copy most of `tests/run-coverage` into `tests/coverage-map/status-quo` The output of these tests is too complicated to comfortably verify by hand, but we can still use them to observe changes to the underlying mappings produced by codegen/LLVM. If these tests fail due to non-coverage changes (e.g. in HIR-to-MIR lowering or MIR optimizations), it should usually be OK to just `--bless` them, as long as the `run-coverage` test suite still works. 2023-08-14 11:29:41 +00:00