1 // Copyright 2012-2013 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! Error Reporting Code for the inference engine
13 //! Because of the way inference, and in particular region inference,
14 //! works, it often happens that errors are not detected until far after
15 //! the relevant line of code has been type-checked. Therefore, there is
16 //! an elaborate system to track why a particular constraint in the
17 //! inference graph arose so that we can explain to the user what gave
18 //! rise to a particular error.
20 //! The basis of the system are the "origin" types. An "origin" is the
21 //! reason that a constraint or inference variable arose. There are
22 //! different "origin" enums for different kinds of constraints/variables
23 //! (e.g., `TypeOrigin`, `RegionVariableOrigin`). An origin always has
24 //! a span, but also more information so that we can generate a meaningful
27 //! Having a catalogue of all the different reasons an error can arise is
28 //! also useful for other reasons, like cross-referencing FAQs etc, though
29 //! we are not really taking advantage of this yet.
31 //! # Region Inference
33 //! Region inference is particularly tricky because it always succeeds "in
34 //! the moment" and simply registers a constraint. Then, at the end, we
35 //! can compute the full graph and report errors, so we need to be able to
36 //! store and later report what gave rise to the conflicting constraints.
40 //! Determining whether `T1 <: T2` often involves a number of subtypes and
41 //! subconstraints along the way. A "TypeTrace" is an extended version
42 //! of an origin that traces the types and other values that were being
43 //! compared. It is not necessarily comprehensive (in fact, at the time of
44 //! this writing it only tracks the root values being compared) but I'd
45 //! like to extend it to include significant "waypoints". For example, if
46 //! you are comparing `(T1, T2) <: (T3, T4)`, and the problem is that `T2
47 //! <: T4` fails, I'd like the trace to include enough information to say
48 //! "in the 2nd element of the tuple". Similarly, failures when comparing
49 //! arguments or return types in fn types should be able to cite the
50 //! specific position, etc.
54 //! Of course, there is still a LOT of code in typeck that has yet to be
55 //! ported to this system, and which relies on string concatenation at the
56 //! time of error detection.
58 use self::FreshOrKept::*;
62 use super::SubregionOrigin;
63 use super::RegionVariableOrigin;
64 use super::ValuePairs;
65 use super::region_inference::RegionResolutionError;
66 use super::region_inference::ConcreteFailure;
67 use super::region_inference::SubSupConflict;
68 use super::region_inference::GenericBoundFailure;
69 use super::region_inference::GenericKind;
70 use super::region_inference::ProcessedErrors;
71 use super::region_inference::ProcessedErrorOrigin;
72 use super::region_inference::SameRegions;
74 use std::collections::HashSet;
76 use hir::map as ast_map;
78 use hir::print as pprust;
82 use hir::def_id::DefId;
83 use infer::{self, TypeOrigin};
86 use ty::{self, TyCtxt, TypeFoldable};
87 use ty::{Region, ReFree};
88 use ty::error::TypeError;
90 use std::cell::{Cell, RefCell};
91 use std::char::from_u32;
94 use syntax::parse::token;
96 use syntax_pos::{self, Pos, Span};
97 use errors::{DiagnosticBuilder, check_old_school};
99 impl<'a, 'gcx, 'tcx> TyCtxt<'a, 'gcx, 'tcx> {
100 pub fn note_and_explain_region(self,
101 err: &mut DiagnosticBuilder,
105 fn item_scope_tag(item: &hir::Item) -> &'static str {
107 hir::ItemImpl(..) => "impl",
108 hir::ItemStruct(..) => "struct",
109 hir::ItemEnum(..) => "enum",
110 hir::ItemTrait(..) => "trait",
111 hir::ItemFn(..) => "function body",
116 fn explain_span<'a, 'gcx, 'tcx>(tcx: TyCtxt<'a, 'gcx, 'tcx>,
117 heading: &str, span: Span)
118 -> (String, Option<Span>) {
119 let lo = tcx.sess.codemap().lookup_char_pos_adj(span.lo);
120 (format!("the {} at {}:{}", heading, lo.line, lo.col.to_usize()),
124 let (description, span) = match region {
125 ty::ReScope(scope) => {
127 let unknown_scope = || {
128 format!("{}unknown scope: {:?}{}. Please report a bug.",
129 prefix, scope, suffix)
131 let span = match scope.span(&self.region_maps, &self.map) {
134 err.note(&unknown_scope());
138 let tag = match self.map.find(scope.node_id(&self.region_maps)) {
139 Some(ast_map::NodeBlock(_)) => "block",
140 Some(ast_map::NodeExpr(expr)) => match expr.node {
141 hir::ExprCall(..) => "call",
142 hir::ExprMethodCall(..) => "method call",
143 hir::ExprMatch(_, _, hir::MatchSource::IfLetDesugar { .. }) => "if let",
144 hir::ExprMatch(_, _, hir::MatchSource::WhileLetDesugar) => "while let",
145 hir::ExprMatch(_, _, hir::MatchSource::ForLoopDesugar) => "for",
146 hir::ExprMatch(..) => "match",
149 Some(ast_map::NodeStmt(_)) => "statement",
150 Some(ast_map::NodeItem(it)) => item_scope_tag(&it),
152 err.span_note(span, &unknown_scope());
156 let scope_decorated_tag = match self.region_maps.code_extent_data(scope) {
157 region::CodeExtentData::Misc(_) => tag,
158 region::CodeExtentData::CallSiteScope { .. } => {
159 "scope of call-site for function"
161 region::CodeExtentData::ParameterScope { .. } => {
162 "scope of function body"
164 region::CodeExtentData::DestructionScope(_) => {
165 new_string = format!("destruction scope surrounding {}", tag);
168 region::CodeExtentData::Remainder(r) => {
169 new_string = format!("block suffix following statement {}",
170 r.first_statement_index);
174 explain_span(self, scope_decorated_tag, span)
177 ty::ReFree(ref fr) => {
178 let prefix = match fr.bound_region {
180 format!("the anonymous lifetime #{} defined on", idx + 1)
182 ty::BrFresh(_) => "an anonymous lifetime defined on".to_owned(),
184 format!("the lifetime {} as defined on",
189 match self.map.find(fr.scope.node_id(&self.region_maps)) {
190 Some(ast_map::NodeBlock(ref blk)) => {
191 let (msg, opt_span) = explain_span(self, "block", blk.span);
192 (format!("{} {}", prefix, msg), opt_span)
194 Some(ast_map::NodeItem(it)) => {
195 let tag = item_scope_tag(&it);
196 let (msg, opt_span) = explain_span(self, tag, it.span);
197 (format!("{} {}", prefix, msg), opt_span)
200 // this really should not happen, but it does:
202 (format!("{} unknown free region bounded by scope {:?}",
203 prefix, fr.scope), None)
208 ty::ReStatic => ("the static lifetime".to_owned(), None),
210 ty::ReEmpty => ("the empty lifetime".to_owned(), None),
212 ty::ReEarlyBound(ref data) => (data.name.to_string(), None),
214 // FIXME(#13998) ReSkolemized should probably print like
215 // ReFree rather than dumping Debug output on the user.
217 // We shouldn't really be having unification failures with ReVar
218 // and ReLateBound though.
219 ty::ReSkolemized(..) |
221 ty::ReLateBound(..) |
223 (format!("lifetime {:?}", region), None)
226 let message = format!("{}{}{}", prefix, description, suffix);
227 if let Some(span) = span {
228 err.span_note(span, &message);
235 impl<'a, 'gcx, 'tcx> InferCtxt<'a, 'gcx, 'tcx> {
236 pub fn report_region_errors(&self,
237 errors: &Vec<RegionResolutionError<'tcx>>) {
238 debug!("report_region_errors(): {} errors to start", errors.len());
240 // try to pre-process the errors, which will group some of them
241 // together into a `ProcessedErrors` group:
242 let processed_errors = self.process_errors(errors);
243 let errors = processed_errors.as_ref().unwrap_or(errors);
245 debug!("report_region_errors: {} errors after preprocessing", errors.len());
247 for error in errors {
248 match error.clone() {
249 ConcreteFailure(origin, sub, sup) => {
250 self.report_concrete_failure(origin, sub, sup).emit();
253 GenericBoundFailure(kind, param_ty, sub) => {
254 self.report_generic_bound_failure(kind, param_ty, sub);
257 SubSupConflict(var_origin,
259 sup_origin, sup_r) => {
260 self.report_sub_sup_conflict(var_origin,
265 ProcessedErrors(ref origins,
266 ref same_regions) => {
267 if !same_regions.is_empty() {
268 self.report_processed_errors(origins, same_regions);
275 // This method goes through all the errors and try to group certain types
276 // of error together, for the purpose of suggesting explicit lifetime
277 // parameters to the user. This is done so that we can have a more
278 // complete view of what lifetimes should be the same.
279 // If the return value is an empty vector, it means that processing
280 // failed (so the return value of this method should not be used).
282 // The method also attempts to weed out messages that seem like
283 // duplicates that will be unhelpful to the end-user. But
284 // obviously it never weeds out ALL errors.
285 fn process_errors(&self, errors: &Vec<RegionResolutionError<'tcx>>)
286 -> Option<Vec<RegionResolutionError<'tcx>>> {
287 debug!("process_errors()");
288 let mut origins = Vec::new();
290 // we collect up ConcreteFailures and SubSupConflicts that are
291 // relating free-regions bound on the fn-header and group them
292 // together into this vector
293 let mut same_regions = Vec::new();
295 // here we put errors that we will not be able to process nicely
296 let mut other_errors = Vec::new();
298 // we collect up GenericBoundFailures in here.
299 let mut bound_failures = Vec::new();
301 for error in errors {
303 ConcreteFailure(ref origin, sub, sup) => {
304 debug!("processing ConcreteFailure");
305 match free_regions_from_same_fn(self.tcx, sub, sup) {
306 Some(ref same_frs) => {
308 ProcessedErrorOrigin::ConcreteFailure(
312 append_to_same_regions(&mut same_regions, same_frs);
315 other_errors.push(error.clone());
319 SubSupConflict(ref var_origin, _, sub_r, _, sup_r) => {
320 debug!("processing SubSupConflict sub: {:?} sup: {:?}", sub_r, sup_r);
321 match free_regions_from_same_fn(self.tcx, sub_r, sup_r) {
322 Some(ref same_frs) => {
324 ProcessedErrorOrigin::VariableFailure(
325 var_origin.clone()));
326 append_to_same_regions(&mut same_regions, same_frs);
329 other_errors.push(error.clone());
333 GenericBoundFailure(ref origin, ref kind, region) => {
334 bound_failures.push((origin.clone(), kind.clone(), region));
336 ProcessedErrors(..) => {
337 bug!("should not encounter a `ProcessedErrors` yet: {:?}", error)
342 // ok, let's pull together the errors, sorted in an order that
343 // we think will help user the best
344 let mut processed_errors = vec![];
346 // first, put the processed errors, if any
347 if !same_regions.is_empty() {
348 let common_scope_id = same_regions[0].scope_id;
349 for sr in &same_regions {
350 // Since ProcessedErrors is used to reconstruct the function
351 // declaration, we want to make sure that they are, in fact,
352 // from the same scope
353 if sr.scope_id != common_scope_id {
354 debug!("returning empty result from process_errors because
355 {} != {}", sr.scope_id, common_scope_id);
359 assert!(origins.len() > 0);
360 let pe = ProcessedErrors(origins, same_regions);
361 debug!("errors processed: {:?}", pe);
362 processed_errors.push(pe);
365 // next, put the other misc errors
366 processed_errors.extend(other_errors);
368 // finally, put the `T: 'a` errors, but only if there were no
369 // other errors. otherwise, these have a very high rate of
370 // being unhelpful in practice. This is because they are
371 // basically secondary checks that test the state of the
372 // region graph after the rest of inference is done, and the
373 // other kinds of errors indicate that the region constraint
374 // graph is internally inconsistent, so these test results are
375 // likely to be meaningless.
376 if processed_errors.is_empty() {
377 for (origin, kind, region) in bound_failures {
378 processed_errors.push(GenericBoundFailure(origin, kind, region));
382 // we should always wind up with SOME errors, unless there were no
384 assert!(if errors.len() > 0 {processed_errors.len() > 0} else {true});
386 return Some(processed_errors);
389 struct FreeRegionsFromSameFn {
390 sub_fr: ty::FreeRegion,
391 sup_fr: ty::FreeRegion,
392 scope_id: ast::NodeId
395 impl FreeRegionsFromSameFn {
396 fn new(sub_fr: ty::FreeRegion,
397 sup_fr: ty::FreeRegion,
398 scope_id: ast::NodeId)
399 -> FreeRegionsFromSameFn {
400 FreeRegionsFromSameFn {
408 fn free_regions_from_same_fn<'a, 'gcx, 'tcx>(tcx: TyCtxt<'a, 'gcx, 'tcx>,
411 -> Option<FreeRegionsFromSameFn> {
412 debug!("free_regions_from_same_fn(sub={:?}, sup={:?})", sub, sup);
413 let (scope_id, fr1, fr2) = match (sub, sup) {
414 (ReFree(fr1), ReFree(fr2)) => {
415 if fr1.scope != fr2.scope {
418 assert!(fr1.scope == fr2.scope);
419 (fr1.scope.node_id(&tcx.region_maps), fr1, fr2)
423 let parent = tcx.map.get_parent(scope_id);
424 let parent_node = tcx.map.find(parent);
426 Some(node) => match node {
427 ast_map::NodeItem(item) => match item.node {
429 Some(FreeRegionsFromSameFn::new(fr1, fr2, scope_id))
433 ast_map::NodeImplItem(..) |
434 ast_map::NodeTraitItem(..) => {
435 Some(FreeRegionsFromSameFn::new(fr1, fr2, scope_id))
440 debug!("no parent node of scope_id {}", scope_id);
446 fn append_to_same_regions(same_regions: &mut Vec<SameRegions>,
447 same_frs: &FreeRegionsFromSameFn) {
448 debug!("append_to_same_regions(same_regions={:?}, same_frs={:?})",
449 same_regions, same_frs);
450 let scope_id = same_frs.scope_id;
451 let (sub_fr, sup_fr) = (same_frs.sub_fr, same_frs.sup_fr);
452 for sr in same_regions.iter_mut() {
453 if sr.contains(&sup_fr.bound_region) && scope_id == sr.scope_id {
454 sr.push(sub_fr.bound_region);
458 same_regions.push(SameRegions {
460 regions: vec!(sub_fr.bound_region, sup_fr.bound_region)
465 /// Adds a note if the types come from similarly named crates
466 fn check_and_note_conflicting_crates(&self,
467 err: &mut DiagnosticBuilder,
468 terr: &TypeError<'tcx>,
470 let report_path_match = |err: &mut DiagnosticBuilder, did1: DefId, did2: DefId| {
471 // Only external crates, if either is from a local
472 // module we could have false positives
473 if !(did1.is_local() || did2.is_local()) && did1.krate != did2.krate {
474 let exp_path = self.tcx.item_path_str(did1);
475 let found_path = self.tcx.item_path_str(did2);
476 // We compare strings because DefPath can be different
477 // for imported and non-imported crates
478 if exp_path == found_path {
479 let crate_name = self.tcx.sess.cstore.crate_name(did1.krate);
480 err.span_note(sp, &format!("Perhaps two different versions \
481 of crate `{}` are being used?",
487 TypeError::Sorts(ref exp_found) => {
488 // if they are both "path types", there's a chance of ambiguity
489 // due to different versions of the same crate
490 match (&exp_found.expected.sty, &exp_found.found.sty) {
491 (&ty::TyEnum(ref exp_adt, _), &ty::TyEnum(ref found_adt, _)) |
492 (&ty::TyStruct(ref exp_adt, _), &ty::TyStruct(ref found_adt, _)) |
493 (&ty::TyEnum(ref exp_adt, _), &ty::TyStruct(ref found_adt, _)) |
494 (&ty::TyStruct(ref exp_adt, _), &ty::TyEnum(ref found_adt, _)) => {
495 report_path_match(err, exp_adt.did, found_adt.did);
500 TypeError::Traits(ref exp_found) => {
501 report_path_match(err, exp_found.expected, exp_found.found);
503 _ => () // FIXME(#22750) handle traits and stuff
507 fn note_error_origin(&self,
508 err: &mut DiagnosticBuilder<'tcx>,
512 &TypeOrigin::MatchExpressionArm(_, arm_span, source) => match source {
513 hir::MatchSource::IfLetDesugar {..} => {
514 err.span_note(arm_span, "`if let` arm with an incompatible type");
517 err.span_note(arm_span, "match arm with an incompatible type");
524 pub fn report_and_explain_type_error_with_code(&self,
526 values: Option<ValuePairs<'tcx>>,
527 terr: &TypeError<'tcx>,
530 -> DiagnosticBuilder<'tcx>
532 let expected_found = match values {
534 Some(values) => match self.values_str(&values) {
535 Some((expected, found)) => Some((expected, found)),
536 None => return self.tcx.sess.diagnostic().struct_dummy() /* derived error */
540 let span = origin.span();
541 let mut err = self.tcx.sess.struct_span_err_with_code(
542 span, message, code);
544 let mut is_simple_error = false;
546 if let Some((expected, found)) = expected_found {
547 is_simple_error = if let &TypeError::Sorts(ref values) = terr {
548 values.expected.is_primitive() && values.found.is_primitive()
553 if !is_simple_error || check_old_school() {
554 err.note_expected_found(&"type", &expected, &found);
558 if !is_simple_error && check_old_school() {
559 err.span_note(span, &format!("{}", terr));
561 err.span_label(span, &terr);
564 self.note_error_origin(&mut err, &origin);
565 self.check_and_note_conflicting_crates(&mut err, terr, span);
566 self.tcx.note_and_explain_type_err(&mut err, terr, span);
571 pub fn report_and_explain_type_error(&self,
572 trace: TypeTrace<'tcx>,
573 terr: &TypeError<'tcx>)
574 -> DiagnosticBuilder<'tcx>
576 // FIXME: do we want to use a different error code for each origin?
577 let failure_str = trace.origin.as_failure_str();
578 type_err!(self, trace.origin, Some(trace.values), terr, E0308, "{}", failure_str)
581 /// Returns a string of the form "expected `{}`, found `{}`".
582 fn values_str(&self, values: &ValuePairs<'tcx>) -> Option<(String, String)> {
584 infer::Types(ref exp_found) => self.expected_found_str(exp_found),
585 infer::TraitRefs(ref exp_found) => self.expected_found_str(exp_found),
586 infer::PolyTraitRefs(ref exp_found) => self.expected_found_str(exp_found),
590 fn expected_found_str<T: fmt::Display + TypeFoldable<'tcx>>(
592 exp_found: &ty::error::ExpectedFound<T>)
593 -> Option<(String, String)>
595 let exp_found = self.resolve_type_vars_if_possible(exp_found);
596 if exp_found.references_error() {
600 Some((format!("{}", exp_found.expected), format!("{}", exp_found.found)))
603 fn report_generic_bound_failure(&self,
604 origin: SubregionOrigin<'tcx>,
605 bound_kind: GenericKind<'tcx>,
608 // FIXME: it would be better to report the first error message
609 // with the span of the parameter itself, rather than the span
610 // where the error was detected. But that span is not readily
613 let labeled_user_string = match bound_kind {
614 GenericKind::Param(ref p) =>
615 format!("the parameter type `{}`", p),
616 GenericKind::Projection(ref p) =>
617 format!("the associated type `{}`", p),
620 let mut err = match sub {
621 ty::ReFree(ty::FreeRegion {bound_region: ty::BrNamed(..), ..}) => {
622 // Does the required lifetime have a nice name we can print?
623 let mut err = struct_span_err!(self.tcx.sess,
626 "{} may not live long enough",
627 labeled_user_string);
628 err.help(&format!("consider adding an explicit lifetime bound `{}: {}`...",
635 // Does the required lifetime have a nice name we can print?
636 let mut err = struct_span_err!(self.tcx.sess,
639 "{} may not live long enough",
640 labeled_user_string);
641 err.help(&format!("consider adding an explicit lifetime \
642 bound `{}: 'static`...",
648 // If not, be less specific.
649 let mut err = struct_span_err!(self.tcx.sess,
652 "{} may not live long enough",
653 labeled_user_string);
654 err.help(&format!("consider adding an explicit lifetime bound for `{}`",
656 self.tcx.note_and_explain_region(
658 &format!("{} must be valid for ", labeled_user_string),
665 self.note_region_origin(&mut err, &origin);
669 fn report_concrete_failure(&self,
670 origin: SubregionOrigin<'tcx>,
673 -> DiagnosticBuilder<'tcx> {
675 infer::Subtype(trace) => {
676 let terr = TypeError::RegionsDoesNotOutlive(sup, sub);
677 self.report_and_explain_type_error(trace, &terr)
679 infer::Reborrow(span) => {
680 let mut err = struct_span_err!(self.tcx.sess, span, E0312,
681 "lifetime of reference outlives \
682 lifetime of borrowed content...");
683 self.tcx.note_and_explain_region(&mut err,
684 "...the reference is valid for ",
687 self.tcx.note_and_explain_region(&mut err,
688 "...but the borrowed content is only valid for ",
693 infer::ReborrowUpvar(span, ref upvar_id) => {
694 let mut err = struct_span_err!(self.tcx.sess, span, E0313,
695 "lifetime of borrowed pointer outlives \
696 lifetime of captured variable `{}`...",
697 self.tcx.local_var_name_str(upvar_id.var_id));
698 self.tcx.note_and_explain_region(&mut err,
699 "...the borrowed pointer is valid for ",
702 self.tcx.note_and_explain_region(&mut err,
703 &format!("...but `{}` is only valid for ",
704 self.tcx.local_var_name_str(upvar_id.var_id)),
709 infer::InfStackClosure(span) => {
710 let mut err = struct_span_err!(self.tcx.sess, span, E0314,
711 "closure outlives stack frame");
712 self.tcx.note_and_explain_region(&mut err,
713 "...the closure must be valid for ",
716 self.tcx.note_and_explain_region(&mut err,
717 "...but the closure's stack frame is only valid for ",
722 infer::InvokeClosure(span) => {
723 let mut err = struct_span_err!(self.tcx.sess, span, E0315,
724 "cannot invoke closure outside of its lifetime");
725 self.tcx.note_and_explain_region(&mut err,
726 "the closure is only valid for ",
731 infer::DerefPointer(span) => {
732 let mut err = struct_span_err!(self.tcx.sess, span, E0473,
733 "dereference of reference outside its lifetime");
734 self.tcx.note_and_explain_region(&mut err,
735 "the reference is only valid for ",
740 infer::FreeVariable(span, id) => {
741 let mut err = struct_span_err!(self.tcx.sess, span, E0474,
742 "captured variable `{}` does not outlive the enclosing closure",
743 self.tcx.local_var_name_str(id));
744 self.tcx.note_and_explain_region(&mut err,
745 "captured variable is valid for ",
748 self.tcx.note_and_explain_region(&mut err,
749 "closure is valid for ",
754 infer::IndexSlice(span) => {
755 let mut err = struct_span_err!(self.tcx.sess, span, E0475,
756 "index of slice outside its lifetime");
757 self.tcx.note_and_explain_region(&mut err,
758 "the slice is only valid for ",
763 infer::RelateObjectBound(span) => {
764 let mut err = struct_span_err!(self.tcx.sess, span, E0476,
765 "lifetime of the source pointer does not outlive \
766 lifetime bound of the object type");
767 self.tcx.note_and_explain_region(&mut err,
768 "object type is valid for ",
771 self.tcx.note_and_explain_region(&mut err,
772 "source pointer is only valid for ",
777 infer::RelateParamBound(span, ty) => {
778 let mut err = struct_span_err!(self.tcx.sess, span, E0477,
779 "the type `{}` does not fulfill the required lifetime",
780 self.ty_to_string(ty));
781 self.tcx.note_and_explain_region(&mut err,
782 "type must outlive ",
787 infer::RelateRegionParamBound(span) => {
788 let mut err = struct_span_err!(self.tcx.sess, span, E0478,
789 "lifetime bound not satisfied");
790 self.tcx.note_and_explain_region(&mut err,
791 "lifetime parameter instantiated with ",
794 self.tcx.note_and_explain_region(&mut err,
795 "but lifetime parameter must outlive ",
800 infer::RelateDefaultParamBound(span, ty) => {
801 let mut err = struct_span_err!(self.tcx.sess, span, E0479,
802 "the type `{}` (provided as the value of \
803 a type parameter) is not valid at this point",
804 self.ty_to_string(ty));
805 self.tcx.note_and_explain_region(&mut err,
806 "type must outlive ",
811 infer::CallRcvr(span) => {
812 let mut err = struct_span_err!(self.tcx.sess, span, E0480,
813 "lifetime of method receiver does not outlive \
815 self.tcx.note_and_explain_region(&mut err,
816 "the receiver is only valid for ",
821 infer::CallArg(span) => {
822 let mut err = struct_span_err!(self.tcx.sess, span, E0481,
823 "lifetime of function argument does not outlive \
825 self.tcx.note_and_explain_region(&mut err,
826 "the function argument is only valid for ",
831 infer::CallReturn(span) => {
832 let mut err = struct_span_err!(self.tcx.sess, span, E0482,
833 "lifetime of return value does not outlive \
835 self.tcx.note_and_explain_region(&mut err,
836 "the return value is only valid for ",
841 infer::Operand(span) => {
842 let mut err = struct_span_err!(self.tcx.sess, span, E0483,
843 "lifetime of operand does not outlive \
845 self.tcx.note_and_explain_region(&mut err,
846 "the operand is only valid for ",
851 infer::AddrOf(span) => {
852 let mut err = struct_span_err!(self.tcx.sess, span, E0484,
853 "reference is not valid at the time of borrow");
854 self.tcx.note_and_explain_region(&mut err,
855 "the borrow is only valid for ",
860 infer::AutoBorrow(span) => {
861 let mut err = struct_span_err!(self.tcx.sess, span, E0485,
862 "automatically reference is not valid \
863 at the time of borrow");
864 self.tcx.note_and_explain_region(&mut err,
865 "the automatic borrow is only valid for ",
870 infer::ExprTypeIsNotInScope(t, span) => {
871 let mut err = struct_span_err!(self.tcx.sess, span, E0486,
872 "type of expression contains references \
873 that are not valid during the expression: `{}`",
874 self.ty_to_string(t));
875 self.tcx.note_and_explain_region(&mut err,
876 "type is only valid for ",
881 infer::SafeDestructor(span) => {
882 let mut err = struct_span_err!(self.tcx.sess, span, E0487,
883 "unsafe use of destructor: destructor might be called \
884 while references are dead");
885 // FIXME (22171): terms "super/subregion" are suboptimal
886 self.tcx.note_and_explain_region(&mut err,
890 self.tcx.note_and_explain_region(&mut err,
896 infer::BindingTypeIsNotValidAtDecl(span) => {
897 let mut err = struct_span_err!(self.tcx.sess, span, E0488,
898 "lifetime of variable does not enclose its declaration");
899 self.tcx.note_and_explain_region(&mut err,
900 "the variable is only valid for ",
905 infer::ParameterInScope(_, span) => {
906 let mut err = struct_span_err!(self.tcx.sess, span, E0489,
907 "type/lifetime parameter not in scope here");
908 self.tcx.note_and_explain_region(&mut err,
909 "the parameter is only valid for ",
914 infer::DataBorrowed(ty, span) => {
915 let mut err = struct_span_err!(self.tcx.sess, span, E0490,
916 "a value of type `{}` is borrowed for too long",
917 self.ty_to_string(ty));
918 self.tcx.note_and_explain_region(&mut err, "the type is valid for ", sub, "");
919 self.tcx.note_and_explain_region(&mut err, "but the borrow lasts for ", sup, "");
922 infer::ReferenceOutlivesReferent(ty, span) => {
923 let mut err = struct_span_err!(self.tcx.sess, span, E0491,
924 "in type `{}`, reference has a longer lifetime \
925 than the data it references",
926 self.ty_to_string(ty));
927 self.tcx.note_and_explain_region(&mut err,
928 "the pointer is valid for ",
931 self.tcx.note_and_explain_region(&mut err,
932 "but the referenced data is only valid for ",
940 fn report_sub_sup_conflict(&self,
941 var_origin: RegionVariableOrigin,
942 sub_origin: SubregionOrigin<'tcx>,
944 sup_origin: SubregionOrigin<'tcx>,
945 sup_region: Region) {
946 let mut err = self.report_inference_failure(var_origin);
948 self.tcx.note_and_explain_region(&mut err,
949 "first, the lifetime cannot outlive ",
953 self.note_region_origin(&mut err, &sup_origin);
955 self.tcx.note_and_explain_region(&mut err,
956 "but, the lifetime must be valid for ",
960 self.note_region_origin(&mut err, &sub_origin);
964 fn report_processed_errors(&self,
965 origins: &[ProcessedErrorOrigin<'tcx>],
966 same_regions: &[SameRegions]) {
967 for (i, origin) in origins.iter().enumerate() {
968 let mut err = match *origin {
969 ProcessedErrorOrigin::VariableFailure(ref var_origin) =>
970 self.report_inference_failure(var_origin.clone()),
971 ProcessedErrorOrigin::ConcreteFailure(ref sr_origin, sub, sup) =>
972 self.report_concrete_failure(sr_origin.clone(), sub, sup),
975 // attach the suggestion to the last such error
976 if i == origins.len() - 1 {
977 self.give_suggestion(&mut err, same_regions);
984 fn give_suggestion(&self, err: &mut DiagnosticBuilder, same_regions: &[SameRegions]) {
985 let scope_id = same_regions[0].scope_id;
986 let parent = self.tcx.map.get_parent(scope_id);
987 let parent_node = self.tcx.map.find(parent);
988 let taken = lifetimes_in_scope(self.tcx, scope_id);
989 let life_giver = LifeGiver::with_taken(&taken[..]);
990 let node_inner = match parent_node {
991 Some(ref node) => match *node {
992 ast_map::NodeItem(ref item) => {
994 hir::ItemFn(ref fn_decl, unsafety, constness, _, ref gen, _) => {
995 Some((fn_decl, gen, unsafety, constness, item.name, item.span))
1000 ast_map::NodeImplItem(item) => {
1002 hir::ImplItemKind::Method(ref sig, _) => {
1013 ast_map::NodeTraitItem(item) => {
1015 hir::MethodTraitItem(ref sig, Some(_)) => {
1030 let (fn_decl, generics, unsafety, constness, name, span)
1031 = node_inner.expect("expect item fn");
1032 let rebuilder = Rebuilder::new(self.tcx, fn_decl, generics, same_regions, &life_giver);
1033 let (fn_decl, generics) = rebuilder.rebuild();
1034 self.give_expl_lifetime_param(err, &fn_decl, unsafety, constness, name, &generics, span);
1037 pub fn issue_32330_warnings(&self, span: Span, issue32330s: &[ty::Issue32330]) {
1038 for issue32330 in issue32330s {
1040 ty::Issue32330::WontChange => { }
1041 ty::Issue32330::WillChange { fn_def_id, region_name } => {
1042 self.tcx.sess.add_lint(
1043 lint::builtin::HR_LIFETIME_IN_ASSOC_TYPE,
1046 format!("lifetime parameter `{0}` declared on fn `{1}` \
1047 appears only in the return type, \
1048 but here is required to be higher-ranked, \
1049 which means that `{0}` must appear in both \
1050 argument and return types",
1052 self.tcx.item_path_str(fn_def_id)));
1059 struct RebuildPathInfo<'a> {
1060 path: &'a hir::Path,
1061 // indexes to insert lifetime on path.lifetimes
1063 // number of lifetimes we expect to see on the type referred by `path`
1064 // (e.g., expected=1 for struct Foo<'a>)
1066 anon_nums: &'a HashSet<u32>,
1067 region_names: &'a HashSet<ast::Name>
1070 struct Rebuilder<'a, 'gcx: 'a+'tcx, 'tcx: 'a> {
1071 tcx: TyCtxt<'a, 'gcx, 'tcx>,
1072 fn_decl: &'a hir::FnDecl,
1073 generics: &'a hir::Generics,
1074 same_regions: &'a [SameRegions],
1075 life_giver: &'a LifeGiver,
1076 cur_anon: Cell<u32>,
1077 inserted_anons: RefCell<HashSet<u32>>,
1085 impl<'a, 'gcx, 'tcx> Rebuilder<'a, 'gcx, 'tcx> {
1086 fn new(tcx: TyCtxt<'a, 'gcx, 'tcx>,
1087 fn_decl: &'a hir::FnDecl,
1088 generics: &'a hir::Generics,
1089 same_regions: &'a [SameRegions],
1090 life_giver: &'a LifeGiver)
1091 -> Rebuilder<'a, 'gcx, 'tcx> {
1096 same_regions: same_regions,
1097 life_giver: life_giver,
1098 cur_anon: Cell::new(0),
1099 inserted_anons: RefCell::new(HashSet::new()),
1103 fn rebuild(&self) -> (hir::FnDecl, hir::Generics) {
1104 let mut inputs = self.fn_decl.inputs.clone();
1105 let mut output = self.fn_decl.output.clone();
1106 let mut ty_params = self.generics.ty_params.clone();
1107 let where_clause = self.generics.where_clause.clone();
1108 let mut kept_lifetimes = HashSet::new();
1109 for sr in self.same_regions {
1110 self.cur_anon.set(0);
1111 self.offset_cur_anon();
1112 let (anon_nums, region_names) =
1113 self.extract_anon_nums_and_names(sr);
1114 let (lifetime, fresh_or_kept) = self.pick_lifetime(®ion_names);
1115 match fresh_or_kept {
1116 Kept => { kept_lifetimes.insert(lifetime.name); }
1119 inputs = self.rebuild_args_ty(&inputs[..], lifetime,
1120 &anon_nums, ®ion_names);
1121 output = self.rebuild_output(&output, lifetime, &anon_nums, ®ion_names);
1122 ty_params = self.rebuild_ty_params(ty_params, lifetime,
1125 let fresh_lifetimes = self.life_giver.get_generated_lifetimes();
1126 let all_region_names = self.extract_all_region_names();
1127 let generics = self.rebuild_generics(self.generics,
1133 let new_fn_decl = hir::FnDecl {
1136 variadic: self.fn_decl.variadic
1138 (new_fn_decl, generics)
1141 fn pick_lifetime(&self,
1142 region_names: &HashSet<ast::Name>)
1143 -> (hir::Lifetime, FreshOrKept) {
1144 if !region_names.is_empty() {
1145 // It's not necessary to convert the set of region names to a
1146 // vector of string and then sort them. However, it makes the
1147 // choice of lifetime name deterministic and thus easier to test.
1148 let mut names = Vec::new();
1149 for rn in region_names {
1150 let lt_name = rn.to_string();
1151 names.push(lt_name);
1154 let name = token::intern(&names[0]);
1155 return (name_to_dummy_lifetime(name), Kept);
1157 return (self.life_giver.give_lifetime(), Fresh);
1160 fn extract_anon_nums_and_names(&self, same_regions: &SameRegions)
1161 -> (HashSet<u32>, HashSet<ast::Name>) {
1162 let mut anon_nums = HashSet::new();
1163 let mut region_names = HashSet::new();
1164 for br in &same_regions.regions {
1167 anon_nums.insert(i);
1169 ty::BrNamed(_, name, _) => {
1170 region_names.insert(name);
1175 (anon_nums, region_names)
1178 fn extract_all_region_names(&self) -> HashSet<ast::Name> {
1179 let mut all_region_names = HashSet::new();
1180 for sr in self.same_regions {
1181 for br in &sr.regions {
1183 ty::BrNamed(_, name, _) => {
1184 all_region_names.insert(name);
1193 fn inc_cur_anon(&self, n: u32) {
1194 let anon = self.cur_anon.get();
1195 self.cur_anon.set(anon+n);
1198 fn offset_cur_anon(&self) {
1199 let mut anon = self.cur_anon.get();
1200 while self.inserted_anons.borrow().contains(&anon) {
1203 self.cur_anon.set(anon);
1206 fn inc_and_offset_cur_anon(&self, n: u32) {
1207 self.inc_cur_anon(n);
1208 self.offset_cur_anon();
1211 fn track_anon(&self, anon: u32) {
1212 self.inserted_anons.borrow_mut().insert(anon);
1215 fn rebuild_ty_params(&self,
1216 ty_params: hir::HirVec<hir::TyParam>,
1217 lifetime: hir::Lifetime,
1218 region_names: &HashSet<ast::Name>)
1219 -> hir::HirVec<hir::TyParam> {
1220 ty_params.iter().map(|ty_param| {
1221 let bounds = self.rebuild_ty_param_bounds(ty_param.bounds.clone(),
1225 name: ty_param.name,
1228 default: ty_param.default.clone(),
1229 span: ty_param.span,
1234 fn rebuild_ty_param_bounds(&self,
1235 ty_param_bounds: hir::TyParamBounds,
1236 lifetime: hir::Lifetime,
1237 region_names: &HashSet<ast::Name>)
1238 -> hir::TyParamBounds {
1239 ty_param_bounds.iter().map(|tpb| {
1241 &hir::RegionTyParamBound(lt) => {
1242 // FIXME -- it's unclear whether I'm supposed to
1243 // substitute lifetime here. I suspect we need to
1244 // be passing down a map.
1245 hir::RegionTyParamBound(lt)
1247 &hir::TraitTyParamBound(ref poly_tr, modifier) => {
1248 let tr = &poly_tr.trait_ref;
1249 let last_seg = tr.path.segments.last().unwrap();
1250 let mut insert = Vec::new();
1251 let lifetimes = last_seg.parameters.lifetimes();
1252 for (i, lt) in lifetimes.iter().enumerate() {
1253 if region_names.contains(<.name) {
1254 insert.push(i as u32);
1257 let rebuild_info = RebuildPathInfo {
1260 expected: lifetimes.len() as u32,
1261 anon_nums: &HashSet::new(),
1262 region_names: region_names
1264 let new_path = self.rebuild_path(rebuild_info, lifetime);
1265 hir::TraitTyParamBound(hir::PolyTraitRef {
1266 bound_lifetimes: poly_tr.bound_lifetimes.clone(),
1267 trait_ref: hir::TraitRef {
1278 fn rebuild_generics(&self,
1279 generics: &hir::Generics,
1280 add: &Vec<hir::Lifetime>,
1281 keep: &HashSet<ast::Name>,
1282 remove: &HashSet<ast::Name>,
1283 ty_params: hir::HirVec<hir::TyParam>,
1284 where_clause: hir::WhereClause)
1286 let mut lifetimes = Vec::new();
1288 lifetimes.push(hir::LifetimeDef { lifetime: *lt,
1289 bounds: hir::HirVec::new() });
1291 for lt in &generics.lifetimes {
1292 if keep.contains(<.lifetime.name) ||
1293 !remove.contains(<.lifetime.name) {
1294 lifetimes.push((*lt).clone());
1298 lifetimes: lifetimes.into(),
1299 ty_params: ty_params,
1300 where_clause: where_clause,
1304 fn rebuild_args_ty(&self,
1305 inputs: &[hir::Arg],
1306 lifetime: hir::Lifetime,
1307 anon_nums: &HashSet<u32>,
1308 region_names: &HashSet<ast::Name>)
1309 -> hir::HirVec<hir::Arg> {
1310 let mut new_inputs = Vec::new();
1312 let new_ty = self.rebuild_arg_ty_or_output(&arg.ty, lifetime,
1313 anon_nums, region_names);
1314 let possibly_new_arg = hir::Arg {
1316 pat: arg.pat.clone(),
1319 new_inputs.push(possibly_new_arg);
1324 fn rebuild_output(&self, ty: &hir::FunctionRetTy,
1325 lifetime: hir::Lifetime,
1326 anon_nums: &HashSet<u32>,
1327 region_names: &HashSet<ast::Name>) -> hir::FunctionRetTy {
1329 hir::Return(ref ret_ty) => hir::Return(
1330 self.rebuild_arg_ty_or_output(&ret_ty, lifetime, anon_nums, region_names)
1332 hir::DefaultReturn(span) => hir::DefaultReturn(span),
1333 hir::NoReturn(span) => hir::NoReturn(span)
1337 fn rebuild_arg_ty_or_output(&self,
1339 lifetime: hir::Lifetime,
1340 anon_nums: &HashSet<u32>,
1341 region_names: &HashSet<ast::Name>)
1343 let mut new_ty = P(ty.clone());
1344 let mut ty_queue = vec!(ty);
1345 while !ty_queue.is_empty() {
1346 let cur_ty = ty_queue.remove(0);
1348 hir::TyRptr(lt_opt, ref mut_ty) => {
1349 let rebuild = match lt_opt {
1350 Some(lt) => region_names.contains(<.name),
1352 let anon = self.cur_anon.get();
1353 let rebuild = anon_nums.contains(&anon);
1355 self.track_anon(anon);
1357 self.inc_and_offset_cur_anon(1);
1364 node: hir::TyRptr(Some(lifetime), mut_ty.clone()),
1367 new_ty = self.rebuild_ty(new_ty, P(to));
1369 ty_queue.push(&mut_ty.ty);
1371 hir::TyPath(ref maybe_qself, ref path) => {
1372 match self.tcx.expect_def(cur_ty.id) {
1373 Def::Enum(did) | Def::TyAlias(did) | Def::Struct(did) => {
1374 let generics = self.tcx.lookup_item_type(did).generics;
1377 generics.regions.len(subst::TypeSpace) as u32;
1379 path.segments.last().unwrap().parameters.lifetimes();
1380 let mut insert = Vec::new();
1381 if lifetimes.is_empty() {
1382 let anon = self.cur_anon.get();
1383 for (i, a) in (anon..anon+expected).enumerate() {
1384 if anon_nums.contains(&a) {
1385 insert.push(i as u32);
1389 self.inc_and_offset_cur_anon(expected);
1391 for (i, lt) in lifetimes.iter().enumerate() {
1392 if region_names.contains(<.name) {
1393 insert.push(i as u32);
1397 let rebuild_info = RebuildPathInfo {
1401 anon_nums: anon_nums,
1402 region_names: region_names
1404 let new_path = self.rebuild_path(rebuild_info, lifetime);
1405 let qself = maybe_qself.as_ref().map(|qself| {
1407 ty: self.rebuild_arg_ty_or_output(&qself.ty, lifetime,
1408 anon_nums, region_names),
1409 position: qself.position
1414 node: hir::TyPath(qself, new_path),
1417 new_ty = self.rebuild_ty(new_ty, P(to));
1423 hir::TyPtr(ref mut_ty) => {
1424 ty_queue.push(&mut_ty.ty);
1426 hir::TyVec(ref ty) |
1427 hir::TyFixedLengthVec(ref ty, _) => {
1430 hir::TyTup(ref tys) => ty_queue.extend(tys.iter().map(|ty| &**ty)),
1437 fn rebuild_ty(&self,
1442 fn build_to(from: P<hir::Ty>,
1443 to: &mut Option<P<hir::Ty>>)
1445 if Some(from.id) == to.as_ref().map(|ty| ty.id) {
1446 return to.take().expect("`to` type found more than once during rebuild");
1448 from.map(|hir::Ty {id, node, span}| {
1449 let new_node = match node {
1450 hir::TyRptr(lifetime, mut_ty) => {
1451 hir::TyRptr(lifetime, hir::MutTy {
1452 mutbl: mut_ty.mutbl,
1453 ty: build_to(mut_ty.ty, to),
1456 hir::TyPtr(mut_ty) => {
1457 hir::TyPtr(hir::MutTy {
1458 mutbl: mut_ty.mutbl,
1459 ty: build_to(mut_ty.ty, to),
1462 hir::TyVec(ty) => hir::TyVec(build_to(ty, to)),
1463 hir::TyFixedLengthVec(ty, e) => {
1464 hir::TyFixedLengthVec(build_to(ty, to), e)
1466 hir::TyTup(tys) => {
1467 hir::TyTup(tys.into_iter().map(|ty| build_to(ty, to)).collect())
1471 hir::Ty { id: id, node: new_node, span: span }
1475 build_to(from, &mut Some(to))
1478 fn rebuild_path(&self,
1479 rebuild_info: RebuildPathInfo,
1480 lifetime: hir::Lifetime)
1483 let RebuildPathInfo {
1491 let last_seg = path.segments.last().unwrap();
1492 let new_parameters = match last_seg.parameters {
1493 hir::ParenthesizedParameters(..) => {
1494 last_seg.parameters.clone()
1497 hir::AngleBracketedParameters(ref data) => {
1498 let mut new_lts = Vec::new();
1499 if data.lifetimes.is_empty() {
1500 // traverse once to see if there's a need to insert lifetime
1501 let need_insert = (0..expected).any(|i| {
1502 indexes.contains(&i)
1505 for i in 0..expected {
1506 if indexes.contains(&i) {
1507 new_lts.push(lifetime);
1509 new_lts.push(self.life_giver.give_lifetime());
1514 for (i, lt) in data.lifetimes.iter().enumerate() {
1515 if indexes.contains(&(i as u32)) {
1516 new_lts.push(lifetime);
1522 let new_types = data.types.iter().map(|t| {
1523 self.rebuild_arg_ty_or_output(&t, lifetime, anon_nums, region_names)
1525 let new_bindings = data.bindings.iter().map(|b| {
1529 ty: self.rebuild_arg_ty_or_output(&b.ty,
1536 hir::AngleBracketedParameters(hir::AngleBracketedParameterData {
1537 lifetimes: new_lts.into(),
1539 bindings: new_bindings,
1543 let new_seg = hir::PathSegment {
1544 name: last_seg.name,
1545 parameters: new_parameters
1547 let mut new_segs = Vec::new();
1548 new_segs.extend_from_slice(path.segments.split_last().unwrap().1);
1549 new_segs.push(new_seg);
1552 global: path.global,
1553 segments: new_segs.into()
1558 impl<'a, 'gcx, 'tcx> InferCtxt<'a, 'gcx, 'tcx> {
1559 fn give_expl_lifetime_param(&self,
1560 err: &mut DiagnosticBuilder,
1562 unsafety: hir::Unsafety,
1563 constness: hir::Constness,
1565 generics: &hir::Generics,
1567 let suggested_fn = pprust::fun_to_string(decl, unsafety, constness, name, generics);
1568 let msg = format!("consider using an explicit lifetime \
1569 parameter as shown: {}", suggested_fn);
1570 err.span_help(span, &msg[..]);
1573 fn report_inference_failure(&self,
1574 var_origin: RegionVariableOrigin)
1575 -> DiagnosticBuilder<'tcx> {
1576 let br_string = |br: ty::BoundRegion| {
1577 let mut s = br.to_string();
1583 let var_description = match var_origin {
1584 infer::MiscVariable(_) => "".to_string(),
1585 infer::PatternRegion(_) => " for pattern".to_string(),
1586 infer::AddrOfRegion(_) => " for borrow expression".to_string(),
1587 infer::Autoref(_) => " for autoref".to_string(),
1588 infer::Coercion(_) => " for automatic coercion".to_string(),
1589 infer::LateBoundRegion(_, br, infer::FnCall) => {
1590 format!(" for lifetime parameter {}in function call",
1593 infer::LateBoundRegion(_, br, infer::HigherRankedType) => {
1594 format!(" for lifetime parameter {}in generic type", br_string(br))
1596 infer::LateBoundRegion(_, br, infer::AssocTypeProjection(type_name)) => {
1597 format!(" for lifetime parameter {}in trait containing associated type `{}`",
1598 br_string(br), type_name)
1600 infer::EarlyBoundRegion(_, name) => {
1601 format!(" for lifetime parameter `{}`",
1604 infer::BoundRegionInCoherence(name) => {
1605 format!(" for lifetime parameter `{}` in coherence check",
1608 infer::UpvarRegion(ref upvar_id, _) => {
1609 format!(" for capture of `{}` by closure",
1610 self.tcx.local_var_name_str(upvar_id.var_id).to_string())
1614 struct_span_err!(self.tcx.sess, var_origin.span(), E0495,
1615 "cannot infer an appropriate lifetime{} \
1616 due to conflicting requirements",
1620 fn note_region_origin(&self, err: &mut DiagnosticBuilder, origin: &SubregionOrigin<'tcx>) {
1622 infer::Subtype(ref trace) => {
1623 if let Some((expected, found)) = self.values_str(&trace.values) {
1624 // FIXME: do we want a "the" here?
1626 trace.origin.span(),
1627 &format!("...so that {} (expected {}, found {})",
1628 trace.origin.as_requirement_str(), expected, found));
1630 // FIXME: this really should be handled at some earlier stage. Our
1631 // handling of region checking when type errors are present is
1635 trace.origin.span(),
1636 &format!("...so that {}",
1637 trace.origin.as_requirement_str()));
1640 infer::Reborrow(span) => {
1643 "...so that reference does not outlive \
1646 infer::ReborrowUpvar(span, ref upvar_id) => {
1650 "...so that closure can access `{}`",
1651 self.tcx.local_var_name_str(upvar_id.var_id)
1654 infer::InfStackClosure(span) => {
1657 "...so that closure does not outlive its stack frame");
1659 infer::InvokeClosure(span) => {
1662 "...so that closure is not invoked outside its lifetime");
1664 infer::DerefPointer(span) => {
1667 "...so that pointer is not dereferenced \
1668 outside its lifetime");
1670 infer::FreeVariable(span, id) => {
1673 &format!("...so that captured variable `{}` \
1674 does not outlive the enclosing closure",
1675 self.tcx.local_var_name_str(id)));
1677 infer::IndexSlice(span) => {
1680 "...so that slice is not indexed outside the lifetime");
1682 infer::RelateObjectBound(span) => {
1685 "...so that it can be closed over into an object");
1687 infer::CallRcvr(span) => {
1690 "...so that method receiver is valid for the method call");
1692 infer::CallArg(span) => {
1695 "...so that argument is valid for the call");
1697 infer::CallReturn(span) => {
1700 "...so that return value is valid for the call");
1702 infer::Operand(span) => {
1705 "...so that operand is valid for operation");
1707 infer::AddrOf(span) => {
1710 "...so that reference is valid \
1711 at the time of borrow");
1713 infer::AutoBorrow(span) => {
1716 "...so that auto-reference is valid \
1717 at the time of borrow");
1719 infer::ExprTypeIsNotInScope(t, span) => {
1722 &format!("...so type `{}` of expression is valid during the \
1724 self.ty_to_string(t)));
1726 infer::BindingTypeIsNotValidAtDecl(span) => {
1729 "...so that variable is valid at time of its declaration");
1731 infer::ParameterInScope(_, span) => {
1734 "...so that a type/lifetime parameter is in scope here");
1736 infer::DataBorrowed(ty, span) => {
1739 &format!("...so that the type `{}` is not borrowed for too long",
1740 self.ty_to_string(ty)));
1742 infer::ReferenceOutlivesReferent(ty, span) => {
1745 &format!("...so that the reference type `{}` \
1746 does not outlive the data it points at",
1747 self.ty_to_string(ty)));
1749 infer::RelateParamBound(span, t) => {
1752 &format!("...so that the type `{}` \
1753 will meet its required lifetime bounds",
1754 self.ty_to_string(t)));
1756 infer::RelateDefaultParamBound(span, t) => {
1759 &format!("...so that type parameter \
1760 instantiated with `{}`, \
1761 will meet its declared lifetime bounds",
1762 self.ty_to_string(t)));
1764 infer::RelateRegionParamBound(span) => {
1767 "...so that the declared lifetime parameter bounds \
1770 infer::SafeDestructor(span) => {
1773 "...so that references are valid when the destructor \
1780 fn lifetimes_in_scope<'a, 'gcx, 'tcx>(tcx: TyCtxt<'a, 'gcx, 'tcx>,
1781 scope_id: ast::NodeId)
1782 -> Vec<hir::LifetimeDef> {
1783 let mut taken = Vec::new();
1784 let parent = tcx.map.get_parent(scope_id);
1785 let method_id_opt = match tcx.map.find(parent) {
1786 Some(node) => match node {
1787 ast_map::NodeItem(item) => match item.node {
1788 hir::ItemFn(_, _, _, _, ref gen, _) => {
1789 taken.extend_from_slice(&gen.lifetimes);
1794 ast_map::NodeImplItem(ii) => {
1796 hir::ImplItemKind::Method(ref sig, _) => {
1797 taken.extend_from_slice(&sig.generics.lifetimes);
1807 if let Some(method_id) = method_id_opt {
1808 let parent = tcx.map.get_parent(method_id);
1809 if let Some(node) = tcx.map.find(parent) {
1811 ast_map::NodeItem(item) => match item.node {
1812 hir::ItemImpl(_, _, ref gen, _, _, _) => {
1813 taken.extend_from_slice(&gen.lifetimes);
1824 // LifeGiver is responsible for generating fresh lifetime names
1826 taken: HashSet<String>,
1827 counter: Cell<usize>,
1828 generated: RefCell<Vec<hir::Lifetime>>,
1832 fn with_taken(taken: &[hir::LifetimeDef]) -> LifeGiver {
1833 let mut taken_ = HashSet::new();
1835 let lt_name = lt.lifetime.name.to_string();
1836 taken_.insert(lt_name);
1840 counter: Cell::new(0),
1841 generated: RefCell::new(Vec::new()),
1845 fn inc_counter(&self) {
1846 let c = self.counter.get();
1847 self.counter.set(c+1);
1850 fn give_lifetime(&self) -> hir::Lifetime {
1853 let mut s = String::from("'");
1854 s.push_str(&num_to_string(self.counter.get()));
1855 if !self.taken.contains(&s) {
1856 lifetime = name_to_dummy_lifetime(token::intern(&s[..]));
1857 self.generated.borrow_mut().push(lifetime);
1865 // 0 .. 25 generates a .. z, 26 .. 51 generates aa .. zz, and so on
1866 fn num_to_string(counter: usize) -> String {
1867 let mut s = String::new();
1868 let (n, r) = (counter/26 + 1, counter % 26);
1869 let letter: char = from_u32((r+97) as u32).unwrap();
1877 fn get_generated_lifetimes(&self) -> Vec<hir::Lifetime> {
1878 self.generated.borrow().clone()
1882 fn name_to_dummy_lifetime(name: ast::Name) -> hir::Lifetime {
1883 hir::Lifetime { id: ast::DUMMY_NODE_ID,
1884 span: syntax_pos::DUMMY_SP,