rust-clippy/clippy_lints/src/lifetimes.rs

516 lines
17 KiB
Rust
Raw Normal View History

2018-11-27 20:14:15 +00:00
use matches::matches;
2019-12-03 23:16:03 +00:00
use rustc::declare_lint_pass;
use rustc::hir::intravisit::*;
use rustc::lint::{in_external_macro, LateContext, LateLintPass, LintArray, LintContext, LintPass};
use rustc_data_structures::fx::{FxHashMap, FxHashSet};
2020-01-06 16:39:50 +00:00
use rustc_hir::def::{DefKind, Res};
use rustc_hir::FunctionRetTy::Return;
use rustc_hir::*;
2019-12-03 23:16:03 +00:00
use rustc_session::declare_tool_lint;
use rustc_span::source_map::Span;
use rustc_span::symbol::kw;
2019-01-31 01:15:29 +00:00
use crate::reexport::*;
use crate::utils::{last_path_segment, span_lint, trait_ref_of_method};
2019-01-31 01:15:29 +00:00
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// **What it does:** Checks for lifetime annotations which can be removed by
/// relying on lifetime elision.
///
/// **Why is this bad?** The additional lifetimes make the code look more
/// complicated, while there is nothing out of the ordinary going on. Removing
/// them leads to more readable code.
///
/// **Known problems:** Potential false negatives: we bail out if the function
2019-03-10 17:19:47 +00:00
/// has a `where` clause where lifetimes are mentioned.
///
/// **Example:**
/// ```rust
/// // Bad: unnecessary lifetime annotations
/// fn in_and_out<'a>(x: &'a u8, y: u8) -> &'a u8 {
/// x
/// }
///
/// // Good
/// fn elided(x: &u8, y: u8) -> &u8 {
/// x
/// }
/// ```
pub NEEDLESS_LIFETIMES,
complexity,
"using explicit lifetimes for references in function arguments when elision rules \
would allow omitting them"
}
2018-03-28 13:24:26 +00:00
declare_clippy_lint! {
/// **What it does:** Checks for lifetimes in generics that are never used
/// anywhere else.
///
/// **Why is this bad?** The additional lifetimes make the code look more
/// complicated, while there is nothing out of the ordinary going on. Removing
/// them leads to more readable code.
///
/// **Known problems:** None.
///
/// **Example:**
/// ```rust
/// // Bad: unnecessary lifetimes
/// fn unused_lifetime<'a>(x: u8) {
/// // ..
/// }
///
/// // Good
/// fn no_lifetime(x: u8) {
/// // ...
/// }
/// ```
2018-05-26 08:23:34 +00:00
pub EXTRA_UNUSED_LIFETIMES,
2018-03-28 13:24:26 +00:00
complexity,
"unused lifetimes in function definitions"
}
2019-04-08 20:43:55 +00:00
declare_lint_pass!(Lifetimes => [NEEDLESS_LIFETIMES, EXTRA_UNUSED_LIFETIMES]);
2019-04-08 20:43:55 +00:00
impl<'a, 'tcx> LateLintPass<'a, 'tcx> for Lifetimes {
2019-12-22 14:42:41 +00:00
fn check_item(&mut self, cx: &LateContext<'a, 'tcx>, item: &'tcx Item<'_>) {
2019-11-08 20:12:08 +00:00
if let ItemKind::Fn(ref sig, ref generics, id) = item.kind {
check_fn_inner(cx, &sig.decl, Some(id), generics, item.span, true);
}
}
2019-12-22 14:42:41 +00:00
fn check_impl_item(&mut self, cx: &LateContext<'a, 'tcx>, item: &'tcx ImplItem<'_>) {
2019-09-27 15:16:06 +00:00
if let ImplItemKind::Method(ref sig, id) = item.kind {
let report_extra_lifetimes = trait_ref_of_method(cx, item.hir_id).is_none();
check_fn_inner(
cx,
&sig.decl,
Some(id),
&item.generics,
item.span,
report_extra_lifetimes,
);
}
}
2019-12-22 14:42:41 +00:00
fn check_trait_item(&mut self, cx: &LateContext<'a, 'tcx>, item: &'tcx TraitItem<'_>) {
2019-09-27 15:16:06 +00:00
if let TraitItemKind::Method(ref sig, ref body) = item.kind {
let body = match *body {
TraitMethod::Required(_) => None,
TraitMethod::Provided(id) => Some(id),
};
check_fn_inner(cx, &sig.decl, body, &item.generics, item.span, true);
}
}
}
/// The lifetime of a &-reference.
#[derive(PartialEq, Eq, Hash, Debug)]
enum RefLt {
Unnamed,
Static,
Named(Name),
}
2017-04-12 09:06:32 +00:00
fn check_fn_inner<'a, 'tcx>(
cx: &LateContext<'a, 'tcx>,
2019-12-30 04:02:10 +00:00
decl: &'tcx FnDecl<'_>,
2017-04-12 09:06:32 +00:00
body: Option<BodyId>,
2019-12-30 04:02:10 +00:00
generics: &'tcx Generics<'_>,
2017-08-09 07:30:56 +00:00
span: Span,
report_extra_lifetimes: bool,
2017-04-12 09:06:32 +00:00
) {
2018-07-24 06:55:38 +00:00
if in_external_macro(cx.sess(), span) || has_where_lifetimes(cx, &generics.where_clause) {
return;
}
let mut bounds_lts = Vec::new();
2018-09-27 04:29:48 +00:00
let types = generics.params.iter().filter(|param| match param.kind {
GenericParamKind::Type { .. } => true,
_ => false,
});
for typ in types {
2019-12-30 04:02:10 +00:00
for bound in typ.bounds {
let mut visitor = RefVisitor::new(cx);
walk_param_bound(&mut visitor, bound);
if visitor.lts.iter().any(|lt| matches!(lt, RefLt::Named(_))) {
return;
}
if let GenericBound::Trait(ref trait_ref, _) = *bound {
let params = &trait_ref
.trait_ref
.path
.segments
.last()
.expect("a path must have at least one segment")
.args;
if let Some(ref params) = *params {
let lifetimes = params.args.iter().filter_map(|arg| match arg {
GenericArg::Lifetime(lt) => Some(lt),
_ => None,
});
for bound in lifetimes {
if bound.name != LifetimeName::Static && !bound.is_elided() {
return;
}
bounds_lts.push(bound);
}
}
}
}
}
if could_use_elision(cx, decl, body, &generics.params, bounds_lts) {
2017-08-09 07:30:56 +00:00
span_lint(
cx,
NEEDLESS_LIFETIMES,
span,
2018-11-27 20:14:15 +00:00
"explicit lifetimes given in parameter types where they could be elided \
(or replaced with `'_` if needed by type declaration)",
2017-08-09 07:30:56 +00:00
);
}
if report_extra_lifetimes {
self::report_extra_lifetimes(cx, decl, generics);
}
}
fn could_use_elision<'a, 'tcx>(
cx: &LateContext<'a, 'tcx>,
2019-12-30 04:02:10 +00:00
func: &'tcx FnDecl<'_>,
body: Option<BodyId>,
2019-12-30 04:02:10 +00:00
named_generics: &'tcx [GenericParam<'_>],
2017-08-09 07:30:56 +00:00
bounds_lts: Vec<&'tcx Lifetime>,
) -> bool {
// There are two scenarios where elision works:
// * no output references, all input references have different LT
// * output references, exactly one input reference with same LT
// All lifetimes must be unnamed, 'static or defined without bounds on the
// level of the current item.
// check named LTs
let allowed_lts = allowed_lts_from(named_generics);
// these will collect all the lifetimes for references in arg/return types
let mut input_visitor = RefVisitor::new(cx);
let mut output_visitor = RefVisitor::new(cx);
// extract lifetimes in input argument types
2019-12-30 04:02:10 +00:00
for arg in func.inputs {
input_visitor.visit_ty(arg);
}
// extract lifetimes in output type
if let Return(ref ty) = func.output {
output_visitor.visit_ty(ty);
}
let input_lts = match input_visitor.into_vec() {
Some(lts) => lts_from_bounds(lts, bounds_lts.into_iter()),
None => return false,
};
let output_lts = match output_visitor.into_vec() {
Some(val) => val,
None => return false,
};
if let Some(body_id) = body {
2017-09-05 09:33:04 +00:00
let mut checker = BodyLifetimeChecker {
lifetimes_used_in_body: false,
};
checker.visit_expr(&cx.tcx.hir().body(body_id).value);
if checker.lifetimes_used_in_body {
return false;
}
}
// check for lifetimes from higher scopes
for lt in input_lts.iter().chain(output_lts.iter()) {
if !allowed_lts.contains(lt) {
return false;
}
}
// no input lifetimes? easy case!
if input_lts.is_empty() {
false
} else if output_lts.is_empty() {
// no output lifetimes, check distinctness of input lifetimes
// only unnamed and static, ok
2018-11-27 20:14:15 +00:00
let unnamed_and_static = input_lts.iter().all(|lt| *lt == RefLt::Unnamed || *lt == RefLt::Static);
if unnamed_and_static {
return false;
}
// we have no output reference, so we only need all distinct lifetimes
input_lts.len() == unique_lifetimes(&input_lts)
} else {
// we have output references, so we need one input reference,
// and all output lifetimes must be the same
if unique_lifetimes(&output_lts) > 1 {
return false;
}
if input_lts.len() == 1 {
match (&input_lts[0], &output_lts[0]) {
(&RefLt::Named(n1), &RefLt::Named(n2)) if n1 == n2 => true,
(&RefLt::Named(_), &RefLt::Unnamed) => true,
2017-09-05 09:33:04 +00:00
_ => false, /* already elided, different named lifetimes
* or something static going on */
}
} else {
false
}
}
}
2019-12-30 04:02:10 +00:00
fn allowed_lts_from(named_generics: &[GenericParam<'_>]) -> FxHashSet<RefLt> {
let mut allowed_lts = FxHashSet::default();
for par in named_generics.iter() {
if let GenericParamKind::Lifetime { .. } = par.kind {
if par.bounds.is_empty() {
2018-06-28 13:46:58 +00:00
allowed_lts.insert(RefLt::Named(par.name.ident().name));
}
}
}
allowed_lts.insert(RefLt::Unnamed);
allowed_lts.insert(RefLt::Static);
allowed_lts
}
2016-01-30 12:48:39 +00:00
fn lts_from_bounds<'a, T: Iterator<Item = &'a Lifetime>>(mut vec: Vec<RefLt>, bounds_lts: T) -> Vec<RefLt> {
for lt in bounds_lts {
if lt.name != LifetimeName::Static {
2018-06-28 13:46:58 +00:00
vec.push(RefLt::Named(lt.name.ident().name));
}
}
vec
}
/// Number of unique lifetimes in the given vector.
#[must_use]
2015-08-13 14:28:11 +00:00
fn unique_lifetimes(lts: &[RefLt]) -> usize {
lts.iter().collect::<FxHashSet<_>>().len()
}
/// A visitor usable for `rustc_front::visit::walk_ty()`.
struct RefVisitor<'a, 'tcx> {
cx: &'a LateContext<'a, 'tcx>,
2016-01-04 04:26:12 +00:00
lts: Vec<RefLt>,
abort: bool,
}
2016-01-04 04:26:12 +00:00
impl<'v, 't> RefVisitor<'v, 't> {
2017-08-21 11:32:12 +00:00
fn new(cx: &'v LateContext<'v, 't>) -> Self {
Self {
cx,
2016-01-04 04:26:12 +00:00
lts: Vec::new(),
abort: false,
2016-01-04 04:26:12 +00:00
}
}
fn record(&mut self, lifetime: &Option<Lifetime>) {
2015-11-24 17:44:40 +00:00
if let Some(ref lt) = *lifetime {
if lt.name == LifetimeName::Static {
self.lts.push(RefLt::Static);
} else if let LifetimeName::Param(ParamName::Fresh(_)) = lt.name {
// Fresh lifetimes generated should be ignored.
2017-02-03 10:52:13 +00:00
} else if lt.is_elided() {
self.lts.push(RefLt::Unnamed);
} else {
2018-06-28 13:46:58 +00:00
self.lts.push(RefLt::Named(lt.name.ident().name));
}
} else {
self.lts.push(RefLt::Unnamed);
}
}
fn into_vec(self) -> Option<Vec<RefLt>> {
2017-09-05 09:33:04 +00:00
if self.abort {
None
} else {
Some(self.lts)
}
}
2019-12-30 04:02:10 +00:00
fn collect_anonymous_lifetimes(&mut self, qpath: &QPath<'_>, ty: &Ty<'_>) {
if let Some(ref last_path_segment) = last_path_segment(qpath).args {
if !last_path_segment.parenthesized
&& !last_path_segment.args.iter().any(|arg| match arg {
GenericArg::Lifetime(_) => true,
_ => false,
2018-11-27 20:14:15 +00:00
})
{
2019-02-24 18:43:15 +00:00
let hir_id = ty.hir_id;
match self.cx.tables.qpath_res(qpath, hir_id) {
Res::Def(DefKind::TyAlias, def_id) | Res::Def(DefKind::Struct, def_id) => {
let generics = self.cx.tcx.generics_of(def_id);
2018-05-17 09:21:15 +00:00
for _ in generics.params.as_slice() {
self.record(&None);
}
},
Res::Def(DefKind::Trait, def_id) => {
let trait_def = self.cx.tcx.trait_def(def_id);
2018-05-17 09:21:15 +00:00
for _ in &self.cx.tcx.generics_of(trait_def.def_id).params {
self.record(&None);
}
},
_ => (),
}
}
}
}
}
impl<'a, 'tcx> Visitor<'tcx> for RefVisitor<'a, 'tcx> {
// for lifetimes as parameters of generics
fn visit_lifetime(&mut self, lifetime: &'tcx Lifetime) {
self.record(&Some(*lifetime));
}
2019-12-30 04:02:10 +00:00
fn visit_ty(&mut self, ty: &'tcx Ty<'_>) {
2019-09-27 15:16:06 +00:00
match ty.kind {
2018-07-12 08:03:06 +00:00
TyKind::Rptr(ref lt, _) if lt.is_elided() => {
self.record(&None);
2016-12-20 17:21:30 +00:00
},
2018-07-12 08:03:06 +00:00
TyKind::Path(ref path) => {
self.collect_anonymous_lifetimes(path, ty);
2018-11-27 20:14:15 +00:00
},
TyKind::Def(item, _) => {
let map = self.cx.tcx.hir();
2019-09-27 15:16:06 +00:00
if let ItemKind::OpaqueTy(ref exist_ty) = map.expect_item(item.id).kind {
2019-12-30 04:02:10 +00:00
for bound in exist_ty.bounds {
if let GenericBound::Outlives(_) = *bound {
self.record(&None);
2018-06-19 07:56:37 +00:00
}
2017-11-22 09:55:12 +00:00
}
} else {
unreachable!()
2017-11-22 09:55:12 +00:00
}
walk_ty(self, ty);
2018-11-27 20:14:15 +00:00
},
2019-12-30 04:02:10 +00:00
TyKind::TraitObject(bounds, ref lt) => {
if !lt.is_elided() {
self.abort = true;
}
for bound in bounds {
self.visit_poly_trait_ref(bound, TraitBoundModifier::None);
}
return;
},
2016-04-14 18:14:03 +00:00
_ => (),
}
walk_ty(self, ty);
}
fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
NestedVisitorMap::None
}
}
2019-03-10 17:19:47 +00:00
/// Are any lifetimes mentioned in the `where` clause? If so, we don't try to
/// reason about elision.
2019-12-30 04:02:10 +00:00
fn has_where_lifetimes<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, where_clause: &'tcx WhereClause<'_>) -> bool {
for predicate in where_clause.predicates {
match *predicate {
WherePredicate::RegionPredicate(..) => return true,
WherePredicate::BoundPredicate(ref pred) => {
// a predicate like F: Trait or F: for<'a> Trait<'a>
let mut visitor = RefVisitor::new(cx);
// walk the type F, it may not contain LT refs
walk_ty(&mut visitor, &pred.bounded_ty);
2016-01-04 04:26:12 +00:00
if !visitor.lts.is_empty() {
return true;
}
// if the bounds define new lifetimes, they are fine to occur
let allowed_lts = allowed_lts_from(&pred.bound_generic_params);
// now walk the bounds
for bound in pred.bounds.iter() {
walk_param_bound(&mut visitor, bound);
}
// and check that all lifetimes are allowed
match visitor.into_vec() {
None => return false,
2018-11-27 20:14:15 +00:00
Some(lts) => {
for lt in lts {
if !allowed_lts.contains(&lt) {
return true;
}
}
},
}
2016-12-20 17:21:30 +00:00
},
WherePredicate::EqPredicate(ref pred) => {
let mut visitor = RefVisitor::new(cx);
walk_ty(&mut visitor, &pred.lhs_ty);
walk_ty(&mut visitor, &pred.rhs_ty);
2016-01-04 04:26:12 +00:00
if !visitor.lts.is_empty() {
return true;
}
2016-12-20 17:21:30 +00:00
},
}
}
false
}
struct LifetimeChecker {
map: FxHashMap<Name, Span>,
}
impl<'tcx> Visitor<'tcx> for LifetimeChecker {
// for lifetimes as parameters of generics
fn visit_lifetime(&mut self, lifetime: &'tcx Lifetime) {
2018-06-28 13:46:58 +00:00
self.map.remove(&lifetime.name.ident().name);
}
2019-12-30 04:02:10 +00:00
fn visit_generic_param(&mut self, param: &'tcx GenericParam<'_>) {
// don't actually visit `<'a>` or `<'a: 'b>`
// we've already visited the `'a` declarations and
// don't want to spuriously remove them
// `'b` in `'a: 'b` is useless unless used elsewhere in
// a non-lifetime bound
if let GenericParamKind::Type { .. } = param.kind {
walk_generic_param(self, param)
}
}
fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
NestedVisitorMap::None
}
}
2019-12-30 04:02:10 +00:00
fn report_extra_lifetimes<'a, 'tcx>(cx: &LateContext<'a, 'tcx>, func: &'tcx FnDecl<'_>, generics: &'tcx Generics<'_>) {
2018-11-27 20:14:15 +00:00
let hs = generics
.params
.iter()
.filter_map(|par| match par.kind {
2018-06-28 13:46:58 +00:00
GenericParamKind::Lifetime { .. } => Some((par.name.ident().name, par.span)),
_ => None,
})
2016-12-20 17:21:30 +00:00
.collect();
let mut checker = LifetimeChecker { map: hs };
walk_generics(&mut checker, generics);
walk_fn_decl(&mut checker, func);
for &v in checker.map.values() {
2018-11-27 20:14:15 +00:00
span_lint(
cx,
EXTRA_UNUSED_LIFETIMES,
v,
"this lifetime isn't used in the function definition",
);
}
}
struct BodyLifetimeChecker {
lifetimes_used_in_body: bool,
}
impl<'tcx> Visitor<'tcx> for BodyLifetimeChecker {
// for lifetimes as parameters of generics
fn visit_lifetime(&mut self, lifetime: &'tcx Lifetime) {
if lifetime.name.ident().name != kw::Invalid && lifetime.name.ident().name != kw::StaticLifetime {
self.lifetimes_used_in_body = true;
}
}
fn nested_visit_map<'this>(&'this mut self) -> NestedVisitorMap<'this, 'tcx> {
NestedVisitorMap::None
}
2017-04-11 13:54:48 +00:00
}