clippy_lints/src/entry.rs

   1 use crate::utils::SpanlessEq;
   2 use crate::utils::{get_item_name, higher, match_type, paths, snippet, snippet_opt};
   3 use crate::utils::{snippet_with_applicability, span_lint_and_then, walk_ptrs_ty};
   4 use if_chain::if_chain;
   5 use rustc::hir::map::Map;
   6 use rustc_errors::Applicability;
   7 use rustc_hir::intravisit::{walk_expr, NestedVisitorMap, Visitor};
   8 use rustc_hir::*;
   9 use rustc_lint::{LateContext, LateLintPass};
  10 use rustc_session::{declare_lint_pass, declare_tool_lint};
  11 use rustc_span::source_map::Span;
  12
  13 declare_clippy_lint! {
  14     /// **What it does:** Checks for uses of `contains_key` + `insert` on `HashMap`
  15     /// or `BTreeMap`.
  16     ///
  17     /// **Why is this bad?** Using `entry` is more efficient.
  18     ///
  19     /// **Known problems:** Some false negatives, eg.:
  20     /// ```rust
  21     /// # use std::collections::HashMap;
  22     /// # let mut map = HashMap::new();
  23     /// # let v = 1;
  24     /// # let k = 1;
  25     /// if !map.contains_key(&k) {
  26     ///     map.insert(k.clone(), v);
  27     /// }
  28     /// ```
  29     ///
  30     /// **Example:**
  31     /// ```rust
  32     /// # use std::collections::HashMap;
  33     /// # let mut map = HashMap::new();
  34     /// # let k = 1;
  35     /// # let v = 1;
  36     /// if !map.contains_key(&k) {
  37     ///     map.insert(k, v);
  38     /// }
  39     /// ```
  40     /// can both be rewritten as:
  41     /// ```rust
  42     /// # use std::collections::HashMap;
  43     /// # let mut map = HashMap::new();
  44     /// # let k = 1;
  45     /// # let v = 1;
  46     /// map.entry(k).or_insert(v);
  47     /// ```
  48     pub MAP_ENTRY,
  49     perf,
  50     "use of `contains_key` followed by `insert` on a `HashMap` or `BTreeMap`"
  51 }
  52
  53 declare_lint_pass!(HashMapPass => [MAP_ENTRY]);
  54
  55 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for HashMapPass {
  56     fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr<'_>) {
  57         if let Some((ref check, ref then_block, ref else_block)) = higher::if_block(&expr) {
  58             if let ExprKind::Unary(UnOp::UnNot, ref check) = check.kind {
  59                 if let Some((ty, map, key)) = check_cond(cx, check) {
  60                     // in case of `if !m.contains_key(&k) { m.insert(k, v); }`
  61                     // we can give a better error message
  62                     let sole_expr = {
  63                         else_block.is_none()
  64                             && if let ExprKind::Block(ref then_block, _) = then_block.kind {
  65                                 (then_block.expr.is_some() as usize) + then_block.stmts.len() == 1
  66                             } else {
  67                                 true
  68                             }
  69                         // XXXManishearth we can also check for if/else blocks containing `None`.
  70                     };
  71
  72                     let mut visitor = InsertVisitor {
  73                         cx,
  74                         span: expr.span,
  75                         ty,
  76                         map,
  77                         key,
  78                         sole_expr,
  79                     };
  80
  81                     walk_expr(&mut visitor, &**then_block);
  82                 }
  83             } else if let Some(ref else_block) = *else_block {
  84                 if let Some((ty, map, key)) = check_cond(cx, check) {
  85                     let mut visitor = InsertVisitor {
  86                         cx,
  87                         span: expr.span,
  88                         ty,
  89                         map,
  90                         key,
  91                         sole_expr: false,
  92                     };
  93
  94                     walk_expr(&mut visitor, else_block);
  95                 }
  96             }
  97         }
  98     }
  99 }
 100
 101 fn check_cond<'a, 'tcx, 'b>(
 102     cx: &'a LateContext<'a, 'tcx>,
 103     check: &'b Expr<'b>,
 104 ) -> Option<(&'static str, &'b Expr<'b>, &'b Expr<'b>)> {
 105     if_chain! {
 106         if let ExprKind::MethodCall(ref path, _, ref params) = check.kind;
 107         if params.len() >= 2;
 108         if path.ident.name == sym!(contains_key);
 109         if let ExprKind::AddrOf(BorrowKind::Ref, _, ref key) = params[1].kind;
 110         then {
 111             let map = &params[0];
 112             let obj_ty = walk_ptrs_ty(cx.tables.expr_ty(map));
 113
 114             return if match_type(cx, obj_ty, &paths::BTREEMAP) {
 115                 Some(("BTreeMap", map, key))
 116             }
 117             else if match_type(cx, obj_ty, &paths::HASHMAP) {
 118                 Some(("HashMap", map, key))
 119             }
 120             else {
 121                 None
 122             };
 123         }
 124     }
 125
 126     None
 127 }
 128
 129 struct InsertVisitor<'a, 'tcx, 'b> {
 130     cx: &'a LateContext<'a, 'tcx>,
 131     span: Span,
 132     ty: &'static str,
 133     map: &'b Expr<'b>,
 134     key: &'b Expr<'b>,
 135     sole_expr: bool,
 136 }
 137
 138 impl<'a, 'tcx, 'b> Visitor<'tcx> for InsertVisitor<'a, 'tcx, 'b> {
 139     type Map = Map<'tcx>;
 140
 141     fn visit_expr(&mut self, expr: &'tcx Expr<'_>) {
 142         if_chain! {
 143             if let ExprKind::MethodCall(ref path, _, ref params) = expr.kind;
 144             if params.len() == 3;
 145             if path.ident.name == sym!(insert);
 146             if get_item_name(self.cx, self.map) == get_item_name(self.cx, &params[0]);
 147             if SpanlessEq::new(self.cx).eq_expr(self.key, &params[1]);
 148             if snippet_opt(self.cx, self.map.span) == snippet_opt(self.cx, params[0].span);
 149             then {
 150                 span_lint_and_then(self.cx, MAP_ENTRY, self.span,
 151                                    &format!("usage of `contains_key` followed by `insert` on a `{}`", self.ty), |db| {
 152                     if self.sole_expr {
 153                         let mut app = Applicability::MachineApplicable;
 154                         let help = format!("{}.entry({}).or_insert({});",
 155                                            snippet_with_applicability(self.cx, self.map.span, "map", &mut app),
 156                                            snippet_with_applicability(self.cx, params[1].span, "..", &mut app),
 157                                            snippet_with_applicability(self.cx, params[2].span, "..", &mut app));
 158
 159                         db.span_suggestion(
 160                             self.span,
 161                             "consider using",
 162                             help,
 163                             Applicability::MachineApplicable, // snippet
 164                         );
 165                     }
 166                     else {
 167                         let help = format!("consider using `{}.entry({})`",
 168                                            snippet(self.cx, self.map.span, "map"),
 169                                            snippet(self.cx, params[1].span, ".."));
 170
 171                         db.span_label(
 172                             self.span,
 173                             &help,
 174                         );
 175                     }
 176                 });
 177             }
 178         }
 179
 180         if !self.sole_expr {
 181             walk_expr(self, expr);
 182         }
 183     }
 184     fn nested_visit_map(&mut self) -> NestedVisitorMap<'_, Self::Map> {
 185         NestedVisitorMap::None
 186     }
 187 }