1 #![feature(box_patterns)]
2 #![feature(in_band_lifetimes)]
3 #![feature(or_patterns)]
4 #![feature(rustc_private)]
5 #![recursion_limit = "512"]
6 #![allow(clippy::missing_errors_doc, clippy::missing_panics_doc, clippy::must_use_candidate)]
8 // FIXME: switch to something more ergonomic here, once available.
9 // (Currently there is no way to opt into sysroot crates without `extern crate`.)
10 extern crate rustc_ast;
11 extern crate rustc_ast_pretty;
12 extern crate rustc_data_structures;
13 extern crate rustc_errors;
14 extern crate rustc_hir;
15 extern crate rustc_hir_pretty;
16 extern crate rustc_infer;
17 extern crate rustc_lint;
18 extern crate rustc_middle;
19 extern crate rustc_mir;
20 extern crate rustc_session;
21 extern crate rustc_span;
22 extern crate rustc_target;
23 extern crate rustc_trait_selection;
24 extern crate rustc_typeck;
29 #[allow(clippy::module_name_repetitions)]
36 pub mod eager_or_lazy;
39 pub mod numeric_literal;
42 pub mod qualify_min_const_fn;
47 pub use self::attrs::*;
48 pub use self::diagnostics::*;
49 pub use self::hir_utils::{both, eq_expr_value, over, SpanlessEq, SpanlessHash};
52 use std::collections::hash_map::Entry;
53 use std::hash::BuildHasherDefault;
55 use if_chain::if_chain;
56 use rustc_ast::ast::{self, Attribute, BorrowKind, LitKind, Mutability};
57 use rustc_data_structures::fx::FxHashMap;
58 use rustc_errors::Applicability;
60 use rustc_hir::def::{CtorKind, CtorOf, DefKind, Res};
61 use rustc_hir::def_id::{DefId, LOCAL_CRATE};
62 use rustc_hir::intravisit::{self, NestedVisitorMap, Visitor};
65 def, Arm, Block, Body, Constness, Crate, Expr, ExprKind, FnDecl, HirId, ImplItem, ImplItemKind, Item, ItemKind,
66 MatchSource, Param, Pat, PatKind, Path, PathSegment, QPath, TraitItem, TraitItemKind, TraitRef, TyKind, Unsafety,
68 use rustc_infer::infer::TyCtxtInferExt;
69 use rustc_lint::{LateContext, Level, Lint, LintContext};
70 use rustc_middle::hir::exports::Export;
71 use rustc_middle::hir::map::Map;
72 use rustc_middle::ty::subst::{GenericArg, GenericArgKind};
73 use rustc_middle::ty::{self, layout::IntegerExt, DefIdTree, Ty, TyCtxt, TypeFoldable};
74 use rustc_semver::RustcVersion;
75 use rustc_session::Session;
76 use rustc_span::hygiene::{self, ExpnKind, MacroKind};
77 use rustc_span::source_map::original_sp;
79 use rustc_span::symbol::{kw, Symbol};
80 use rustc_span::{BytePos, Pos, Span, SyntaxContext, DUMMY_SP};
81 use rustc_target::abi::Integer;
82 use rustc_trait_selection::traits::query::normalize::AtExt;
83 use smallvec::SmallVec;
85 use crate::consts::{constant, Constant};
87 pub fn parse_msrv(msrv: &str, sess: Option<&Session>, span: Option<Span>) -> Option<RustcVersion> {
88 if let Ok(version) = RustcVersion::parse(msrv) {
90 } else if let Some(sess) = sess {
91 if let Some(span) = span {
92 sess.span_err(span, &format!("`{}` is not a valid Rust version", msrv));
98 pub fn meets_msrv(msrv: Option<&RustcVersion>, lint_msrv: &RustcVersion) -> bool {
99 msrv.map_or(true, |msrv| msrv.meets(*lint_msrv))
103 macro_rules! extract_msrv_attr {
105 extract_msrv_attr!(@LateContext, ());
108 extract_msrv_attr!(@EarlyContext);
110 (@$context:ident$(, $call:tt)?) => {
111 fn enter_lint_attrs(&mut self, cx: &rustc_lint::$context<'tcx>, attrs: &'tcx [rustc_ast::ast::Attribute]) {
112 use $crate::get_unique_inner_attr;
113 match get_unique_inner_attr(cx.sess$($call)?, attrs, "msrv") {
115 if let Some(msrv) = msrv_attr.value_str() {
116 self.msrv = $crate::parse_msrv(
118 Some(cx.sess$($call)?),
119 Some(msrv_attr.span),
122 cx.sess$($call)?.span_err(msrv_attr.span, "bad clippy attribute");
131 /// Returns `true` if the two spans come from differing expansions (i.e., one is
132 /// from a macro and one isn't).
134 pub fn differing_macro_contexts(lhs: Span, rhs: Span) -> bool {
135 rhs.ctxt() != lhs.ctxt()
138 /// Returns `true` if the given `NodeId` is inside a constant context
143 /// if in_constant(cx, expr.hir_id) {
147 pub fn in_constant(cx: &LateContext<'_>, id: HirId) -> bool {
148 let parent_id = cx.tcx.hir().get_parent_item(id);
149 match cx.tcx.hir().get(parent_id) {
151 kind: ItemKind::Const(..) | ItemKind::Static(..),
154 | Node::TraitItem(&TraitItem {
155 kind: TraitItemKind::Const(..),
158 | Node::ImplItem(&ImplItem {
159 kind: ImplItemKind::Const(..),
162 | Node::AnonConst(_) => true,
164 kind: ItemKind::Fn(ref sig, ..),
167 | Node::ImplItem(&ImplItem {
168 kind: ImplItemKind::Fn(ref sig, _),
170 }) => sig.header.constness == Constness::Const,
175 /// Returns `true` if this `span` was expanded by any macro.
177 pub fn in_macro(span: Span) -> bool {
178 if span.from_expansion() {
179 !matches!(span.ctxt().outer_expn_data().kind, ExpnKind::Desugaring(..))
185 // If the snippet is empty, it's an attribute that was inserted during macro
186 // expansion and we want to ignore those, because they could come from external
187 // sources that the user has no control over.
188 // For some reason these attributes don't have any expansion info on them, so
189 // we have to check it this way until there is a better way.
190 pub fn is_present_in_source<T: LintContext>(cx: &T, span: Span) -> bool {
191 if let Some(snippet) = snippet_opt(cx, span) {
192 if snippet.is_empty() {
199 /// Checks if given pattern is a wildcard (`_`)
200 pub fn is_wild<'tcx>(pat: &impl std::ops::Deref<Target = Pat<'tcx>>) -> bool {
201 matches!(pat.kind, PatKind::Wild)
204 /// Checks if type is struct, enum or union type with the given def path.
206 /// If the type is a diagnostic item, use `is_type_diagnostic_item` instead.
207 /// If you change the signature, remember to update the internal lint `MatchTypeOnDiagItem`
208 pub fn match_type(cx: &LateContext<'_>, ty: Ty<'_>, path: &[&str]) -> bool {
210 ty::Adt(adt, _) => match_def_path(cx, adt.did, path),
215 /// Checks if the type is equal to a diagnostic item
217 /// If you change the signature, remember to update the internal lint `MatchTypeOnDiagItem`
218 pub fn is_type_diagnostic_item(cx: &LateContext<'_>, ty: Ty<'_>, diag_item: Symbol) -> bool {
220 ty::Adt(adt, _) => cx.tcx.is_diagnostic_item(diag_item, adt.did),
225 /// Checks if the type is equal to a lang item
226 pub fn is_type_lang_item(cx: &LateContext<'_>, ty: Ty<'_>, lang_item: hir::LangItem) -> bool {
228 ty::Adt(adt, _) => cx.tcx.lang_items().require(lang_item).unwrap() == adt.did,
233 /// Checks if the method call given in `expr` belongs to the given trait.
234 pub fn match_trait_method(cx: &LateContext<'_>, expr: &Expr<'_>, path: &[&str]) -> bool {
235 let def_id = cx.typeck_results().type_dependent_def_id(expr.hir_id).unwrap();
236 let trt_id = cx.tcx.trait_of_item(def_id);
237 trt_id.map_or(false, |trt_id| match_def_path(cx, trt_id, path))
240 /// Checks if an expression references a variable of the given name.
241 pub fn match_var(expr: &Expr<'_>, var: Symbol) -> bool {
242 if let ExprKind::Path(QPath::Resolved(None, ref path)) = expr.kind {
243 if let [p] = path.segments {
244 return p.ident.name == var;
250 pub fn last_path_segment<'tcx>(path: &QPath<'tcx>) -> &'tcx PathSegment<'tcx> {
252 QPath::Resolved(_, ref path) => path.segments.last().expect("A path must have at least one segment"),
253 QPath::TypeRelative(_, ref seg) => seg,
254 QPath::LangItem(..) => panic!("last_path_segment: lang item has no path segments"),
258 pub fn single_segment_path<'tcx>(path: &QPath<'tcx>) -> Option<&'tcx PathSegment<'tcx>> {
260 QPath::Resolved(_, ref path) => path.segments.get(0),
261 QPath::TypeRelative(_, ref seg) => Some(seg),
262 QPath::LangItem(..) => None,
266 /// Matches a `QPath` against a slice of segment string literals.
268 /// There is also `match_path` if you are dealing with a `rustc_hir::Path` instead of a
269 /// `rustc_hir::QPath`.
273 /// match_qpath(path, &["std", "rt", "begin_unwind"])
275 pub fn match_qpath(path: &QPath<'_>, segments: &[&str]) -> bool {
277 QPath::Resolved(_, ref path) => match_path(path, segments),
278 QPath::TypeRelative(ref ty, ref segment) => match ty.kind {
279 TyKind::Path(ref inner_path) => {
280 if let [prefix @ .., end] = segments {
281 if match_qpath(inner_path, prefix) {
282 return segment.ident.name.as_str() == *end;
289 QPath::LangItem(..) => false,
293 /// Matches a `Path` against a slice of segment string literals.
295 /// There is also `match_qpath` if you are dealing with a `rustc_hir::QPath` instead of a
296 /// `rustc_hir::Path`.
301 /// if match_path(&trait_ref.path, &paths::HASH) {
302 /// // This is the `std::hash::Hash` trait.
305 /// if match_path(ty_path, &["rustc", "lint", "Lint"]) {
306 /// // This is a `rustc_middle::lint::Lint`.
309 pub fn match_path(path: &Path<'_>, segments: &[&str]) -> bool {
313 .zip(segments.iter().rev())
314 .all(|(a, b)| a.ident.name.as_str() == *b)
317 /// Matches a `Path` against a slice of segment string literals, e.g.
321 /// match_path_ast(path, &["std", "rt", "begin_unwind"])
323 pub fn match_path_ast(path: &ast::Path, segments: &[&str]) -> bool {
327 .zip(segments.iter().rev())
328 .all(|(a, b)| a.ident.name.as_str() == *b)
331 /// If the expression is a path to a local, returns the canonical `HirId` of the local.
332 pub fn path_to_local(expr: &Expr<'_>) -> Option<HirId> {
333 if let ExprKind::Path(QPath::Resolved(None, ref path)) = expr.kind {
334 if let Res::Local(id) = path.res {
341 /// Returns true if the expression is a path to a local with the specified `HirId`.
342 /// Use this function to see if an expression matches a function argument or a match binding.
343 pub fn path_to_local_id(expr: &Expr<'_>, id: HirId) -> bool {
344 path_to_local(expr) == Some(id)
347 /// Gets the definition associated to a path.
348 #[allow(clippy::shadow_unrelated)] // false positive #6563
349 pub fn path_to_res(cx: &LateContext<'_>, path: &[&str]) -> Res {
350 macro_rules! try_res {
354 None => return Res::Err,
358 fn item_child_by_name<'tcx>(tcx: TyCtxt<'tcx>, def_id: DefId, name: &str) -> Option<&'tcx Export<HirId>> {
359 tcx.item_children(def_id)
361 .find(|item| item.ident.name.as_str() == name)
364 let (krate, first, path) = match *path {
365 [krate, first, ref path @ ..] => (krate, first, path),
366 _ => return Res::Err,
369 let crates = tcx.crates();
370 let krate = try_res!(crates.iter().find(|&&num| tcx.crate_name(num).as_str() == krate));
371 let first = try_res!(item_child_by_name(tcx, krate.as_def_id(), first));
375 // `get_def_path` seems to generate these empty segments for extern blocks.
376 // We can just ignore them.
377 .filter(|segment| !segment.is_empty())
378 // for each segment, find the child item
379 .try_fold(first, |item, segment| {
380 let def_id = item.res.def_id();
381 if let Some(item) = item_child_by_name(tcx, def_id, segment) {
383 } else if matches!(item.res, Res::Def(DefKind::Enum | DefKind::Struct, _)) {
384 // it is not a child item so check inherent impl items
385 tcx.inherent_impls(def_id)
387 .find_map(|&impl_def_id| item_child_by_name(tcx, impl_def_id, segment))
395 /// Convenience function to get the `DefId` of a trait by path.
396 /// It could be a trait or trait alias.
397 pub fn get_trait_def_id(cx: &LateContext<'_>, path: &[&str]) -> Option<DefId> {
398 match path_to_res(cx, path) {
399 Res::Def(DefKind::Trait | DefKind::TraitAlias, trait_id) => Some(trait_id),
404 /// Checks whether a type implements a trait.
405 /// See also `get_trait_def_id`.
406 pub fn implements_trait<'tcx>(
407 cx: &LateContext<'tcx>,
410 ty_params: &[GenericArg<'tcx>],
412 // Do not check on infer_types to avoid panic in evaluate_obligation.
413 if ty.has_infer_types() {
416 let ty = cx.tcx.erase_regions(ty);
417 if ty.has_escaping_bound_vars() {
420 let ty_params = cx.tcx.mk_substs(ty_params.iter());
421 cx.tcx.type_implements_trait((trait_id, ty, ty_params, cx.param_env))
424 /// Gets the `hir::TraitRef` of the trait the given method is implemented for.
426 /// Use this if you want to find the `TraitRef` of the `Add` trait in this example:
429 /// struct Point(isize, isize);
431 /// impl std::ops::Add for Point {
432 /// type Output = Self;
434 /// fn add(self, other: Self) -> Self {
439 pub fn trait_ref_of_method<'tcx>(cx: &LateContext<'tcx>, hir_id: HirId) -> Option<&'tcx TraitRef<'tcx>> {
440 // Get the implemented trait for the current function
441 let parent_impl = cx.tcx.hir().get_parent_item(hir_id);
443 if parent_impl != hir::CRATE_HIR_ID;
444 if let hir::Node::Item(item) = cx.tcx.hir().get(parent_impl);
445 if let hir::ItemKind::Impl(impl_) = &item.kind;
446 then { return impl_.of_trait.as_ref(); }
451 /// Checks whether this type implements `Drop`.
452 pub fn has_drop<'tcx>(cx: &LateContext<'tcx>, ty: Ty<'tcx>) -> bool {
453 match ty.ty_adt_def() {
454 Some(def) => def.has_dtor(cx.tcx),
459 /// Checks whether a type can be partially moved.
460 pub fn can_partially_move_ty(cx: &LateContext<'tcx>, ty: Ty<'tcx>) -> bool {
461 if has_drop(cx, ty) || is_copy(cx, ty) {
465 ty::Param(_) => false,
466 ty::Adt(def, subs) => def.all_fields().any(|f| !is_copy(cx, f.ty(cx.tcx, subs))),
471 /// Returns the method names and argument list of nested method call expressions that make up
472 /// `expr`. method/span lists are sorted with the most recent call first.
473 pub fn method_calls<'tcx>(
474 expr: &'tcx Expr<'tcx>,
476 ) -> (Vec<Symbol>, Vec<&'tcx [Expr<'tcx>]>, Vec<Span>) {
477 let mut method_names = Vec::with_capacity(max_depth);
478 let mut arg_lists = Vec::with_capacity(max_depth);
479 let mut spans = Vec::with_capacity(max_depth);
481 let mut current = expr;
482 for _ in 0..max_depth {
483 if let ExprKind::MethodCall(path, span, args, _) = ¤t.kind {
484 if args.iter().any(|e| e.span.from_expansion()) {
487 method_names.push(path.ident.name);
488 arg_lists.push(&**args);
496 (method_names, arg_lists, spans)
499 /// Matches an `Expr` against a chain of methods, and return the matched `Expr`s.
501 /// For example, if `expr` represents the `.baz()` in `foo.bar().baz()`,
502 /// `method_chain_args(expr, &["bar", "baz"])` will return a `Vec`
503 /// containing the `Expr`s for
504 /// `.bar()` and `.baz()`
505 pub fn method_chain_args<'a>(expr: &'a Expr<'_>, methods: &[&str]) -> Option<Vec<&'a [Expr<'a>]>> {
506 let mut current = expr;
507 let mut matched = Vec::with_capacity(methods.len());
508 for method_name in methods.iter().rev() {
509 // method chains are stored last -> first
510 if let ExprKind::MethodCall(ref path, _, ref args, _) = current.kind {
511 if path.ident.name.as_str() == *method_name {
512 if args.iter().any(|e| e.span.from_expansion()) {
515 matched.push(&**args); // build up `matched` backwards
516 current = &args[0] // go to parent expression
524 // Reverse `matched` so that it is in the same order as `methods`.
529 /// Returns `true` if the provided `def_id` is an entrypoint to a program.
530 pub fn is_entrypoint_fn(cx: &LateContext<'_>, def_id: DefId) -> bool {
532 .entry_fn(LOCAL_CRATE)
533 .map_or(false, |(entry_fn_def_id, _)| def_id == entry_fn_def_id.to_def_id())
536 /// Returns `true` if the expression is in the program's `#[panic_handler]`.
537 pub fn is_in_panic_handler(cx: &LateContext<'_>, e: &Expr<'_>) -> bool {
538 let parent = cx.tcx.hir().get_parent_item(e.hir_id);
539 let def_id = cx.tcx.hir().local_def_id(parent).to_def_id();
540 Some(def_id) == cx.tcx.lang_items().panic_impl()
543 /// Gets the name of the item the expression is in, if available.
544 pub fn get_item_name(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<Symbol> {
545 let parent_id = cx.tcx.hir().get_parent_item(expr.hir_id);
546 match cx.tcx.hir().find(parent_id) {
548 Node::Item(Item { ident, .. })
549 | Node::TraitItem(TraitItem { ident, .. })
550 | Node::ImplItem(ImplItem { ident, .. }),
551 ) => Some(ident.name),
556 /// Gets the name of a `Pat`, if any.
557 pub fn get_pat_name(pat: &Pat<'_>) -> Option<Symbol> {
559 PatKind::Binding(.., ref spname, _) => Some(spname.name),
560 PatKind::Path(ref qpath) => single_segment_path(qpath).map(|ps| ps.ident.name),
561 PatKind::Box(ref p) | PatKind::Ref(ref p, _) => get_pat_name(&*p),
566 struct ContainsName {
571 impl<'tcx> Visitor<'tcx> for ContainsName {
572 type Map = Map<'tcx>;
574 fn visit_name(&mut self, _: Span, name: Symbol) {
575 if self.name == name {
579 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
580 NestedVisitorMap::None
584 /// Checks if an `Expr` contains a certain name.
585 pub fn contains_name(name: Symbol, expr: &Expr<'_>) -> bool {
586 let mut cn = ContainsName { name, result: false };
591 /// Returns `true` if `expr` contains a return expression
592 pub fn contains_return(expr: &hir::Expr<'_>) -> bool {
593 struct RetCallFinder {
597 impl<'tcx> hir::intravisit::Visitor<'tcx> for RetCallFinder {
598 type Map = Map<'tcx>;
600 fn visit_expr(&mut self, expr: &'tcx hir::Expr<'_>) {
604 if let hir::ExprKind::Ret(..) = &expr.kind {
607 hir::intravisit::walk_expr(self, expr);
611 fn nested_visit_map(&mut self) -> hir::intravisit::NestedVisitorMap<Self::Map> {
612 hir::intravisit::NestedVisitorMap::None
616 let mut visitor = RetCallFinder { found: false };
617 visitor.visit_expr(expr);
621 struct FindMacroCalls<'a, 'b> {
622 names: &'a [&'b str],
626 impl<'a, 'b, 'tcx> Visitor<'tcx> for FindMacroCalls<'a, 'b> {
627 type Map = Map<'tcx>;
629 fn visit_expr(&mut self, expr: &'tcx Expr<'_>) {
630 if self.names.iter().any(|fun| is_expn_of(expr.span, fun).is_some()) {
631 self.result.push(expr.span);
633 // and check sub-expressions
634 intravisit::walk_expr(self, expr);
637 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
638 NestedVisitorMap::None
642 /// Finds calls of the specified macros in a function body.
643 pub fn find_macro_calls(names: &[&str], body: &Body<'_>) -> Vec<Span> {
644 let mut fmc = FindMacroCalls {
648 fmc.visit_expr(&body.value);
652 /// Converts a span to a code snippet if available, otherwise use default.
654 /// This is useful if you want to provide suggestions for your lint or more generally, if you want
655 /// to convert a given `Span` to a `str`.
659 /// snippet(cx, expr.span, "..")
661 pub fn snippet<'a, T: LintContext>(cx: &T, span: Span, default: &'a str) -> Cow<'a, str> {
662 snippet_opt(cx, span).map_or_else(|| Cow::Borrowed(default), From::from)
665 /// Same as `snippet`, but it adapts the applicability level by following rules:
667 /// - Applicability level `Unspecified` will never be changed.
668 /// - If the span is inside a macro, change the applicability level to `MaybeIncorrect`.
669 /// - If the default value is used and the applicability level is `MachineApplicable`, change it to
670 /// `HasPlaceholders`
671 pub fn snippet_with_applicability<'a, T: LintContext>(
675 applicability: &mut Applicability,
677 if *applicability != Applicability::Unspecified && span.from_expansion() {
678 *applicability = Applicability::MaybeIncorrect;
680 snippet_opt(cx, span).map_or_else(
682 if *applicability == Applicability::MachineApplicable {
683 *applicability = Applicability::HasPlaceholders;
685 Cow::Borrowed(default)
691 /// Same as `snippet`, but should only be used when it's clear that the input span is
692 /// not a macro argument.
693 pub fn snippet_with_macro_callsite<'a, T: LintContext>(cx: &T, span: Span, default: &'a str) -> Cow<'a, str> {
694 snippet(cx, span.source_callsite(), default)
697 /// Converts a span to a code snippet. Returns `None` if not available.
698 pub fn snippet_opt<T: LintContext>(cx: &T, span: Span) -> Option<String> {
699 cx.sess().source_map().span_to_snippet(span).ok()
702 /// Converts a span (from a block) to a code snippet if available, otherwise use default.
704 /// This trims the code of indentation, except for the first line. Use it for blocks or block-like
705 /// things which need to be printed as such.
707 /// The `indent_relative_to` arg can be used, to provide a span, where the indentation of the
708 /// resulting snippet of the given span.
713 /// snippet_block(cx, block.span, "..", None)
714 /// // where, `block` is the block of the if expr
718 /// // will return the snippet
725 /// snippet_block(cx, block.span, "..", Some(if_expr.span))
726 /// // where, `block` is the block of the if expr
730 /// // will return the snippet
733 /// } // aligned with `if`
735 /// Note that the first line of the snippet always has 0 indentation.
736 pub fn snippet_block<'a, T: LintContext>(
740 indent_relative_to: Option<Span>,
742 let snip = snippet(cx, span, default);
743 let indent = indent_relative_to.and_then(|s| indent_of(cx, s));
744 reindent_multiline(snip, true, indent)
747 /// Same as `snippet_block`, but adapts the applicability level by the rules of
748 /// `snippet_with_applicability`.
749 pub fn snippet_block_with_applicability<'a, T: LintContext>(
753 indent_relative_to: Option<Span>,
754 applicability: &mut Applicability,
756 let snip = snippet_with_applicability(cx, span, default, applicability);
757 let indent = indent_relative_to.and_then(|s| indent_of(cx, s));
758 reindent_multiline(snip, true, indent)
761 /// Same as `snippet_with_applicability`, but first walks the span up to the given context. This
762 /// will result in the macro call, rather then the expansion, if the span is from a child context.
763 /// If the span is not from a child context, it will be used directly instead.
765 /// e.g. Given the expression `&vec![]`, getting a snippet from the span for `vec![]` as a HIR node
766 /// would result in `box []`. If given the context of the address of expression, this function will
767 /// correctly get a snippet of `vec![]`.
768 pub fn snippet_with_context(
769 cx: &LateContext<'_>,
771 outer: SyntaxContext,
773 applicability: &mut Applicability,
775 let outer_span = hygiene::walk_chain(span, outer);
776 let span = if outer_span.ctxt() == outer {
779 // The span is from a macro argument, and the outer context is the macro using the argument
780 if *applicability != Applicability::Unspecified {
781 *applicability = Applicability::MaybeIncorrect;
783 // TODO: get the argument span.
787 snippet_with_applicability(cx, span, default, applicability)
790 /// Returns a new Span that extends the original Span to the first non-whitespace char of the first
796 /// // will be converted to
800 pub fn first_line_of_span<T: LintContext>(cx: &T, span: Span) -> Span {
801 first_char_in_first_line(cx, span).map_or(span, |first_char_pos| span.with_lo(first_char_pos))
804 fn first_char_in_first_line<T: LintContext>(cx: &T, span: Span) -> Option<BytePos> {
805 let line_span = line_span(cx, span);
806 snippet_opt(cx, line_span).and_then(|snip| {
807 snip.find(|c: char| !c.is_whitespace())
808 .map(|pos| line_span.lo() + BytePos::from_usize(pos))
812 /// Returns the indentation of the line of a span
816 /// // ^^ -- will return 0
818 /// // ^^ -- will return 4
820 pub fn indent_of<T: LintContext>(cx: &T, span: Span) -> Option<usize> {
821 snippet_opt(cx, line_span(cx, span)).and_then(|snip| snip.find(|c: char| !c.is_whitespace()))
824 /// Returns the positon just before rarrow
827 /// fn into(self) -> () {}
829 /// // in case of unformatted code
830 /// fn into2(self)-> () {}
832 /// fn into3(self) -> () {}
835 pub fn position_before_rarrow(s: &str) -> Option<usize> {
836 s.rfind("->").map(|rpos| {
838 let chars: Vec<char> = s.chars().collect();
840 if let Some(c) = chars.get(rpos - 1) {
841 if c.is_whitespace() {
852 /// Extends the span to the beginning of the spans line, incl. whitespaces.
857 /// // will be converted to
859 /// // ^^^^^^^^^^^^^^
861 fn line_span<T: LintContext>(cx: &T, span: Span) -> Span {
862 let span = original_sp(span, DUMMY_SP);
863 let source_map_and_line = cx.sess().source_map().lookup_line(span.lo()).unwrap();
864 let line_no = source_map_and_line.line;
865 let line_start = source_map_and_line.sf.lines[line_no];
866 Span::new(line_start, span.hi(), span.ctxt())
869 /// Like `snippet_block`, but add braces if the expr is not an `ExprKind::Block`.
870 /// Also takes an `Option<String>` which can be put inside the braces.
871 pub fn expr_block<'a, T: LintContext>(
874 option: Option<String>,
876 indent_relative_to: Option<Span>,
878 let code = snippet_block(cx, expr.span, default, indent_relative_to);
879 let string = option.unwrap_or_default();
880 if expr.span.from_expansion() {
881 Cow::Owned(format!("{{ {} }}", snippet_with_macro_callsite(cx, expr.span, default)))
882 } else if let ExprKind::Block(_, _) = expr.kind {
883 Cow::Owned(format!("{}{}", code, string))
884 } else if string.is_empty() {
885 Cow::Owned(format!("{{ {} }}", code))
887 Cow::Owned(format!("{{\n{};\n{}\n}}", code, string))
891 /// Reindent a multiline string with possibility of ignoring the first line.
892 #[allow(clippy::needless_pass_by_value)]
893 pub fn reindent_multiline(s: Cow<'_, str>, ignore_first: bool, indent: Option<usize>) -> Cow<'_, str> {
894 let s_space = reindent_multiline_inner(&s, ignore_first, indent, ' ');
895 let s_tab = reindent_multiline_inner(&s_space, ignore_first, indent, '\t');
896 reindent_multiline_inner(&s_tab, ignore_first, indent, ' ').into()
899 fn reindent_multiline_inner(s: &str, ignore_first: bool, indent: Option<usize>, ch: char) -> String {
902 .skip(ignore_first as usize)
907 // ignore empty lines
908 Some(l.char_indices().find(|&(_, x)| x != ch).unwrap_or((l.len(), ch)).0)
913 let indent = indent.unwrap_or(0);
917 if (ignore_first && i == 0) || l.is_empty() {
919 } else if x > indent {
920 l.split_at(x - indent).1.to_owned()
922 " ".repeat(indent - x) + l
925 .collect::<Vec<String>>()
929 /// Gets the parent expression, if any –- this is useful to constrain a lint.
930 pub fn get_parent_expr<'tcx>(cx: &LateContext<'tcx>, e: &Expr<'_>) -> Option<&'tcx Expr<'tcx>> {
931 let map = &cx.tcx.hir();
932 let hir_id = e.hir_id;
933 let parent_id = map.get_parent_node(hir_id);
934 if hir_id == parent_id {
937 map.find(parent_id).and_then(|node| {
938 if let Node::Expr(parent) = node {
946 pub fn get_enclosing_block<'tcx>(cx: &LateContext<'tcx>, hir_id: HirId) -> Option<&'tcx Block<'tcx>> {
947 let map = &cx.tcx.hir();
948 let enclosing_node = map
949 .get_enclosing_scope(hir_id)
950 .and_then(|enclosing_id| map.find(enclosing_id));
951 enclosing_node.and_then(|node| match node {
952 Node::Block(block) => Some(block),
954 kind: ItemKind::Fn(_, _, eid),
957 | Node::ImplItem(&ImplItem {
958 kind: ImplItemKind::Fn(_, eid),
960 }) => match cx.tcx.hir().body(eid).value.kind {
961 ExprKind::Block(ref block, _) => Some(block),
968 /// Returns the base type for HIR references and pointers.
969 pub fn walk_ptrs_hir_ty<'tcx>(ty: &'tcx hir::Ty<'tcx>) -> &'tcx hir::Ty<'tcx> {
971 TyKind::Ptr(ref mut_ty) | TyKind::Rptr(_, ref mut_ty) => walk_ptrs_hir_ty(&mut_ty.ty),
976 /// Returns the base type for references and raw pointers, and count reference
978 pub fn walk_ptrs_ty_depth(ty: Ty<'_>) -> (Ty<'_>, usize) {
979 fn inner(ty: Ty<'_>, depth: usize) -> (Ty<'_>, usize) {
981 ty::Ref(_, ty, _) => inner(ty, depth + 1),
988 /// Checks whether the given expression is a constant integer of the given value.
989 /// unlike `is_integer_literal`, this version does const folding
990 pub fn is_integer_const(cx: &LateContext<'_>, e: &Expr<'_>, value: u128) -> bool {
991 if is_integer_literal(e, value) {
994 let map = cx.tcx.hir();
995 let parent_item = map.get_parent_item(e.hir_id);
996 if let Some((Constant::Int(v), _)) = map
997 .maybe_body_owned_by(parent_item)
998 .and_then(|body_id| constant(cx, cx.tcx.typeck_body(body_id), e))
1006 /// Checks whether the given expression is a constant literal of the given value.
1007 pub fn is_integer_literal(expr: &Expr<'_>, value: u128) -> bool {
1008 // FIXME: use constant folding
1009 if let ExprKind::Lit(ref spanned) = expr.kind {
1010 if let LitKind::Int(v, _) = spanned.node {
1017 /// Returns `true` if the given `Expr` has been coerced before.
1019 /// Examples of coercions can be found in the Nomicon at
1020 /// <https://doc.rust-lang.org/nomicon/coercions.html>.
1022 /// See `rustc_middle::ty::adjustment::Adjustment` and `rustc_typeck::check::coercion` for more
1023 /// information on adjustments and coercions.
1024 pub fn is_adjusted(cx: &LateContext<'_>, e: &Expr<'_>) -> bool {
1025 cx.typeck_results().adjustments().get(e.hir_id).is_some()
1028 /// Returns the pre-expansion span if is this comes from an expansion of the
1030 /// See also `is_direct_expn_of`.
1032 pub fn is_expn_of(mut span: Span, name: &str) -> Option<Span> {
1034 if span.from_expansion() {
1035 let data = span.ctxt().outer_expn_data();
1036 let new_span = data.call_site;
1038 if let ExpnKind::Macro(MacroKind::Bang, mac_name) = data.kind {
1039 if mac_name.as_str() == name {
1040 return Some(new_span);
1051 /// Returns the pre-expansion span if the span directly comes from an expansion
1052 /// of the macro `name`.
1053 /// The difference with `is_expn_of` is that in
1057 /// `42` is considered expanded from `foo!` and `bar!` by `is_expn_of` but only
1059 /// `is_direct_expn_of`.
1061 pub fn is_direct_expn_of(span: Span, name: &str) -> Option<Span> {
1062 if span.from_expansion() {
1063 let data = span.ctxt().outer_expn_data();
1064 let new_span = data.call_site;
1066 if let ExpnKind::Macro(MacroKind::Bang, mac_name) = data.kind {
1067 if mac_name.as_str() == name {
1068 return Some(new_span);
1076 /// Convenience function to get the return type of a function.
1077 pub fn return_ty<'tcx>(cx: &LateContext<'tcx>, fn_item: hir::HirId) -> Ty<'tcx> {
1078 let fn_def_id = cx.tcx.hir().local_def_id(fn_item);
1079 let ret_ty = cx.tcx.fn_sig(fn_def_id).output();
1080 cx.tcx.erase_late_bound_regions(ret_ty)
1083 /// Walks into `ty` and returns `true` if any inner type is the same as `other_ty`
1084 pub fn contains_ty(ty: Ty<'_>, other_ty: Ty<'_>) -> bool {
1085 ty.walk().any(|inner| match inner.unpack() {
1086 GenericArgKind::Type(inner_ty) => ty::TyS::same_type(other_ty, inner_ty),
1087 GenericArgKind::Lifetime(_) | GenericArgKind::Const(_) => false,
1091 /// Returns `true` if the given type is an `unsafe` function.
1092 pub fn type_is_unsafe_function<'tcx>(cx: &LateContext<'tcx>, ty: Ty<'tcx>) -> bool {
1094 ty::FnDef(..) | ty::FnPtr(_) => ty.fn_sig(cx.tcx).unsafety() == Unsafety::Unsafe,
1099 pub fn is_copy<'tcx>(cx: &LateContext<'tcx>, ty: Ty<'tcx>) -> bool {
1100 ty.is_copy_modulo_regions(cx.tcx.at(DUMMY_SP), cx.param_env)
1103 /// Checks if an expression is constructing a tuple-like enum variant or struct
1104 pub fn is_ctor_or_promotable_const_function(cx: &LateContext<'_>, expr: &Expr<'_>) -> bool {
1105 if let ExprKind::Call(ref fun, _) = expr.kind {
1106 if let ExprKind::Path(ref qp) = fun.kind {
1107 let res = cx.qpath_res(qp, fun.hir_id);
1109 def::Res::Def(DefKind::Variant | DefKind::Ctor(..), ..) => true,
1110 def::Res::Def(_, def_id) => cx.tcx.is_promotable_const_fn(def_id),
1118 /// Returns `true` if a pattern is refutable.
1119 // TODO: should be implemented using rustc/mir_build/thir machinery
1120 pub fn is_refutable(cx: &LateContext<'_>, pat: &Pat<'_>) -> bool {
1121 fn is_enum_variant(cx: &LateContext<'_>, qpath: &QPath<'_>, id: HirId) -> bool {
1123 cx.qpath_res(qpath, id),
1124 def::Res::Def(DefKind::Variant, ..) | Res::Def(DefKind::Ctor(def::CtorOf::Variant, _), _)
1128 fn are_refutable<'a, I: Iterator<Item = &'a Pat<'a>>>(cx: &LateContext<'_>, mut i: I) -> bool {
1129 i.any(|pat| is_refutable(cx, pat))
1133 PatKind::Wild => false,
1134 PatKind::Binding(_, _, _, pat) => pat.map_or(false, |pat| is_refutable(cx, pat)),
1135 PatKind::Box(ref pat) | PatKind::Ref(ref pat, _) => is_refutable(cx, pat),
1136 PatKind::Lit(..) | PatKind::Range(..) => true,
1137 PatKind::Path(ref qpath) => is_enum_variant(cx, qpath, pat.hir_id),
1138 PatKind::Or(ref pats) => {
1139 // TODO: should be the honest check, that pats is exhaustive set
1140 are_refutable(cx, pats.iter().map(|pat| &**pat))
1142 PatKind::Tuple(ref pats, _) => are_refutable(cx, pats.iter().map(|pat| &**pat)),
1143 PatKind::Struct(ref qpath, ref fields, _) => {
1144 is_enum_variant(cx, qpath, pat.hir_id) || are_refutable(cx, fields.iter().map(|field| &*field.pat))
1146 PatKind::TupleStruct(ref qpath, ref pats, _) => {
1147 is_enum_variant(cx, qpath, pat.hir_id) || are_refutable(cx, pats.iter().map(|pat| &**pat))
1149 PatKind::Slice(ref head, ref middle, ref tail) => {
1150 match &cx.typeck_results().node_type(pat.hir_id).kind() {
1152 // [..] is the only irrefutable slice pattern.
1153 !head.is_empty() || middle.is_none() || !tail.is_empty()
1155 ty::Array(..) => are_refutable(cx, head.iter().chain(middle).chain(tail.iter()).map(|pat| &**pat)),
1165 /// Checks for the `#[automatically_derived]` attribute all `#[derive]`d
1166 /// implementations have.
1167 pub fn is_automatically_derived(attrs: &[ast::Attribute]) -> bool {
1168 attrs.iter().any(|attr| attr.has_name(sym::automatically_derived))
1171 /// Remove blocks around an expression.
1173 /// Ie. `x`, `{ x }` and `{{{{ x }}}}` all give `x`. `{ x; y }` and `{}` return
1175 pub fn remove_blocks<'tcx>(mut expr: &'tcx Expr<'tcx>) -> &'tcx Expr<'tcx> {
1176 while let ExprKind::Block(ref block, ..) = expr.kind {
1177 match (block.stmts.is_empty(), block.expr.as_ref()) {
1178 (true, Some(e)) => expr = e,
1185 pub fn is_self(slf: &Param<'_>) -> bool {
1186 if let PatKind::Binding(.., name, _) = slf.pat.kind {
1187 name.name == kw::SelfLower
1193 pub fn is_self_ty(slf: &hir::Ty<'_>) -> bool {
1195 if let TyKind::Path(QPath::Resolved(None, ref path)) = slf.kind;
1196 if let Res::SelfTy(..) = path.res;
1204 pub fn iter_input_pats<'tcx>(decl: &FnDecl<'_>, body: &'tcx Body<'_>) -> impl Iterator<Item = &'tcx Param<'tcx>> {
1205 (0..decl.inputs.len()).map(move |i| &body.params[i])
1208 /// Checks if a given expression is a match expression expanded from the `?`
1209 /// operator or the `try` macro.
1210 pub fn is_try<'tcx>(expr: &'tcx Expr<'tcx>) -> Option<&'tcx Expr<'tcx>> {
1211 fn is_ok(arm: &Arm<'_>) -> bool {
1213 if let PatKind::TupleStruct(ref path, ref pat, None) = arm.pat.kind;
1214 if match_qpath(path, &paths::RESULT_OK[1..]);
1215 if let PatKind::Binding(_, hir_id, _, None) = pat[0].kind;
1216 if path_to_local_id(arm.body, hir_id);
1224 fn is_err(arm: &Arm<'_>) -> bool {
1225 if let PatKind::TupleStruct(ref path, _, _) = arm.pat.kind {
1226 match_qpath(path, &paths::RESULT_ERR[1..])
1232 if let ExprKind::Match(_, ref arms, ref source) = expr.kind {
1233 // desugared from a `?` operator
1234 if let MatchSource::TryDesugar = *source {
1240 if arms[0].guard.is_none();
1241 if arms[1].guard.is_none();
1242 if (is_ok(&arms[0]) && is_err(&arms[1])) ||
1243 (is_ok(&arms[1]) && is_err(&arms[0]));
1253 /// Returns `true` if the lint is allowed in the current context
1255 /// Useful for skipping long running code when it's unnecessary
1256 pub fn is_allowed(cx: &LateContext<'_>, lint: &'static Lint, id: HirId) -> bool {
1257 cx.tcx.lint_level_at_node(lint, id).0 == Level::Allow
1260 pub fn strip_pat_refs<'hir>(mut pat: &'hir Pat<'hir>) -> &'hir Pat<'hir> {
1261 while let PatKind::Ref(subpat, _) = pat.kind {
1267 pub fn int_bits(tcx: TyCtxt<'_>, ity: ty::IntTy) -> u64 {
1268 Integer::from_int_ty(&tcx, ity).size().bits()
1271 #[allow(clippy::cast_possible_wrap)]
1272 /// Turn a constant int byte representation into an i128
1273 pub fn sext(tcx: TyCtxt<'_>, u: u128, ity: ty::IntTy) -> i128 {
1274 let amt = 128 - int_bits(tcx, ity);
1275 ((u as i128) << amt) >> amt
1278 #[allow(clippy::cast_sign_loss)]
1279 /// clip unused bytes
1280 pub fn unsext(tcx: TyCtxt<'_>, u: i128, ity: ty::IntTy) -> u128 {
1281 let amt = 128 - int_bits(tcx, ity);
1282 ((u as u128) << amt) >> amt
1285 /// clip unused bytes
1286 pub fn clip(tcx: TyCtxt<'_>, u: u128, ity: ty::UintTy) -> u128 {
1287 let bits = Integer::from_uint_ty(&tcx, ity).size().bits();
1288 let amt = 128 - bits;
1292 /// Removes block comments from the given `Vec` of lines.
1297 /// without_block_comments(vec!["/*", "foo", "*/"]);
1300 /// without_block_comments(vec!["bar", "/*", "foo", "*/"]);
1301 /// // => vec!["bar"]
1303 pub fn without_block_comments(lines: Vec<&str>) -> Vec<&str> {
1304 let mut without = vec![];
1306 let mut nest_level = 0;
1309 if line.contains("/*") {
1312 } else if line.contains("*/") {
1317 if nest_level == 0 {
1325 pub fn any_parent_is_automatically_derived(tcx: TyCtxt<'_>, node: HirId) -> bool {
1326 let map = &tcx.hir();
1327 let mut prev_enclosing_node = None;
1328 let mut enclosing_node = node;
1329 while Some(enclosing_node) != prev_enclosing_node {
1330 if is_automatically_derived(map.attrs(enclosing_node)) {
1333 prev_enclosing_node = Some(enclosing_node);
1334 enclosing_node = map.get_parent_item(enclosing_node);
1339 /// Returns true if ty has `iter` or `iter_mut` methods
1340 pub fn has_iter_method(cx: &LateContext<'_>, probably_ref_ty: Ty<'_>) -> Option<&'static str> {
1341 // FIXME: instead of this hard-coded list, we should check if `<adt>::iter`
1342 // exists and has the desired signature. Unfortunately FnCtxt is not exported
1343 // so we can't use its `lookup_method` method.
1344 let into_iter_collections: [&[&str]; 13] = [
1351 &paths::LINKED_LIST,
1352 &paths::BINARY_HEAP,
1360 let ty_to_check = match probably_ref_ty.kind() {
1361 ty::Ref(_, ty_to_check, _) => ty_to_check,
1362 _ => probably_ref_ty,
1365 let def_id = match ty_to_check.kind() {
1366 ty::Array(..) => return Some("array"),
1367 ty::Slice(..) => return Some("slice"),
1368 ty::Adt(adt, _) => adt.did,
1372 for path in &into_iter_collections {
1373 if match_def_path(cx, def_id, path) {
1374 return Some(*path.last().unwrap());
1380 /// Matches a function call with the given path and returns the arguments.
1385 /// if let Some(args) = match_function_call(cx, cmp_max_call, &paths::CMP_MAX);
1387 pub fn match_function_call<'tcx>(
1388 cx: &LateContext<'tcx>,
1389 expr: &'tcx Expr<'_>,
1391 ) -> Option<&'tcx [Expr<'tcx>]> {
1393 if let ExprKind::Call(ref fun, ref args) = expr.kind;
1394 if let ExprKind::Path(ref qpath) = fun.kind;
1395 if let Some(fun_def_id) = cx.qpath_res(qpath, fun.hir_id).opt_def_id();
1396 if match_def_path(cx, fun_def_id, path);
1404 /// Checks if `Ty` is normalizable. This function is useful
1405 /// to avoid crashes on `layout_of`.
1406 pub fn is_normalizable<'tcx>(cx: &LateContext<'tcx>, param_env: ty::ParamEnv<'tcx>, ty: Ty<'tcx>) -> bool {
1407 cx.tcx.infer_ctxt().enter(|infcx| {
1408 let cause = rustc_middle::traits::ObligationCause::dummy();
1409 infcx.at(&cause, param_env).normalize(ty).is_ok()
1413 pub fn match_def_path<'tcx>(cx: &LateContext<'tcx>, did: DefId, syms: &[&str]) -> bool {
1414 // We have to convert `syms` to `&[Symbol]` here because rustc's `match_def_path`
1415 // accepts only that. We should probably move to Symbols in Clippy as well.
1416 let syms = syms.iter().map(|p| Symbol::intern(p)).collect::<Vec<Symbol>>();
1417 cx.match_def_path(did, &syms)
1420 pub fn match_panic_call<'tcx>(cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) -> Option<&'tcx [Expr<'tcx>]> {
1421 match_function_call(cx, expr, &paths::BEGIN_PANIC)
1422 .or_else(|| match_function_call(cx, expr, &paths::BEGIN_PANIC_FMT))
1423 .or_else(|| match_function_call(cx, expr, &paths::PANIC_ANY))
1424 .or_else(|| match_function_call(cx, expr, &paths::PANICKING_PANIC))
1425 .or_else(|| match_function_call(cx, expr, &paths::PANICKING_PANIC_FMT))
1426 .or_else(|| match_function_call(cx, expr, &paths::PANICKING_PANIC_STR))
1429 pub fn match_panic_def_id(cx: &LateContext<'_>, did: DefId) -> bool {
1430 match_def_path(cx, did, &paths::BEGIN_PANIC)
1431 || match_def_path(cx, did, &paths::BEGIN_PANIC_FMT)
1432 || match_def_path(cx, did, &paths::PANIC_ANY)
1433 || match_def_path(cx, did, &paths::PANICKING_PANIC)
1434 || match_def_path(cx, did, &paths::PANICKING_PANIC_FMT)
1435 || match_def_path(cx, did, &paths::PANICKING_PANIC_STR)
1438 /// Returns the list of condition expressions and the list of blocks in a
1439 /// sequence of `if/else`.
1440 /// E.g., this returns `([a, b], [c, d, e])` for the expression
1441 /// `if a { c } else if b { d } else { e }`.
1442 pub fn if_sequence<'tcx>(
1443 mut expr: &'tcx Expr<'tcx>,
1444 ) -> (SmallVec<[&'tcx Expr<'tcx>; 1]>, SmallVec<[&'tcx Block<'tcx>; 1]>) {
1445 let mut conds = SmallVec::new();
1446 let mut blocks: SmallVec<[&Block<'_>; 1]> = SmallVec::new();
1448 while let ExprKind::If(ref cond, ref then_expr, ref else_expr) = expr.kind {
1449 conds.push(&**cond);
1450 if let ExprKind::Block(ref block, _) = then_expr.kind {
1453 panic!("ExprKind::If node is not an ExprKind::Block");
1456 if let Some(ref else_expr) = *else_expr {
1463 // final `else {..}`
1464 if !blocks.is_empty() {
1465 if let ExprKind::Block(ref block, _) = expr.kind {
1466 blocks.push(&**block);
1473 pub fn parent_node_is_if_expr(expr: &Expr<'_>, cx: &LateContext<'_>) -> bool {
1474 let map = cx.tcx.hir();
1475 let parent_id = map.get_parent_node(expr.hir_id);
1476 let parent_node = map.get(parent_id);
1480 kind: ExprKind::If(_, _, _),
1486 // Finds the attribute with the given name, if any
1487 pub fn attr_by_name<'a>(attrs: &'a [Attribute], name: &'_ str) -> Option<&'a Attribute> {
1490 .find(|attr| attr.ident().map_or(false, |ident| ident.as_str() == name))
1493 // Finds the `#[must_use]` attribute, if any
1494 pub fn must_use_attr(attrs: &[Attribute]) -> Option<&Attribute> {
1495 attr_by_name(attrs, "must_use")
1498 // Returns whether the type has #[must_use] attribute
1499 pub fn is_must_use_ty<'tcx>(cx: &LateContext<'tcx>, ty: Ty<'tcx>) -> bool {
1501 ty::Adt(ref adt, _) => must_use_attr(&cx.tcx.get_attrs(adt.did)).is_some(),
1502 ty::Foreign(ref did) => must_use_attr(&cx.tcx.get_attrs(*did)).is_some(),
1504 | ty::Array(ref ty, _)
1505 | ty::RawPtr(ty::TypeAndMut { ref ty, .. })
1506 | ty::Ref(_, ref ty, _) => {
1507 // for the Array case we don't need to care for the len == 0 case
1508 // because we don't want to lint functions returning empty arrays
1509 is_must_use_ty(cx, *ty)
1511 ty::Tuple(ref substs) => substs.types().any(|ty| is_must_use_ty(cx, ty)),
1512 ty::Opaque(ref def_id, _) => {
1513 for (predicate, _) in cx.tcx.explicit_item_bounds(*def_id) {
1514 if let ty::PredicateKind::Trait(trait_predicate, _) = predicate.kind().skip_binder() {
1515 if must_use_attr(&cx.tcx.get_attrs(trait_predicate.trait_ref.def_id)).is_some() {
1522 ty::Dynamic(binder, _) => {
1523 for predicate in binder.iter() {
1524 if let ty::ExistentialPredicate::Trait(ref trait_ref) = predicate.skip_binder() {
1525 if must_use_attr(&cx.tcx.get_attrs(trait_ref.def_id)).is_some() {
1536 // check if expr is calling method or function with #[must_use] attribute
1537 pub fn is_must_use_func_call(cx: &LateContext<'_>, expr: &Expr<'_>) -> bool {
1538 let did = match expr.kind {
1539 ExprKind::Call(ref path, _) => if_chain! {
1540 if let ExprKind::Path(ref qpath) = path.kind;
1541 if let def::Res::Def(_, did) = cx.qpath_res(qpath, path.hir_id);
1548 ExprKind::MethodCall(_, _, _, _) => cx.typeck_results().type_dependent_def_id(expr.hir_id),
1552 did.map_or(false, |did| must_use_attr(&cx.tcx.get_attrs(did)).is_some())
1555 pub fn is_no_std_crate(krate: &Crate<'_>) -> bool {
1556 krate.item.attrs.iter().any(|attr| {
1557 if let ast::AttrKind::Normal(ref attr, _) = attr.kind {
1558 attr.path == sym::no_std
1565 /// Check if parent of a hir node is a trait implementation block.
1566 /// For example, `f` in
1568 /// impl Trait for S {
1572 pub fn is_trait_impl_item(cx: &LateContext<'_>, hir_id: HirId) -> bool {
1573 if let Some(Node::Item(item)) = cx.tcx.hir().find(cx.tcx.hir().get_parent_node(hir_id)) {
1574 matches!(item.kind, ItemKind::Impl(hir::Impl { of_trait: Some(_), .. }))
1580 /// Check if it's even possible to satisfy the `where` clause for the item.
1582 /// `trivial_bounds` feature allows functions with unsatisfiable bounds, for example:
1585 /// fn foo() where i32: Iterator {
1586 /// for _ in 2i32 {}
1589 pub fn fn_has_unsatisfiable_preds(cx: &LateContext<'_>, did: DefId) -> bool {
1590 use rustc_trait_selection::traits;
1596 .filter_map(|(p, _)| if p.is_global() { Some(*p) } else { None });
1597 traits::impossible_predicates(
1599 traits::elaborate_predicates(cx.tcx, predicates)
1600 .map(|o| o.predicate)
1601 .collect::<Vec<_>>(),
1605 /// Returns the `DefId` of the callee if the given expression is a function or method call.
1606 pub fn fn_def_id(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<DefId> {
1608 ExprKind::MethodCall(..) => cx.typeck_results().type_dependent_def_id(expr.hir_id),
1611 kind: ExprKind::Path(qpath),
1612 hir_id: path_hir_id,
1616 ) => cx.typeck_results().qpath_res(qpath, *path_hir_id).opt_def_id(),
1621 pub fn run_lints(cx: &LateContext<'_>, lints: &[&'static Lint], id: HirId) -> bool {
1622 lints.iter().any(|lint| {
1624 cx.tcx.lint_level_at_node(lint, id),
1625 (Level::Forbid | Level::Deny | Level::Warn, _)
1630 /// Returns true iff the given type is a primitive (a bool or char, any integer or floating-point
1631 /// number type, a str, or an array, slice, or tuple of those types).
1632 pub fn is_recursively_primitive_type(ty: Ty<'_>) -> bool {
1634 ty::Bool | ty::Char | ty::Int(_) | ty::Uint(_) | ty::Float(_) | ty::Str => true,
1635 ty::Ref(_, inner, _) if *inner.kind() == ty::Str => true,
1636 ty::Array(inner_type, _) | ty::Slice(inner_type) => is_recursively_primitive_type(inner_type),
1637 ty::Tuple(inner_types) => inner_types.types().all(is_recursively_primitive_type),
1642 /// Returns Option<String> where String is a textual representation of the type encapsulated in the
1643 /// slice iff the given expression is a slice of primitives (as defined in the
1644 /// `is_recursively_primitive_type` function) and None otherwise.
1645 pub fn is_slice_of_primitives(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<String> {
1646 let expr_type = cx.typeck_results().expr_ty_adjusted(expr);
1647 let expr_kind = expr_type.kind();
1648 let is_primitive = match expr_kind {
1649 ty::Slice(element_type) => is_recursively_primitive_type(element_type),
1650 ty::Ref(_, inner_ty, _) if matches!(inner_ty.kind(), &ty::Slice(_)) => {
1651 if let ty::Slice(element_type) = inner_ty.kind() {
1652 is_recursively_primitive_type(element_type)
1661 // if we have wrappers like Array, Slice or Tuple, print these
1662 // and get the type enclosed in the slice ref
1663 match expr_type.peel_refs().walk().nth(1).unwrap().expect_ty().kind() {
1664 ty::Slice(..) => return Some("slice".into()),
1665 ty::Array(..) => return Some("array".into()),
1666 ty::Tuple(..) => return Some("tuple".into()),
1668 // is_recursively_primitive_type() should have taken care
1669 // of the rest and we can rely on the type that is found
1670 let refs_peeled = expr_type.peel_refs();
1671 return Some(refs_peeled.walk().last().unwrap().to_string());
1678 /// returns list of all pairs (a, b) from `exprs` such that `eq(a, b)`
1679 /// `hash` must be comformed with `eq`
1680 pub fn search_same<T, Hash, Eq>(exprs: &[T], hash: Hash, eq: Eq) -> Vec<(&T, &T)>
1682 Hash: Fn(&T) -> u64,
1683 Eq: Fn(&T, &T) -> bool,
1685 if exprs.len() == 2 && eq(&exprs[0], &exprs[1]) {
1686 return vec![(&exprs[0], &exprs[1])];
1689 let mut match_expr_list: Vec<(&T, &T)> = Vec::new();
1691 let mut map: FxHashMap<_, Vec<&_>> =
1692 FxHashMap::with_capacity_and_hasher(exprs.len(), BuildHasherDefault::default());
1695 match map.entry(hash(expr)) {
1696 Entry::Occupied(mut o) => {
1699 match_expr_list.push((o, expr));
1702 o.get_mut().push(expr);
1704 Entry::Vacant(v) => {
1705 v.insert(vec![expr]);
1713 /// Peels off all references on the pattern. Returns the underlying pattern and the number of
1714 /// references removed.
1715 pub fn peel_hir_pat_refs(pat: &'a Pat<'a>) -> (&'a Pat<'a>, usize) {
1716 fn peel(pat: &'a Pat<'a>, count: usize) -> (&'a Pat<'a>, usize) {
1717 if let PatKind::Ref(pat, _) = pat.kind {
1718 peel(pat, count + 1)
1726 /// Peels off up to the given number of references on the expression. Returns the underlying
1727 /// expression and the number of references removed.
1728 pub fn peel_n_hir_expr_refs(expr: &'a Expr<'a>, count: usize) -> (&'a Expr<'a>, usize) {
1729 fn f(expr: &'a Expr<'a>, count: usize, target: usize) -> (&'a Expr<'a>, usize) {
1731 ExprKind::AddrOf(_, _, expr) if count != target => f(expr, count + 1, target),
1738 /// Peels off all references on the expression. Returns the underlying expression and the number of
1739 /// references removed.
1740 pub fn peel_hir_expr_refs(expr: &'a Expr<'a>) -> (&'a Expr<'a>, usize) {
1741 fn f(expr: &'a Expr<'a>, count: usize) -> (&'a Expr<'a>, usize) {
1743 ExprKind::AddrOf(BorrowKind::Ref, _, expr) => f(expr, count + 1),
1750 /// Peels off all references on the type. Returns the underlying type and the number of references
1752 pub fn peel_mid_ty_refs(ty: Ty<'_>) -> (Ty<'_>, usize) {
1753 fn peel(ty: Ty<'_>, count: usize) -> (Ty<'_>, usize) {
1754 if let ty::Ref(_, ty, _) = ty.kind() {
1763 /// Peels off all references on the type.Returns the underlying type, the number of references
1764 /// removed, and whether the pointer is ultimately mutable or not.
1765 pub fn peel_mid_ty_refs_is_mutable(ty: Ty<'_>) -> (Ty<'_>, usize, Mutability) {
1766 fn f(ty: Ty<'_>, count: usize, mutability: Mutability) -> (Ty<'_>, usize, Mutability) {
1768 ty::Ref(_, ty, Mutability::Mut) => f(ty, count + 1, mutability),
1769 ty::Ref(_, ty, Mutability::Not) => f(ty, count + 1, Mutability::Not),
1770 _ => (ty, count, mutability),
1773 f(ty, 0, Mutability::Mut)
1777 macro_rules! unwrap_cargo_metadata {
1778 ($cx: ident, $lint: ident, $deps: expr) => {{
1779 let mut command = cargo_metadata::MetadataCommand::new();
1784 match command.exec() {
1785 Ok(metadata) => metadata,
1787 span_lint($cx, $lint, DUMMY_SP, &format!("could not read cargo metadata: {}", err));
1794 pub fn is_hir_ty_cfg_dependant(cx: &LateContext<'_>, ty: &hir::Ty<'_>) -> bool {
1796 if let TyKind::Path(QPath::Resolved(_, path)) = ty.kind;
1797 if let Res::Def(_, def_id) = path.res;
1799 cx.tcx.has_attr(def_id, sym::cfg) || cx.tcx.has_attr(def_id, sym::cfg_attr)
1806 /// Check if the resolution of a given path is an `Ok` variant of `Result`.
1807 pub fn is_ok_ctor(cx: &LateContext<'_>, res: Res) -> bool {
1808 if let Some(ok_id) = cx.tcx.lang_items().result_ok_variant() {
1809 if let Res::Def(DefKind::Ctor(CtorOf::Variant, CtorKind::Fn), id) = res {
1810 if let Some(variant_id) = cx.tcx.parent(id) {
1811 return variant_id == ok_id;
1818 /// Check if the resolution of a given path is a `Some` variant of `Option`.
1819 pub fn is_some_ctor(cx: &LateContext<'_>, res: Res) -> bool {
1820 if let Some(some_id) = cx.tcx.lang_items().option_some_variant() {
1821 if let Res::Def(DefKind::Ctor(CtorOf::Variant, CtorKind::Fn), id) = res {
1822 if let Some(variant_id) = cx.tcx.parent(id) {
1823 return variant_id == some_id;
1832 use super::{reindent_multiline, without_block_comments};
1835 fn test_reindent_multiline_single_line() {
1836 assert_eq!("", reindent_multiline("".into(), false, None));
1837 assert_eq!("...", reindent_multiline("...".into(), false, None));
1838 assert_eq!("...", reindent_multiline(" ...".into(), false, None));
1839 assert_eq!("...", reindent_multiline("\t...".into(), false, None));
1840 assert_eq!("...", reindent_multiline("\t\t...".into(), false, None));
1845 fn test_reindent_multiline_block() {
1851 }", reindent_multiline(" if x {
1855 }".into(), false, None));
1861 }", reindent_multiline(" if x {
1865 }".into(), false, None));
1870 fn test_reindent_multiline_empty_line() {
1877 }", reindent_multiline(" if x {
1882 }".into(), false, None));
1887 fn test_reindent_multiline_lines_deeper() {
1893 }", reindent_multiline("\
1898 }".into(), true, Some(8)));
1902 fn test_without_block_comments_lines_without_block_comments() {
1903 let result = without_block_comments(vec!["/*", "", "*/"]);
1904 println!("result: {:?}", result);
1905 assert!(result.is_empty());
1907 let result = without_block_comments(vec!["", "/*", "", "*/", "#[crate_type = \"lib\"]", "/*", "", "*/", ""]);
1908 assert_eq!(result, vec!["", "#[crate_type = \"lib\"]", ""]);
1910 let result = without_block_comments(vec!["/* rust", "", "*/"]);
1911 assert!(result.is_empty());
1913 let result = without_block_comments(vec!["/* one-line comment */"]);
1914 assert!(result.is_empty());
1916 let result = without_block_comments(vec!["/* nested", "/* multi-line", "comment", "*/", "test", "*/"]);
1917 assert!(result.is_empty());
1919 let result = without_block_comments(vec!["/* nested /* inline /* comment */ test */ */"]);
1920 assert!(result.is_empty());
1922 let result = without_block_comments(vec!["foo", "bar", "baz"]);
1923 assert_eq!(result, vec!["foo", "bar", "baz"]);