1 #![feature(box_patterns)]
2 #![feature(in_band_lifetimes)]
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_attr;
13 extern crate rustc_data_structures;
14 extern crate rustc_errors;
15 extern crate rustc_hir;
16 extern crate rustc_hir_pretty;
17 extern crate rustc_infer;
18 extern crate rustc_lexer;
19 extern crate rustc_lint;
20 extern crate rustc_middle;
21 extern crate rustc_mir;
22 extern crate rustc_session;
23 extern crate rustc_span;
24 extern crate rustc_target;
25 extern crate rustc_trait_selection;
26 extern crate rustc_typeck;
31 #[allow(clippy::module_name_repetitions)]
38 pub mod eager_or_lazy;
41 pub mod numeric_literal;
44 pub mod qualify_min_const_fn;
51 pub use self::attrs::*;
52 pub use self::hir_utils::{both, count_eq, eq_expr_value, over, SpanlessEq, SpanlessHash};
54 use std::collections::hash_map::Entry;
55 use std::hash::BuildHasherDefault;
57 use if_chain::if_chain;
58 use rustc_ast::ast::{self, Attribute, BorrowKind, LitKind};
59 use rustc_data_structures::fx::FxHashMap;
61 use rustc_hir::def::{DefKind, Res};
62 use rustc_hir::def_id::{DefId, LOCAL_CRATE};
63 use rustc_hir::intravisit::{self, NestedVisitorMap, Visitor};
64 use rustc_hir::LangItem::{ResultErr, ResultOk};
66 def, Arm, BindingAnnotation, Block, Body, Constness, Expr, ExprKind, FnDecl, GenericArgs, HirId, Impl, ImplItem,
67 ImplItemKind, Item, ItemKind, LangItem, MatchSource, Node, Param, Pat, PatKind, Path, PathSegment, QPath,
68 TraitItem, TraitItemKind, TraitRef, TyKind,
70 use rustc_lint::{LateContext, Level, Lint, LintContext};
71 use rustc_middle::hir::exports::Export;
72 use rustc_middle::hir::map::Map;
73 use rustc_middle::ty as rustc_ty;
74 use rustc_middle::ty::{layout::IntegerExt, DefIdTree, Ty, TyCtxt, TypeFoldable};
75 use rustc_semver::RustcVersion;
76 use rustc_session::Session;
77 use rustc_span::hygiene::{ExpnKind, MacroKind};
78 use rustc_span::source_map::original_sp;
80 use rustc_span::symbol::{kw, Symbol};
81 use rustc_span::{Span, DUMMY_SP};
82 use rustc_target::abi::Integer;
84 use crate::consts::{constant, Constant};
85 use crate::ty::is_recursively_primitive_type;
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 /// If the given expression is a local binding, find the initializer expression.
139 /// If that initializer expression is another local binding, find its initializer again.
140 /// This process repeats as long as possible (but usually no more than once). Initializer
141 /// expressions with adjustments are ignored. If this is not desired, use [`find_binding_init`]
154 /// let def = abc + 2;
155 /// // ^^^^^^^ output
159 pub fn expr_or_init<'a, 'b, 'tcx: 'b>(cx: &LateContext<'tcx>, mut expr: &'a Expr<'b>) -> &'a Expr<'b> {
160 while let Some(init) = path_to_local(expr)
161 .and_then(|id| find_binding_init(cx, id))
162 .filter(|init| cx.typeck_results().expr_adjustments(init).is_empty())
169 /// Finds the initializer expression for a local binding. Returns `None` if the binding is mutable.
170 /// By only considering immutable bindings, we guarantee that the returned expression represents the
171 /// value of the binding wherever it is referenced.
173 /// Example: For `let x = 1`, if the `HirId` of `x` is provided, the `Expr` `1` is returned.
174 /// Note: If you have an expression that references a binding `x`, use `path_to_local` to get the
175 /// canonical binding `HirId`.
176 pub fn find_binding_init<'tcx>(cx: &LateContext<'tcx>, hir_id: HirId) -> Option<&'tcx Expr<'tcx>> {
177 let hir = cx.tcx.hir();
179 if let Some(Node::Binding(pat)) = hir.find(hir_id);
180 if matches!(pat.kind, PatKind::Binding(BindingAnnotation::Unannotated, ..));
181 let parent = hir.get_parent_node(hir_id);
182 if let Some(Node::Local(local)) = hir.find(parent);
190 /// Returns `true` if the given `NodeId` is inside a constant context
195 /// if in_constant(cx, expr.hir_id) {
199 pub fn in_constant(cx: &LateContext<'_>, id: HirId) -> bool {
200 let parent_id = cx.tcx.hir().get_parent_item(id);
201 match cx.tcx.hir().get(parent_id) {
203 kind: ItemKind::Const(..) | ItemKind::Static(..),
206 | Node::TraitItem(&TraitItem {
207 kind: TraitItemKind::Const(..),
210 | Node::ImplItem(&ImplItem {
211 kind: ImplItemKind::Const(..),
214 | Node::AnonConst(_) => true,
216 kind: ItemKind::Fn(ref sig, ..),
219 | Node::ImplItem(&ImplItem {
220 kind: ImplItemKind::Fn(ref sig, _),
222 }) => sig.header.constness == Constness::Const,
227 /// Checks if a `QPath` resolves to a constructor of a `LangItem`.
228 /// For example, use this to check whether a function call or a pattern is `Some(..)`.
229 pub fn is_lang_ctor(cx: &LateContext<'_>, qpath: &QPath<'_>, lang_item: LangItem) -> bool {
230 if let QPath::Resolved(_, path) = qpath {
231 if let Res::Def(DefKind::Ctor(..), ctor_id) = path.res {
232 if let Ok(item_id) = cx.tcx.lang_items().require(lang_item) {
233 return cx.tcx.parent(ctor_id) == Some(item_id);
240 /// Returns `true` if this `span` was expanded by any macro.
242 pub fn in_macro(span: Span) -> bool {
243 if span.from_expansion() {
244 !matches!(span.ctxt().outer_expn_data().kind, ExpnKind::Desugaring(..))
250 /// Checks if given pattern is a wildcard (`_`)
251 pub fn is_wild<'tcx>(pat: &impl std::ops::Deref<Target = Pat<'tcx>>) -> bool {
252 matches!(pat.kind, PatKind::Wild)
255 /// Checks if the first type parameter is a lang item.
256 pub fn is_ty_param_lang_item(cx: &LateContext<'_>, qpath: &QPath<'tcx>, item: LangItem) -> Option<&'tcx hir::Ty<'tcx>> {
257 let ty = get_qpath_generic_tys(qpath).next()?;
259 if let TyKind::Path(qpath) = &ty.kind {
260 cx.qpath_res(qpath, ty.hir_id)
262 .map_or(false, |id| {
263 cx.tcx.lang_items().require(item).map_or(false, |lang_id| id == lang_id)
271 /// Checks if the first type parameter is a diagnostic item.
272 pub fn is_ty_param_diagnostic_item(
273 cx: &LateContext<'_>,
276 ) -> Option<&'tcx hir::Ty<'tcx>> {
277 let ty = get_qpath_generic_tys(qpath).next()?;
279 if let TyKind::Path(qpath) = &ty.kind {
280 cx.qpath_res(qpath, ty.hir_id)
282 .map_or(false, |id| cx.tcx.is_diagnostic_item(item, id))
289 /// Checks if the method call given in `expr` belongs to the given trait.
290 /// This is a deprecated function, consider using [`is_trait_method`].
291 pub fn match_trait_method(cx: &LateContext<'_>, expr: &Expr<'_>, path: &[&str]) -> bool {
292 let def_id = cx.typeck_results().type_dependent_def_id(expr.hir_id).unwrap();
293 let trt_id = cx.tcx.trait_of_item(def_id);
294 trt_id.map_or(false, |trt_id| match_def_path(cx, trt_id, path))
297 /// Checks if a method is defined in an impl of a diagnostic item
298 pub fn is_diag_item_method(cx: &LateContext<'_>, def_id: DefId, diag_item: Symbol) -> bool {
299 if let Some(impl_did) = cx.tcx.impl_of_method(def_id) {
300 if let Some(adt) = cx.tcx.type_of(impl_did).ty_adt_def() {
301 return cx.tcx.is_diagnostic_item(diag_item, adt.did);
307 /// Checks if a method is in a diagnostic item trait
308 pub fn is_diag_trait_item(cx: &LateContext<'_>, def_id: DefId, diag_item: Symbol) -> bool {
309 if let Some(trait_did) = cx.tcx.trait_of_item(def_id) {
310 return cx.tcx.is_diagnostic_item(diag_item, trait_did);
315 /// Checks if the method call given in `expr` belongs to the given trait.
316 pub fn is_trait_method(cx: &LateContext<'_>, expr: &Expr<'_>, diag_item: Symbol) -> bool {
318 .type_dependent_def_id(expr.hir_id)
319 .map_or(false, |did| is_diag_trait_item(cx, did, diag_item))
322 /// Checks if an expression references a variable of the given name.
323 pub fn match_var(expr: &Expr<'_>, var: Symbol) -> bool {
324 if let ExprKind::Path(QPath::Resolved(None, ref path)) = expr.kind {
325 if let [p] = path.segments {
326 return p.ident.name == var;
332 pub fn last_path_segment<'tcx>(path: &QPath<'tcx>) -> &'tcx PathSegment<'tcx> {
334 QPath::Resolved(_, ref path) => path.segments.last().expect("A path must have at least one segment"),
335 QPath::TypeRelative(_, ref seg) => seg,
336 QPath::LangItem(..) => panic!("last_path_segment: lang item has no path segments"),
340 pub fn get_qpath_generics(path: &QPath<'tcx>) -> Option<&'tcx GenericArgs<'tcx>> {
342 QPath::Resolved(_, p) => p.segments.last().and_then(|s| s.args),
343 QPath::TypeRelative(_, s) => s.args,
344 QPath::LangItem(..) => None,
348 pub fn get_qpath_generic_tys(path: &QPath<'tcx>) -> impl Iterator<Item = &'tcx hir::Ty<'tcx>> {
349 get_qpath_generics(path)
350 .map_or([].as_ref(), |a| a.args)
353 if let hir::GenericArg::Type(ty) = a {
361 pub fn single_segment_path<'tcx>(path: &QPath<'tcx>) -> Option<&'tcx PathSegment<'tcx>> {
363 QPath::Resolved(_, ref path) => path.segments.get(0),
364 QPath::TypeRelative(_, ref seg) => Some(seg),
365 QPath::LangItem(..) => None,
369 /// THIS METHOD IS DEPRECATED and will eventually be removed since it does not match against the
370 /// entire path or resolved `DefId`. Prefer using `match_def_path`. Consider getting a `DefId` from
371 /// `QPath::Resolved.1.res.opt_def_id()`.
373 /// Matches a `QPath` against a slice of segment string literals.
375 /// There is also `match_path` if you are dealing with a `rustc_hir::Path` instead of a
376 /// `rustc_hir::QPath`.
380 /// match_qpath(path, &["std", "rt", "begin_unwind"])
382 pub fn match_qpath(path: &QPath<'_>, segments: &[&str]) -> bool {
384 QPath::Resolved(_, ref path) => match_path(path, segments),
385 QPath::TypeRelative(ref ty, ref segment) => match ty.kind {
386 TyKind::Path(ref inner_path) => {
387 if let [prefix @ .., end] = segments {
388 if match_qpath(inner_path, prefix) {
389 return segment.ident.name.as_str() == *end;
396 QPath::LangItem(..) => false,
400 /// If the expression is a path, resolve it. Otherwise, return `Res::Err`.
401 pub fn expr_path_res(cx: &LateContext<'_>, expr: &Expr<'_>) -> Res {
402 if let ExprKind::Path(p) = &expr.kind {
403 cx.qpath_res(p, expr.hir_id)
409 /// Resolves the path to a `DefId` and checks if it matches the given path.
410 pub fn is_qpath_def_path(cx: &LateContext<'_>, path: &QPath<'_>, hir_id: HirId, segments: &[&str]) -> bool {
411 cx.qpath_res(path, hir_id)
413 .map_or(false, |id| match_def_path(cx, id, segments))
416 /// If the expression is a path, resolves it to a `DefId` and checks if it matches the given path.
417 pub fn is_expr_path_def_path(cx: &LateContext<'_>, expr: &Expr<'_>, segments: &[&str]) -> bool {
418 expr_path_res(cx, expr)
420 .map_or(false, |id| match_def_path(cx, id, segments))
423 /// THIS METHOD IS DEPRECATED and will eventually be removed since it does not match against the
424 /// entire path or resolved `DefId`. Prefer using `match_def_path`. Consider getting a `DefId` from
425 /// `QPath::Resolved.1.res.opt_def_id()`.
427 /// Matches a `Path` against a slice of segment string literals.
429 /// There is also `match_qpath` if you are dealing with a `rustc_hir::QPath` instead of a
430 /// `rustc_hir::Path`.
435 /// if match_path(&trait_ref.path, &paths::HASH) {
436 /// // This is the `std::hash::Hash` trait.
439 /// if match_path(ty_path, &["rustc", "lint", "Lint"]) {
440 /// // This is a `rustc_middle::lint::Lint`.
443 pub fn match_path(path: &Path<'_>, segments: &[&str]) -> bool {
447 .zip(segments.iter().rev())
448 .all(|(a, b)| a.ident.name.as_str() == *b)
451 /// If the expression is a path to a local, returns the canonical `HirId` of the local.
452 pub fn path_to_local(expr: &Expr<'_>) -> Option<HirId> {
453 if let ExprKind::Path(QPath::Resolved(None, ref path)) = expr.kind {
454 if let Res::Local(id) = path.res {
461 /// Returns true if the expression is a path to a local with the specified `HirId`.
462 /// Use this function to see if an expression matches a function argument or a match binding.
463 pub fn path_to_local_id(expr: &Expr<'_>, id: HirId) -> bool {
464 path_to_local(expr) == Some(id)
467 /// Gets the definition associated to a path.
468 #[allow(clippy::shadow_unrelated)] // false positive #6563
469 pub fn path_to_res(cx: &LateContext<'_>, path: &[&str]) -> Res {
470 macro_rules! try_res {
474 None => return Res::Err,
478 fn item_child_by_name<'tcx>(tcx: TyCtxt<'tcx>, def_id: DefId, name: &str) -> Option<&'tcx Export<HirId>> {
479 tcx.item_children(def_id)
481 .find(|item| item.ident.name.as_str() == name)
484 let (krate, first, path) = match *path {
485 [krate, first, ref path @ ..] => (krate, first, path),
486 _ => return Res::Err,
489 let crates = tcx.crates();
490 let krate = try_res!(crates.iter().find(|&&num| tcx.crate_name(num).as_str() == krate));
491 let first = try_res!(item_child_by_name(tcx, krate.as_def_id(), first));
495 // `get_def_path` seems to generate these empty segments for extern blocks.
496 // We can just ignore them.
497 .filter(|segment| !segment.is_empty())
498 // for each segment, find the child item
499 .try_fold(first, |item, segment| {
500 let def_id = item.res.def_id();
501 if let Some(item) = item_child_by_name(tcx, def_id, segment) {
503 } else if matches!(item.res, Res::Def(DefKind::Enum | DefKind::Struct, _)) {
504 // it is not a child item so check inherent impl items
505 tcx.inherent_impls(def_id)
507 .find_map(|&impl_def_id| item_child_by_name(tcx, impl_def_id, segment))
515 /// Convenience function to get the `DefId` of a trait by path.
516 /// It could be a trait or trait alias.
517 pub fn get_trait_def_id(cx: &LateContext<'_>, path: &[&str]) -> Option<DefId> {
518 match path_to_res(cx, path) {
519 Res::Def(DefKind::Trait | DefKind::TraitAlias, trait_id) => Some(trait_id),
524 /// Gets the `hir::TraitRef` of the trait the given method is implemented for.
526 /// Use this if you want to find the `TraitRef` of the `Add` trait in this example:
529 /// struct Point(isize, isize);
531 /// impl std::ops::Add for Point {
532 /// type Output = Self;
534 /// fn add(self, other: Self) -> Self {
539 pub fn trait_ref_of_method<'tcx>(cx: &LateContext<'tcx>, hir_id: HirId) -> Option<&'tcx TraitRef<'tcx>> {
540 // Get the implemented trait for the current function
541 let parent_impl = cx.tcx.hir().get_parent_item(hir_id);
543 if parent_impl != hir::CRATE_HIR_ID;
544 if let hir::Node::Item(item) = cx.tcx.hir().get(parent_impl);
545 if let hir::ItemKind::Impl(impl_) = &item.kind;
546 then { return impl_.of_trait.as_ref(); }
551 /// Returns the method names and argument list of nested method call expressions that make up
552 /// `expr`. method/span lists are sorted with the most recent call first.
553 pub fn method_calls<'tcx>(
554 expr: &'tcx Expr<'tcx>,
556 ) -> (Vec<Symbol>, Vec<&'tcx [Expr<'tcx>]>, Vec<Span>) {
557 let mut method_names = Vec::with_capacity(max_depth);
558 let mut arg_lists = Vec::with_capacity(max_depth);
559 let mut spans = Vec::with_capacity(max_depth);
561 let mut current = expr;
562 for _ in 0..max_depth {
563 if let ExprKind::MethodCall(path, span, args, _) = ¤t.kind {
564 if args.iter().any(|e| e.span.from_expansion()) {
567 method_names.push(path.ident.name);
568 arg_lists.push(&**args);
576 (method_names, arg_lists, spans)
579 /// Matches an `Expr` against a chain of methods, and return the matched `Expr`s.
581 /// For example, if `expr` represents the `.baz()` in `foo.bar().baz()`,
582 /// `method_chain_args(expr, &["bar", "baz"])` will return a `Vec`
583 /// containing the `Expr`s for
584 /// `.bar()` and `.baz()`
585 pub fn method_chain_args<'a>(expr: &'a Expr<'_>, methods: &[&str]) -> Option<Vec<&'a [Expr<'a>]>> {
586 let mut current = expr;
587 let mut matched = Vec::with_capacity(methods.len());
588 for method_name in methods.iter().rev() {
589 // method chains are stored last -> first
590 if let ExprKind::MethodCall(ref path, _, ref args, _) = current.kind {
591 if path.ident.name.as_str() == *method_name {
592 if args.iter().any(|e| e.span.from_expansion()) {
595 matched.push(&**args); // build up `matched` backwards
596 current = &args[0] // go to parent expression
604 // Reverse `matched` so that it is in the same order as `methods`.
609 /// Returns `true` if the provided `def_id` is an entrypoint to a program.
610 pub fn is_entrypoint_fn(cx: &LateContext<'_>, def_id: DefId) -> bool {
612 .entry_fn(LOCAL_CRATE)
613 .map_or(false, |(entry_fn_def_id, _)| def_id == entry_fn_def_id.to_def_id())
616 /// Returns `true` if the expression is in the program's `#[panic_handler]`.
617 pub fn is_in_panic_handler(cx: &LateContext<'_>, e: &Expr<'_>) -> bool {
618 let parent = cx.tcx.hir().get_parent_item(e.hir_id);
619 let def_id = cx.tcx.hir().local_def_id(parent).to_def_id();
620 Some(def_id) == cx.tcx.lang_items().panic_impl()
623 /// Gets the name of the item the expression is in, if available.
624 pub fn get_item_name(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<Symbol> {
625 let parent_id = cx.tcx.hir().get_parent_item(expr.hir_id);
626 match cx.tcx.hir().find(parent_id) {
628 Node::Item(Item { ident, .. })
629 | Node::TraitItem(TraitItem { ident, .. })
630 | Node::ImplItem(ImplItem { ident, .. }),
631 ) => Some(ident.name),
636 /// Gets the name of a `Pat`, if any.
637 pub fn get_pat_name(pat: &Pat<'_>) -> Option<Symbol> {
639 PatKind::Binding(.., ref spname, _) => Some(spname.name),
640 PatKind::Path(ref qpath) => single_segment_path(qpath).map(|ps| ps.ident.name),
641 PatKind::Box(ref p) | PatKind::Ref(ref p, _) => get_pat_name(&*p),
646 pub struct ContainsName {
651 impl<'tcx> Visitor<'tcx> for ContainsName {
652 type Map = Map<'tcx>;
654 fn visit_name(&mut self, _: Span, name: Symbol) {
655 if self.name == name {
659 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
660 NestedVisitorMap::None
664 /// Checks if an `Expr` contains a certain name.
665 pub fn contains_name(name: Symbol, expr: &Expr<'_>) -> bool {
666 let mut cn = ContainsName { name, result: false };
671 /// Returns `true` if `expr` contains a return expression
672 pub fn contains_return(expr: &hir::Expr<'_>) -> bool {
673 struct RetCallFinder {
677 impl<'tcx> hir::intravisit::Visitor<'tcx> for RetCallFinder {
678 type Map = Map<'tcx>;
680 fn visit_expr(&mut self, expr: &'tcx hir::Expr<'_>) {
684 if let hir::ExprKind::Ret(..) = &expr.kind {
687 hir::intravisit::walk_expr(self, expr);
691 fn nested_visit_map(&mut self) -> hir::intravisit::NestedVisitorMap<Self::Map> {
692 hir::intravisit::NestedVisitorMap::None
696 let mut visitor = RetCallFinder { found: false };
697 visitor.visit_expr(expr);
701 struct FindMacroCalls<'a, 'b> {
702 names: &'a [&'b str],
706 impl<'a, 'b, 'tcx> Visitor<'tcx> for FindMacroCalls<'a, 'b> {
707 type Map = Map<'tcx>;
709 fn visit_expr(&mut self, expr: &'tcx Expr<'_>) {
710 if self.names.iter().any(|fun| is_expn_of(expr.span, fun).is_some()) {
711 self.result.push(expr.span);
713 // and check sub-expressions
714 intravisit::walk_expr(self, expr);
717 fn nested_visit_map(&mut self) -> NestedVisitorMap<Self::Map> {
718 NestedVisitorMap::None
722 /// Finds calls of the specified macros in a function body.
723 pub fn find_macro_calls(names: &[&str], body: &Body<'_>) -> Vec<Span> {
724 let mut fmc = FindMacroCalls {
728 fmc.visit_expr(&body.value);
732 /// Extends the span to the beginning of the spans line, incl. whitespaces.
737 /// // will be converted to
739 /// // ^^^^^^^^^^^^^^
741 fn line_span<T: LintContext>(cx: &T, span: Span) -> Span {
742 let span = original_sp(span, DUMMY_SP);
743 let source_map_and_line = cx.sess().source_map().lookup_line(span.lo()).unwrap();
744 let line_no = source_map_and_line.line;
745 let line_start = source_map_and_line.sf.lines[line_no];
746 Span::new(line_start, span.hi(), span.ctxt())
749 /// Gets the parent node, if any.
750 pub fn get_parent_node(tcx: TyCtxt<'_>, id: HirId) -> Option<Node<'_>> {
751 tcx.hir().parent_iter(id).next().map(|(_, node)| node)
754 /// Gets the parent expression, if any –- this is useful to constrain a lint.
755 pub fn get_parent_expr<'tcx>(cx: &LateContext<'tcx>, e: &Expr<'_>) -> Option<&'tcx Expr<'tcx>> {
756 match get_parent_node(cx.tcx, e.hir_id) {
757 Some(Node::Expr(parent)) => Some(parent),
762 pub fn get_enclosing_block<'tcx>(cx: &LateContext<'tcx>, hir_id: HirId) -> Option<&'tcx Block<'tcx>> {
763 let map = &cx.tcx.hir();
764 let enclosing_node = map
765 .get_enclosing_scope(hir_id)
766 .and_then(|enclosing_id| map.find(enclosing_id));
767 enclosing_node.and_then(|node| match node {
768 Node::Block(block) => Some(block),
770 kind: ItemKind::Fn(_, _, eid),
773 | Node::ImplItem(&ImplItem {
774 kind: ImplItemKind::Fn(_, eid),
776 }) => match cx.tcx.hir().body(eid).value.kind {
777 ExprKind::Block(ref block, _) => Some(block),
784 /// Gets the parent node if it's an impl block.
785 pub fn get_parent_as_impl(tcx: TyCtxt<'_>, id: HirId) -> Option<&Impl<'_>> {
787 match map.parent_iter(id).next() {
791 kind: ItemKind::Impl(imp),
799 /// Checks if the given expression is the else clause of either an `if` or `if let` expression.
800 pub fn is_else_clause(tcx: TyCtxt<'_>, expr: &Expr<'_>) -> bool {
802 let mut iter = map.parent_iter(expr.hir_id);
804 Some((arm_id, Node::Arm(..))) => matches!(
809 kind: ExprKind::Match(_, [_, else_arm], MatchSource::IfLetDesugar { .. }),
813 if else_arm.hir_id == arm_id
818 kind: ExprKind::If(_, _, Some(else_expr)),
821 )) => else_expr.hir_id == expr.hir_id,
826 /// Checks whether the given expression is a constant integer of the given value.
827 /// unlike `is_integer_literal`, this version does const folding
828 pub fn is_integer_const(cx: &LateContext<'_>, e: &Expr<'_>, value: u128) -> bool {
829 if is_integer_literal(e, value) {
832 let map = cx.tcx.hir();
833 let parent_item = map.get_parent_item(e.hir_id);
834 if let Some((Constant::Int(v), _)) = map
835 .maybe_body_owned_by(parent_item)
836 .and_then(|body_id| constant(cx, cx.tcx.typeck_body(body_id), e))
844 /// Checks whether the given expression is a constant literal of the given value.
845 pub fn is_integer_literal(expr: &Expr<'_>, value: u128) -> bool {
846 // FIXME: use constant folding
847 if let ExprKind::Lit(ref spanned) = expr.kind {
848 if let LitKind::Int(v, _) = spanned.node {
855 /// Returns `true` if the given `Expr` has been coerced before.
857 /// Examples of coercions can be found in the Nomicon at
858 /// <https://doc.rust-lang.org/nomicon/coercions.html>.
860 /// See `rustc_middle::ty::adjustment::Adjustment` and `rustc_typeck::check::coercion` for more
861 /// information on adjustments and coercions.
862 pub fn is_adjusted(cx: &LateContext<'_>, e: &Expr<'_>) -> bool {
863 cx.typeck_results().adjustments().get(e.hir_id).is_some()
866 /// Returns the pre-expansion span if is this comes from an expansion of the
868 /// See also `is_direct_expn_of`.
870 pub fn is_expn_of(mut span: Span, name: &str) -> Option<Span> {
872 if span.from_expansion() {
873 let data = span.ctxt().outer_expn_data();
874 let new_span = data.call_site;
876 if let ExpnKind::Macro(MacroKind::Bang, mac_name) = data.kind {
877 if mac_name.as_str() == name {
878 return Some(new_span);
889 /// Returns the pre-expansion span if the span directly comes from an expansion
890 /// of the macro `name`.
891 /// The difference with `is_expn_of` is that in
895 /// `42` is considered expanded from `foo!` and `bar!` by `is_expn_of` but only
897 /// `is_direct_expn_of`.
899 pub fn is_direct_expn_of(span: Span, name: &str) -> Option<Span> {
900 if span.from_expansion() {
901 let data = span.ctxt().outer_expn_data();
902 let new_span = data.call_site;
904 if let ExpnKind::Macro(MacroKind::Bang, mac_name) = data.kind {
905 if mac_name.as_str() == name {
906 return Some(new_span);
914 /// Convenience function to get the return type of a function.
915 pub fn return_ty<'tcx>(cx: &LateContext<'tcx>, fn_item: hir::HirId) -> Ty<'tcx> {
916 let fn_def_id = cx.tcx.hir().local_def_id(fn_item);
917 let ret_ty = cx.tcx.fn_sig(fn_def_id).output();
918 cx.tcx.erase_late_bound_regions(ret_ty)
921 /// Checks if an expression is constructing a tuple-like enum variant or struct
922 pub fn is_ctor_or_promotable_const_function(cx: &LateContext<'_>, expr: &Expr<'_>) -> bool {
923 if let ExprKind::Call(ref fun, _) = expr.kind {
924 if let ExprKind::Path(ref qp) = fun.kind {
925 let res = cx.qpath_res(qp, fun.hir_id);
927 def::Res::Def(DefKind::Variant | DefKind::Ctor(..), ..) => true,
928 def::Res::Def(_, def_id) => cx.tcx.is_promotable_const_fn(def_id),
936 /// Returns `true` if a pattern is refutable.
937 // TODO: should be implemented using rustc/mir_build/thir machinery
938 pub fn is_refutable(cx: &LateContext<'_>, pat: &Pat<'_>) -> bool {
939 fn is_enum_variant(cx: &LateContext<'_>, qpath: &QPath<'_>, id: HirId) -> bool {
941 cx.qpath_res(qpath, id),
942 def::Res::Def(DefKind::Variant, ..) | Res::Def(DefKind::Ctor(def::CtorOf::Variant, _), _)
946 fn are_refutable<'a, I: Iterator<Item = &'a Pat<'a>>>(cx: &LateContext<'_>, mut i: I) -> bool {
947 i.any(|pat| is_refutable(cx, pat))
951 PatKind::Wild => false,
952 PatKind::Binding(_, _, _, pat) => pat.map_or(false, |pat| is_refutable(cx, pat)),
953 PatKind::Box(ref pat) | PatKind::Ref(ref pat, _) => is_refutable(cx, pat),
954 PatKind::Lit(..) | PatKind::Range(..) => true,
955 PatKind::Path(ref qpath) => is_enum_variant(cx, qpath, pat.hir_id),
956 PatKind::Or(ref pats) => {
957 // TODO: should be the honest check, that pats is exhaustive set
958 are_refutable(cx, pats.iter().map(|pat| &**pat))
960 PatKind::Tuple(ref pats, _) => are_refutable(cx, pats.iter().map(|pat| &**pat)),
961 PatKind::Struct(ref qpath, ref fields, _) => {
962 is_enum_variant(cx, qpath, pat.hir_id) || are_refutable(cx, fields.iter().map(|field| &*field.pat))
964 PatKind::TupleStruct(ref qpath, ref pats, _) => {
965 is_enum_variant(cx, qpath, pat.hir_id) || are_refutable(cx, pats.iter().map(|pat| &**pat))
967 PatKind::Slice(ref head, ref middle, ref tail) => {
968 match &cx.typeck_results().node_type(pat.hir_id).kind() {
969 rustc_ty::Slice(..) => {
970 // [..] is the only irrefutable slice pattern.
971 !head.is_empty() || middle.is_none() || !tail.is_empty()
973 rustc_ty::Array(..) => {
974 are_refutable(cx, head.iter().chain(middle).chain(tail.iter()).map(|pat| &**pat))
985 /// If the pattern is an `or` pattern, call the function once for each sub pattern. Otherwise, call
986 /// the function once on the given pattern.
987 pub fn recurse_or_patterns<'tcx, F: FnMut(&'tcx Pat<'tcx>)>(pat: &'tcx Pat<'tcx>, mut f: F) {
988 if let PatKind::Or(pats) = pat.kind {
989 pats.iter().cloned().for_each(f)
995 /// Checks for the `#[automatically_derived]` attribute all `#[derive]`d
996 /// implementations have.
997 pub fn is_automatically_derived(attrs: &[ast::Attribute]) -> bool {
998 attrs.iter().any(|attr| attr.has_name(sym::automatically_derived))
1001 /// Remove blocks around an expression.
1003 /// Ie. `x`, `{ x }` and `{{{{ x }}}}` all give `x`. `{ x; y }` and `{}` return
1005 pub fn remove_blocks<'tcx>(mut expr: &'tcx Expr<'tcx>) -> &'tcx Expr<'tcx> {
1006 while let ExprKind::Block(ref block, ..) = expr.kind {
1007 match (block.stmts.is_empty(), block.expr.as_ref()) {
1008 (true, Some(e)) => expr = e,
1015 pub fn is_self(slf: &Param<'_>) -> bool {
1016 if let PatKind::Binding(.., name, _) = slf.pat.kind {
1017 name.name == kw::SelfLower
1023 pub fn is_self_ty(slf: &hir::Ty<'_>) -> bool {
1025 if let TyKind::Path(QPath::Resolved(None, ref path)) = slf.kind;
1026 if let Res::SelfTy(..) = path.res;
1034 pub fn iter_input_pats<'tcx>(decl: &FnDecl<'_>, body: &'tcx Body<'_>) -> impl Iterator<Item = &'tcx Param<'tcx>> {
1035 (0..decl.inputs.len()).map(move |i| &body.params[i])
1038 /// Checks if a given expression is a match expression expanded from the `?`
1039 /// operator or the `try` macro.
1040 pub fn is_try<'tcx>(cx: &LateContext<'_>, expr: &'tcx Expr<'tcx>) -> Option<&'tcx Expr<'tcx>> {
1041 fn is_ok(cx: &LateContext<'_>, arm: &Arm<'_>) -> bool {
1043 if let PatKind::TupleStruct(ref path, ref pat, None) = arm.pat.kind;
1044 if is_lang_ctor(cx, path, ResultOk);
1045 if let PatKind::Binding(_, hir_id, _, None) = pat[0].kind;
1046 if path_to_local_id(arm.body, hir_id);
1054 fn is_err(cx: &LateContext<'_>, arm: &Arm<'_>) -> bool {
1055 if let PatKind::TupleStruct(ref path, _, _) = arm.pat.kind {
1056 is_lang_ctor(cx, path, ResultErr)
1062 if let ExprKind::Match(_, ref arms, ref source) = expr.kind {
1063 // desugared from a `?` operator
1064 if let MatchSource::TryDesugar = *source {
1070 if arms[0].guard.is_none();
1071 if arms[1].guard.is_none();
1072 if (is_ok(cx, &arms[0]) && is_err(cx, &arms[1])) ||
1073 (is_ok(cx, &arms[1]) && is_err(cx, &arms[0]));
1083 /// Returns `true` if the lint is allowed in the current context
1085 /// Useful for skipping long running code when it's unnecessary
1086 pub fn is_allowed(cx: &LateContext<'_>, lint: &'static Lint, id: HirId) -> bool {
1087 cx.tcx.lint_level_at_node(lint, id).0 == Level::Allow
1090 pub fn strip_pat_refs<'hir>(mut pat: &'hir Pat<'hir>) -> &'hir Pat<'hir> {
1091 while let PatKind::Ref(subpat, _) = pat.kind {
1097 pub fn int_bits(tcx: TyCtxt<'_>, ity: rustc_ty::IntTy) -> u64 {
1098 Integer::from_int_ty(&tcx, ity).size().bits()
1101 #[allow(clippy::cast_possible_wrap)]
1102 /// Turn a constant int byte representation into an i128
1103 pub fn sext(tcx: TyCtxt<'_>, u: u128, ity: rustc_ty::IntTy) -> i128 {
1104 let amt = 128 - int_bits(tcx, ity);
1105 ((u as i128) << amt) >> amt
1108 #[allow(clippy::cast_sign_loss)]
1109 /// clip unused bytes
1110 pub fn unsext(tcx: TyCtxt<'_>, u: i128, ity: rustc_ty::IntTy) -> u128 {
1111 let amt = 128 - int_bits(tcx, ity);
1112 ((u as u128) << amt) >> amt
1115 /// clip unused bytes
1116 pub fn clip(tcx: TyCtxt<'_>, u: u128, ity: rustc_ty::UintTy) -> u128 {
1117 let bits = Integer::from_uint_ty(&tcx, ity).size().bits();
1118 let amt = 128 - bits;
1122 pub fn any_parent_is_automatically_derived(tcx: TyCtxt<'_>, node: HirId) -> bool {
1123 let map = &tcx.hir();
1124 let mut prev_enclosing_node = None;
1125 let mut enclosing_node = node;
1126 while Some(enclosing_node) != prev_enclosing_node {
1127 if is_automatically_derived(map.attrs(enclosing_node)) {
1130 prev_enclosing_node = Some(enclosing_node);
1131 enclosing_node = map.get_parent_item(enclosing_node);
1136 /// Matches a function call with the given path and returns the arguments.
1141 /// if let Some(args) = match_function_call(cx, cmp_max_call, &paths::CMP_MAX);
1143 pub fn match_function_call<'tcx>(
1144 cx: &LateContext<'tcx>,
1145 expr: &'tcx Expr<'_>,
1147 ) -> Option<&'tcx [Expr<'tcx>]> {
1149 if let ExprKind::Call(ref fun, ref args) = expr.kind;
1150 if let ExprKind::Path(ref qpath) = fun.kind;
1151 if let Some(fun_def_id) = cx.qpath_res(qpath, fun.hir_id).opt_def_id();
1152 if match_def_path(cx, fun_def_id, path);
1160 /// Checks if the given `DefId` matches any of the paths. Returns the index of matching path, if
1162 pub fn match_any_def_paths(cx: &LateContext<'_>, did: DefId, paths: &[&[&str]]) -> Option<usize> {
1163 let search_path = cx.get_def_path(did);
1166 .position(|p| p.iter().map(|x| Symbol::intern(x)).eq(search_path.iter().cloned()))
1169 /// Checks if the given `DefId` matches the path.
1170 pub fn match_def_path<'tcx>(cx: &LateContext<'tcx>, did: DefId, syms: &[&str]) -> bool {
1171 // We should probably move to Symbols in Clippy as well rather than interning every time.
1172 let path = cx.get_def_path(did);
1173 syms.iter().map(|x| Symbol::intern(x)).eq(path.iter().cloned())
1176 pub fn match_panic_call(cx: &LateContext<'_>, expr: &'tcx Expr<'_>) -> Option<&'tcx Expr<'tcx>> {
1177 if let ExprKind::Call(func, [arg]) = expr.kind {
1178 expr_path_res(cx, func)
1180 .map_or(false, |id| match_panic_def_id(cx, id))
1187 pub fn match_panic_def_id(cx: &LateContext<'_>, did: DefId) -> bool {
1188 match_any_def_paths(
1192 &paths::BEGIN_PANIC,
1193 &paths::BEGIN_PANIC_FMT,
1195 &paths::PANICKING_PANIC,
1196 &paths::PANICKING_PANIC_FMT,
1197 &paths::PANICKING_PANIC_STR,
1203 /// Returns the list of condition expressions and the list of blocks in a
1204 /// sequence of `if/else`.
1205 /// E.g., this returns `([a, b], [c, d, e])` for the expression
1206 /// `if a { c } else if b { d } else { e }`.
1207 pub fn if_sequence<'tcx>(mut expr: &'tcx Expr<'tcx>) -> (Vec<&'tcx Expr<'tcx>>, Vec<&'tcx Block<'tcx>>) {
1208 let mut conds = Vec::new();
1209 let mut blocks: Vec<&Block<'_>> = Vec::new();
1211 while let ExprKind::If(ref cond, ref then_expr, ref else_expr) = expr.kind {
1212 conds.push(&**cond);
1213 if let ExprKind::Block(ref block, _) = then_expr.kind {
1216 panic!("ExprKind::If node is not an ExprKind::Block");
1219 if let Some(ref else_expr) = *else_expr {
1226 // final `else {..}`
1227 if !blocks.is_empty() {
1228 if let ExprKind::Block(ref block, _) = expr.kind {
1229 blocks.push(&**block);
1236 /// This function returns true if the given expression is the `else` or `if else` part of an if
1238 pub fn parent_node_is_if_expr(expr: &Expr<'_>, cx: &LateContext<'_>) -> bool {
1239 let map = cx.tcx.hir();
1240 let parent_id = map.get_parent_node(expr.hir_id);
1241 let parent_node = map.get(parent_id);
1245 kind: ExprKind::If(_, _, _),
1251 // Finds the `#[must_use]` attribute, if any
1252 pub fn must_use_attr(attrs: &[Attribute]) -> Option<&Attribute> {
1253 attrs.iter().find(|a| a.has_name(sym::must_use))
1256 // check if expr is calling method or function with #[must_use] attribute
1257 pub fn is_must_use_func_call(cx: &LateContext<'_>, expr: &Expr<'_>) -> bool {
1258 let did = match expr.kind {
1259 ExprKind::Call(ref path, _) => if_chain! {
1260 if let ExprKind::Path(ref qpath) = path.kind;
1261 if let def::Res::Def(_, did) = cx.qpath_res(qpath, path.hir_id);
1268 ExprKind::MethodCall(_, _, _, _) => cx.typeck_results().type_dependent_def_id(expr.hir_id),
1272 did.map_or(false, |did| must_use_attr(&cx.tcx.get_attrs(did)).is_some())
1275 pub fn is_no_std_crate(cx: &LateContext<'_>) -> bool {
1276 cx.tcx.hir().attrs(hir::CRATE_HIR_ID).iter().any(|attr| {
1277 if let ast::AttrKind::Normal(ref attr, _) = attr.kind {
1278 attr.path == sym::no_std
1285 /// Check if parent of a hir node is a trait implementation block.
1286 /// For example, `f` in
1288 /// impl Trait for S {
1292 pub fn is_trait_impl_item(cx: &LateContext<'_>, hir_id: HirId) -> bool {
1293 if let Some(Node::Item(item)) = cx.tcx.hir().find(cx.tcx.hir().get_parent_node(hir_id)) {
1294 matches!(item.kind, ItemKind::Impl(hir::Impl { of_trait: Some(_), .. }))
1300 /// Check if it's even possible to satisfy the `where` clause for the item.
1302 /// `trivial_bounds` feature allows functions with unsatisfiable bounds, for example:
1305 /// fn foo() where i32: Iterator {
1306 /// for _ in 2i32 {}
1309 pub fn fn_has_unsatisfiable_preds(cx: &LateContext<'_>, did: DefId) -> bool {
1310 use rustc_trait_selection::traits;
1316 .filter_map(|(p, _)| if p.is_global() { Some(*p) } else { None });
1317 traits::impossible_predicates(
1319 traits::elaborate_predicates(cx.tcx, predicates)
1320 .map(|o| o.predicate)
1321 .collect::<Vec<_>>(),
1325 /// Returns the `DefId` of the callee if the given expression is a function or method call.
1326 pub fn fn_def_id(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<DefId> {
1328 ExprKind::MethodCall(..) => cx.typeck_results().type_dependent_def_id(expr.hir_id),
1331 kind: ExprKind::Path(qpath),
1332 hir_id: path_hir_id,
1336 ) => cx.typeck_results().qpath_res(qpath, *path_hir_id).opt_def_id(),
1341 /// This function checks if any of the lints in the slice is enabled for the provided `HirId`.
1342 /// A lint counts as enabled with any of the levels: `Level::Forbid` | `Level::Deny` | `Level::Warn`
1345 /// #[deny(clippy::YOUR_AWESOME_LINT)]
1346 /// println!("Hello, World!"); // <- Clippy code: run_lints(cx, &[YOUR_AWESOME_LINT], id) == true
1348 /// #[allow(clippy::YOUR_AWESOME_LINT)]
1349 /// println!("See you soon!"); // <- Clippy code: run_lints(cx, &[YOUR_AWESOME_LINT], id) == false
1351 pub fn run_lints(cx: &LateContext<'_>, lints: &[&'static Lint], id: HirId) -> bool {
1352 lints.iter().any(|lint| {
1354 cx.tcx.lint_level_at_node(lint, id),
1355 (Level::Forbid | Level::Deny | Level::Warn, _)
1360 /// Returns Option<String> where String is a textual representation of the type encapsulated in the
1361 /// slice iff the given expression is a slice of primitives (as defined in the
1362 /// `is_recursively_primitive_type` function) and None otherwise.
1363 pub fn is_slice_of_primitives(cx: &LateContext<'_>, expr: &Expr<'_>) -> Option<String> {
1364 let expr_type = cx.typeck_results().expr_ty_adjusted(expr);
1365 let expr_kind = expr_type.kind();
1366 let is_primitive = match expr_kind {
1367 rustc_ty::Slice(element_type) => is_recursively_primitive_type(element_type),
1368 rustc_ty::Ref(_, inner_ty, _) if matches!(inner_ty.kind(), &rustc_ty::Slice(_)) => {
1369 if let rustc_ty::Slice(element_type) = inner_ty.kind() {
1370 is_recursively_primitive_type(element_type)
1379 // if we have wrappers like Array, Slice or Tuple, print these
1380 // and get the type enclosed in the slice ref
1381 match expr_type.peel_refs().walk().nth(1).unwrap().expect_ty().kind() {
1382 rustc_ty::Slice(..) => return Some("slice".into()),
1383 rustc_ty::Array(..) => return Some("array".into()),
1384 rustc_ty::Tuple(..) => return Some("tuple".into()),
1386 // is_recursively_primitive_type() should have taken care
1387 // of the rest and we can rely on the type that is found
1388 let refs_peeled = expr_type.peel_refs();
1389 return Some(refs_peeled.walk().last().unwrap().to_string());
1396 /// returns list of all pairs (a, b) from `exprs` such that `eq(a, b)`
1397 /// `hash` must be comformed with `eq`
1398 pub fn search_same<T, Hash, Eq>(exprs: &[T], hash: Hash, eq: Eq) -> Vec<(&T, &T)>
1400 Hash: Fn(&T) -> u64,
1401 Eq: Fn(&T, &T) -> bool,
1403 if exprs.len() == 2 && eq(&exprs[0], &exprs[1]) {
1404 return vec![(&exprs[0], &exprs[1])];
1407 let mut match_expr_list: Vec<(&T, &T)> = Vec::new();
1409 let mut map: FxHashMap<_, Vec<&_>> =
1410 FxHashMap::with_capacity_and_hasher(exprs.len(), BuildHasherDefault::default());
1413 match map.entry(hash(expr)) {
1414 Entry::Occupied(mut o) => {
1417 match_expr_list.push((o, expr));
1420 o.get_mut().push(expr);
1422 Entry::Vacant(v) => {
1423 v.insert(vec![expr]);
1431 /// Peels off all references on the pattern. Returns the underlying pattern and the number of
1432 /// references removed.
1433 pub fn peel_hir_pat_refs(pat: &'a Pat<'a>) -> (&'a Pat<'a>, usize) {
1434 fn peel(pat: &'a Pat<'a>, count: usize) -> (&'a Pat<'a>, usize) {
1435 if let PatKind::Ref(pat, _) = pat.kind {
1436 peel(pat, count + 1)
1444 /// Peels off up to the given number of references on the expression. Returns the underlying
1445 /// expression and the number of references removed.
1446 pub fn peel_n_hir_expr_refs(expr: &'a Expr<'a>, count: usize) -> (&'a Expr<'a>, usize) {
1447 fn f(expr: &'a Expr<'a>, count: usize, target: usize) -> (&'a Expr<'a>, usize) {
1449 ExprKind::AddrOf(_, _, expr) if count != target => f(expr, count + 1, target),
1456 /// Peels off all references on the expression. Returns the underlying expression and the number of
1457 /// references removed.
1458 pub fn peel_hir_expr_refs(expr: &'a Expr<'a>) -> (&'a Expr<'a>, usize) {
1459 fn f(expr: &'a Expr<'a>, count: usize) -> (&'a Expr<'a>, usize) {
1461 ExprKind::AddrOf(BorrowKind::Ref, _, expr) => f(expr, count + 1),
1469 macro_rules! unwrap_cargo_metadata {
1470 ($cx: ident, $lint: ident, $deps: expr) => {{
1471 let mut command = cargo_metadata::MetadataCommand::new();
1476 match command.exec() {
1477 Ok(metadata) => metadata,
1479 span_lint($cx, $lint, DUMMY_SP, &format!("could not read cargo metadata: {}", err));
1486 pub fn is_hir_ty_cfg_dependant(cx: &LateContext<'_>, ty: &hir::Ty<'_>) -> bool {
1488 if let TyKind::Path(QPath::Resolved(_, path)) = ty.kind;
1489 if let Res::Def(_, def_id) = path.res;
1491 cx.tcx.has_attr(def_id, sym::cfg) || cx.tcx.has_attr(def_id, sym::cfg_attr)