@@ -245,7 +245,7 @@ pub enum ExtraConstraintInfo {
245
245
PlaceholderFromPredicate ( Span ) ,
246
246
}
247
247
248
- #[ instrument( skip( infcx, sccs) , level = "debug " ) ]
248
+ #[ instrument( skip( infcx, sccs) , level = "trace " ) ]
249
249
fn sccs_info < ' cx , ' tcx > (
250
250
infcx : & ' cx BorrowckInferCtxt < ' cx , ' tcx > ,
251
251
sccs : Rc < Sccs < RegionVid , ConstraintSccIndex > > ,
@@ -655,7 +655,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
655
655
/// Performs region inference and report errors if we see any
656
656
/// unsatisfiable constraints. If this is a closure, returns the
657
657
/// region requirements to propagate to our creator, if any.
658
- #[ instrument( skip( self , infcx, body, polonius_output) , level = "debug " ) ]
658
+ #[ instrument( skip( self , infcx, body, polonius_output) , level = "trace " ) ]
659
659
pub ( super ) fn solve (
660
660
& mut self ,
661
661
infcx : & InferCtxt < ' tcx > ,
@@ -717,7 +717,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
717
717
/// for each region variable until all the constraints are
718
718
/// satisfied. Note that some values may grow **too** large to be
719
719
/// feasible, but we check this later.
720
- #[ instrument( skip( self , _body) , level = "debug " ) ]
720
+ #[ instrument( skip( self , _body) , level = "trace " ) ]
721
721
fn propagate_constraints ( & mut self , _body : & Body < ' tcx > ) {
722
722
trace ! ( "constraints={:#?}" , {
723
723
let mut constraints: Vec <_> = self . outlives_constraints( ) . collect( ) ;
@@ -746,7 +746,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
746
746
/// computed, by unioning the values of its successors.
747
747
/// Assumes that all successors have been computed already
748
748
/// (which is assured by iterating over SCCs in dependency order).
749
- #[ instrument( skip( self ) , level = "debug " ) ]
749
+ #[ instrument( skip( self ) , level = "trace " ) ]
750
750
fn compute_value_for_scc ( & mut self , scc_a : ConstraintSccIndex ) {
751
751
let constraint_sccs = self . constraint_sccs . clone ( ) ;
752
752
@@ -787,7 +787,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
787
787
/// is considered a *lower bound*. If possible, we will modify
788
788
/// the constraint to set it equal to one of the option regions.
789
789
/// If we make any changes, returns true, else false.
790
- #[ instrument( skip( self , member_constraint_index) , level = "debug " ) ]
790
+ #[ instrument( skip( self , member_constraint_index) , level = "trace " ) ]
791
791
fn apply_member_constraint (
792
792
& mut self ,
793
793
scc : ConstraintSccIndex ,
@@ -1014,7 +1014,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
1014
1014
/// The idea then is to lower the `T: 'X` constraint into multiple
1015
1015
/// bounds -- e.g., if `'X` is the union of two free lifetimes,
1016
1016
/// `'1` and `'2`, then we would create `T: '1` and `T: '2`.
1017
- #[ instrument( level = "debug " , skip( self , infcx, propagated_outlives_requirements) ) ]
1017
+ #[ instrument( level = "trace " , skip( self , infcx, propagated_outlives_requirements) ) ]
1018
1018
fn try_promote_type_test (
1019
1019
& self ,
1020
1020
infcx : & InferCtxt < ' tcx > ,
@@ -1114,7 +1114,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
1114
1114
/// variables in the type `T` with an equal universal region from the
1115
1115
/// closure signature.
1116
1116
/// This is not always possible, so this is a fallible process.
1117
- #[ instrument( level = "debug " , skip( self , infcx) ) ]
1117
+ #[ instrument( level = "trace " , skip( self , infcx) ) ]
1118
1118
fn try_promote_type_test_subject (
1119
1119
& self ,
1120
1120
infcx : & InferCtxt < ' tcx > ,
@@ -1195,7 +1195,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
1195
1195
/// include the CFG anyhow.
1196
1196
/// - For each `end('x)` element in `'r`, compute the mutual LUB, yielding
1197
1197
/// a result `'y`.
1198
- #[ instrument( skip( self ) , level = "debug " , ret) ]
1198
+ #[ instrument( skip( self ) , level = "trace " , ret) ]
1199
1199
pub ( crate ) fn universal_upper_bound ( & self , r : RegionVid ) -> RegionVid {
1200
1200
trace ! ( r = %self . region_value_str( r) ) ;
1201
1201
@@ -1221,7 +1221,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
1221
1221
/// Therefore, this method should only be used in diagnostic code,
1222
1222
/// where displaying *some* named universal region is better than
1223
1223
/// falling back to 'static.
1224
- #[ instrument( level = "debug " , skip( self ) ) ]
1224
+ #[ instrument( level = "trace " , skip( self ) ) ]
1225
1225
pub ( crate ) fn approx_universal_upper_bound ( & self , r : RegionVid ) -> RegionVid {
1226
1226
trace ! ( "{}" , self . region_value_str( r) ) ;
1227
1227
@@ -1372,7 +1372,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
1372
1372
}
1373
1373
1374
1374
// Evaluate whether `sup_region: sub_region`.
1375
- #[ instrument( skip( self ) , level = "debug " , ret) ]
1375
+ #[ instrument( skip( self ) , level = "trace " , ret) ]
1376
1376
fn eval_outlives ( & self , sup_region : RegionVid , sub_region : RegionVid ) -> bool {
1377
1377
trace ! (
1378
1378
"sup_region's value = {:?} universal={:?}" ,
@@ -1589,7 +1589,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
1589
1589
///
1590
1590
/// Things that are to be propagated are accumulated into the
1591
1591
/// `outlives_requirements` vector.
1592
- #[ instrument( skip( self , propagated_outlives_requirements, errors_buffer) , level = "debug " ) ]
1592
+ #[ instrument( skip( self , propagated_outlives_requirements, errors_buffer) , level = "trace " ) ]
1593
1593
fn check_universal_region (
1594
1594
& self ,
1595
1595
longer_fr : RegionVid ,
@@ -1760,7 +1760,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
1760
1760
trace ! ( "check_bound_universal_region: all bounds satisfied" ) ;
1761
1761
}
1762
1762
1763
- #[ instrument( level = "debug " , skip( self , infcx, errors_buffer) ) ]
1763
+ #[ instrument( level = "trace " , skip( self , infcx, errors_buffer) ) ]
1764
1764
fn check_member_constraints (
1765
1765
& self ,
1766
1766
infcx : & InferCtxt < ' tcx > ,
@@ -2042,7 +2042,7 @@ impl<'tcx> RegionInferenceContext<'tcx> {
2042
2042
/// creating a constraint path that forces `R` to outlive
2043
2043
/// `from_region`, and then finding the best choices within that
2044
2044
/// path to blame.
2045
- #[ instrument( level = "debug " , skip( self , target_test) ) ]
2045
+ #[ instrument( level = "trace " , skip( self , target_test) ) ]
2046
2046
pub ( crate ) fn best_blame_constraint (
2047
2047
& self ,
2048
2048
from_region : RegionVid ,
0 commit comments