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_infer;
16 extern crate rustc_lint;
17 extern crate rustc_middle;
18 extern crate rustc_mir;
19 extern crate rustc_session;
20 extern crate rustc_span;
21 extern crate rustc_target;
22 extern crate rustc_trait_selection;
23 extern crate rustc_typeck;
28 #[allow(clippy::module_name_repetitions)]
35 pub mod eager_or_lazy;
38 pub mod numeric_literal;
41 pub mod qualify_min_const_fn;
46 pub use self::attrs::*;
47 pub use self::diagnostics::*;
48 pub use self::hir_utils::{both, eq_expr_value, over, SpanlessEq, SpanlessHash};
51 use std::collections::hash_map::Entry;
52 use std::hash::BuildHasherDefault;
54 use if_chain::if_chain;
55 use rustc_ast::ast::{self, Attribute, BorrowKind, LitKind, Mutability};
56 use rustc_data_structures::fx::FxHashMap;
57 use rustc_errors::Applicability;
59 use rustc_hir::def::{CtorKind, CtorOf, DefKind, Res};
60 use rustc_hir::def_id::{DefId, LOCAL_CRATE};
61 use rustc_hir::intravisit::{self, NestedVisitorMap, Visitor};
64 def, Arm, Block, Body, Constness, Crate, Expr, ExprKind, FnDecl, HirId, ImplItem, ImplItemKind, Item, ItemKind,
65 MatchSource, Param, Pat, PatKind, Path, PathSegment, QPath, TraitItem, TraitItemKind, TraitRef, TyKind, Unsafety,
67 use rustc_infer::infer::TyCtxtInferExt;
68 use rustc_lint::{LateContext, Level, Lint, LintContext};
69 use rustc_middle::hir::exports::Export;
70 use rustc_middle::hir::map::Map;
71 use rustc_middle::ty::subst::{GenericArg, GenericArgKind};
72 use rustc_middle::ty::{self, layout::IntegerExt, DefIdTree, Ty, TyCtxt, TypeFoldable};
73 use rustc_semver::RustcVersion;
74 use rustc_session::Session;
75 use rustc_span::hygiene::{ExpnKind, MacroKind};
76 use rustc_span::source_map::original_sp;
78 use rustc_span::symbol::{kw, Symbol};
79 use rustc_span::{BytePos, Pos, Span, DUMMY_SP};
80 use rustc_target::abi::Integer;
81 use rustc_trait_selection::traits::query::normalize::AtExt;
82 use smallvec::SmallVec;
84 use crate::consts::{constant, Constant};
86 pub fn parse_msrv(msrv: &str, sess: Option<&Session>, span: Option<Span>) -> Option<RustcVersion> {
87 if let Ok(version) = RustcVersion::parse(msrv) {
89 } else if let Some(sess) = sess {
90 if let Some(span) = span {
91 sess.span_err(span, &format!("`{}` is not a valid Rust version", msrv));
97 pub fn meets_msrv(msrv: Option<&RustcVersion>, lint_msrv: &RustcVersion) -> bool {
98 msrv.map_or(true, |msrv| msrv.meets(*lint_msrv))
102 macro_rules! extract_msrv_attr {
104 extract_msrv_attr!(@LateContext, ());
107 extract_msrv_attr!(@EarlyContext);
109 (@$context:ident$(, $call:tt)?) => {
110 fn enter_lint_attrs(&mut self, cx: &rustc_lint::$context<'tcx>, attrs: &'tcx [rustc_ast::ast::Attribute]) {
111 use $crate::get_unique_inner_attr;
112 match get_unique_inner_attr(cx.sess$($call)?, attrs, "msrv") {
114 if let Some(msrv) = msrv_attr.value_str() {
115 self.msrv = $crate::parse_msrv(
117 Some(cx.sess$($call)?),
118 Some(msrv_attr.span),
121 cx.sess$($call)?.span_err(msrv_attr.span, "bad clippy attribute");
130 /// Returns `true` if the two spans come from differing expansions (i.e., one is
131 /// from a macro and one isn't).
133 pub fn differing_macro_contexts(lhs: Span, rhs: Span) -> bool {
134 rhs.ctxt() != lhs.ctxt()
137 /// Returns `true` if the given `NodeId` is inside a constant context
142 /// if in_constant(cx, expr.hir_id) {
146 pub fn in_constant(cx: &LateContext<'_>, id: HirId) -> bool {
147 let parent_id = cx.tcx.hir().get_parent_item(id);
148 match cx.tcx.hir().get(parent_id) {
150 kind: ItemKind::Const(..) | ItemKind::Static(..),
153 | Node::TraitItem(&TraitItem {
154 kind: TraitItemKind::Const(..),
157 | Node::ImplItem(&ImplItem {
158 kind: ImplItemKind::Const(..),
161 | Node::AnonConst(_) => true,
163 kind: ItemKind::Fn(ref sig, ..),
166 | Node::ImplItem(&ImplItem {
167 kind: ImplItemKind::Fn(ref sig, _),
169 }) => sig.header.constness == Constness::Const,
174 /// Returns `true` if this `span` was expanded by any macro.
176 pub fn in_macro(span: Span) -> bool {
177 if span.from_expansion() {
178 !matches!(span.ctxt().outer_expn_data().kind, ExpnKind::Desugaring(..))
184 // If the snippet is empty, it's an attribute that was inserted during macro
185 // expansion and we want to ignore those, because they could come from external
186 // sources that the user has no control over.
187 // For some reason these attributes don't have any expansion info on them, so
188 // we have to check it this way until there is a better way.
189 pub fn is_present_in_source<T: LintContext>(cx: &T, span: Span) -> bool {
190 if let Some(snippet) = snippet_opt(cx, span) {
191 if snippet.is_empty() {
198 /// Checks if given pattern is a wildcard (`_`)
199 pub fn is_wild<'tcx>(pat: &impl std::ops::Deref<Target = Pat<'tcx>>) -> bool {
200 matches!(pat.kind, PatKind::Wild)
203 /// Checks if type is struct, enum or union type with the given def path.
205 /// If the type is a diagnostic item, use `is_type_diagnostic_item` instead.
206 /// If you change the signature, remember to update the internal lint `MatchTypeOnDiagItem`
207 pub fn match_type(cx: &LateContext<'_>, ty: Ty<'_>, path: &[&str]) -> bool {
209 ty::Adt(adt, _) => match_def_path(cx, adt.did, path),
214 /// Checks if the type is equal to a diagnostic item
216 /// If you change the signature, remember to update the internal lint `MatchTypeOnDiagItem`
217 pub fn is_type_diagnostic_item(cx: &LateContext<'_>, ty: Ty<'_>, diag_item: Symbol) -> bool {
219 ty::Adt(adt, _) => cx.tcx.is_diagnostic_item(diag_item, adt.did),
224 /// Checks if the type is equal to a lang item
225 pub fn is_type_lang_item(cx: &LateContext<'_>, ty: Ty<'_>, lang_item: hir::LangItem) -> bool {
227 ty::Adt(adt, _) => cx.tcx.lang_items().require(lang_item).unwrap() == adt.did,
232 /// Checks if the method call given in `expr` belongs to the given trait.
233 pub fn match_trait_method(cx: &LateContext<'_>, expr: &Expr<'_>, path: &[&str]) -> bool {
234 let def_id = cx.typeck_results().type_dependent_def_id(expr.hir_id).unwrap();
235 let trt_id = cx.tcx.trait_of_item(def_id);
236 trt_id.map_or(false, |trt_id| match_def_path(cx, trt_id, path))
239 /// Checks if an expression references a variable of the given name.
240 pub fn match_var(expr: &Expr<'_>, var: Symbol) -> bool {
241 if let ExprKind::Path(QPath::Resolved(None, ref path)) = expr.kind {
242 if let [p] = path.segments {
243 return p.ident.name == var;
249 pub fn last_path_segment<'tcx>(path: &QPath<'tcx>) -> &'tcx PathSegment<'tcx> {
251 QPath::Resolved(_, ref path) => path.segments.last().expect("A path must have at least one segment"),
252 QPath::TypeRelative(_, ref seg) => seg,
253 QPath::LangItem(..) => panic!("last_path_segment: lang item has no path segments"),
257 pub fn single_segment_path<'tcx>(path: &QPath<'tcx>) -> Option<&'tcx PathSegment<'tcx>> {
259 QPath::Resolved(_, ref path) => path.segments.get(0),
260 QPath::TypeRelative(_, ref seg) => Some(seg),
261 QPath::LangItem(..) => None,
265 /// Matches a `QPath` against a slice of segment string literals.
267 /// There is also `match_path` if you are dealing with a `rustc_hir::Path` instead of a
268 /// `rustc_hir::QPath`.
272 /// match_qpath(path, &["std", "rt", "begin_unwind"])
274 pub fn match_qpath(path: &QPath<'_>, segments: &[&str]) -> bool {
276 QPath::Resolved(_, ref path) => match_path(path, segments),
277 QPath::TypeRelative(ref ty, ref segment) => match ty.kind {
278 TyKind::Path(ref inner_path) => {
279 if let [prefix @ .., end] = segments {
280 if match_qpath(inner_path, prefix) {
281 return segment.ident.name.as_str() == *end;
288 QPath::LangItem(..) => false,
292 /// Matches a `Path` against a slice of segment string literals.
294 /// There is also `match_qpath` if you are dealing with a `rustc_hir::QPath` instead of a
295 /// `rustc_hir::Path`.
300 /// if match_path(&trait_ref.path, &paths::HASH) {
301 /// // This is the `std::hash::Hash` trait.
304 /// if match_path(ty_path, &["rustc", "lint", "Lint"]) {
305 /// // This is a `rustc_middle::lint::Lint`.
308 pub fn match_path(path: &Path<'_>, segments: &[&str]) -> bool {
312 .zip(segments.iter().rev())
313 .all(|(a, b)| a.ident.name.as_str() == *b)
316 /// Matches a `Path` against a slice of segment string literals, e.g.
320 /// match_path_ast(path, &["std", "rt", "begin_unwind"])
322 pub fn match_path_ast(path: &ast::Path, segments: &[&str]) -> bool {
326 .zip(segments.iter().rev())
327 .all(|(a, b)| a.ident.name.as_str() == *b)
330 /// If the expression is a path to a local, returns the canonical `HirId` of the local.
331 pub fn path_to_local(expr: &Expr<'_>) -> Option<HirId> {
332 if let ExprKind::Path(QPath::Resolved(None, ref path)) = expr.kind {
333 if let Res::Local(id) = path.res {
340 /// Returns true if the expression is a path to a local with the specified `HirId`.
341 /// Use this function to see if an expression matches a function argument or a match binding.
342 pub fn path_to_local_id(expr: &Expr<'_>, id: HirId) -> bool {
343 path_to_local(expr) == Some(id)
346 /// Gets the definition associated to a path.
347 #[allow(clippy::shadow_unrelated)] // false positive #6563
348 pub fn path_to_res(cx: &LateContext<'_>, path: &[&str]) -> Res {
349 macro_rules! try_res {
353 None => return Res::Err,
357 fn item_child_by_name<'tcx>(tcx: TyCtxt<'tcx>, def_id: DefId, name: &str) -> Option<&'tcx Export<HirId>> {
358 tcx.item_children(def_id)
360 .find(|item| item.ident.name.as_str() == name)
363 let (krate, first, path) = match *path {
364 [krate, first, ref path @ ..] => (krate, first, path),
365 _ => return Res::Err,
368 let crates = tcx.crates();
369 let krate = try_res!(crates.iter().find(|&&num| tcx.crate_name(num).as_str() == krate));
370 let first = try_res!(item_child_by_name(tcx, krate.as_def_id(), first));
374 // `get_def_path` seems to generate these empty segments for extern blocks.
375 // We can just ignore them.
376 .filter(|segment| !segment.is_empty())
377 // for each segment, find the child item
378 .try_fold(first, |item, segment| {
379 let def_id = item.res.def_id();
380 if let Some(item) = item_child_by_name(tcx, def_id, segment) {
382 } else if matches!(item.res, Res::Def(DefKind::Enum | DefKind::Struct, _)) {
383 // it is not a child item so check inherent impl items
384 tcx.inherent_impls(def_id)
386 .find_map(|&impl_def_id| item_child_by_name(tcx, impl_def_id, segment))
394 /// Convenience function to get the `DefId` of a trait by path.
395 /// It could be a trait or trait alias.
396 pub fn get_trait_def_id(cx: &LateContext<'_>, path: &[&str]) -> Option<DefId> {
397 match path_to_res(cx, path) {
398 Res::Def(DefKind::Trait | DefKind::TraitAlias, trait_id) => Some(trait_id),
403 /// Checks whether a type implements a trait.
404 /// See also `get_trait_def_id`.
405 pub fn implements_trait<'tcx>(
406 cx: &LateContext<'tcx>,
409 ty_params: &[GenericArg<'tcx>],
411 // Do not check on infer_types to avoid panic in evaluate_obligation.
412 if ty.has_infer_types() {
415 let ty = cx.tcx.erase_regions(ty);
416 if ty.has_escaping_bound_vars() {
419 let ty_params = cx.tcx.mk_substs(ty_params.iter());
420 cx.tcx.type_implements_trait((trait_id, ty, ty_params, cx.param_env))
423 /// Gets the `hir::TraitRef` of the trait the given method is implemented for.
425 /// Use this if you want to find the `TraitRef` of the `Add` trait in this example:
428 /// struct Point(isize, isize);
430 /// impl std::ops::Add for Point {
431 /// type Output = Self;
433 /// fn add(self, other: Self) -> Self {
438 pub fn trait_ref_of_method<'tcx>(cx: &LateContext<'tcx>, hir_id: HirId) -> Option<&'tcx TraitRef<'tcx>> {
439 // Get the implemented trait for the current function
440 let parent_impl = cx.tcx.hir().get_parent_item(hir_id);
442 if parent_impl != hir::CRATE_HIR_ID;
443 if let hir::Node::Item(item) = cx.tcx.hir().get(parent_impl);
444 if let hir::ItemKind::Impl(impl_) = &item.kind;
445 then { return impl_.of_trait.as_ref(); }
450 /// Checks whether this type implements `Drop`.
451 pub fn has_drop<'tcx>(cx: &LateContext<'tcx>, ty: Ty<'tcx>) -> bool {
452 match ty.ty_adt_def() {
453 Some(def) => def.has_dtor(cx.tcx),
458 /// Returns the method names and argument list of nested method call expressions that make up
459 /// `expr`. method/span lists are sorted with the most recent call first.
460 pub fn method_calls<'tcx>(
461 expr: &'tcx Expr<'tcx>,
463 ) -> (Vec<Symbol>, Vec<&'tcx [Expr<'tcx>]>, Vec<Span>) {
464 let mut method_names = Vec::with_capacity(max_depth);
465 let mut arg_lists = Vec::with_capacity(max_depth);
466 let mut spans = Vec::with_capacity(max_depth);
468 let mut current = expr;
469 for _ in 0..max_depth {
470 if let ExprKind::MethodCall(path, span, args, _) = ¤t.kind {
471 if args.iter().any(|e| e.span.from_expansion()) {
474 method_names.push(path.ident.name);
475 arg_lists.push(&**args);
483 (method_names, arg_lists, spans)
486 /// Matches an `Expr` against a chain of methods, and return the matched `Expr`s.
488 /// For example, if `expr` represents the `.baz()` in `foo.bar().baz()`,
489 /// `method_chain_args(expr, &["bar", "baz"])` will return a `Vec`
490 /// containing the `Expr`s for
491 /// `.bar()` and `.baz()`
492 pub fn method_chain_args<'a>(expr: &'a Expr<'_>, methods: &[&str]) -> Option<Vec<&'a [Expr<'a>]>> {
493 let mut current = expr;
494 let mut matched = Vec::with_capacity(methods.len());
495 for method_name in methods.iter().rev() {
496 // method chains are stored last -> first
497 if let ExprKind::MethodCall(ref path, _, ref args, _) = current.kind {
498 if path.ident.name.as_str() == *method_name {
499 if args.iter().any(|e| e.span.from_expansion()) {
502 matched.push(&**args); // build up `matched` backwards
503 current = &args[0] // go to parent expression
511 // Reverse `matched` so that it is in the same order as `methods`.
516 /// Returns `true` if the provided `def_id` is an entrypoint to a program.
517 pub fn is_entrypoint_fn(cx: &LateContext<'_>, def_id: DefId) -> bool {
519 .entry_fn(LOCAL_CRATE)
520 .map_or(false, |(entry_fn_def_id, _)| def_id == entry_fn_def_id.to_def_id())
523 /// Returns `true` if the expression is in the program's `#[panic_handler]`.
524 pub fn is_in_panic_handler(cx: &LateContext<'_>, e: &Expr<'_>) -> bool {
525 let parent = cx.tcx.hir().get_parent_item(e.hir_id);
526 let def_id = cx.tcx.hir().local_def_id(parent).to_def_id();
527 Some(def_id) == cx.tcx.lang_items().panic_impl()
530 /// Gets the name of the item the expression is in, if available.
531 pub fn get_item_name(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<Symbol> {
532 let parent_id = cx.tcx.hir().get_parent_item(expr.hir_id);
533 match cx.tcx.hir().find(parent_id) {
535 Node::Item(Item { ident, .. })
536 | Node::TraitItem(TraitItem { ident, .. })
537 | Node::ImplItem(ImplItem { ident, .. }),
538 ) => Some(ident.name),
543 /// Gets the name of a `Pat`, if any.
544 pub fn get_pat_name(pat: &Pat<'_>) -> Option<Symbol> {
546 PatKind::Binding(.., ref spname, _) => Some(spname.name),
547 PatKind::Path(ref qpath) => single_segment_path(qpath).map(|ps| ps.ident.name),
548 PatKind::Box(ref p) | PatKind::Ref(ref p, _) => get_pat_name(&*p),
553 struct ContainsName {
558 impl<'tcx> Visitor<'tcx> for ContainsName {
559 type Map = Map<'tcx>;
561 fn visit_name(&mut self, _: Span, name: Symbol) {
562 if self.name == name {
566 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
567 NestedVisitorMap::None
571 /// Checks if an `Expr` contains a certain name.
572 pub fn contains_name(name: Symbol, expr: &Expr<'_>) -> bool {
573 let mut cn = ContainsName { name, result: false };
578 /// Returns `true` if `expr` contains a return expression
579 pub fn contains_return(expr: &hir::Expr<'_>) -> bool {
580 struct RetCallFinder {
584 impl<'tcx> hir::intravisit::Visitor<'tcx> for RetCallFinder {
585 type Map = Map<'tcx>;
587 fn visit_expr(&mut self, expr: &'tcx hir::Expr<'_>) {
591 if let hir::ExprKind::Ret(..) = &expr.kind {
594 hir::intravisit::walk_expr(self, expr);
598 fn nested_visit_map(&mut self) -> hir::intravisit::NestedVisitorMap<Self::Map> {
599 hir::intravisit::NestedVisitorMap::None
603 let mut visitor = RetCallFinder { found: false };
604 visitor.visit_expr(expr);
608 struct FindMacroCalls<'a, 'b> {
609 names: &'a [&'b str],
613 impl<'a, 'b, 'tcx> Visitor<'tcx> for FindMacroCalls<'a, 'b> {
614 type Map = Map<'tcx>;
616 fn visit_expr(&mut self, expr: &'tcx Expr<'_>) {
617 if self.names.iter().any(|fun| is_expn_of(expr.span, fun).is_some()) {
618 self.result.push(expr.span);
620 // and check sub-expressions
621 intravisit::walk_expr(self, expr);
624 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
625 NestedVisitorMap::None
629 /// Finds calls of the specified macros in a function body.
630 pub fn find_macro_calls(names: &[&str], body: &Body<'_>) -> Vec<Span> {
631 let mut fmc = FindMacroCalls {
635 fmc.visit_expr(&body.value);
639 /// Converts a span to a code snippet if available, otherwise use default.
641 /// This is useful if you want to provide suggestions for your lint or more generally, if you want
642 /// to convert a given `Span` to a `str`.
646 /// snippet(cx, expr.span, "..")
648 pub fn snippet<'a, T: LintContext>(cx: &T, span: Span, default: &'a str) -> Cow<'a, str> {
649 snippet_opt(cx, span).map_or_else(|| Cow::Borrowed(default), From::from)
652 /// Same as `snippet`, but it adapts the applicability level by following rules:
654 /// - Applicability level `Unspecified` will never be changed.
655 /// - If the span is inside a macro, change the applicability level to `MaybeIncorrect`.
656 /// - If the default value is used and the applicability level is `MachineApplicable`, change it to
657 /// `HasPlaceholders`
658 pub fn snippet_with_applicability<'a, T: LintContext>(
662 applicability: &mut Applicability,
664 if *applicability != Applicability::Unspecified && span.from_expansion() {
665 *applicability = Applicability::MaybeIncorrect;
667 snippet_opt(cx, span).map_or_else(
669 if *applicability == Applicability::MachineApplicable {
670 *applicability = Applicability::HasPlaceholders;
672 Cow::Borrowed(default)
678 /// Same as `snippet`, but should only be used when it's clear that the input span is
679 /// not a macro argument.
680 pub fn snippet_with_macro_callsite<'a, T: LintContext>(cx: &T, span: Span, default: &'a str) -> Cow<'a, str> {
681 snippet(cx, span.source_callsite(), default)
684 /// Converts a span to a code snippet. Returns `None` if not available.
685 pub fn snippet_opt<T: LintContext>(cx: &T, span: Span) -> Option<String> {
686 cx.sess().source_map().span_to_snippet(span).ok()
689 /// Converts a span (from a block) to a code snippet if available, otherwise use default.
691 /// This trims the code of indentation, except for the first line. Use it for blocks or block-like
692 /// things which need to be printed as such.
694 /// The `indent_relative_to` arg can be used, to provide a span, where the indentation of the
695 /// resulting snippet of the given span.
700 /// snippet_block(cx, block.span, "..", None)
701 /// // where, `block` is the block of the if expr
705 /// // will return the snippet
712 /// snippet_block(cx, block.span, "..", Some(if_expr.span))
713 /// // where, `block` is the block of the if expr
717 /// // will return the snippet
720 /// } // aligned with `if`
722 /// Note that the first line of the snippet always has 0 indentation.
723 pub fn snippet_block<'a, T: LintContext>(
727 indent_relative_to: Option<Span>,
729 let snip = snippet(cx, span, default);
730 let indent = indent_relative_to.and_then(|s| indent_of(cx, s));
731 reindent_multiline(snip, true, indent)
734 /// Same as `snippet_block`, but adapts the applicability level by the rules of
735 /// `snippet_with_applicability`.
736 pub fn snippet_block_with_applicability<'a, T: LintContext>(
740 indent_relative_to: Option<Span>,
741 applicability: &mut Applicability,
743 let snip = snippet_with_applicability(cx, span, default, applicability);
744 let indent = indent_relative_to.and_then(|s| indent_of(cx, s));
745 reindent_multiline(snip, true, indent)
748 /// Returns a new Span that extends the original Span to the first non-whitespace char of the first
754 /// // will be converted to
758 pub fn first_line_of_span<T: LintContext>(cx: &T, span: Span) -> Span {
759 first_char_in_first_line(cx, span).map_or(span, |first_char_pos| span.with_lo(first_char_pos))
762 fn first_char_in_first_line<T: LintContext>(cx: &T, span: Span) -> Option<BytePos> {
763 let line_span = line_span(cx, span);
764 snippet_opt(cx, line_span).and_then(|snip| {
765 snip.find(|c: char| !c.is_whitespace())
766 .map(|pos| line_span.lo() + BytePos::from_usize(pos))
770 /// Returns the indentation of the line of a span
774 /// // ^^ -- will return 0
776 /// // ^^ -- will return 4
778 pub fn indent_of<T: LintContext>(cx: &T, span: Span) -> Option<usize> {
779 snippet_opt(cx, line_span(cx, span)).and_then(|snip| snip.find(|c: char| !c.is_whitespace()))
782 /// Returns the positon just before rarrow
785 /// fn into(self) -> () {}
787 /// // in case of unformatted code
788 /// fn into2(self)-> () {}
790 /// fn into3(self) -> () {}
793 pub fn position_before_rarrow(s: &str) -> Option<usize> {
794 s.rfind("->").map(|rpos| {
796 let chars: Vec<char> = s.chars().collect();
798 if let Some(c) = chars.get(rpos - 1) {
799 if c.is_whitespace() {
810 /// Extends the span to the beginning of the spans line, incl. whitespaces.
815 /// // will be converted to
817 /// // ^^^^^^^^^^^^^^
819 fn line_span<T: LintContext>(cx: &T, span: Span) -> Span {
820 let span = original_sp(span, DUMMY_SP);
821 let source_map_and_line = cx.sess().source_map().lookup_line(span.lo()).unwrap();
822 let line_no = source_map_and_line.line;
823 let line_start = source_map_and_line.sf.lines[line_no];
824 Span::new(line_start, span.hi(), span.ctxt())
827 /// Like `snippet_block`, but add braces if the expr is not an `ExprKind::Block`.
828 /// Also takes an `Option<String>` which can be put inside the braces.
829 pub fn expr_block<'a, T: LintContext>(
832 option: Option<String>,
834 indent_relative_to: Option<Span>,
836 let code = snippet_block(cx, expr.span, default, indent_relative_to);
837 let string = option.unwrap_or_default();
838 if expr.span.from_expansion() {
839 Cow::Owned(format!("{{ {} }}", snippet_with_macro_callsite(cx, expr.span, default)))
840 } else if let ExprKind::Block(_, _) = expr.kind {
841 Cow::Owned(format!("{}{}", code, string))
842 } else if string.is_empty() {
843 Cow::Owned(format!("{{ {} }}", code))
845 Cow::Owned(format!("{{\n{};\n{}\n}}", code, string))
849 /// Reindent a multiline string with possibility of ignoring the first line.
850 #[allow(clippy::needless_pass_by_value)]
851 pub fn reindent_multiline(s: Cow<'_, str>, ignore_first: bool, indent: Option<usize>) -> Cow<'_, str> {
852 let s_space = reindent_multiline_inner(&s, ignore_first, indent, ' ');
853 let s_tab = reindent_multiline_inner(&s_space, ignore_first, indent, '\t');
854 reindent_multiline_inner(&s_tab, ignore_first, indent, ' ').into()
857 fn reindent_multiline_inner(s: &str, ignore_first: bool, indent: Option<usize>, ch: char) -> String {
860 .skip(ignore_first as usize)
865 // ignore empty lines
866 Some(l.char_indices().find(|&(_, x)| x != ch).unwrap_or((l.len(), ch)).0)
871 let indent = indent.unwrap_or(0);
875 if (ignore_first && i == 0) || l.is_empty() {
877 } else if x > indent {
878 l.split_at(x - indent).1.to_owned()
880 " ".repeat(indent - x) + l
883 .collect::<Vec<String>>()
887 /// Gets the parent expression, if any –- this is useful to constrain a lint.
888 pub fn get_parent_expr<'tcx>(cx: &LateContext<'tcx>, e: &Expr<'_>) -> Option<&'tcx Expr<'tcx>> {
889 let map = &cx.tcx.hir();
890 let hir_id = e.hir_id;
891 let parent_id = map.get_parent_node(hir_id);
892 if hir_id == parent_id {
895 map.find(parent_id).and_then(|node| {
896 if let Node::Expr(parent) = node {
904 pub fn get_enclosing_block<'tcx>(cx: &LateContext<'tcx>, hir_id: HirId) -> Option<&'tcx Block<'tcx>> {
905 let map = &cx.tcx.hir();
906 let enclosing_node = map
907 .get_enclosing_scope(hir_id)
908 .and_then(|enclosing_id| map.find(enclosing_id));
909 enclosing_node.and_then(|node| match node {
910 Node::Block(block) => Some(block),
912 kind: ItemKind::Fn(_, _, eid),
915 | Node::ImplItem(&ImplItem {
916 kind: ImplItemKind::Fn(_, eid),
918 }) => match cx.tcx.hir().body(eid).value.kind {
919 ExprKind::Block(ref block, _) => Some(block),
926 /// Returns the base type for HIR references and pointers.
927 pub fn walk_ptrs_hir_ty<'tcx>(ty: &'tcx hir::Ty<'tcx>) -> &'tcx hir::Ty<'tcx> {
929 TyKind::Ptr(ref mut_ty) | TyKind::Rptr(_, ref mut_ty) => walk_ptrs_hir_ty(&mut_ty.ty),
934 /// Returns the base type for references and raw pointers, and count reference
936 pub fn walk_ptrs_ty_depth(ty: Ty<'_>) -> (Ty<'_>, usize) {
937 fn inner(ty: Ty<'_>, depth: usize) -> (Ty<'_>, usize) {
939 ty::Ref(_, ty, _) => inner(ty, depth + 1),
946 /// Checks whether the given expression is a constant integer of the given value.
947 /// unlike `is_integer_literal`, this version does const folding
948 pub fn is_integer_const(cx: &LateContext<'_>, e: &Expr<'_>, value: u128) -> bool {
949 if is_integer_literal(e, value) {
952 let map = cx.tcx.hir();
953 let parent_item = map.get_parent_item(e.hir_id);
954 if let Some((Constant::Int(v), _)) = map
955 .maybe_body_owned_by(parent_item)
956 .and_then(|body_id| constant(cx, cx.tcx.typeck_body(body_id), e))
964 /// Checks whether the given expression is a constant literal of the given value.
965 pub fn is_integer_literal(expr: &Expr<'_>, value: u128) -> bool {
966 // FIXME: use constant folding
967 if let ExprKind::Lit(ref spanned) = expr.kind {
968 if let LitKind::Int(v, _) = spanned.node {
975 /// Returns `true` if the given `Expr` has been coerced before.
977 /// Examples of coercions can be found in the Nomicon at
978 /// <https://doc.rust-lang.org/nomicon/coercions.html>.
980 /// See `rustc_middle::ty::adjustment::Adjustment` and `rustc_typeck::check::coercion` for more
981 /// information on adjustments and coercions.
982 pub fn is_adjusted(cx: &LateContext<'_>, e: &Expr<'_>) -> bool {
983 cx.typeck_results().adjustments().get(e.hir_id).is_some()
986 /// Returns the pre-expansion span if is this comes from an expansion of the
988 /// See also `is_direct_expn_of`.
990 pub fn is_expn_of(mut span: Span, name: &str) -> Option<Span> {
992 if span.from_expansion() {
993 let data = span.ctxt().outer_expn_data();
994 let new_span = data.call_site;
996 if let ExpnKind::Macro(MacroKind::Bang, mac_name) = data.kind {
997 if mac_name.as_str() == name {
998 return Some(new_span);
1009 /// Returns the pre-expansion span if the span directly comes from an expansion
1010 /// of the macro `name`.
1011 /// The difference with `is_expn_of` is that in
1015 /// `42` is considered expanded from `foo!` and `bar!` by `is_expn_of` but only
1017 /// `is_direct_expn_of`.
1019 pub fn is_direct_expn_of(span: Span, name: &str) -> Option<Span> {
1020 if span.from_expansion() {
1021 let data = span.ctxt().outer_expn_data();
1022 let new_span = data.call_site;
1024 if let ExpnKind::Macro(MacroKind::Bang, mac_name) = data.kind {
1025 if mac_name.as_str() == name {
1026 return Some(new_span);
1034 /// Convenience function to get the return type of a function.
1035 pub fn return_ty<'tcx>(cx: &LateContext<'tcx>, fn_item: hir::HirId) -> Ty<'tcx> {
1036 let fn_def_id = cx.tcx.hir().local_def_id(fn_item);
1037 let ret_ty = cx.tcx.fn_sig(fn_def_id).output();
1038 cx.tcx.erase_late_bound_regions(ret_ty)
1041 /// Walks into `ty` and returns `true` if any inner type is the same as `other_ty`
1042 pub fn contains_ty(ty: Ty<'_>, other_ty: Ty<'_>) -> bool {
1043 ty.walk().any(|inner| match inner.unpack() {
1044 GenericArgKind::Type(inner_ty) => ty::TyS::same_type(other_ty, inner_ty),
1045 GenericArgKind::Lifetime(_) | GenericArgKind::Const(_) => false,
1049 /// Returns `true` if the given type is an `unsafe` function.
1050 pub fn type_is_unsafe_function<'tcx>(cx: &LateContext<'tcx>, ty: Ty<'tcx>) -> bool {
1052 ty::FnDef(..) | ty::FnPtr(_) => ty.fn_sig(cx.tcx).unsafety() == Unsafety::Unsafe,
1057 pub fn is_copy<'tcx>(cx: &LateContext<'tcx>, ty: Ty<'tcx>) -> bool {
1058 ty.is_copy_modulo_regions(cx.tcx.at(DUMMY_SP), cx.param_env)
1061 /// Checks if an expression is constructing a tuple-like enum variant or struct
1062 pub fn is_ctor_or_promotable_const_function(cx: &LateContext<'_>, expr: &Expr<'_>) -> bool {
1063 if let ExprKind::Call(ref fun, _) = expr.kind {
1064 if let ExprKind::Path(ref qp) = fun.kind {
1065 let res = cx.qpath_res(qp, fun.hir_id);
1067 def::Res::Def(DefKind::Variant | DefKind::Ctor(..), ..) => true,
1068 def::Res::Def(_, def_id) => cx.tcx.is_promotable_const_fn(def_id),
1076 /// Returns `true` if a pattern is refutable.
1077 // TODO: should be implemented using rustc/mir_build/thir machinery
1078 pub fn is_refutable(cx: &LateContext<'_>, pat: &Pat<'_>) -> bool {
1079 fn is_enum_variant(cx: &LateContext<'_>, qpath: &QPath<'_>, id: HirId) -> bool {
1081 cx.qpath_res(qpath, id),
1082 def::Res::Def(DefKind::Variant, ..) | Res::Def(DefKind::Ctor(def::CtorOf::Variant, _), _)
1086 fn are_refutable<'a, I: Iterator<Item = &'a Pat<'a>>>(cx: &LateContext<'_>, mut i: I) -> bool {
1087 i.any(|pat| is_refutable(cx, pat))
1091 PatKind::Wild => false,
1092 PatKind::Binding(_, _, _, pat) => pat.map_or(false, |pat| is_refutable(cx, pat)),
1093 PatKind::Box(ref pat) | PatKind::Ref(ref pat, _) => is_refutable(cx, pat),
1094 PatKind::Lit(..) | PatKind::Range(..) => true,
1095 PatKind::Path(ref qpath) => is_enum_variant(cx, qpath, pat.hir_id),
1096 PatKind::Or(ref pats) => {
1097 // TODO: should be the honest check, that pats is exhaustive set
1098 are_refutable(cx, pats.iter().map(|pat| &**pat))
1100 PatKind::Tuple(ref pats, _) => are_refutable(cx, pats.iter().map(|pat| &**pat)),
1101 PatKind::Struct(ref qpath, ref fields, _) => {
1102 is_enum_variant(cx, qpath, pat.hir_id) || are_refutable(cx, fields.iter().map(|field| &*field.pat))
1104 PatKind::TupleStruct(ref qpath, ref pats, _) => {
1105 is_enum_variant(cx, qpath, pat.hir_id) || are_refutable(cx, pats.iter().map(|pat| &**pat))
1107 PatKind::Slice(ref head, ref middle, ref tail) => {
1108 match &cx.typeck_results().node_type(pat.hir_id).kind() {
1110 // [..] is the only irrefutable slice pattern.
1111 !head.is_empty() || middle.is_none() || !tail.is_empty()
1113 ty::Array(..) => are_refutable(cx, head.iter().chain(middle).chain(tail.iter()).map(|pat| &**pat)),
1123 /// Checks for the `#[automatically_derived]` attribute all `#[derive]`d
1124 /// implementations have.
1125 pub fn is_automatically_derived(attrs: &[ast::Attribute]) -> bool {
1126 attrs.iter().any(|attr| attr.has_name(sym::automatically_derived))
1129 /// Remove blocks around an expression.
1131 /// Ie. `x`, `{ x }` and `{{{{ x }}}}` all give `x`. `{ x; y }` and `{}` return
1133 pub fn remove_blocks<'tcx>(mut expr: &'tcx Expr<'tcx>) -> &'tcx Expr<'tcx> {
1134 while let ExprKind::Block(ref block, ..) = expr.kind {
1135 match (block.stmts.is_empty(), block.expr.as_ref()) {
1136 (true, Some(e)) => expr = e,
1143 pub fn is_self(slf: &Param<'_>) -> bool {
1144 if let PatKind::Binding(.., name, _) = slf.pat.kind {
1145 name.name == kw::SelfLower
1151 pub fn is_self_ty(slf: &hir::Ty<'_>) -> bool {
1153 if let TyKind::Path(QPath::Resolved(None, ref path)) = slf.kind;
1154 if let Res::SelfTy(..) = path.res;
1162 pub fn iter_input_pats<'tcx>(decl: &FnDecl<'_>, body: &'tcx Body<'_>) -> impl Iterator<Item = &'tcx Param<'tcx>> {
1163 (0..decl.inputs.len()).map(move |i| &body.params[i])
1166 /// Checks if a given expression is a match expression expanded from the `?`
1167 /// operator or the `try` macro.
1168 pub fn is_try<'tcx>(expr: &'tcx Expr<'tcx>) -> Option<&'tcx Expr<'tcx>> {
1169 fn is_ok(arm: &Arm<'_>) -> bool {
1171 if let PatKind::TupleStruct(ref path, ref pat, None) = arm.pat.kind;
1172 if match_qpath(path, &paths::RESULT_OK[1..]);
1173 if let PatKind::Binding(_, hir_id, _, None) = pat[0].kind;
1174 if path_to_local_id(arm.body, hir_id);
1182 fn is_err(arm: &Arm<'_>) -> bool {
1183 if let PatKind::TupleStruct(ref path, _, _) = arm.pat.kind {
1184 match_qpath(path, &paths::RESULT_ERR[1..])
1190 if let ExprKind::Match(_, ref arms, ref source) = expr.kind {
1191 // desugared from a `?` operator
1192 if let MatchSource::TryDesugar = *source {
1198 if arms[0].guard.is_none();
1199 if arms[1].guard.is_none();
1200 if (is_ok(&arms[0]) && is_err(&arms[1])) ||
1201 (is_ok(&arms[1]) && is_err(&arms[0]));
1211 /// Returns `true` if the lint is allowed in the current context
1213 /// Useful for skipping long running code when it's unnecessary
1214 pub fn is_allowed(cx: &LateContext<'_>, lint: &'static Lint, id: HirId) -> bool {
1215 cx.tcx.lint_level_at_node(lint, id).0 == Level::Allow
1218 pub fn strip_pat_refs<'hir>(mut pat: &'hir Pat<'hir>) -> &'hir Pat<'hir> {
1219 while let PatKind::Ref(subpat, _) = pat.kind {
1225 pub fn int_bits(tcx: TyCtxt<'_>, ity: ty::IntTy) -> u64 {
1226 Integer::from_int_ty(&tcx, ity).size().bits()
1229 #[allow(clippy::cast_possible_wrap)]
1230 /// Turn a constant int byte representation into an i128
1231 pub fn sext(tcx: TyCtxt<'_>, u: u128, ity: ty::IntTy) -> i128 {
1232 let amt = 128 - int_bits(tcx, ity);
1233 ((u as i128) << amt) >> amt
1236 #[allow(clippy::cast_sign_loss)]
1237 /// clip unused bytes
1238 pub fn unsext(tcx: TyCtxt<'_>, u: i128, ity: ty::IntTy) -> u128 {
1239 let amt = 128 - int_bits(tcx, ity);
1240 ((u as u128) << amt) >> amt
1243 /// clip unused bytes
1244 pub fn clip(tcx: TyCtxt<'_>, u: u128, ity: ty::UintTy) -> u128 {
1245 let bits = Integer::from_uint_ty(&tcx, ity).size().bits();
1246 let amt = 128 - bits;
1250 /// Removes block comments from the given `Vec` of lines.
1255 /// without_block_comments(vec!["/*", "foo", "*/"]);
1258 /// without_block_comments(vec!["bar", "/*", "foo", "*/"]);
1259 /// // => vec!["bar"]
1261 pub fn without_block_comments(lines: Vec<&str>) -> Vec<&str> {
1262 let mut without = vec![];
1264 let mut nest_level = 0;
1267 if line.contains("/*") {
1270 } else if line.contains("*/") {
1275 if nest_level == 0 {
1283 pub fn any_parent_is_automatically_derived(tcx: TyCtxt<'_>, node: HirId) -> bool {
1284 let map = &tcx.hir();
1285 let mut prev_enclosing_node = None;
1286 let mut enclosing_node = node;
1287 while Some(enclosing_node) != prev_enclosing_node {
1288 if is_automatically_derived(map.attrs(enclosing_node)) {
1291 prev_enclosing_node = Some(enclosing_node);
1292 enclosing_node = map.get_parent_item(enclosing_node);
1297 /// Returns true if ty has `iter` or `iter_mut` methods
1298 pub fn has_iter_method(cx: &LateContext<'_>, probably_ref_ty: Ty<'_>) -> Option<&'static str> {
1299 // FIXME: instead of this hard-coded list, we should check if `<adt>::iter`
1300 // exists and has the desired signature. Unfortunately FnCtxt is not exported
1301 // so we can't use its `lookup_method` method.
1302 let into_iter_collections: [&[&str]; 13] = [
1309 &paths::LINKED_LIST,
1310 &paths::BINARY_HEAP,
1318 let ty_to_check = match probably_ref_ty.kind() {
1319 ty::Ref(_, ty_to_check, _) => ty_to_check,
1320 _ => probably_ref_ty,
1323 let def_id = match ty_to_check.kind() {
1324 ty::Array(..) => return Some("array"),
1325 ty::Slice(..) => return Some("slice"),
1326 ty::Adt(adt, _) => adt.did,
1330 for path in &into_iter_collections {
1331 if match_def_path(cx, def_id, path) {
1332 return Some(*path.last().unwrap());
1338 /// Matches a function call with the given path and returns the arguments.
1343 /// if let Some(args) = match_function_call(cx, cmp_max_call, &paths::CMP_MAX);
1345 pub fn match_function_call<'tcx>(
1346 cx: &LateContext<'tcx>,
1347 expr: &'tcx Expr<'_>,
1349 ) -> Option<&'tcx [Expr<'tcx>]> {
1351 if let ExprKind::Call(ref fun, ref args) = expr.kind;
1352 if let ExprKind::Path(ref qpath) = fun.kind;
1353 if let Some(fun_def_id) = cx.qpath_res(qpath, fun.hir_id).opt_def_id();
1354 if match_def_path(cx, fun_def_id, path);
1362 /// Checks if `Ty` is normalizable. This function is useful
1363 /// to avoid crashes on `layout_of`.
1364 pub fn is_normalizable<'tcx>(cx: &LateContext<'tcx>, param_env: ty::ParamEnv<'tcx>, ty: Ty<'tcx>) -> bool {
1365 cx.tcx.infer_ctxt().enter(|infcx| {
1366 let cause = rustc_middle::traits::ObligationCause::dummy();
1367 infcx.at(&cause, param_env).normalize(ty).is_ok()
1371 pub fn match_def_path<'tcx>(cx: &LateContext<'tcx>, did: DefId, syms: &[&str]) -> bool {
1372 // We have to convert `syms` to `&[Symbol]` here because rustc's `match_def_path`
1373 // accepts only that. We should probably move to Symbols in Clippy as well.
1374 let syms = syms.iter().map(|p| Symbol::intern(p)).collect::<Vec<Symbol>>();
1375 cx.match_def_path(did, &syms)
1378 pub fn match_panic_call<'tcx>(cx: &LateContext<'tcx>, expr: &'tcx Expr<'_>) -> Option<&'tcx [Expr<'tcx>]> {
1379 match_function_call(cx, expr, &paths::BEGIN_PANIC)
1380 .or_else(|| match_function_call(cx, expr, &paths::BEGIN_PANIC_FMT))
1381 .or_else(|| match_function_call(cx, expr, &paths::PANIC_ANY))
1382 .or_else(|| match_function_call(cx, expr, &paths::PANICKING_PANIC))
1383 .or_else(|| match_function_call(cx, expr, &paths::PANICKING_PANIC_FMT))
1384 .or_else(|| match_function_call(cx, expr, &paths::PANICKING_PANIC_STR))
1387 pub fn match_panic_def_id(cx: &LateContext<'_>, did: DefId) -> bool {
1388 match_def_path(cx, did, &paths::BEGIN_PANIC)
1389 || match_def_path(cx, did, &paths::BEGIN_PANIC_FMT)
1390 || match_def_path(cx, did, &paths::PANIC_ANY)
1391 || match_def_path(cx, did, &paths::PANICKING_PANIC)
1392 || match_def_path(cx, did, &paths::PANICKING_PANIC_FMT)
1393 || match_def_path(cx, did, &paths::PANICKING_PANIC_STR)
1396 /// Returns the list of condition expressions and the list of blocks in a
1397 /// sequence of `if/else`.
1398 /// E.g., this returns `([a, b], [c, d, e])` for the expression
1399 /// `if a { c } else if b { d } else { e }`.
1400 pub fn if_sequence<'tcx>(
1401 mut expr: &'tcx Expr<'tcx>,
1402 ) -> (SmallVec<[&'tcx Expr<'tcx>; 1]>, SmallVec<[&'tcx Block<'tcx>; 1]>) {
1403 let mut conds = SmallVec::new();
1404 let mut blocks: SmallVec<[&Block<'_>; 1]> = SmallVec::new();
1406 while let ExprKind::If(ref cond, ref then_expr, ref else_expr) = expr.kind {
1407 conds.push(&**cond);
1408 if let ExprKind::Block(ref block, _) = then_expr.kind {
1411 panic!("ExprKind::If node is not an ExprKind::Block");
1414 if let Some(ref else_expr) = *else_expr {
1421 // final `else {..}`
1422 if !blocks.is_empty() {
1423 if let ExprKind::Block(ref block, _) = expr.kind {
1424 blocks.push(&**block);
1431 pub fn parent_node_is_if_expr(expr: &Expr<'_>, cx: &LateContext<'_>) -> bool {
1432 let map = cx.tcx.hir();
1433 let parent_id = map.get_parent_node(expr.hir_id);
1434 let parent_node = map.get(parent_id);
1438 kind: ExprKind::If(_, _, _),
1444 // Finds the attribute with the given name, if any
1445 pub fn attr_by_name<'a>(attrs: &'a [Attribute], name: &'_ str) -> Option<&'a Attribute> {
1448 .find(|attr| attr.ident().map_or(false, |ident| ident.as_str() == name))
1451 // Finds the `#[must_use]` attribute, if any
1452 pub fn must_use_attr(attrs: &[Attribute]) -> Option<&Attribute> {
1453 attr_by_name(attrs, "must_use")
1456 // Returns whether the type has #[must_use] attribute
1457 pub fn is_must_use_ty<'tcx>(cx: &LateContext<'tcx>, ty: Ty<'tcx>) -> bool {
1459 ty::Adt(ref adt, _) => must_use_attr(&cx.tcx.get_attrs(adt.did)).is_some(),
1460 ty::Foreign(ref did) => must_use_attr(&cx.tcx.get_attrs(*did)).is_some(),
1462 | ty::Array(ref ty, _)
1463 | ty::RawPtr(ty::TypeAndMut { ref ty, .. })
1464 | ty::Ref(_, ref ty, _) => {
1465 // for the Array case we don't need to care for the len == 0 case
1466 // because we don't want to lint functions returning empty arrays
1467 is_must_use_ty(cx, *ty)
1469 ty::Tuple(ref substs) => substs.types().any(|ty| is_must_use_ty(cx, ty)),
1470 ty::Opaque(ref def_id, _) => {
1471 for (predicate, _) in cx.tcx.explicit_item_bounds(*def_id) {
1472 if let ty::PredicateKind::Trait(trait_predicate, _) = predicate.kind().skip_binder() {
1473 if must_use_attr(&cx.tcx.get_attrs(trait_predicate.trait_ref.def_id)).is_some() {
1480 ty::Dynamic(binder, _) => {
1481 for predicate in binder.iter() {
1482 if let ty::ExistentialPredicate::Trait(ref trait_ref) = predicate.skip_binder() {
1483 if must_use_attr(&cx.tcx.get_attrs(trait_ref.def_id)).is_some() {
1494 // check if expr is calling method or function with #[must_use] attribute
1495 pub fn is_must_use_func_call(cx: &LateContext<'_>, expr: &Expr<'_>) -> bool {
1496 let did = match expr.kind {
1497 ExprKind::Call(ref path, _) => if_chain! {
1498 if let ExprKind::Path(ref qpath) = path.kind;
1499 if let def::Res::Def(_, did) = cx.qpath_res(qpath, path.hir_id);
1506 ExprKind::MethodCall(_, _, _, _) => cx.typeck_results().type_dependent_def_id(expr.hir_id),
1510 did.map_or(false, |did| must_use_attr(&cx.tcx.get_attrs(did)).is_some())
1513 pub fn is_no_std_crate(krate: &Crate<'_>) -> bool {
1514 krate.item.attrs.iter().any(|attr| {
1515 if let ast::AttrKind::Normal(ref attr, _) = attr.kind {
1516 attr.path == sym::no_std
1523 /// Check if parent of a hir node is a trait implementation block.
1524 /// For example, `f` in
1526 /// impl Trait for S {
1530 pub fn is_trait_impl_item(cx: &LateContext<'_>, hir_id: HirId) -> bool {
1531 if let Some(Node::Item(item)) = cx.tcx.hir().find(cx.tcx.hir().get_parent_node(hir_id)) {
1532 matches!(item.kind, ItemKind::Impl(hir::Impl { of_trait: Some(_), .. }))
1538 /// Check if it's even possible to satisfy the `where` clause for the item.
1540 /// `trivial_bounds` feature allows functions with unsatisfiable bounds, for example:
1543 /// fn foo() where i32: Iterator {
1544 /// for _ in 2i32 {}
1547 pub fn fn_has_unsatisfiable_preds(cx: &LateContext<'_>, did: DefId) -> bool {
1548 use rustc_trait_selection::traits;
1554 .filter_map(|(p, _)| if p.is_global() { Some(*p) } else { None });
1555 traits::impossible_predicates(
1557 traits::elaborate_predicates(cx.tcx, predicates)
1558 .map(|o| o.predicate)
1559 .collect::<Vec<_>>(),
1563 /// Returns the `DefId` of the callee if the given expression is a function or method call.
1564 pub fn fn_def_id(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<DefId> {
1566 ExprKind::MethodCall(..) => cx.typeck_results().type_dependent_def_id(expr.hir_id),
1569 kind: ExprKind::Path(qpath),
1570 hir_id: path_hir_id,
1574 ) => cx.typeck_results().qpath_res(qpath, *path_hir_id).opt_def_id(),
1579 pub fn run_lints(cx: &LateContext<'_>, lints: &[&'static Lint], id: HirId) -> bool {
1580 lints.iter().any(|lint| {
1582 cx.tcx.lint_level_at_node(lint, id),
1583 (Level::Forbid | Level::Deny | Level::Warn, _)
1588 /// Returns true iff the given type is a primitive (a bool or char, any integer or floating-point
1589 /// number type, a str, or an array, slice, or tuple of those types).
1590 pub fn is_recursively_primitive_type(ty: Ty<'_>) -> bool {
1592 ty::Bool | ty::Char | ty::Int(_) | ty::Uint(_) | ty::Float(_) | ty::Str => true,
1593 ty::Ref(_, inner, _) if *inner.kind() == ty::Str => true,
1594 ty::Array(inner_type, _) | ty::Slice(inner_type) => is_recursively_primitive_type(inner_type),
1595 ty::Tuple(inner_types) => inner_types.types().all(is_recursively_primitive_type),
1600 /// Returns Option<String> where String is a textual representation of the type encapsulated in the
1601 /// slice iff the given expression is a slice of primitives (as defined in the
1602 /// `is_recursively_primitive_type` function) and None otherwise.
1603 pub fn is_slice_of_primitives(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<String> {
1604 let expr_type = cx.typeck_results().expr_ty_adjusted(expr);
1605 let expr_kind = expr_type.kind();
1606 let is_primitive = match expr_kind {
1607 ty::Slice(element_type) => is_recursively_primitive_type(element_type),
1608 ty::Ref(_, inner_ty, _) if matches!(inner_ty.kind(), &ty::Slice(_)) => {
1609 if let ty::Slice(element_type) = inner_ty.kind() {
1610 is_recursively_primitive_type(element_type)
1619 // if we have wrappers like Array, Slice or Tuple, print these
1620 // and get the type enclosed in the slice ref
1621 match expr_type.peel_refs().walk().nth(1).unwrap().expect_ty().kind() {
1622 ty::Slice(..) => return Some("slice".into()),
1623 ty::Array(..) => return Some("array".into()),
1624 ty::Tuple(..) => return Some("tuple".into()),
1626 // is_recursively_primitive_type() should have taken care
1627 // of the rest and we can rely on the type that is found
1628 let refs_peeled = expr_type.peel_refs();
1629 return Some(refs_peeled.walk().last().unwrap().to_string());
1636 /// returns list of all pairs (a, b) from `exprs` such that `eq(a, b)`
1637 /// `hash` must be comformed with `eq`
1638 pub fn search_same<T, Hash, Eq>(exprs: &[T], hash: Hash, eq: Eq) -> Vec<(&T, &T)>
1640 Hash: Fn(&T) -> u64,
1641 Eq: Fn(&T, &T) -> bool,
1643 if exprs.len() == 2 && eq(&exprs[0], &exprs[1]) {
1644 return vec![(&exprs[0], &exprs[1])];
1647 let mut match_expr_list: Vec<(&T, &T)> = Vec::new();
1649 let mut map: FxHashMap<_, Vec<&_>> =
1650 FxHashMap::with_capacity_and_hasher(exprs.len(), BuildHasherDefault::default());
1653 match map.entry(hash(expr)) {
1654 Entry::Occupied(mut o) => {
1657 match_expr_list.push((o, expr));
1660 o.get_mut().push(expr);
1662 Entry::Vacant(v) => {
1663 v.insert(vec![expr]);
1671 /// Peels off all references on the pattern. Returns the underlying pattern and the number of
1672 /// references removed.
1673 pub fn peel_hir_pat_refs(pat: &'a Pat<'a>) -> (&'a Pat<'a>, usize) {
1674 fn peel(pat: &'a Pat<'a>, count: usize) -> (&'a Pat<'a>, usize) {
1675 if let PatKind::Ref(pat, _) = pat.kind {
1676 peel(pat, count + 1)
1684 /// Peels off up to the given number of references on the expression. Returns the underlying
1685 /// expression and the number of references removed.
1686 pub fn peel_n_hir_expr_refs(expr: &'a Expr<'a>, count: usize) -> (&'a Expr<'a>, usize) {
1687 fn f(expr: &'a Expr<'a>, count: usize, target: usize) -> (&'a Expr<'a>, usize) {
1689 ExprKind::AddrOf(_, _, expr) if count != target => f(expr, count + 1, target),
1696 /// Peels off all references on the expression. Returns the underlying expression and the number of
1697 /// references removed.
1698 pub fn peel_hir_expr_refs(expr: &'a Expr<'a>) -> (&'a Expr<'a>, usize) {
1699 fn f(expr: &'a Expr<'a>, count: usize) -> (&'a Expr<'a>, usize) {
1701 ExprKind::AddrOf(BorrowKind::Ref, _, expr) => f(expr, count + 1),
1708 /// Peels off all references on the type. Returns the underlying type and the number of references
1710 pub fn peel_mid_ty_refs(ty: Ty<'_>) -> (Ty<'_>, usize) {
1711 fn peel(ty: Ty<'_>, count: usize) -> (Ty<'_>, usize) {
1712 if let ty::Ref(_, ty, _) = ty.kind() {
1721 /// Peels off all references on the type.Returns the underlying type, the number of references
1722 /// removed, and whether the pointer is ultimately mutable or not.
1723 pub fn peel_mid_ty_refs_is_mutable(ty: Ty<'_>) -> (Ty<'_>, usize, Mutability) {
1724 fn f(ty: Ty<'_>, count: usize, mutability: Mutability) -> (Ty<'_>, usize, Mutability) {
1726 ty::Ref(_, ty, Mutability::Mut) => f(ty, count + 1, mutability),
1727 ty::Ref(_, ty, Mutability::Not) => f(ty, count + 1, Mutability::Not),
1728 _ => (ty, count, mutability),
1731 f(ty, 0, Mutability::Mut)
1735 macro_rules! unwrap_cargo_metadata {
1736 ($cx: ident, $lint: ident, $deps: expr) => {{
1737 let mut command = cargo_metadata::MetadataCommand::new();
1742 match command.exec() {
1743 Ok(metadata) => metadata,
1745 span_lint($cx, $lint, DUMMY_SP, &format!("could not read cargo metadata: {}", err));
1752 pub fn is_hir_ty_cfg_dependant(cx: &LateContext<'_>, ty: &hir::Ty<'_>) -> bool {
1754 if let TyKind::Path(QPath::Resolved(_, path)) = ty.kind;
1755 if let Res::Def(_, def_id) = path.res;
1757 cx.tcx.has_attr(def_id, sym::cfg) || cx.tcx.has_attr(def_id, sym::cfg_attr)
1764 /// Check if the resolution of a given path is an `Ok` variant of `Result`.
1765 pub fn is_ok_ctor(cx: &LateContext<'_>, res: Res) -> bool {
1766 if let Some(ok_id) = cx.tcx.lang_items().result_ok_variant() {
1767 if let Res::Def(DefKind::Ctor(CtorOf::Variant, CtorKind::Fn), id) = res {
1768 if let Some(variant_id) = cx.tcx.parent(id) {
1769 return variant_id == ok_id;
1776 /// Check if the resolution of a given path is a `Some` variant of `Option`.
1777 pub fn is_some_ctor(cx: &LateContext<'_>, res: Res) -> bool {
1778 if let Some(some_id) = cx.tcx.lang_items().option_some_variant() {
1779 if let Res::Def(DefKind::Ctor(CtorOf::Variant, CtorKind::Fn), id) = res {
1780 if let Some(variant_id) = cx.tcx.parent(id) {
1781 return variant_id == some_id;
1790 use super::{reindent_multiline, without_block_comments};
1793 fn test_reindent_multiline_single_line() {
1794 assert_eq!("", reindent_multiline("".into(), false, None));
1795 assert_eq!("...", reindent_multiline("...".into(), false, None));
1796 assert_eq!("...", reindent_multiline(" ...".into(), false, None));
1797 assert_eq!("...", reindent_multiline("\t...".into(), false, None));
1798 assert_eq!("...", reindent_multiline("\t\t...".into(), false, None));
1803 fn test_reindent_multiline_block() {
1809 }", reindent_multiline(" if x {
1813 }".into(), false, None));
1819 }", reindent_multiline(" if x {
1823 }".into(), false, None));
1828 fn test_reindent_multiline_empty_line() {
1835 }", reindent_multiline(" if x {
1840 }".into(), false, None));
1845 fn test_reindent_multiline_lines_deeper() {
1851 }", reindent_multiline("\
1856 }".into(), true, Some(8)));
1860 fn test_without_block_comments_lines_without_block_comments() {
1861 let result = without_block_comments(vec!["/*", "", "*/"]);
1862 println!("result: {:?}", result);
1863 assert!(result.is_empty());
1865 let result = without_block_comments(vec!["", "/*", "", "*/", "#[crate_type = \"lib\"]", "/*", "", "*/", ""]);
1866 assert_eq!(result, vec!["", "#[crate_type = \"lib\"]", ""]);
1868 let result = without_block_comments(vec!["/* rust", "", "*/"]);
1869 assert!(result.is_empty());
1871 let result = without_block_comments(vec!["/* one-line comment */"]);
1872 assert!(result.is_empty());
1874 let result = without_block_comments(vec!["/* nested", "/* multi-line", "comment", "*/", "test", "*/"]);
1875 assert!(result.is_empty());
1877 let result = without_block_comments(vec!["/* nested /* inline /* comment */ test */ */"]);
1878 assert!(result.is_empty());
1880 let result = without_block_comments(vec!["foo", "bar", "baz"]);
1881 assert_eq!(result, vec!["foo", "bar", "baz"]);