3 use rustc::hir::intravisit::FnKind;
5 use rustc::middle::const_val::ConstVal;
7 use rustc_const_eval::EvalHint::ExprTypeChecked;
8 use rustc_const_eval::ConstContext;
9 use rustc_const_math::ConstFloat;
10 use syntax::codemap::{Span, Spanned, ExpnFormat};
11 use utils::{get_item_name, get_parent_expr, implements_trait, in_macro, is_integer_literal, match_path, snippet,
12 span_lint, span_lint_and_then, walk_ptrs_ty, last_path_segment, iter_input_pats};
13 use utils::sugg::Sugg;
15 /// **What it does:** Checks for function arguments and let bindings denoted as `ref`.
17 /// **Why is this bad?** The `ref` declaration makes the function take an owned
18 /// value, but turns the argument into a reference (which means that the value
19 /// is destroyed when exiting the function). This adds not much value: either
20 /// take a reference type, or take an owned value and create references in the
23 /// For let bindings, `let x = &foo;` is preferred over `let ref x = foo`. The
24 /// type of `x` is more obvious with the former.
26 /// **Known problems:** If the argument is dereferenced within the function,
27 /// removing the `ref` will lead to errors. This can be fixed by removing the
28 /// dereferences, e.g. changing `*x` to `x` within the function.
32 /// fn foo(ref x: u8) -> bool { .. }
37 "an entire binding declared as `ref`, in a function argument or a `let` statement"
40 /// **What it does:** Checks for comparisons to NaN.
42 /// **Why is this bad?** NaN does not compare meaningfully to anything – not
43 /// even itself – so those comparisons are simply wrong.
45 /// **Known problems:** None.
54 "comparisons to NAN, which will always return false, probably not intended"
57 /// **What it does:** Checks for (in-)equality comparisons on floating-point
58 /// values (apart from zero), except in functions called `*eq*` (which probably
59 /// implement equality for a type involving floats).
61 /// **Why is this bad?** Floating point calculations are usually imprecise, so
62 /// asking if two values are *exactly* equal is asking for trouble. For a good
63 /// guide on what to do, see [the floating point
64 /// guide](http://www.floating-point-gui.de/errors/comparison).
66 /// **Known problems:** None.
71 /// y != x // where both are floats
76 "using `==` or `!=` on float values instead of comparing difference with an epsilon"
79 /// **What it does:** Checks for conversions to owned values just for the sake
82 /// **Why is this bad?** The comparison can operate on a reference, so creating
83 /// an owned value effectively throws it away directly afterwards, which is
84 /// needlessly consuming code and heap space.
86 /// **Known problems:** None.
95 "creating owned instances for comparing with others, e.g. `x == \"foo\".to_string()`"
98 /// **What it does:** Checks for getting the remainder of a division by one.
100 /// **Why is this bad?** The result can only ever be zero. No one will write
101 /// such code deliberately, unless trying to win an Underhanded Rust
102 /// Contest. Even for that contest, it's probably a bad idea. Use something more
105 /// **Known problems:** None.
114 "taking a number modulo 1, which always returns 0"
117 /// **What it does:** Checks for patterns in the form `name @ _`.
119 /// **Why is this bad?** It's almost always more readable to just use direct bindings.
121 /// **Known problems:** None.
127 /// y @ _ => (), // easier written as `y`,
131 pub REDUNDANT_PATTERN,
133 "using `name @ _` in a pattern"
136 /// **What it does:** Checks for the use of bindings with a single leading underscore.
138 /// **Why is this bad?** A single leading underscore is usually used to indicate
139 /// that a binding will not be used. Using such a binding breaks this
142 /// **Known problems:** The lint does not work properly with desugaring and
143 /// macro, it has been allowed in the mean time.
148 /// let y = _x + 1; // Here we are using `_x`, even though it has a leading underscore.
149 /// // We should rename `_x` to `x`
152 pub USED_UNDERSCORE_BINDING,
154 "using a binding which is prefixed with an underscore"
157 /// **What it does:** Checks for the use of short circuit boolean conditions as a
160 /// **Why is this bad?** Using a short circuit boolean condition as a statement may
161 /// hide the fact that the second part is executed or not depending on the outcome of
164 /// **Known problems:** None.
168 /// f() && g(); // We should write `if f() { g(); }`.
171 pub SHORT_CIRCUIT_STATEMENT,
173 "using a short circuit boolean condition as a statement"
176 #[derive(Copy, Clone)]
179 impl LintPass for Pass {
180 fn get_lints(&self) -> LintArray {
181 lint_array!(TOPLEVEL_REF_ARG,
187 USED_UNDERSCORE_BINDING,
188 SHORT_CIRCUIT_STATEMENT)
192 impl<'a, 'tcx> LateLintPass<'a, 'tcx> for Pass {
195 cx: &LateContext<'a, 'tcx>,
202 if let FnKind::Closure(_) = k {
203 // Does not apply to closures
206 for arg in iter_input_pats(decl, body) {
207 if let PatKind::Binding(BindByRef(_), _, _, _) = arg.pat.node {
211 "`ref` directly on a function argument is ignored. Consider using a reference type instead.");
216 fn check_stmt(&mut self, cx: &LateContext<'a, 'tcx>, s: &'tcx Stmt) {
218 let StmtDecl(ref d, _) = s.node,
219 let DeclLocal(ref l) = d.node,
220 let PatKind::Binding(BindByRef(mt), _, i, None) = l.pat.node,
221 let Some(ref init) = l.init
223 let init = Sugg::hir(cx, init, "..");
224 let (mutopt,initref) = if mt == Mutability::MutMutable {
225 ("mut ", init.mut_addr())
229 let tyopt = if let Some(ref ty) = l.ty {
230 format!(": &{mutopt}{ty}", mutopt=mutopt, ty=snippet(cx, ty.span, "_"))
234 span_lint_and_then(cx,
237 "`ref` on an entire `let` pattern is discouraged, take a reference with `&` instead",
239 db.span_suggestion(s.span,
241 format!("let {name}{tyopt} = {initref};",
242 name=snippet(cx, i.span, "_"),
249 let StmtSemi(ref expr, _) = s.node,
250 let Expr_::ExprBinary(ref binop, ref a, ref b) = expr.node,
251 binop.node == BiAnd || binop.node == BiOr,
252 let Some(sugg) = Sugg::hir_opt(cx, a),
254 span_lint_and_then(cx,
255 SHORT_CIRCUIT_STATEMENT,
257 "boolean short circuit operator in statement may be clearer using an explicit test",
259 let sugg = if binop.node == BiOr { !sugg } else { sugg };
260 db.span_suggestion(s.span, "replace it with",
261 format!("if {} {{ {}; }}", sugg, &snippet(cx, b.span, "..")));
266 fn check_expr(&mut self, cx: &LateContext<'a, 'tcx>, expr: &'tcx Expr) {
267 if let ExprBinary(ref cmp, ref left, ref right) = expr.node {
269 if op.is_comparison() {
270 if let ExprPath(QPath::Resolved(_, ref path)) = left.node {
271 check_nan(cx, path, expr.span);
273 if let ExprPath(QPath::Resolved(_, ref path)) = right.node {
274 check_nan(cx, path, expr.span);
276 check_to_owned(cx, left, right, true, cmp.span);
277 check_to_owned(cx, right, left, false, cmp.span)
279 if (op == BiEq || op == BiNe) && (is_float(cx, left) || is_float(cx, right)) {
280 if is_allowed(cx, left) || is_allowed(cx, right) {
283 if let Some(name) = get_item_name(cx, expr) {
284 let name = &*name.as_str();
285 if name == "eq" || name == "ne" || name == "is_nan" || name.starts_with("eq_") ||
286 name.ends_with("_eq") {
290 span_lint_and_then(cx, FLOAT_CMP, expr.span, "strict comparison of f32 or f64", |db| {
291 let lhs = Sugg::hir(cx, left, "..");
292 let rhs = Sugg::hir(cx, right, "..");
294 db.span_suggestion(expr.span,
295 "consider comparing them within some error",
296 format!("({}).abs() < error", lhs - rhs));
297 db.span_note(expr.span, "std::f32::EPSILON and std::f64::EPSILON are available.");
299 } else if op == BiRem && is_integer_literal(right, 1) {
300 span_lint(cx, MODULO_ONE, expr.span, "any number modulo 1 will be 0");
303 if in_attributes_expansion(cx, expr) {
304 // Don't lint things expanded by #[derive(...)], etc
307 let binding = match expr.node {
308 ExprPath(ref qpath) => {
309 let binding = last_path_segment(qpath).name.as_str();
310 if binding.starts_with('_') &&
311 !binding.starts_with("__") &&
312 &*binding != "_result" && // FIXME: #944
314 // don't lint if the declaration is in a macro
315 non_macro_local(cx, &cx.tables.qpath_def(qpath, expr.id)) {
321 ExprField(_, spanned) => {
322 let name = spanned.node.as_str();
323 if name.starts_with('_') && !name.starts_with("__") {
331 if let Some(binding) = binding {
333 USED_UNDERSCORE_BINDING,
335 &format!("used binding `{}` which is prefixed with an underscore. A leading \
336 underscore signals that a binding will not be used.",
341 fn check_pat(&mut self, cx: &LateContext<'a, 'tcx>, pat: &'tcx Pat) {
342 if let PatKind::Binding(_, _, ref ident, Some(ref right)) = pat.node {
343 if right.node == PatKind::Wild {
347 &format!("the `{} @ _` pattern can be written as just `{}`", ident.node, ident.node));
353 fn check_nan(cx: &LateContext, path: &Path, span: Span) {
354 path.segments.last().map(|seg| if &*seg.name.as_str() == "NAN" {
358 "doomed comparison with NAN, use `std::{f32,f64}::is_nan()` instead");
362 fn is_allowed(cx: &LateContext, expr: &Expr) -> bool {
363 let res = ConstContext::with_tables(cx.tcx, cx.tables).eval(expr, ExprTypeChecked);
364 if let Ok(ConstVal::Float(val)) = res {
365 use std::cmp::Ordering;
367 let zero = ConstFloat::FInfer {
372 let infinity = ConstFloat::FInfer {
373 f32: ::std::f32::INFINITY,
374 f64: ::std::f64::INFINITY,
377 let neg_infinity = ConstFloat::FInfer {
378 f32: ::std::f32::NEG_INFINITY,
379 f64: ::std::f64::NEG_INFINITY,
382 val.try_cmp(zero) == Ok(Ordering::Equal) || val.try_cmp(infinity) == Ok(Ordering::Equal) ||
383 val.try_cmp(neg_infinity) == Ok(Ordering::Equal)
389 fn is_float(cx: &LateContext, expr: &Expr) -> bool {
390 matches!(walk_ptrs_ty(cx.tables.expr_ty(expr)).sty, ty::TyFloat(_))
393 fn check_to_owned(cx: &LateContext, expr: &Expr, other: &Expr, left: bool, op: Span) {
394 let (arg_ty, snip) = match expr.node {
395 ExprMethodCall(Spanned { node: ref name, .. }, _, ref args) if args.len() == 1 => {
396 let name = &*name.as_str();
397 if name == "to_string" || name == "to_owned" && is_str_arg(cx, args) {
398 (cx.tables.expr_ty(&args[0]), snippet(cx, args[0].span, ".."))
403 ExprCall(ref path, ref v) if v.len() == 1 => {
404 if let ExprPath(ref path) = path.node {
405 if match_path(path, &["String", "from_str"]) || match_path(path, &["String", "from"]) {
406 (cx.tables.expr_ty(&v[0]), snippet(cx, v[0].span, ".."))
417 let other_ty = cx.tables.expr_ty(other);
418 let partial_eq_trait_id = match cx.tcx.lang_items.eq_trait() {
423 if !implements_trait(cx, arg_ty, partial_eq_trait_id, vec![other_ty]) {
431 &format!("this creates an owned instance just for comparison. Consider using `{} {} {}` to \
432 compare without allocation",
434 snippet(cx, op, "=="),
435 snippet(cx, other.span, "..")));
440 &format!("this creates an owned instance just for comparison. Consider using `{} {} {}` to \
441 compare without allocation",
442 snippet(cx, other.span, ".."),
443 snippet(cx, op, "=="),
449 fn is_str_arg(cx: &LateContext, args: &[Expr]) -> bool {
450 args.len() == 1 && matches!(walk_ptrs_ty(cx.tables.expr_ty(&args[0])).sty, ty::TyStr)
453 /// Heuristic to see if an expression is used. Should be compatible with `unused_variables`'s idea
454 /// of what it means for an expression to be "used".
455 fn is_used(cx: &LateContext, expr: &Expr) -> bool {
456 if let Some(parent) = get_parent_expr(cx, expr) {
458 ExprAssign(_, ref rhs) |
459 ExprAssignOp(_, _, ref rhs) => **rhs == *expr,
460 _ => is_used(cx, parent),
467 /// Test whether an expression is in a macro expansion (e.g. something generated by
468 /// `#[derive(...)`] or the like).
469 fn in_attributes_expansion(cx: &LateContext, expr: &Expr) -> bool {
470 cx.sess().codemap().with_expn_info(expr.span.expn_id, |info_opt| {
471 info_opt.map_or(false, |info| matches!(info.callee.format, ExpnFormat::MacroAttribute(_)))
475 /// Test whether `def` is a variable defined outside a macro.
476 fn non_macro_local(cx: &LateContext, def: &def::Def) -> bool {
478 def::Def::Local(id) |
479 def::Def::Upvar(id, _, _) => {
480 if let Some(span) = cx.tcx.hir.span_if_local(id) {