coverage: Fetch expressions and mappings separately
The combined `get_expressions_and_counter_regions` method was an artifact of having to prepare the expressions and mappings at the same time, to avoid ownership/lifetime problems with temporary data used by both. Now that we have an explicit transition from `FunctionCoverageCollector` to the final `FunctionCoverage`, we can prepare any shared data during that step and store it in the final struct.
This commit is contained in:
parent
371883a05a
commit
86b55cccff
@ -1,5 +1,6 @@
|
|||||||
use crate::coverageinfo::ffi::{Counter, CounterExpression, ExprKind};
|
use crate::coverageinfo::ffi::{Counter, CounterExpression, ExprKind};
|
||||||
|
|
||||||
|
use rustc_data_structures::captures::Captures;
|
||||||
use rustc_data_structures::fx::FxIndexSet;
|
use rustc_data_structures::fx::FxIndexSet;
|
||||||
use rustc_index::bit_set::BitSet;
|
use rustc_index::bit_set::BitSet;
|
||||||
use rustc_middle::mir::coverage::{
|
use rustc_middle::mir::coverage::{
|
||||||
@ -188,26 +189,11 @@ impl<'tcx> FunctionCoverage<'tcx> {
|
|||||||
if self.is_used { self.function_coverage_info.function_source_hash } else { 0 }
|
if self.is_used { self.function_coverage_info.function_source_hash } else { 0 }
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Generate an array of CounterExpressions, and an iterator over all `Counter`s and their
|
|
||||||
/// associated `Regions` (from which the LLVM-specific `CoverageMapGenerator` will create
|
|
||||||
/// `CounterMappingRegion`s.
|
|
||||||
pub fn get_expressions_and_counter_regions(
|
|
||||||
&self,
|
|
||||||
) -> (Vec<CounterExpression>, impl Iterator<Item = (Counter, &CodeRegion)>) {
|
|
||||||
let counter_expressions = self.counter_expressions();
|
|
||||||
// Expression IDs are indices into `self.expressions`, and on the LLVM
|
|
||||||
// side they will be treated as indices into `counter_expressions`, so
|
|
||||||
// the two vectors should correspond 1:1.
|
|
||||||
assert_eq!(self.function_coverage_info.expressions.len(), counter_expressions.len());
|
|
||||||
|
|
||||||
let counter_regions = self.counter_regions();
|
|
||||||
|
|
||||||
(counter_expressions, counter_regions)
|
|
||||||
}
|
|
||||||
|
|
||||||
/// Convert this function's coverage expression data into a form that can be
|
/// Convert this function's coverage expression data into a form that can be
|
||||||
/// passed through FFI to LLVM.
|
/// passed through FFI to LLVM.
|
||||||
fn counter_expressions(&self) -> Vec<CounterExpression> {
|
pub(crate) fn counter_expressions(
|
||||||
|
&self,
|
||||||
|
) -> impl Iterator<Item = CounterExpression> + ExactSizeIterator + Captures<'_> {
|
||||||
// We know that LLVM will optimize out any unused expressions before
|
// We know that LLVM will optimize out any unused expressions before
|
||||||
// producing the final coverage map, so there's no need to do the same
|
// producing the final coverage map, so there's no need to do the same
|
||||||
// thing on the Rust side unless we're confident we can do much better.
|
// thing on the Rust side unless we're confident we can do much better.
|
||||||
@ -218,23 +204,23 @@ impl<'tcx> FunctionCoverage<'tcx> {
|
|||||||
_ => Counter::from_term(operand),
|
_ => Counter::from_term(operand),
|
||||||
};
|
};
|
||||||
|
|
||||||
self.function_coverage_info
|
self.function_coverage_info.expressions.iter().map(move |&Expression { lhs, op, rhs }| {
|
||||||
.expressions
|
CounterExpression {
|
||||||
.iter()
|
|
||||||
.map(|&Expression { lhs, op, rhs }| CounterExpression {
|
|
||||||
lhs: counter_from_operand(lhs),
|
lhs: counter_from_operand(lhs),
|
||||||
kind: match op {
|
kind: match op {
|
||||||
Op::Add => ExprKind::Add,
|
Op::Add => ExprKind::Add,
|
||||||
Op::Subtract => ExprKind::Subtract,
|
Op::Subtract => ExprKind::Subtract,
|
||||||
},
|
},
|
||||||
rhs: counter_from_operand(rhs),
|
rhs: counter_from_operand(rhs),
|
||||||
})
|
}
|
||||||
.collect::<Vec<_>>()
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Converts this function's coverage mappings into an intermediate form
|
/// Converts this function's coverage mappings into an intermediate form
|
||||||
/// that will be used by `mapgen` when preparing for FFI.
|
/// that will be used by `mapgen` when preparing for FFI.
|
||||||
fn counter_regions(&self) -> impl Iterator<Item = (Counter, &CodeRegion)> {
|
pub(crate) fn counter_regions(
|
||||||
|
&self,
|
||||||
|
) -> impl Iterator<Item = (Counter, &CodeRegion)> + ExactSizeIterator {
|
||||||
// Historically, mappings were stored directly in counter/expression
|
// Historically, mappings were stored directly in counter/expression
|
||||||
// statements in MIR, and MIR optimizations would sometimes remove them.
|
// statements in MIR, and MIR optimizations would sometimes remove them.
|
||||||
// That's mostly no longer true, so now we detect cases where that would
|
// That's mostly no longer true, so now we detect cases where that would
|
||||||
|
@ -185,13 +185,13 @@ fn encode_mappings_for_function(
|
|||||||
global_file_table: &mut GlobalFileTable,
|
global_file_table: &mut GlobalFileTable,
|
||||||
function_coverage: &FunctionCoverage<'_>,
|
function_coverage: &FunctionCoverage<'_>,
|
||||||
) -> Vec<u8> {
|
) -> Vec<u8> {
|
||||||
let (expressions, counter_regions) = function_coverage.get_expressions_and_counter_regions();
|
let mut counter_regions = function_coverage.counter_regions().collect::<Vec<_>>();
|
||||||
|
|
||||||
let mut counter_regions = counter_regions.collect::<Vec<_>>();
|
|
||||||
if counter_regions.is_empty() {
|
if counter_regions.is_empty() {
|
||||||
return Vec::new();
|
return Vec::new();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
let expressions = function_coverage.counter_expressions().collect::<Vec<_>>();
|
||||||
|
|
||||||
let mut virtual_file_mapping = IndexVec::<u32, u32>::new();
|
let mut virtual_file_mapping = IndexVec::<u32, u32>::new();
|
||||||
let mut mapping_regions = Vec::with_capacity(counter_regions.len());
|
let mut mapping_regions = Vec::with_capacity(counter_regions.len());
|
||||||
|
|
||||||
|
Loading…
x
Reference in New Issue
Block a user