os-rust/tests/coverage/branch/generics.cov-map

Function name: generics::print_size::<()>
Raw bytes (33): 0x[01, 01, 01, 01, 05, 05, 01, 06, 01, 01, 24, 20, 05, 02, 01, 08, 00, 24, 05, 00, 25, 02, 06, 02, 02, 0c, 02, 06, 01, 03, 01, 00, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 1
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
Number of file 0 mappings: 5
- Code(Counter(0)) at (prev + 6, 1) to (start + 1, 36)
- Branch { true: Counter(1), false: Expression(0, Sub) } at (prev + 1, 8) to (start + 0, 36)
    true  = c1
    false = (c0 - c1)
- Code(Counter(1)) at (prev + 0, 37) to (start + 2, 6)
- Code(Expression(0, Sub)) at (prev + 2, 12) to (start + 2, 6)
    = (c0 - c1)
- Code(Counter(0)) at (prev + 3, 1) to (start + 0, 2)
Highest counter ID seen: c1

Function name: generics::print_size::<u32>
Raw bytes (33): 0x[01, 01, 01, 01, 05, 05, 01, 06, 01, 01, 24, 20, 05, 02, 01, 08, 00, 24, 05, 00, 25, 02, 06, 02, 02, 0c, 02, 06, 01, 03, 01, 00, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 1
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
Number of file 0 mappings: 5
- Code(Counter(0)) at (prev + 6, 1) to (start + 1, 36)
- Branch { true: Counter(1), false: Expression(0, Sub) } at (prev + 1, 8) to (start + 0, 36)
    true  = c1
    false = (c0 - c1)
- Code(Counter(1)) at (prev + 0, 37) to (start + 2, 6)
- Code(Expression(0, Sub)) at (prev + 2, 12) to (start + 2, 6)
    = (c0 - c1)
- Code(Counter(0)) at (prev + 3, 1) to (start + 0, 2)
Highest counter ID seen: c1

Function name: generics::print_size::<u64>
Raw bytes (33): 0x[01, 01, 01, 01, 05, 05, 01, 06, 01, 01, 24, 20, 05, 02, 01, 08, 00, 24, 05, 00, 25, 02, 06, 02, 02, 0c, 02, 06, 01, 03, 01, 00, 02]
Number of files: 1
- file 0 => global file 1
Number of expressions: 1
- expression 0 operands: lhs = Counter(0), rhs = Counter(1)
Number of file 0 mappings: 5
- Code(Counter(0)) at (prev + 6, 1) to (start + 1, 36)
- Branch { true: Counter(1), false: Expression(0, Sub) } at (prev + 1, 8) to (start + 0, 36)
    true  = c1
    false = (c0 - c1)
- Code(Counter(1)) at (prev + 0, 37) to (start + 2, 6)
- Code(Expression(0, Sub)) at (prev + 2, 12) to (start + 2, 6)
    = (c0 - c1)
- Code(Counter(0)) at (prev + 3, 1) to (start + 0, 2)
Highest counter ID seen: c1
coverage: Move branch coverage tests into a subdirectory 2024-04-17 11:41:40 +10:00			`Function name: generics::print_size::<()>`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 13:51:24 +10:00			`Raw bytes (33): 0x[01, 01, 01, 01, 05, 05, 01, 06, 01, 01, 24, 20, 05, 02, 01, 08, 00, 24, 05, 00, 25, 02, 06, 02, 02, 0c, 02, 06, 01, 03, 01, 00, 02]`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11: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-14 13:51:24 +10:00			`Number of expressions: 1`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00			`- expression 0 operands: lhs = Counter(0), rhs = Counter(1)`
coverage: Enable branch coverage in the branch coverage tests 2024-03-10 21:20:27 +11:00			`Number of file 0 mappings: 5`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00			`- Code(Counter(0)) at (prev + 6, 1) to (start + 1, 36)`
coverage: Enable branch coverage in the branch coverage tests 2024-03-10 21:20:27 +11:00			`- Branch { true: Counter(1), false: Expression(0, Sub) } at (prev + 1, 8) to (start + 0, 36)`
			`true = c1`
			`false = (c0 - c1)`
			`- Code(Counter(1)) at (prev + 0, 37) to (start + 2, 6)`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00			`- Code(Expression(0, Sub)) at (prev + 2, 12) to (start + 2, 6)`
			`= (c0 - c1)`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 13:51:24 +10:00			`- Code(Counter(0)) at (prev + 3, 1) to (start + 0, 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-08 13:13:05 +11:00			`Highest counter ID seen: c1`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00
coverage: Move branch coverage tests into a subdirectory 2024-04-17 11:41:40 +10:00			`Function name: generics::print_size::<u32>`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 13:51:24 +10:00			`Raw bytes (33): 0x[01, 01, 01, 01, 05, 05, 01, 06, 01, 01, 24, 20, 05, 02, 01, 08, 00, 24, 05, 00, 25, 02, 06, 02, 02, 0c, 02, 06, 01, 03, 01, 00, 02]`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11: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-14 13:51:24 +10:00			`Number of expressions: 1`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00			`- expression 0 operands: lhs = Counter(0), rhs = Counter(1)`
coverage: Enable branch coverage in the branch coverage tests 2024-03-10 21:20:27 +11:00			`Number of file 0 mappings: 5`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00			`- Code(Counter(0)) at (prev + 6, 1) to (start + 1, 36)`
coverage: Enable branch coverage in the branch coverage tests 2024-03-10 21:20:27 +11:00			`- Branch { true: Counter(1), false: Expression(0, Sub) } at (prev + 1, 8) to (start + 0, 36)`
			`true = c1`
			`false = (c0 - c1)`
			`- Code(Counter(1)) at (prev + 0, 37) to (start + 2, 6)`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00			`- Code(Expression(0, Sub)) at (prev + 2, 12) to (start + 2, 6)`
			`= (c0 - c1)`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 13:51:24 +10:00			`- Code(Counter(0)) at (prev + 3, 1) to (start + 0, 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-08 13:13:05 +11:00			`Highest counter ID seen: c1`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00
coverage: Move branch coverage tests into a subdirectory 2024-04-17 11:41:40 +10:00			`Function name: generics::print_size::<u64>`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 13:51:24 +10:00			`Raw bytes (33): 0x[01, 01, 01, 01, 05, 05, 01, 06, 01, 01, 24, 20, 05, 02, 01, 08, 00, 24, 05, 00, 25, 02, 06, 02, 02, 0c, 02, 06, 01, 03, 01, 00, 02]`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11: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-14 13:51:24 +10:00			`Number of expressions: 1`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00			`- expression 0 operands: lhs = Counter(0), rhs = Counter(1)`
coverage: Enable branch coverage in the branch coverage tests 2024-03-10 21:20:27 +11:00			`Number of file 0 mappings: 5`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00			`- Code(Counter(0)) at (prev + 6, 1) to (start + 1, 36)`
coverage: Enable branch coverage in the branch coverage tests 2024-03-10 21:20:27 +11:00			`- Branch { true: Counter(1), false: Expression(0, Sub) } at (prev + 1, 8) to (start + 0, 36)`
			`true = c1`
			`false = (c0 - c1)`
			`- Code(Counter(1)) at (prev + 0, 37) to (start + 2, 6)`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00			`- Code(Expression(0, Sub)) at (prev + 2, 12) to (start + 2, 6)`
			`= (c0 - c1)`
coverage: Simplify counter expressions using simple algebra Some of these cases currently don't occur in practice, but are included for completeness, and to avoid having to add them later as branch coverage and MC/DC coverage start building more complex expressions. 2024-05-14 13:51:24 +10:00			`- Code(Counter(0)) at (prev + 3, 1) to (start + 0, 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-08 13:13:05 +11:00			`Highest counter ID seen: c1`
coverage: Add branch coverage tests (with branch coverage disabled) 2023-12-25 21:23:15 +11:00