2015-08-05 08:10:45 -05:00
|
|
|
//! This LintPass catches both string addition and string addition + assignment
|
2015-08-11 13:22:20 -05:00
|
|
|
//!
|
2015-08-05 08:10:45 -05:00
|
|
|
//! Note that since we have two lints where one subsumes the other, we try to
|
|
|
|
//! disable the subsumed lint unless it has a higher level
|
|
|
|
|
|
|
|
use rustc::lint::*;
|
2015-09-03 09:42:17 -05:00
|
|
|
use rustc_front::hir::*;
|
2015-08-16 01:54:43 -05:00
|
|
|
use syntax::codemap::Spanned;
|
|
|
|
|
2015-08-05 08:10:45 -05:00
|
|
|
use eq_op::is_exp_equal;
|
2015-08-21 12:00:33 -05:00
|
|
|
use utils::{match_type, span_lint, walk_ptrs_ty, get_parent_expr};
|
2015-08-21 11:48:36 -05:00
|
|
|
use utils::STRING_PATH;
|
2015-08-05 08:10:45 -05:00
|
|
|
|
|
|
|
declare_lint! {
|
|
|
|
pub STRING_ADD_ASSIGN,
|
2015-08-12 14:17:21 -05:00
|
|
|
Allow,
|
2015-08-13 03:32:35 -05:00
|
|
|
"using `x = x + ..` where x is a `String`; suggests using `push_str()` instead"
|
2015-08-05 08:10:45 -05:00
|
|
|
}
|
|
|
|
|
2015-08-12 08:50:56 -05:00
|
|
|
declare_lint! {
|
2015-08-12 08:57:50 -05:00
|
|
|
pub STRING_ADD,
|
|
|
|
Allow,
|
2015-08-13 03:32:35 -05:00
|
|
|
"using `x + ..` where x is a `String`; suggests using `push_str()` instead"
|
2015-08-12 08:50:56 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
#[derive(Copy, Clone)]
|
2015-08-05 08:10:45 -05:00
|
|
|
pub struct StringAdd;
|
|
|
|
|
|
|
|
impl LintPass for StringAdd {
|
2015-08-12 08:50:56 -05:00
|
|
|
fn get_lints(&self) -> LintArray {
|
2015-08-12 09:42:42 -05:00
|
|
|
lint_array!(STRING_ADD, STRING_ADD_ASSIGN)
|
2015-08-12 08:50:56 -05:00
|
|
|
}
|
2015-09-18 21:53:04 -05:00
|
|
|
}
|
2015-08-12 08:50:56 -05:00
|
|
|
|
2015-09-18 21:53:04 -05:00
|
|
|
impl LateLintPass for StringAdd {
|
|
|
|
fn check_expr(&mut self, cx: &LateContext, e: &Expr) {
|
2015-08-12 08:57:50 -05:00
|
|
|
if let &ExprBinary(Spanned{ node: BiAdd, .. }, ref left, _) = &e.node {
|
|
|
|
if is_string(cx, left) {
|
|
|
|
if let Allow = cx.current_level(STRING_ADD_ASSIGN) {
|
|
|
|
// the string_add_assign is allow, so no duplicates
|
|
|
|
} else {
|
|
|
|
let parent = get_parent_expr(cx, e);
|
|
|
|
if let Some(ref p) = parent {
|
|
|
|
if let &ExprAssign(ref target, _) = &p.node {
|
|
|
|
// avoid duplicate matches
|
2015-08-21 05:19:07 -05:00
|
|
|
if is_exp_equal(cx, target, left) { return; }
|
2015-08-12 08:57:50 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2015-08-27 00:39:40 -05:00
|
|
|
span_lint(cx, STRING_ADD, e.span,
|
2015-08-26 07:26:43 -05:00
|
|
|
"you added something to a string. \
|
2015-08-27 00:39:40 -05:00
|
|
|
Consider using `String::push_str()` instead")
|
2015-08-12 08:57:50 -05:00
|
|
|
}
|
2015-08-12 09:42:42 -05:00
|
|
|
} else if let &ExprAssign(ref target, ref src) = &e.node {
|
2015-08-21 05:19:07 -05:00
|
|
|
if is_string(cx, target) && is_add(cx, src, target) {
|
2015-08-11 13:22:20 -05:00
|
|
|
span_lint(cx, STRING_ADD_ASSIGN, e.span,
|
2015-08-12 14:17:21 -05:00
|
|
|
"you assigned the result of adding something to this string. \
|
2015-08-13 03:32:35 -05:00
|
|
|
Consider using `String::push_str()` instead")
|
2015-08-05 08:10:45 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-09-18 21:53:04 -05:00
|
|
|
fn is_string(cx: &LateContext, e: &Expr) -> bool {
|
2015-08-21 12:00:33 -05:00
|
|
|
match_type(cx, walk_ptrs_ty(cx.tcx.expr_ty(e)), &STRING_PATH)
|
2015-08-05 08:10:45 -05:00
|
|
|
}
|
|
|
|
|
2015-09-18 21:53:04 -05:00
|
|
|
fn is_add(cx: &LateContext, src: &Expr, target: &Expr) -> bool {
|
2015-08-21 13:44:48 -05:00
|
|
|
match src.node {
|
|
|
|
ExprBinary(Spanned{ node: BiAdd, .. }, ref left, _) =>
|
2015-08-21 05:19:07 -05:00
|
|
|
is_exp_equal(cx, target, left),
|
2015-08-21 13:44:48 -05:00
|
|
|
ExprBlock(ref block) => block.stmts.is_empty() &&
|
2015-08-21 05:19:07 -05:00
|
|
|
block.expr.as_ref().map_or(false,
|
2015-08-25 07:41:35 -05:00
|
|
|
|expr| is_add(cx, expr, target)),
|
2015-08-05 08:10:45 -05:00
|
|
|
_ => false
|
|
|
|
}
|
|
|
|
}
|