about summary refs log tree commit diff
path: root/tests/coverage/try_error_result.coverage
diff options
context:
space:
mode:
authorbors <bors@rust-lang.org>2024-01-15 06:45:33 +0000
committerbors <bors@rust-lang.org>2024-01-15 06:45:33 +0000
commit73252d51d13c0e4f872c3c51defcf48174860ef6 (patch)
tree712a07727dd08580ead456ff002c64e03a8d0fe4 /tests/coverage/try_error_result.coverage
parent9567c3ee73e78e5395a0d4aafce915cb7d7e883f (diff)
parent5eae9452b6762a1347a3dec4f40c8ddc7789a868 (diff)
downloadrust-73252d51d13c0e4f872c3c51defcf48174860ef6.tar.gz
rust-73252d51d13c0e4f872c3c51defcf48174860ef6.zip
Auto merge of #119508 - Zalathar:graph, r=compiler-errors
coverage: Simplify building the coverage graph with `CoverageSuccessors`

This is a collection of simplifications to the code that builds the *basic coverage block* graph, which is a simplified view of the MIR control-flow graph that ignores panics and merges straight-line sequences of blocks into a single BCB node.

The biggest change is to how we determine the coverage-relevant successors of a block. Previously we would call `Terminator::successors` and apply some ad-hoc postprocessing, but with this PR we instead have our own `match` on the terminator kind that produces a coverage-specific enum `CoverageSuccessors`. That enum also includes information about whether a block has exactly one successor that it can be chained into as part of a single BCB.
Diffstat (limited to 'tests/coverage/try_error_result.coverage')
0 files changed, 0 insertions, 0 deletions