rust/tests/coverage/branch/if-let.cov-map

Function name: if_let::if_let
Raw bytes (43): 0x[01, 01, 01, 05, 09, 07, 01, 0c, 01, 01, 10, 20, 02, 09, 03, 0c, 00, 13, 02, 00, 11, 00, 12, 05, 00, 16, 00, 1b, 02, 00, 1c, 02, 06, 09, 02, 0c, 02, 06, 05, 03, 05, 01, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 1
- expression 0 operands: lhs = Counter(1), rhs = Counter(2)
Number of file 0 mappings: 7
- Code(Counter(0)) at (prev + 12, 1) to (start + 1, 16)
- Branch { true: Expression(0, Sub), false: Counter(2) } at (prev + 3, 12) to (start + 0, 19)
    true  = (c1 - c2)
    false = c2
- Code(Expression(0, Sub)) at (prev + 0, 17) to (start + 0, 18)
    = (c1 - c2)
- Code(Counter(1)) at (prev + 0, 22) to (start + 0, 27)
- Code(Expression(0, Sub)) at (prev + 0, 28) to (start + 2, 6)
    = (c1 - c2)
- Code(Counter(2)) at (prev + 2, 12) to (start + 2, 6)
- Code(Counter(1)) at (prev + 3, 5) to (start + 1, 2)
Highest counter ID seen: c2

Function name: if_let::if_let_chain
Raw bytes (66): 0x[01, 01, 04, 01, 05, 05, 09, 0f, 0d, 05, 09, 0a, 01, 17, 01, 00, 33, 20, 02, 05, 01, 0c, 00, 13, 02, 00, 11, 00, 12, 01, 00, 16, 00, 17, 20, 0d, 09, 01, 10, 00, 17, 0d, 00, 15, 00, 16, 02, 00, 1a, 00, 1b, 0d, 01, 05, 03, 06, 0f, 03, 0c, 02, 06, 0b, 03, 05, 01, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 4
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
- expression 1 operands: lhs = Counter(1), rhs = Counter(2)
- expression 2 operands: lhs = Expression(3, Add), rhs = Counter(3)
- expression 3 operands: lhs = Counter(1), rhs = Counter(2)
Number of file 0 mappings: 10
- Code(Counter(0)) at (prev + 23, 1) to (start + 0, 51)
- Branch { true: Expression(0, Sub), false: Counter(1) } at (prev + 1, 12) to (start + 0, 19)
    true  = (c0 - c1)
    false = c1
- Code(Expression(0, Sub)) at (prev + 0, 17) to (start + 0, 18)
    = (c0 - c1)
- Code(Counter(0)) at (prev + 0, 22) to (start + 0, 23)
- Branch { true: Counter(3), false: Counter(2) } at (prev + 1, 16) to (start + 0, 23)
    true  = c3
    false = c2
- Code(Counter(3)) at (prev + 0, 21) to (start + 0, 22)
- Code(Expression(0, Sub)) at (prev + 0, 26) to (start + 0, 27)
    = (c0 - c1)
- Code(Counter(3)) at (prev + 1, 5) to (start + 3, 6)
- Code(Expression(3, Add)) at (prev + 3, 12) to (start + 2, 6)
    = (c1 + c2)
- Code(Expression(2, Add)) at (prev + 3, 5) to (start + 1, 2)
    = ((c1 + c2) + c3)
Highest counter ID seen: c3
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00			`Function name: if_let::if_let`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-13 22:51:24 -05:00			`Raw bytes (43): 0x[01, 01, 01, 05, 09, 07, 01, 0c, 01, 01, 10, 20, 02, 09, 03, 0c, 00, 13, 02, 00, 11, 00, 12, 05, 00, 16, 00, 1b, 02, 00, 1c, 02, 06, 09, 02, 0c, 02, 06, 05, 03, 05, 01, 02]`
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00			`Number of files: 1`
			`- file 0 => global file 1`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-13 22:51:24 -05:00			`Number of expressions: 1`
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00			`- expression 0 operands: lhs = Counter(1), rhs = Counter(2)`
coverage: Add branch coverage support for if-let and let-chains 2024-04-16 20:41:41 -05:00			`Number of file 0 mappings: 7`
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00			`- Code(Counter(0)) at (prev + 12, 1) to (start + 1, 16)`
coverage: Add branch coverage support for if-let and let-chains 2024-04-16 20:41:41 -05:00			`- Branch { true: Expression(0, Sub), false: Counter(2) } at (prev + 3, 12) to (start + 0, 19)`
			`true = (c1 - c2)`
			`false = c2`
			`- Code(Expression(0, Sub)) at (prev + 0, 17) to (start + 0, 18)`
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00			`= (c1 - c2)`
			`- Code(Counter(1)) at (prev + 0, 22) to (start + 0, 27)`
			`- Code(Expression(0, Sub)) at (prev + 0, 28) to (start + 2, 6)`
			`= (c1 - c2)`
			`- Code(Counter(2)) at (prev + 2, 12) to (start + 2, 6)`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-13 22:51:24 -05:00			`- Code(Counter(1)) at (prev + 3, 5) to (start + 1, 2)`
coverage: Include the highest counter ID seen in `.cov-map` dumps When making changes that have a large impact on coverage counter creation, this makes it easier to see whether the number of physical counters has changed. (The highest counter ID seen in coverage maps is not necessarily the same as the number of physical counters actually used by the instrumented code, but it's the best approximation we can get from looking only at the coverage maps, and it should be reasonably accurate in most cases.) 2024-10-07 21:13:05 -05:00			`Highest counter ID seen: c2`
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00
			`Function name: if_let::if_let_chain`
coverage: Add branch coverage support for if-let and let-chains 2024-04-16 20:41:41 -05:00			`Raw bytes (66): 0x[01, 01, 04, 01, 05, 05, 09, 0f, 0d, 05, 09, 0a, 01, 17, 01, 00, 33, 20, 02, 05, 01, 0c, 00, 13, 02, 00, 11, 00, 12, 01, 00, 16, 00, 17, 20, 0d, 09, 01, 10, 00, 17, 0d, 00, 15, 00, 16, 02, 00, 1a, 00, 1b, 0d, 01, 05, 03, 06, 0f, 03, 0c, 02, 06, 0b, 03, 05, 01, 02]`
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00			`Number of files: 1`
			`- file 0 => global file 1`
			`Number of expressions: 4`
			`- expression 0 operands: lhs = Counter(0), rhs = Counter(1)`
			`- expression 1 operands: lhs = Counter(1), rhs = Counter(2)`
			`- expression 2 operands: lhs = Expression(3, Add), rhs = Counter(3)`
			`- expression 3 operands: lhs = Counter(1), rhs = Counter(2)`
coverage: Add branch coverage support for if-let and let-chains 2024-04-16 20:41:41 -05:00			`Number of file 0 mappings: 10`
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00			`- Code(Counter(0)) at (prev + 23, 1) to (start + 0, 51)`
coverage: Add branch coverage support for if-let and let-chains 2024-04-16 20:41:41 -05:00			`- Branch { true: Expression(0, Sub), false: Counter(1) } at (prev + 1, 12) to (start + 0, 19)`
			`true = (c0 - c1)`
			`false = c1`
			`- Code(Expression(0, Sub)) at (prev + 0, 17) to (start + 0, 18)`
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00			`= (c0 - c1)`
			`- Code(Counter(0)) at (prev + 0, 22) to (start + 0, 23)`
coverage: Add branch coverage support for if-let and let-chains 2024-04-16 20:41:41 -05:00			`- Branch { true: Counter(3), false: Counter(2) } at (prev + 1, 16) to (start + 0, 23)`
			`true = c3`
			`false = c2`
			`- Code(Counter(3)) at (prev + 0, 21) to (start + 0, 22)`
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00			`- Code(Expression(0, Sub)) at (prev + 0, 26) to (start + 0, 27)`
			`= (c0 - c1)`
			`- Code(Counter(3)) at (prev + 1, 5) to (start + 3, 6)`
			`- Code(Expression(3, Add)) at (prev + 3, 12) to (start + 2, 6)`
			`= (c1 + c2)`
			`- Code(Expression(2, Add)) at (prev + 3, 5) to (start + 1, 2)`
			`= ((c1 + c2) + c3)`
coverage: Include the highest counter ID seen in `.cov-map` dumps When making changes that have a large impact on coverage counter creation, this makes it easier to see whether the number of physical counters has changed. (The highest counter ID seen in coverage maps is not necessarily the same as the number of physical counters actually used by the instrumented code, but it's the best approximation we can get from looking only at the coverage maps, and it should be reasonably accurate in most cases.) 2024-10-07 21:13:05 -05:00			`Highest counter ID seen: c3`
coverage: Branch coverage test for if-let and let-chains 2024-04-16 20:41:40 -05:00