@@ -6,7 +6,9 @@ use rustc_middle::mir::{
6
6
} ;
7
7
use rustc_span:: { ExpnKind , MacroKind , Span , Symbol } ;
8
8
9
- use crate :: coverage:: graph:: { BasicCoverageBlock , BasicCoverageBlockData , CoverageGraph } ;
9
+ use crate :: coverage:: graph:: {
10
+ BasicCoverageBlock , BasicCoverageBlockData , CoverageGraph , START_BCB ,
11
+ } ;
10
12
use crate :: coverage:: spans:: CoverageSpan ;
11
13
use crate :: coverage:: ExtractedHirInfo ;
12
14
@@ -17,7 +19,7 @@ pub(super) fn mir_to_initial_sorted_coverage_spans(
17
19
) -> Vec < CoverageSpan > {
18
20
let & ExtractedHirInfo { is_async_fn, fn_sig_span, body_span, .. } = hir_info;
19
21
20
- let mut initial_spans = vec ! [ CoverageSpan :: for_fn_sig( fn_sig_span) ] ;
22
+ let mut initial_spans = vec ! [ SpanFromMir :: for_fn_sig( fn_sig_span) ] ;
21
23
22
24
if is_async_fn {
23
25
// An async function desugars into a function that returns a future,
@@ -57,7 +59,7 @@ pub(super) fn mir_to_initial_sorted_coverage_spans(
57
59
. then_with ( || Ord :: cmp ( & a. is_closure , & b. is_closure ) . reverse ( ) )
58
60
} ) ;
59
61
60
- initial_spans
62
+ initial_spans. into_iter ( ) . map ( SpanFromMir :: into_coverage_span ) . collect :: < Vec < _ > > ( )
61
63
}
62
64
63
65
/// Macros that expand into branches (e.g. `assert!`, `trace!`) tend to generate
@@ -67,7 +69,7 @@ pub(super) fn mir_to_initial_sorted_coverage_spans(
67
69
///
68
70
/// (The input spans should be sorted in BCB dominator order, so that the
69
71
/// retained "first" span is likely to dominate the others.)
70
- fn remove_unwanted_macro_spans ( initial_spans : & mut Vec < CoverageSpan > ) {
72
+ fn remove_unwanted_macro_spans ( initial_spans : & mut Vec < SpanFromMir > ) {
71
73
let mut seen_macro_spans = FxHashSet :: default ( ) ;
72
74
initial_spans. retain ( |covspan| {
73
75
// Ignore (retain) closure spans and non-macro-expansion spans.
@@ -84,7 +86,7 @@ fn remove_unwanted_macro_spans(initial_spans: &mut Vec<CoverageSpan>) {
84
86
/// function body, split it into two parts. The first part covers just the
85
87
/// macro name plus `!`, and the second part covers the rest of the macro
86
88
/// invocation. This seems to give better results for code that uses macros.
87
- fn split_visible_macro_spans ( initial_spans : & mut Vec < CoverageSpan > ) {
89
+ fn split_visible_macro_spans ( initial_spans : & mut Vec < SpanFromMir > ) {
88
90
let mut extra_spans = vec ! [ ] ;
89
91
90
92
initial_spans. retain ( |covspan| {
@@ -105,8 +107,8 @@ fn split_visible_macro_spans(initial_spans: &mut Vec<CoverageSpan>) {
105
107
}
106
108
107
109
assert ! ( !covspan. is_closure) ;
108
- extra_spans. push ( CoverageSpan :: new ( before, covspan. visible_macro , covspan. bcb , false ) ) ;
109
- extra_spans. push ( CoverageSpan :: new ( after, covspan. visible_macro , covspan. bcb , false ) ) ;
110
+ extra_spans. push ( SpanFromMir :: new ( before, covspan. visible_macro , covspan. bcb , false ) ) ;
111
+ extra_spans. push ( SpanFromMir :: new ( after, covspan. visible_macro , covspan. bcb , false ) ) ;
110
112
false // Discard the original covspan that we just split.
111
113
} ) ;
112
114
@@ -125,7 +127,7 @@ fn bcb_to_initial_coverage_spans<'a, 'tcx>(
125
127
body_span : Span ,
126
128
bcb : BasicCoverageBlock ,
127
129
bcb_data : & ' a BasicCoverageBlockData ,
128
- ) -> impl Iterator < Item = CoverageSpan > + Captures < ' a > + Captures < ' tcx > {
130
+ ) -> impl Iterator < Item = SpanFromMir > + Captures < ' a > + Captures < ' tcx > {
129
131
bcb_data. basic_blocks . iter ( ) . flat_map ( move |& bb| {
130
132
let data = & mir_body[ bb] ;
131
133
@@ -134,15 +136,15 @@ fn bcb_to_initial_coverage_spans<'a, 'tcx>(
134
136
let ( span, visible_macro) =
135
137
unexpand_into_body_span_with_visible_macro ( expn_span, body_span) ?;
136
138
137
- Some ( CoverageSpan :: new ( span, visible_macro, bcb, is_closure ( statement) ) )
139
+ Some ( SpanFromMir :: new ( span, visible_macro, bcb, is_closure ( statement) ) )
138
140
} ) ;
139
141
140
142
let terminator_span = Some ( data. terminator ( ) ) . into_iter ( ) . filter_map ( move |terminator| {
141
143
let expn_span = filtered_terminator_span ( terminator) ?;
142
144
let ( span, visible_macro) =
143
145
unexpand_into_body_span_with_visible_macro ( expn_span, body_span) ?;
144
146
145
- Some ( CoverageSpan :: new ( span, visible_macro, bcb, false ) )
147
+ Some ( SpanFromMir :: new ( span, visible_macro, bcb, false ) )
146
148
} ) ;
147
149
148
150
statement_spans. chain ( terminator_span)
@@ -300,3 +302,38 @@ fn unexpand_into_body_span_with_prev(
300
302
301
303
Some ( ( curr, prev) )
302
304
}
305
+
306
+ #[ derive( Debug ) ]
307
+ struct SpanFromMir {
308
+ /// A span that has been extracted from MIR and then "un-expanded" back to
309
+ /// within the current function's `body_span`. After various intermediate
310
+ /// processing steps, this span is emitted as part of the final coverage
311
+ /// mappings.
312
+ ///
313
+ /// With the exception of `fn_sig_span`, this should always be contained
314
+ /// within `body_span`.
315
+ span : Span ,
316
+ visible_macro : Option < Symbol > ,
317
+ bcb : BasicCoverageBlock ,
318
+ is_closure : bool ,
319
+ }
320
+
321
+ impl SpanFromMir {
322
+ fn for_fn_sig ( fn_sig_span : Span ) -> Self {
323
+ Self :: new ( fn_sig_span, None , START_BCB , false )
324
+ }
325
+
326
+ fn new (
327
+ span : Span ,
328
+ visible_macro : Option < Symbol > ,
329
+ bcb : BasicCoverageBlock ,
330
+ is_closure : bool ,
331
+ ) -> Self {
332
+ Self { span, visible_macro, bcb, is_closure }
333
+ }
334
+
335
+ fn into_coverage_span ( self ) -> CoverageSpan {
336
+ let Self { span, visible_macro : _, bcb, is_closure } = self ;
337
+ CoverageSpan :: new ( span, bcb, is_closure)
338
+ }
339
+ }
0 commit comments