about summary refs log tree commit diff
path: root/compiler/rustc_llvm/llvm-wrapper
diff options
context:
space:
mode:
authorMichael Goulet <michael@errs.io>2023-11-25 17:23:32 -0500
committerGitHub <noreply@github.com>2023-11-25 17:23:32 -0500
commitfd1a263fc7029b06a8f041feadbcc85c65b0a6e8 (patch)
tree45032f8f123089d2b420e0c6cbde7ed821611528 /compiler/rustc_llvm/llvm-wrapper
parentec1393f14efa179a968ec5b99c1ed62719198267 (diff)
parent3163bc870016ac42f2204057f7e43ec81674aba1 (diff)
downloadrust-fd1a263fc7029b06a8f041feadbcc85c65b0a6e8.tar.gz
rust-fd1a263fc7029b06a8f041feadbcc85c65b0a6e8.zip
Rollup merge of #117651 - Zalathar:fold-sums, r=cjgillot
coverage: Simplify building coverage expressions based on sums

This is a combination of some interlinked changes to the code that creates coverage counters/expressions for nodes and edges in the coverage graph:

- Some preparatory cleanups in `MakeBcbCounters::make_branch_counters`
- Use `BcbCounter` (instead of `CovTerm`) when building coverage expressions
  - This makes it easier to introduce a fold for building sums
- Simplify the creation of coverage expressions based on sums, by having `Iterator::fold` do much of the work
- Get rid of the awkward `BcbBranch` enum, and replace it with graph edges represented as `(from_bcb, to_bcb)`
  - This further simplifies the body of the fold
Diffstat (limited to 'compiler/rustc_llvm/llvm-wrapper')
0 files changed, 0 insertions, 0 deletions